Log in

No account? Create an account
entries friends calendar profile My Website Previous Previous Next Next
Mark Atwood
A math proof that anyone can follow.
One of the oldest and best known theorems in the history of mathmatical reasoning is that there are an infinite number of primes numbers. It was first known to have been proved by Euclid himself.

I just saw what has to be the shortest, most succenct, most easily understood "plain language" formulation of Euclid's proof, ever. With not an equation or piece of scary notation in sight.

Here it is:

"Assume there's a largest prime, multiply them all together, add one, you lose.""

Q. E. freaking-D.
Leave a comment