Prove that there exists an infinitely large number of primes.

Call the largest prime P. Now, multiply all the primes up to P and add 1. This number cannot be divisible by any prime up to P because it is 1 more than a multiple of that prime. Therefore, there has to be another prime greater than P.

Posted by Math Man on 2011-02-04 22:08:10