Skip to content

Erdős Problem #213

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

For which positive integers \(n\) can one find \(n\) points in the real plane such that every pairwise distance is an integer, no three points are collinear, and no four lie on one circle? These are integral point sets in general position. The requirement is the integrality of distances, not coordinates.

The original Erdős question asks whether such configurations exist for arbitrarily large \(n\). It is closely related to the classical Anning–Erdős theorem, which forbids an infinite integral-distance set unless all its points are collinear.

A small example

The points \((0,0)\), \((3,0)\) and \((0,4)\) have pairwise distances \(3,4,5\) and are not collinear. With only three points, the no-four-concyclic condition is vacuous. Adding a fourth point with integral distances is not enough: one must also check that no triple becomes collinear and no four form a cyclic quadrilateral.

The squared-distance test is necessary but insufficient. If a squared distance is an integer that is not a perfect square, the Euclidean distance is irrational, not integral.

What is known

OPEN. Harborth exhibited five points meeting the requirements; Kreisel and Kurz (2008) found an example with seven points, the largest cited on the maintained Erdős #213. Anning and Erdős (1945) ruled out infinite noncollinear sets of integral distances. That theorem does not imply a uniform bound on the sizes of finite examples.

Ascher, Braune and Turchet (2020) established a uniform upper bound assuming Bombieri–Lang. Greenfeld, Iliopoulou and Peluse (2024) proved unconditionally that an integral-distance set \(S\subseteq[-N,N]^2\) in general position satisfies

\[ |S|\ll(\log N)^{O(1)}. \]

This controls cardinality in a bounded box, not the overall maximum over all possible scales. Scaling a fixed integral point set to fit a larger box changes \(N\), so the result does not settle existence for arbitrarily large \(n\).

GCL's current state

Pinned and current classification: OPEN. Original issue #1482. The published existence and conditional bounds are source-attributed; the seven-point coordinates and the full conditional proof were not independently replayed.

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 task takes the seven-point Kreisel–Kurz source coordinates and checks every unordered pair distance, every triple orientation determinant and every four-point incircle determinant with exact arithmetic. Acceptance: all pair distances are positive integers, no triple determinant vanishes, no four-point incircle determinant vanishes, and the coordinate scaling is documented. Do not treat this finite witness as a uniform family.

Sources and claim boundaries

No arbitrarily large integral-distance construction, unconditional size bound or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1482 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction