Prove that there is an infinite number of primes.
The problem was originally called Euclid’s Theorem, named after Euclid, who proved that there were an infinite amount of primes in his book Elements (Book: IX, Proposition: 20) using contradiction. The following is an adaptation of his proof:
Assuming that there is a finite list of primes, let denote the product of all such primes and be one more than it.
It is then shown that must either be a prime or have prime factors larger than .
Case is prime:
If is prime, and is the product of all primes in a finite list plus 1, then it must be larger than the largest prime , meaning that there is a larger prime bigger than the one defined as the largest, and therefore, there cannot be a finite number of prime numbers.
Case is composite:
If is composite, it follows that it cannot have a prime factor smaller than :
cannot be divided by 2 as it is , or one more than a multiple of 2.
cannot be divided by 3 as it is , or one more than a multiple of 3.
cannot be divided by 5 as it is , or one more than a multiple of 5.
It follows that cannot be divided by the assumed largest prime (in a finite list to comply with contradiction assumption that there is a finite number of primes) as it is , or one more than a multiple of .