Erdős Problem #217
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry, distances.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Choose \(n\) distinct points in the real plane, with no three collinear and no four concyclic. There are \(\binom n2\) unordered pairs of points. Erdős asks for which \(n\) it is possible to have precisely \(n-1\) distinct pairwise distances, with their multiplicities, in some order, equal to
These multiplicities sum to \(\binom n2\), so the requirement is numerically possible, but imposes a strong geometric constraint. Distinct distances means different Euclidean lengths, not different ordered pairs.
A small example
At \(n=4\), there are six unordered point pairs, and the desired multiplicities are one, two and three. A configuration containing an isosceles triangle and a carefully placed fourth point supplies the known small case. Counting a distance between \(p\) and \(q\) twice, once for each orientation, would incorrectly double all multiplicities.
No three on a line forbids degenerate triangles. The extra no four on a circle restriction rules out certain highly symmetric constructions even when they realize the right number of distances.
What is known
The existence of examples for arbitrarily large \(n\) remains OPEN. Pomerance constructed a five-point example. Palásti found examples with seven points in 1987 and eight points later, and in 1989 supplied a six-point configuration with no equilateral triangle to meet a strengthened variant.
Erdős originally thought \(n\ge5\) impossible, but those examples refuted that early expectation. He subsequently conjectured that no such configurations exist for all sufficiently large \(n\). The maintained Erdős #217, updated April 2026, records these finite examples and the link to a stronger distinct-distance question #98. None of the finite examples resolves the eventual-existence question.
GCL's current state
Pinned and maintained status: OPEN. Original source issue #1486. No matched formal statement exists at the frozen provider revision. The historical Palásti and Pomerance examples are source-attributed; their exact coordinates have not been independently verified here.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded successor obtains the published coordinates of the seven- or eight-point construction and checks squared distances exactly, grouping equal lengths without floating-point error. Acceptance: the multiplicity multiset is precisely \(\{1,\ldots,n-1\}\), no orientation determinant for any triple vanishes, and no four-point concyclicity determinant vanishes. Avoid inferring an infinite family from finite examples.
Sources and claim boundaries
- Erdős #217, original [Er83c], Pomerance and Palásti [Pa87], [Pa89], [Pa89b].
- GCL source issue #1486.
No new configuration, resolution of the eventual threshold or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1486 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.