Another quick one

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 n!+1 must be larger than n.

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

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s