Loading problem…
Status
On this page
Status
Topics
Status
On this page
Status
Topics
Let be a sufficiently large integer. Suppose has and minimises the number of distinct distances between points in . Prove that there are at least two (and probably many) such which are non-similar.
Source: erdosproblems.com/91
No claim settles this problem.