Erdős Problem #657
Statement
Is it true that if is a set of points such that every subset of points determines distinct distances (i.e. has no isosceles triangles) then must determine at least distinct distances, for some ?
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.