(This exercise constructs another proof of the infinitude of primes.) Show that the integer Qn = n! + 1, where n is a positive integer, has a prime divisor greater than n. Conclude that there are infinitely many primes.
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.