A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm

DOI10.1006/HMAT.1995.1033zbMATH Open0842.01004OpenAlexW2054614144WikidataQ61534966 ScholiaQ61534966MaRDI QIDQ1908667FDOQ1908667

Authors: Peter Schreiber 

Publication date: 28 July 1996

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

Full work available at URL: https://doi.org/10.1006/hmat.1995.1033

Recommendations

• Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
• scientific article; zbMATH DE number 1186933
• scientific article; zbMATH DE number 7368168
• Publication:4508390
• scientific article; zbMATH DE number 60228

zbMATH Keywords

Euclidean algorithmworst case analysisSimon Jacob

Mathematics Subject Classification ID

History of number theory (11-03) History of mathematics in the 15th and 16th centuries, Renaissance (01A40)

Cites Work

• Origins of the analysis of the Euclidean algorithm

Cited In (3)

• Modular arithmetic before C. F. Gauss: systematizations and discussions on remainder problems in 18th-century Germany
• A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
• A look back on the 20th century

This page was built for publication: A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm

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