2, 3, 5, 7, 11, 13, 17, 19...

Where Prime Numbers mysteries are solved.

The biggest known prime to date is the Mersenne prime 2^{43,112,609} - 1. It has 12,978,189 digits! However, we know there are larger primes out there, because there are an infinite number of prime numbers! How do we know that? Euclid actually proved this over 2,000 years ago!

This proof is a proof by contradiction. First, we'll make an assumption, and then we'll show that the assumption must be false. Follow along:

- Suppose there are a finite number of prime numbers, up to N of them. We'll call this set
*P*. So P = {p_{1}, p_{2}, p_{3}, ..., p_{N-1}, p_{N}}. - Now, take all the numbers in
*P*and multiply them together. We'll call this q. So q = p_{1}x p_{2}x p_{3}x ... x p_{N-1}x p_{N}. - Now look at q - 1. This number will not be divisible by any of the numbers in
*P*. If you take any number in*P*, say P_{m}, since P_{m}is greater than 1, and since q is divisible by P_{m}, q - 1 will not be divisible by P_{m}. The next lower number than q to be divisible by P_{m}would be q - P_{m}. - Since q - 1 is not divisible by any of the prime numbers, it is by definition prime! This means our supposition in step 1 was false, and therefore, there must be an infinite number of prime numbers.