Skip to content

Erdős problem 1082

Start work

Let A⊂R2A\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?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:a3aa9b9bdc338d1e3c841f7aff7c3e5f90ad33c0bf3c1aee204c061f78df868f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON