Distinct distances and related problems
Statement
(1) Let with no three points collinear. Then determines at least distinct distances.
(2) Given points in with no three collinear. Then one can remove -many points so that the number of isosceles triangles is at most .
(3) Given a set of points in with no three collinear. Then determines perpendicular bisectors containing at most 1 point of each, unless is the vertices of a regular polygon together with its center.
Record
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.