Article
Licensed
Unlicensed
Requires Authentication
A fast method to transform continued fractions to common fractions
-
E. P. MACHIKINA
and B. YA. RYABKO
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1999
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Titelei
- Random correspondences, binary matrices, and runs
- Probabilities of events related to common predecessors of two vertices in the generalized model of recursive trees
- Structure-complex systems with threshold survival
- A fast method to transform continued fractions to common fractions
- On the spectra of connected graphs
- Modelling and search complexity in multiprocessor Systems
- On some properties of three-index transportation polytopes
Articles in the same Issue
- Titelei
- Random correspondences, binary matrices, and runs
- Probabilities of events related to common predecessors of two vertices in the generalized model of recursive trees
- Structure-complex systems with threshold survival
- A fast method to transform continued fractions to common fractions
- On the spectra of connected graphs
- Modelling and search complexity in multiprocessor Systems
- On some properties of three-index transportation polytopes