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

DOI10.1134/S0001434610090300zbMATH Open1257.11007WikidataQ114075427 ScholiaQ114075427MaRDI QIDQ650319FDOQ650319

Authors: Alexey Ustinov 

Publication date: 25 November 2011

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

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

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)

Cites Work

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

Cited In (12)

• On the average 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
• The average length of finite continued fractions with fixed denominator
• 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
• Spin chains and Arnold's problem on the Gauss-Kuz'min statistics for quadratic irrationals
• The average length of reduced regular continued fractions
• Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
• On a symmetricity property connected to the Euclidean algorithm
• The mean number of steps in the Euclidean algorithm with least absolute value remainders
• Distribution of the reduced quadratic irrationals arising from the odd continued fraction expansion
• On analogues of Heilbronn's theorem

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)