Small quotients in Euclidean algorithms (Q631506): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11139-010-9256-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2036191048 / rank | |||
Normal rank | |||
Revision as of 02:29, 20 March 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
