Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm

DOI10.1070/IM2008v072n05ABEH002427zbMath1211.11009OpenAlexW2057457202MaRDI QIDQ5504844

Alexey Ustinov

Publication date: 22 January 2009

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im2008v072n05abeh002427

zbMATH Keywords

asymptotic formulacontinued fractionEuclidean algorithmpartial quotient

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Continued fractions (11A55) Arithmetic functions in probabilistic number theory (11K65)

Related Items (4)

Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums ⋮ Fine costs for Euclid's algorithm on polynomials and Farey maps ⋮ The mean number of steps in the Euclidean algorithm with odd partial quotients ⋮ On the number of solutions of the congruence $xy\equiv l\pmod {q}$ under the graph of a twice continuously differentiable function

This page was built for publication: Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm