Waste less time on Facebook — follow Brilliant.

Euclid's proof of infinite primes

For those who don't know, there are infinite primes and this can be proved by Euclid's proof.

For every prime number, by multiplying all the prime numbers before it (inclusive) and adding 1 to the product, the resultant is a bigger prime number.

\((p_1 \times p_2 \times p_3 \times ... \times p_{n-1} \times p_n) + 1=p_x\)

My question to everyone is, do you think you could contradict this proof?

Note by Sharky Kesa
3 years, 1 month ago

No vote yet
1 vote


Sort by:

Top Newest

Well, this proof is not necessarily complete. First of all, this is supposed to be a proof by contradiction, so you must first assume you have a finite number of primes and then do what you have done. Secondly, some definitions are in place. We must define prime numbers as only positive integers greater than one. Then the proof is flawless. Bob Krueger · 3 years, 1 month ago

Log in to reply

the result may be a number which is not prime but it must be divisible by primes not in the list. Pranav Kirsur · 3 years ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...