Erdős Problem #982
FALSIFIABLEdatabase updated 2025-08-31
Still open — but if it is false, a finite counterexample exists, so a computer search could in principle disprove it. A search can't prove it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
If \(n\) distinct points in \(\mathbb{R}^2\) form a convex polygon then some vertex has at least \(\lfloor\frac{n}{2}\rfloor\) different distances to other vertices.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/982.Prizenone
Statement in LeanFormal Conjectures
Solution in Leanno
OEISA004526
Original pageerdosproblems.com/982
Attempts
submit one →Read our working report →
Live page status on 2026-07-28 is FALSIFIABLE/open, but it lists 1 partial claimed proof (Scott Duke Kominers, submitted 2026-07-25) and current workers Sam_Petkov and skominers, so the mandatory no-d
SKIPPED