Erdős Problem #1141
Erdős problem #1141 · erdosproblems.com/1141
- Result
- Disproved
- Status
- Resolved
- AI contribution
- AI-discovered
- Method
- Construction
- Field
- Number Theory, Primes
- Posed by
- Various
- Year posed
- 1999
- Years open
- 27y
- Solved
- 2026-04-09
- Model
- OpenAI internal model
- Vendor
- —
- Collaborators
- Boris Alexeev, Moe Putterman, Mehtaab Sawhney, Mark Sellke, Gregory Valiant
- Verification
- Lean-verified
- Publication
- Announced
- Significance
- 10 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
From "Short proofs in combinatorics, probability and number theory II": "The proofs in this manuscript are due to an internal model at OpenAI... The role of the human authors was simply to digest the proofs and modify the write-ups for clarity and elegance." All five independent ChatGPT-5.4 Pro attempts also solved this one. The paper proves the finiteness for every fixed a, generalizing the a = 1 case that is Erdos's problem.
Verification
Listed as solved on erdosproblems.com and the proof is verified in Lean. Solve credited via Terence Tao's AI-contributions wiki.
Sources
- PaperShort proofs II (Section 6)
- Problem recorderdosproblems.com