Prove the statement by the method of exhaustion.
Exercise
For each integer n with 1 ≤ n ≤ 10, n2 − n + 11 is a prime number.
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.