Re: Answer
They go on forever. Proof:
Suppose there were a finite # of primes, and suppose N is the largest. Multiply them all together and add 1 to the result and call this X. Then X can not be divisible by any of the primes, since X-1 is divisible by all of them. Therefore X is prime, but it must be larger than N which is a contradiction, therefore there is not a finite number of primes.
|