Erdős Problem #1070

Partial progress by Ákos Dúcz and Dániel Varga with Codex and GPT-5.5 (29 Jun 2026): partial result.

Problem
Erdős problem #1070 (geometry); current status: open
Credit
Ákos Dúcz and Dániel Varga with Codex and GPT-5.5 · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-06-29 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PARTIALPer Tao's AI-contributions wiki

The problem

Let f(n)f(n) be maximal such that, given any nn points in R2\mathbb{R}^2, there exist f(n)f(n) points such that no two are distance 11 apart. Estimate f(n)f(n). In particular, is it true that f(n)≥n/4f(n)\geq n/4?

Statement quoted from erdosproblems.com/1070, maintained by Thomas Bloom. Original source: [Er87b,p.171]. 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
29 Jun, 2026 AI working with humans Codex, GPT-5.5 Ákos Dúcz, Dániel Varga 🟡 Partial result

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.

∎