Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Euclid's proof of the infinitude of primes"

(reworded proof.)
m
Line 11: Line 11:
 
[[Category:Proofs]]
 
[[Category:Proofs]]
 
[[Category:Number theory]]
 
[[Category:Number theory]]
 +
 +
{{stub}}

Revision as of 22:38, 13 August 2022

Euclid's proof of the infinitude of primes is a classic and well-known proof by the Greek mathematician Euclid that there are infinitely many prime numbers.

Proof

We proceed by contradiction. Suppose there are in fact only finitely many prime numbers, $p_1, p_2, p_3, \ldots, p_n$. Let $N = p_1 \cdot p_2 \cdot p_3 \cdots p_n + 1$. Since $N$ leaves a remainder of 1 when divided by any of our prime numbers $p_k$, it is not divisible by any of them. However, the Fundamental Theorem of Arithmetic states that all positive integers have a unique prime factorization. Therefore, $N$ must have a prime factor (possibly itself) that is not among our set of primes, $\{p_1, p_2, p_3, \ldots, p_n\}$. This means that $\{p_1, p_2, p_3, \ldots, p_n \}$ does not contain all prime numbers, which contradicts our original assumption. Therefore, there must be infinitely many primes.

See Also

This article is a stub. Help us out by expanding it.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Euclid%27s_proof_of_the_infinitude_of_primes&oldid=176915"