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?

Erdős Problems records this as falsifiable.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. Resolutionfalsifiable
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it110 share a topic
Geometry110Distances55
Erdős problem 94accepted
Carrying a Standing. Browse the topic.
Start workOpen sources