Proof by contradiction.
Assume you have a list containing every single prime number.
Multiple all those numbers together to get a very large number. Add 1 to that number to get a new number we’ll call C.
C cannot be divided by any of the prime numbers on your list, so it must not be composite. But it has to be composite because it isn’t on your list. That’s a contradiction. C can’t be composite but it has to be composite.
Because the assumption created a contradiction, the assumption must be wrong. You cannot in fact have a list of all the prime numbers.
Latest Answers