The mean number of steps in the Euclidean algorithm with odd partial quotients

DOI10.1134/S0001434610090300zbMath1257.11007WikidataQ114075427 ScholiaQ114075427MaRDI QIDQ650319

Alexey Ustinov

Publication date: 25 November 2011

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Euclidean algorithm; Gauss-Kuzmin statistics; continued-fraction expansion; dual fraction

Mathematics Subject Classification ID

11N37: Asymptotic results on arithmetic functions

11A55: Continued fractions

11K50: Metric theory of continued fractions

Related Items

The average length of finite continued fractions with fixed denominator, Distribution of the reduced quadratic irrationals arising from the odd continued fraction expansion, Spin chains and Arnold's problem on the Gauss-Kuz'min statistics for quadratic irrationals

Cites Work

• Unnamed Item
• The mean number of steps in the Euclidean algorithm with least absolute value remainders
• Evaluation of Porter's constant
• Dynamical analysis of a class of Euclidean algorithms.
• Euclidean algorithms are Gaussian
• On the statistics of partial quotients of finite continued fractions
• Ein H<scp>EILBRONN</scp>‐Satz für Kettenbrüche mit ungeraden Teilnennern
• On a theorem of Heilbronn
• Über die mittlere Schrittanzahl bei Divisionsalgorithmen
• Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm