Modular arithmetic before C. F. Gauss: systematizations and discussions on remainder problems in 18th-century Germany

DOI10.1016/j.hm.2008.08.009zbMath1172.01006OpenAlexW2023508725WikidataQ54272008 ScholiaQ54272008MaRDI QIDQ1006724

Maarten Bullynck

Publication date: 25 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.hm.2008.08.009

zbMATH Keywords

Euclidean algorithmEulermodular arithmeticGaussHindenburgremainder problems

Mathematics Subject Classification ID

History of mathematics in the 18th century (01A50) Linear Diophantine equations (11D04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

Lagrange and the four-square theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fibonacci's \textit{Liber abaci}. A translation into modern English of Leonardo Pisano's \textit{Book of calculation}. Transl. from the Latin and with an introduction, notes and bibliography by L. E. Sigler
• Algebraic analysis and the use of indeterminate coefficients by Etienne Bézout (1730--1783)
• A note on Article 36 in Gauss's \textit{Disquisitiones}. A ramificated story in the margin of the re-writing of Section II
• The origin of the problems in Euler's \textit{Algebra}
• Origins of the analysis of the Euclidean algorithm
• A supplement to J. Shallit's paper ``Origins of the analysis of the Euclidean algorithm

This page was built for publication: Modular arithmetic before C. F. Gauss: systematizations and discussions on remainder problems in 18th-century Germany