Skip to main content
OlympiadHQ

Browse · MathNet

Print

2022 China Team Selection Test for IMO

China 2022 geometry

Problem

Find all positive integers such that there are finitely many triangles on the Descartes coordinate plane such that (1) the center of mass of each triangle is an integral point; (2) the intersection of any two triangles is either the empty set, a common vertex, or an edge joining two common vertices; and (3) the union of these triangles is a square with side length . (The vertices of the squares are not required to be integral points, and the edges are not required to be parallel to the coordinate axes.)
Solution
The desired positive integers are those divisible by .

First assume that for . Consider the square with vertices , , , and . Divide it into different smaller squares with the same side length along the lines () and (). After this, each square can be divided into isosceles right triangles along the diagonal, and the center of mass of each triangle is an integral point. This gives the needed triangulation.

Conversely, suppose that a square with side length has a triangulation such that the center of mass of each small triangle is an integral point. Let denote the set of all vertices of the triangulation. Define a binary relation in if two triangles of the triangulation are of the form , . The equivalence relation on is generated by , i.e. if and only if there exist such that . Denote the horizontal and vertical coordinates of a point by and , respectively. We have

(i) If , then and . This is because: by transitivity, one may assume that , i.e., there are two triangles in the triangulation of the form , , whose centers of mass are both integral points. Therefore, and ; thus . We may deduce similarly .

(ii) The set has at most equivalent classes with respect to . This is because after fixing a triangle , for each point in , there is always a sequence of triangles such that and shares a same side for all , and that is a vertex of . By definition of , all three vertices of are respectively equivalent to three vertices of . Hence by induction, is equivalent to one of the vertices of .

By (ii) together with the pigeonhole principle, two of the four vertices of a square must be equivalent. Then from (i), we know that or , which implies .
Final answer
all positive integers divisible by 3

Techniques

Cartesian coordinatesConstructions and lociPigeonhole principle