The problem
Let with associated such that the congruence classes are disjoint (that is, every integer is for at most one ). How large can be in terms of ?
Statement quoted from erdosproblems.com/202, maintained by Thomas Bloom. Original source: [Er61][Er65][Er65b][Er73][Er77c][Er80,p.96][ErGr80][Va99,1.29]. Current status there: solved (Lean).
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 |
|---|---|---|---|---|
| 23 Apr, 2026 | AI working with humans | GPT-5.4 Pro | Boon Suan Ho | 🟢 Full solution |
| 30 Apr, 2026 | AI working with humans | GPT-5.5 Pro | Przemek Chojecki | ⚪ Candidate full solution |
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.
∎