Skip to content

Erdős problem 1082

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

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:08c3c82940c4bd978ad0aa5d3628d966870ec3341da76d57a50b6348e396a2b7
Metadata
sha256:b770f83219d0bfc73763c5b6a511c9907c78649cbf8a4c0878928126a4858859
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:a3aa9b9bdc338d1e3c841f7aff7c3e5f90ad33c0bf3c1aee204c061f78df868f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page