Verify R. F. Fortune’s conjecture that tk − Qk + 1 is prime for all positive integers k, where tk is the smallest prime greater than for as many k as you can.
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.