Let Qn = p1p2 ⋯ pn + 1, where p1, p2, ⋯, pn are the n smallest primes. Determine the smallest prime factor of Qn for n = 1, 2, 3, 4, 5, and 6. Do you think that Qn is prime infinitely often? (Note: This is an unresolved question.)
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.