|
This article is cited in 8 scientific papers (total in 8 papers)
The Mean Number of Steps in the Euclidean Algorithm with Odd Incomplete Quotients
A. V. Ustinov Institute for Applied Mathematics, Khabarovsk Division, Far-Eastern Branch of the Russian Academy of Sciences
Abstract:
The length of the continued-fraction expansion of a rational number with odd incomplete quotients is expressed via the Gauss–Kuzmin statistics for the classical continued fraction. This has made it possible to prove asymptotic formulas, similar to those already known for the classical Euclidean algorithm, for the mean length of the Euclidean algorithm with odd incomplete quotients.
Keywords:
Euclidean algorithm, Gauss–Kuzmin statistics, continued-fraction expansion, dual fraction, incomplete quotient.
Received: 13.04.2010
Citation:
A. V. Ustinov, “The Mean Number of Steps in the Euclidean Algorithm with Odd Incomplete Quotients”, Mat. Zametki, 88:4 (2010), 594–604; Math. Notes, 88:4 (2010), 574–584
Linking options:
https://www.mathnet.ru/eng/mzm8854https://doi.org/10.4213/mzm8854 https://www.mathnet.ru/eng/mzm/v88/i4/p594
|
Statistics & downloads: |
Abstract page: | 637 | Full-text PDF : | 221 | References: | 68 | First page: | 16 |
|