Did Euclid Need the Euclidean Algorithm to Prove Unique Factorization?

DOI10.2307/27641888MaRDI QIDQ5440568zbMATH OpenOpenAlexFDO

Authors Fred Richman, David Pengelley

Publication date 5 February 2008

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

Full work available at URL https://doi.org/10.2307/27641888

Mathematics Subject Classification ID

History of Greek and Roman mathematics (01A20) History of number theory (11-03) Factorization; primality (11A51)

Recommendations

• Prime simplicity
• Euclid's proof of the infinitude of primes: distorted, clarified, made obsolete, and confirmed in modern mathematics
• A historical survey of the fundamental theorem of arithmetic
• Euclid's proof of the infinitude of prime numbers.
• scientific article; zbMATH DE number 1000239

Cited in

(7)

• Number theory of the Greeks. I: Euclid's fundamental theorem of arithmetics
• Prime simplicity
• On the success of mishandling Euclid's lemma
• If a prime divides a product \dots
• On the success of \textit{seriously} mishandling Euclid's lemma
• Quick, does 23/67 equal 33/97? A mathematician's secret from Euclid to today
• Number theory of the Greeks. II: Gauss lemmas and Riesz rings

This page was built for publication: Did Euclid Need the Euclidean Algorithm to Prove Unique Factorization?

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