A Simple Estimate for the Number of Steps in the Euclidean Algorithm
From MaRDI portal
Publication:5612612
DOI10.2307/2316901zbMath0211.37401OpenAlexW4255646663MaRDI QIDQ5612612
Publication date: 1971
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2316901
Continued fractions (11A55) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (7)
Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums ⋮ Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen ⋮ A rigorous version of R. P. Brent's model for the binary Euclidean algorithm ⋮ Fine costs for Euclid's algorithm on polynomials and Farey maps ⋮ The exact length of the Euclidean algorithm in [ X ] ⋮ The number of steps in a finite Jacobi algorithm ⋮ The number of steps in the Euclidean algorithm over complex quadratic fields
This page was built for publication: A Simple Estimate for the Number of Steps in the Euclidean Algorithm
