← All problems

Erdős Problem 421

Let U(n)U(n) be the maximum number of unordered pairs of points at Euclidean distance 11 among any set of nn points in the plane, that is, U(n)=max⁡P⊆R2, ∣P∣=n#{{p,q}⊆P:∥p−q∥=1}U(n)=\max_{P\subseteq\mathbb{R}^{2},\,|P|=n}\#\bigl\{\{p,q\}\subseteq P:\|p-q\|=1\bigr\}. The conjecture asks whether U(n)=n1+o(1)U(n)=n^{1+o(1)}, equivalently, whether for every ε>0\varepsilon>0 there exists n0n_{0} such that U(n)≤n1+εU(n)\leq n^{1+\varepsilon} for all n≥n0n\geq n_{0}.

References

Source: GitHub

Progress summary

Refreshed
Open · solution reported

A construction checked by mathematicians and formal-verification work now establishes that Erdős Problem 421 is solved.

Erdős Problem 421 concerns the conjecture that nn planar points determine at most n1+o(1)n^{1+o(1)} pairs at unit distance. A construction with more such pairs disproves the conjecture.

May–August 2026 construction and verification

An internal OpenAI model produced a counterexample with at least n1+δn^{1+\delta} unit-distance pairs for infinitely many nn; Will Sawin refined it to δ=0.014\delta=0.014. External mathematicians checked the argument, and a later audit expanded formal verification and strengthened the short-gap estimate. The available evidence supports closure, though the audit is a verification repository rather than journal confirmation.

Current status (as of August 2026): The conjecture is resolved by a publicly described counterexample, with external checking and expanded formal verification; no specific gap or retraction is reported.

Sources

Solutions 0

No solutions have been posted yet.