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.
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded here
- Next gapNot recorded
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:aa28158f1e69c48dc7f894aeddec6e4aab3d7140744e761e6686a369dc63035c
- Metadata
- sha256:40cfa962094204e93d651f5e7b9b06e923a527f9216b69925657bd780935d19c
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:cb66ee8747086e70c7c52e8b695d668f1ef3fa710eaf6b48079545e36810d934
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb