Skip to content

Erdős problem 958

Let A⊂R2A\subset \mathbb{R}^2 be a finite set of size nn, and let {d1,…,dk}\{d_1,\ldots,d_k\} be the set of distances determined by AA. Let f(d)f(d) be the multiplicity of dd, that is, the number of unordered pairs from AA of distance dd apart.

Erdős Problems records this as disproved (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. Resolutiondisproved (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.

Where the source files it110 share a topic
Erdős problem 94accepted
Carrying a Standing. Browse the topic.