Erdős Problem #91
Statement
Let be a sufficently 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.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.