ELMO 2014 Problem 3
We say a finite set of points in the plane is very if for every point in , there exists an inversion with center mapping every point in other than to another point in (possibly the same point).
(a) Fix an integer . Prove that if , then any line segment contains a unique very set of size such that .
(b) Find the largest possible size of a very set not contained in any line.
(Here, an inversion with center and radius sends every point other than to the point along ray such that .)
Proposed by Sammy Luo
Dataset text AI-MO AoPS. Quoted with source.
Official text: ELMO 2014 official paper, page 1.
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.