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

DOI10.1134/S0001434610090300MaRDI QIDQ650319zbMATH OpenWikidataFDO

Authors Alexey Ustinov

Publication date 25 November 2011

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Euclidean algorithmGauss-Kuzmin statisticscontinued-fraction expansiondual fraction

Mathematics Subject Classification ID

Continued fractions (11A55) Asymptotic results on arithmetic functions (11N37) Metric theory of continued fractions (11K50)

Recommendations

• Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
• The mean number of steps in the Euclidean algorithm with least absolute value remainders
• On analogues of Heilbronn's theorem
• Asymptotic behaviour of the first moment of the number of steps in the by-excess and by-deficiency Euclidean algorithms
• The average length of reduced regular continued fractions

Cites work

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

Cited in

(12)

• The average length of finite continued fractions with fixed denominator
• Spin chains and Arnold's problem on the Gauss-Kuz'min statistics for quadratic irrationals
• On the number of solutions of the congruence \(xy\equiv l\pmod q\) under the graph of a twice continuously differentiable function
• Small quotients in Euclidean algorithms
• The average length of reduced regular continued fractions
• Distribution of the reduced quadratic irrationals arising from the odd continued fraction expansion
• The mean number of steps in the Euclidean algorithm with least absolute value remainders
• Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums
• On analogues of Heilbronn's theorem
• Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
• On the average number of steps in the Euclidean algorithm
• On a symmetricity property connected to the Euclidean algorithm

This page was built for publication: The mean number of steps in the Euclidean algorithm with odd partial quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650319)