Erdős problem 1141 · problems.science

Are there infinitely many $n$ such that $n-k^2$ is prime for all $k$ with $(n,k)=1$ and $k^2 < n$ ?

Retained from Formal Conjectures · not edited here

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.