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)

Full work available at URL https://doi.org/10.1134/S0001434610090300

zbMATH Keywords

continued-fraction expansiondual fractionEuclidean algorithmGauss-Kuzmin statistics

Mathematics Subject Classification ID

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

Review text

The paper deals with different kinds of the Euclidean algorithm and corresponding continued fractions. The main result is a new asymptotic formula for the mean value of steps \(h(\frac{a}{b})\) in the Euclidean algorithm with odd partial quotients. It should be mentioned that asymptotic formulas are obtained both in the case of averaging over numerators and in the case of averaging over both numerators and denominators. These asymptotic formulas improve the previous result due to Baladi and Vallée. The main idea of the proof is to express the value \(h(\frac{a}{b})\) in terms of Gauss-Kuzmin statistics. And for this statistics asymptotic formulas with the desired error terms had been previously obtained by the author.

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

• 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
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• 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 mean number of steps in the Euclidean algorithm with least absolute value remainders
• On the average number of steps in the Euclidean algorithm
• Distribution of the reduced quadratic irrationals arising from the odd continued fraction expansion
• On analogues of Heilbronn's theorem
• Spin chains and Arnold's problem on the Gauss-Kuz'min statistics for quadratic irrationals
• On the number of solutions of the congruence xy l q under the graph of a twice continuously differentiable function
• The average length of reduced regular continued fractions
• On a symmetricity property connected to the Euclidean algorithm
• The average length of finite continued fractions with fixed denominator
• Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
• Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums
• Small quotients in Euclidean algorithms

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)