Origins of the analysis of the Euclidean algorithm

DOI10.1006/hmat.1994.1031zbMath0859.01004OpenAlexW2000752995WikidataQ56047906 ScholiaQ56047906MaRDI QIDQ1344935

Jeffrey O. Shallit

Publication date: 25 March 1997

Published in: Historia Mathematica (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fdd8ea4ff7eca3e36982d9661921c1815f12078c

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of mathematics in the 18th century (01A50) History of mathematics in the 19th century (01A55) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) History of Greek and Roman mathematics (01A20)

Related Items (10)

Maximum versus minimum: two properties of the Fibonacci sequence ⋮ A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm ⋮ On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities ⋮ Dynamical analysis of a class of Euclidean algorithms. ⋮ Unnamed Item ⋮ Dedekind sums in the vicinity of quadratic irrationals ⋮ A rigorous version of R. P. Brent's model for the binary Euclidean algorithm ⋮ Modular arithmetic before C. F. Gauss: systematizations and discussions on remainder problems in 18th-century Germany ⋮ Tracing compressed curves in triangulated surfaces ⋮ Length of the continued logarithm algorithm on rational inputs

Cites Work

• Work for the Hairdressers: The Production of de Prony's Logarithmic and Trigonometric Tables
• A characterization of parenthesis languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Origins of the analysis of the Euclidean algorithm