13
edits
Changes
Jump to navigation
Jump to search
Line 31:
Line 31: + + + +
no edit summary
[[User:Ga ohoyt|Ga ohoyt]] 13:32, 10 January 2008 (EST)
[[User:Ga ohoyt|Ga ohoyt]] 13:32, 10 January 2008 (EST)
== Flaw in proof ==
"It is easy to prove that there are an infinite number of primes using Euclid's second theorem. If there were a finite number of primes, you could multiply them all together and add 1. The resulting number would show the existence of a new prime, since it would not be divisible by any smaller prime (it would always have a remainder of 1)." This argument doesn't work. 510511 = 2 * 3 * 5 * 7 * 11 * 13 * 17 + 1, but it's not prime. [[User:Sepura|Sepura]] 13:21, 20 February 2008 (EST)