Quick, does 23/67 equal 33/97? A mathematician's secret from Euclid to today

DOI10.4169/AMER.MATH.MONTHLY.120.10.867MaRDI QIDQ5404046zbMATH OpenOpenAlexFDO

Authors David Pengelley

Publication date 20 March 2014

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/amer.math.monthly.120.10.867

Mathematics Subject Classification ID

History of Greek and Roman mathematics (01A20) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) General histories, source books (01A05)

Recommendations

• Did Euclid Need the Euclidean Algorithm to Prove Unique Factorization?
• A pumping lemma for invalid reductions of fractions
• Re-examination of the different origins of the arithmetical books of Euclid's \textit{Elements}
• If a prime divides a product \dots
• A prime testing algorithm from Leonhard Euler

Cited in

(2)

• Addenda et corrigenda to: ``The arithmetic of the even and the odd
• Reduction modulo sim and universality

This page was built for publication: Quick, does 23/67 equal 33/97? A mathematician's secret from Euclid to today

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