Prove that there exists an infinitely large number of primes.
(In reply to
suppose not by danny)
I think there is a flaw in the solution here.
Suppose P is the largest prime number and c is the product of all prime numbers less than and including P. Certainly (c+1) would have no prime as a factor. However, since c is the product of prime numbers (which are all odd numbers), c itself must also be an odd number. Therefore, (c+1) must be an even number which is divisible by 2. Thus (c+1) is not a prime number greater than P and no contradiction has be shown.
re: suppose not
