SOLUTION: . I need to proof that "There are infinitely many primes"

Question 727768: . I need to proof that "There are infinitely many primes"

Answer by tommyt3rd(5050) (Show Source): You can put this solution on YOUR website!
I answered this before, here is what I wrote:
Suppose that there are only n-prime numbers and denote the product of all of the primes as A. Next let B be the product of all of the primes plus 1. Now 1 is not a prime number by definition so for any particular prime p>1. By the fundamental theorem of algebra, our p had to be a divisor of A as well as a divisor of B. Furthermore it also must divide their difference, B-A - which is 1. Since the difference is 1, p must be a divisor of 1 and this is impossible.
Our contradiction tells us that our first statement must be false. There are infinitely many primes.
RELATED QUESTIONS
Show that there are infinitely many positive... (answered by tommyt3rd)

Prove that there are infinitely many primes of the form 6n − 1. (answered by ikleyn)

Prove that there are countably many primes of the form 8n − 1 or 8n +... (answered by ikleyn)

in the primes between 100 and 200 there are instances when three consecutive primes have... (answered by Alan3354)

In the primes between 100 and 200 there are instances when three consecutive primes have... (answered by MathTherapy,ikleyn)

would the solution (5,5) mean that there are no solutions to the equation or that there... (answered by checkley77)

twin primes are two consecutive odd prime numbers, such as 11 and 13. How many aris of... (answered by Alan3354)

there are infinitely many irrational numbers.give reason (answered by solver91311)

Twin primes are a pair of prime numbers that have a difference of 2. How many pairs of... (answered by CharlesG2)