The problem
Does there exist which is a minimal basis of order (i.e. every large integer is the sum of elements from , and no proper subset of has this property), such that
for some ?
Statement quoted from erdosproblems.com/326, maintained by Thomas Bloom. Original source: [ErGr80,p.47]. Current status there: open.
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 |
|---|---|---|---|---|
| 20 May-14 Jun, 2026 | AI working with humans | Aristotle, Codex, GPT-5.5 | Aron Bhalla | 🟢 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.
∎