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

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI collaborating with humans
Erdős AI contributions wiki · 25 Jan, 2026
Machine
GPT-5.2 Pro, GPT-5.2 Thinking
People
Quanyu Tang
Open the source record
Formalization
Erdős AI contributions wiki · 11 Apr, 2026
Machine
GPT-5.4 Pro
Open the source record
AI standalone
Erdős AI contributions wiki · 9 Apr, 2026
Machine
OpenAI internal model
Open the source record
construction
VibeMathed
Machine
OpenAI internal model
People
Boris Alexeev, Moe Putterman, Mehtaab Sawhney, Mark Sellke, Gregory Valiant
Reported outcome
resolved
Open the source record