Maths Olympiad Prep

Library / /4 of 4

Geometry Difficulty 7.8 National Olympiad, round 2 Prove it Romania

Let ABCDEFABCDEF be a regular hexagon of side length 22. Through the vertices and the sides' midpoints we construct parallels to the sides, which divide the hexagon into 2424 congruent equilateral triangles, whose vertices are called nodes. A sheet is any (non-degenerate) equilateral triangle whose vertices are nodes. A trio of a node XX is the figure formed by three adjacent sheets such that their intersection is only XX and they are not congruent in pairs.

a)
Find the maximal possible area of a trio.

b) Show that there exists a node whose trios can cover the whole hexagon, and a node whose trios cannot cover the whole hexagon.

c)
Determine the total number of trios associated to the hexagon.

Dana Heuberger

Solution

a) Consider the regular hexagon ABCDEFABCDEF, centered at OO, and let TT, UU, VV, XX, YY, ZZ be the midpoints of the sides ABAB, BCBC, CDCD, DEDE, EFEF, FAFA, respectively.
Notice that the nodes situated on the sides of the hexagon cannot have trios, so a node that admits a trio is either OO, or situated at distance 11 from OO. Denote these latter nodes by MM, NN, PP, QQ, RR, SS, as shown in Figure 1.
The side length of an equilateral triangle with nodes as vertices may be equal to 11, 3\sqrt{3}, 22, 7\sqrt{7}, 33 or 232\sqrt{3}. A sheet of side length 33 or 232\sqrt{3} cannot be part of a trio, because the vertices of this sheet should be situated on the hexagon sides.
There are no sheets of side 7\sqrt{7} that have OO as a vertex. Also, there are only two sheets of side 7\sqrt{7} that have RR as a vertex, namely RAURAU and RCTRCT. Moreover, the intersection of a side 22 sheet and a side 7\sqrt{7} sheet of RR is non-empty, so we can't form trios with such sheets.
Consequently, the sheets RAU, RDP and REY (see Figure 1) form a trio with maximal possible area, and the maximal area is equal to
34+334+734=1134. \frac{\sqrt{3}}{4} + \frac{3\sqrt{3}}{4} + \frac{7\sqrt{3}}{4} = \frac{11\sqrt{3}}{4}.

b) Considering the colored trio from Figure 2, we notice that OAB covers the sixth part of the hexagon. Rotating the view, OBC, OCD, ODE, OEF, and OFA are sheets for some other five trios of OO. All these six trios cover the whole hexagon.
The node RR has exactly two sheets of maximal side length - which is equal to 7\sqrt{7} - namely RAU and RCT. Since RB=3>7RB = 3 > \sqrt{7}, it follows that not all the points of the segment RBRB can be covered with the trios of RR.

c) We say that a trio is (x,y,z)(x, y, z)-type if the side lengths of its sheets are equal to x,y,zx, y, z.
The center OO has only (1,3,2)(1, \sqrt{3}, 2)-type trios, as indicated in Figure 2. Now, we count how many trios have OQROQR as one of its sheets. The only side 22 sheets that we can choose to be part of a trio are OAFOAF, OABOAB and OBCOBC. For each of these side 22 sheets we can choose the side 3\sqrt{3} sheet in two ways, so there are exactly 66 trios which contain OQROQR. Since OO is the vertex of six side 11 sheets, the node OO has exactly 3636 trios. The node RR admits only (1,3,2)(1, \sqrt{3}, 2) and (1,3,7)(1, \sqrt{3}, \sqrt{7}) type trios.
Consider the sheets RDP and RNZ. To complete a trio, there are two choices for the side-11 sheet, specifically REX and REY. The same applies for the sheets RFM and RNV. Therefore, the node RR has exactly four (1,3,2)(1, \sqrt{3}, 2)-type trios.
Likewise, the sheets RAU and RDP can form a trio together with one of the following three triangles of side length 11: REX, REY and RSY. Also, there are three side 11 sheets that form a trio with RCT and RFM. Consequently, RR has six (1,3,7)(1, \sqrt{3}, \sqrt{7})-type trios.
It follows that there are 1010 trios associated to the node RR, so there are 6060 trios associated to a node other than OO. Adding all up, there are 9696 trios associated to the hexagon.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.