Small quotients in Euclidean algorithms (Q631506): Difference between revisions
From MaRDI portal
Latest revision as of 20:29, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Small quotients in Euclidean algorithms |
scientific article |
Statements
Small quotients in Euclidean algorithms (English)
0 references
14 March 2011
0 references
The authors present an estimation of the probability that a rational number with a denominator at most \(N\) has all the digits in the continued fraction expansion less than \(M\).
0 references
continued fractions
0 references
Euclidean algorithm
0 references
0 references
0 references