Once upon a time, there lived a Mathematician named Euclid.

Euclid came up with an ingenious method of proving that there are infinitely many prime numbers. Prime numbers are whole numbers that only have two factors, one and itself. For instance, 7 is a prime number while 6=2×3 is not.

The proof is by contradiction. Suppose that there are only a finite number of prime numbers, .

Now, we consider the number .

P is either a prime number, or it is a composite number.

If P is a prime number, then we have just contradicted the assumption that there are only a finite number of prime numbers !

If P is a composite number, then, it has a factor (smaller than P). However, none of can be a factor since P divided by those primes will leave a remainder of 1! Hence, P has another factor that is not in the original list, contradicting the initial assumption once again.

(Strictly speaking, Euclid’s proof is not by contradiction, instead he used a similar argument to show that given any finite list of primes, there is at least one other prime.)