Asymptotic behaviour of the first moment of the number of steps in the by-excess and by-deficiency Euclidean algorithms

DOI10.1070/SM2012V203N02ABEH004223zbMath1292.11139OpenAlexW2022392915MaRDI QIDQ2884667

Dmitriy A. Frolenkov

Publication date: 30 May 2012

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

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

zbMATH Keywords

prime number theoremfractional partscontinued fractionsEuclidean algorithms

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55) Metric theory of continued fractions (11K50)

Related Items (1)

Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums

This page was built for publication: Asymptotic behaviour of the first moment of the number of steps in the by-excess and by-deficiency Euclidean algorithms