Browse · MathNet
Print37th Iranian Mathematical Olympiad
Iran geometry
Problem
Consider lattice points of a grid. We start with two points , . We say two points , are connected if one can reflect several times with respect to points , and reach from to . What is the minimum number of connected components, over all choices of , ?
Solution
We claim the answer is . Let us first find the points in a connected component. Let be the line passing through a point and parallel to . Let be the reflection of with respect to . First note that the reflection of any point with respect to each of and lies on . Hence, any point connected to lies on or .
We claim if is connected to a point , then can be attained by some number of transformations by and at most one reflection with respect to : the combination of any two reflections with respect to , is a transformation.
Transforming by does not change the parity of coordinates, so if we define an equivalence relation if and only if , , points will form at least classes. Every connected component has points from at most two classes. Note that and are not connected and their components consist of exactly one class, so we have at least components.
As an example, which is easy to verify, take the two points having only half a unit distance from the center of the table as , .
We claim if is connected to a point , then can be attained by some number of transformations by and at most one reflection with respect to : the combination of any two reflections with respect to , is a transformation.
Transforming by does not change the parity of coordinates, so if we define an equivalence relation if and only if , , points will form at least classes. Every connected component has points from at most two classes. Note that and are not connected and their components consist of exactly one class, so we have at least components.
As an example, which is easy to verify, take the two points having only half a unit distance from the center of the table as , .
Final answer
8
Techniques
RotationTranslationConstructions and lociInvariants / monovariants