On the average number of steps in the Euclidean algorithm

MaRDI QIDQ1172658zbMATH OpenFDO

Authors Hans Kilian

Publication date 1983

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/141302

zbMATH Keywords

asymptotic resultlength of Euclidean algorithm

Mathematics Subject Classification ID

Continued fractions (11A55)

Recommendations

• A Simple Estimate for the Number of Steps in the Euclidean Algorithm
• On the asymptotic analysis of the Euclidean algorithm
• The number of steps in the Euclidean algorithm
• 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 odd partial quotients

Cited in

(8)

• Reachability of inequalities from Lame's theorem
• On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities
• 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
• On the asymptotic analysis of the Euclidean algorithm
• Asymptotic behaviour of the first and second moments for the number of steps in the Euclidean algorithm
• A Simple Estimate for the Number of Steps in the Euclidean Algorithm
• The mean number of steps in the Euclidean algorithm with least absolute value remainders

This page was built for publication: On the average number of steps in the Euclidean algorithm

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