The problem
For any , if is a sufficiently large finite Sidon set then there are at least many such that .
Statement quoted from erdosproblems.com/152, maintained by Thomas Bloom. Original source: [ESS94]. Current status there: proved (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 | Outcome | Literature |
|---|---|---|---|---|
| 3 Apr, 2026 | AI on its own; related literature found afterwards | DeepMind prover agent | 🟢 Full solution (Lean) | 🟡 Erdős, Sárközy, and Sós (1994) |
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.
∎