Quote:
Originally Posted by bcbrown
[You must be logged in to view images. Log in or Register.]
Jesus Christ. Here's a proof that there is no highest prime number, or equivalently that the the sequence of prime numbers is unbounded. Note, this is a proof by contradiction.
Assume that there is a highest prime number, P_max. Thus the sequence of primes runs P_0, P_1, P_2 ... P_max. Compute the number sum(P_0, P_1, P_2 ... P_max) + 1. This number is not divisible by any number in the sequence of primes, is not divisible by any of them, and is larger than P_max. This contradicts the assumption there is a highest prime number. QED.
I ask again, what is your definition, and what is your proof? You said it was easily provable.
|
Did you not read my guide? I provided the math in it quite clearly. If you are simply going to quibble over the specifics in how I wrote out the math, then you have already lost the argument.
I'll ask again: What part(s) of my arguments do you feel are incorrect?
01-15-2024, 09:17 PM
Threaded Mode