A New Proof of Euclid's Theorem

@article{Saidak2006ANP,
  title={A New Proof of Euclid's Theorem},
  author={F. Saidak},
  journal={The American Mathematical Monthly},
  year={2006},
  volume={113},
  pages={937 - 938}
}
  • F. Saidak
  • Published 2006
  • Mathematics, Computer Science
  • The American Mathematical Monthly
Analysis. The proof just given is conceptually even simpler than the original proof due to Euclid, since it does not use Eudoxus's method of "reductio ad absurdum," proof by contradiction. And unlike most other proofs of the theorem, it does not require Proposition 30 of Elements (sometimes called "Euclid's Lemma") that states: if p is a prime and p\ab, then either p\a or p\b. Moreover, our proof is constructive, and it gives integers with an arbitrary number of prime factors. 
34 Citations

Topics from this paper

References

SHOWING 1-8 OF 8 REFERENCES
The new book of prime number records
  • 448
The Early History of the Ham Sandwich Theorem
  • 54
  • PDF
Topology in the Complex Plane
  • A. Browder
  • Mathematics, Computer Science
  • Am. Math. Mon.
  • 2000
  • 8
Proofs from THE BOOK
  • 706
  • PDF
Thirteen Books of Euclid's Elements
  • T. Heath
  • Mathematics, Computer Science
  • 1908
  • 491
The development of prime number theory
  • 116
and G
  • M. & Ziegler, Proofs from THE BOOK, Springer-Verlag, Berlin,
  • 1999
First Concepts of Topology, Random House
  • 1966