Skip to content

Erdős problem 659

Start work

Is there a set of nn points in R2\mathbb{R}^2 such that every subset of 44 points determines at least 33 distances, yet the total number of distinct distances is ≪nlog⁡n\ll \frac{n}{\sqrt{\log n}}?

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionproved (Lean)
  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