Modify Euclid’s proof that there are infinitely many primes by assuming the existence of a largest prime p and using the integer N = p!+ 1 to arrive at a contradiction.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.