A note on the number of division steps in the Euclidean algorithm

DOI10.1145/377626.377629zbMath1052.11500OpenAlexW2062951475MaRDI QIDQ4810173

Sergey A. Abramov

Publication date: 1 September 2004

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/377626.377629

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

This page was built for publication: A note on the number of division steps in the Euclidean algorithm