Erdős problem 1082 · problems.science

Let $A\subset \mathbb{R}^2$ be a set of $n$ points with no three on a line. Must there exist a single point from which there are at least $\lfloor n/2\rfloor$ distinct distances?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1082.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1082.leanErdos1082.erdos_1082.parts.i3 linesExact file

1True ↔2  ∀ (A : Finset (EuclideanSpace ℝ (Fin 2))),3    EuclideanGeometry.NonTrilinear ↑A → A.card / 2 ≤ EuclideanGeometry.distinctDistances A

OpenStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI alongside literature
Erdős AI contributions wiki · 14 Feb, 2026
Machine
DeepMind prover agent
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science