Euclid’s proof of the infinitude of primes
If there were only a finite amount of primes then there would be some largest prime . However is not divisible by any number , since is, so cannot be factored by the primes we already know, but every integer greater than one is divisible by at least one prime, so there must be some prime greater than by which is divisible.
Actually Euclid did not use for his proof but stated that if there were a finite list of primes, then the number is not divisible by any of these primes and thus either prime and not in the list or divisible by a prime not in the list.
|Title||Euclid’s proof of the infinitude of primes|
|Date of creation||2013-03-22 12:44:07|
|Last modified on||2013-03-22 12:44:07|
|Last modified by||mathwizard (128)|