The Euler-Mullin sequence q1,q2, …, qk, … is defined by taking q1 = 2 and defining qk + 1 to be the smallest prime factor of q1q2⋯qk + 1 whenever k is a positive integer. Find as many terms of this sequence as you can. It has been conjectured that this sequence is a reordering of the list of prime numbers.
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.