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"
Line 1: Line 1:
−
This is proved by contradiction. Suppose there is a finite number of primes and let them be <math>p_1,p_2,p_3,...,p_n</math>. Let <math>x=p_1p_2p_3\cdots p_n</math>. Then we have <math>x+1=p_1p_2p_3\cdots p_n+1</math>. When divided by any of the primes <math>p_1,p_2,p_3,...,p_n</math>, <math>x+1</math> leaves a remainder of 1 implying that either <math>x+1</math> is prime or that it has some other prime factors not in the set <math>\{ p_1,p_2,p_3,...,p_n\}</math>. In any case we have it so that <math>\{ p_1,p_2,p_3,...,p_n\}</math> does not contain all prime numbers. Contradiction!
+
We proceed by contradiction. Suppose there are only [[finite]]ly many [[prime number]]s; let's call them <math>p_1, p_2, p_3, \ldots, p_n</math>. Let <math>x=p_1\cdot p_2\cdot p_3 \cdots p_n + 1</math>. When <math>x</math> is divided by any of our primes <math>p_1, p_2, p_3, \ldots, p_n</math> it leaves a [[remainder]] of 1, so none of these primes divide <math>x</math>.  Since every [[positive integer]] has at least one prime factor, <math>x</math> has some prime factor (possibly itself) not in the set <math>\{ p_1,p_2,p_3,\ldots,p_n\}</math>. Thus <math>\{ p_1,p_2,p_3,\ldots, p_n\}</math> does not contain all prime numbers. Contradiction! Our original assumption must have been false, so there are in fact infinitely many primes.

Revision as of 17:26, 15 January 2007

We proceed by contradiction. Suppose there are only finitely many prime numbers; let's call them $p_1, p_2, p_3, \ldots, p_n$. Let $x=p_1\cdot p_2\cdot p_3 \cdots p_n + 1$. When $x$ is divided by any of our primes $p_1, p_2, p_3, \ldots, p_n$ it leaves a remainder of 1, so none of these primes divide $x$. Since every positive integer has at least one prime factor, $x$ has some prime factor (possibly itself) not in the set $\{ p_1,p_2,p_3,\ldots,p_n\}$. Thus $\{ p_1,p_2,p_3,\ldots, p_n\}$ does not contain all prime numbers. Contradiction! Our original assumption must have been false, so there are in fact infinitely many primes.

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