Andrew Spinelli

Claim:

There are infinitely many primes.

Proof:

Suppose there are a finite number of primes. Then the set of all primes, P={p1,p2,p3,...,pn,} is
finite. A number is prime if it cannot be divided by any of the other primes. Consider the integer
created by multiplying the members of the set P together and then adding 1. p1*p2*p3*...*pn+1, if it is
not prime, should be divided by one of the primes, pk is contained in P, i.e. C*pk= p1*p2*p3*...*pn+1, C
is contained in Z, by the definition of division. Then C*pk - p1*p2*p3*...*pn=1 ---->
pk (C – (p1*p2*p3*...*pn)/pk )=1. By the definition of division this means that pk divides 1. This is not
possible because 1 is not divisible by any of the primesx. We have reached a contradiction, and
conclude the opposite of our original supposition. Therefore, there are infinitely many primes.