Erdős problem 91
Suppose has and minimises the number of distinct distances between points in . Prove that for large there are at least two (and probably many) such which are non-similar.
Nothing has been recorded here yet.
How far the record reaches3 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal14 retained
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingResolution
No source retained here records an outcome for this question.
Its collection still marks it open.
Where the source files it110 share a topic
Erdős problem 94acceptedCarrying a Standing. Browse the topic.