The problem
Let be a set of integers such that is complete for any finite subset and is not complete for any infinite subset . (Here 'complete' means all sufficiently large integers can be written as a sum of distinct members of the sequence.)
Is it true that if for some and all then
Statement quoted from erdosproblems.com/346, maintained by Thomas Bloom. Original source: [ErGr80,p.57]. Current status there: solved.
AI contributions
As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.
| Date | Kind | AI systems | Humans | Outcome | Literature |
|---|---|---|---|---|---|
| 19 Jun, 2026 | AI on its own; related literature found afterwards | Codex, GPT-5.5 Pro | — | 🟡 Solution to variant problem (Lean) | 🟡 Burr and Erdős (1981) |
| 21 Jun, 2026 | AI working with humans | Codex, GPT | Kenta Kitamura | 🟢 Full solution (Lean) | — |
Caveats
The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.
∎