# Another quick one

May 24, 2012 Leave a comment

I know we’ve done a bunch of these types of proofs already, but this one is particularly beautiful in its simplicity:

Any prime divisor of must be larger than .

We’re pretty much done with the infinitude of the primes. Next week I intend to prove the prime number theorem, and then we’ll be done with primes altogether for a while.

Advertisements