SOLUTION: Show that there are infinitely many positive primes.

Question 738228: Show that there are infinitely many positive primes.
Answer by tommyt3rd(5050) (Show Source): You can put this solution on YOUR website!
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
. I need to proof that "There are infinitely many primes" (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)

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

there are some positive integers n such that n^3 -7 is divisible by n-3 . how many such... (answered by drk)

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

Show that,in a triangle,there are infinitely many lines those divide the area and... (answered by lynnlo)

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

How many two-digit primes are there whose units digit is more than its tens... (answered by Edwin McCravy)