olymmath

ELMO 2014 Problem 3

    We say a finite set SS of points in the plane is very if for every point XX in SS , there exists an inversion with center XX mapping every point in SS other than XX to another point in SS (possibly the same point).

    (a) Fix an integer nn . Prove that if n≥2n \ge 2 , then any line segment AB‾\overline{AB} contains a unique very set SS of size nn such that A,B∈SA, B \in S .

    (b) Find the largest possible size of a very set not contained in any line.

    (Here, an inversion with center OO and radius rr sends every point PP other than OO to the point P′P' along ray OPOP such that OP⋅OP′=r2OP\cdot OP' = r^2 .)

    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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator elmo/2014/p3 · Tag 66N2H76SQ3 · Edit this page on GitHub · Keys: j next, k previous