US-TST 2002 Problem 3
Let be an integer greater than 2, and distinct points in the plane. Let denote the union of all segments . Determine if it is always possible to find points and in such that (segment can lie on line ) and , where (1) ; (2) .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.