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$ ?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:8188b5c387fdc82bb649b4cf3060b6d1ff864f36484ae4e9be44254887afe668
Metadata: sha256:a3ed99268e139fd8ea70522e192e315967284c79c297c099a3e261487faa0db4
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:19b29b35a6521ccede55976f61d3943da1f1f54f73a50d739dc74a7bd6a3a085

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207