Erdős problem 958
Let be a finite set of size , and let be the set of distances determined by . Let be the multiplicity of , that is, the number of unordered pairs from of distance apart.
Erdős Problems records this as disproved (Lean).
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal1 retained
- Resolutiondisproved (Lean)
- WorkNone recorded
- DecisionNone here
- 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 94acceptedCarrying a Standing. Browse the topic.