Let ABCDEF be a regular hexagon of side length 2. Through the vertices and the sides' midpoints we construct parallels to the sides, which divide the hexagon into 24 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 X is the figure formed by three adjacent sheets such that their intersection is only X 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 ABCDEF, centered at O, and let T, U, V, X, Y, Z be the midpoints of the sides AB, BC, CD, DE, EF, FA, respectively. Notice that the nodes situated on the sides of the hexagon cannot have trios, so a node that admits a trio is either O, or situated at distance 1 from O. Denote these latter nodes by M, N, P, Q, R, S, as shown in Figure 1. The side length of an equilateral triangle with nodes as vertices may be equal to 1, 3, 2, 7, 3 or 23. A sheet of side length 3 or 23 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 that have O as a vertex. Also, there are only two sheets of side 7 that have R as a vertex, namely RAU and RCT. Moreover, the intersection of a side 2 sheet and a side 7 sheet of R 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 43+433+473=4113.
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 O. All these six trios cover the whole hexagon. The node R has exactly two sheets of maximal side length - which is equal to 7 - namely RAU and RCT. Since RB=3>7, it follows that not all the points of the segment RB can be covered with the trios of R.
c) We say that a trio is (x,y,z)-type if the side lengths of its sheets are equal to x,y,z. The center O has only (1,3,2)-type trios, as indicated in Figure 2. Now, we count how many trios have OQR as one of its sheets. The only side 2 sheets that we can choose to be part of a trio are OAF, OAB and OBC. For each of these side 2 sheets we can choose the side 3 sheet in two ways, so there are exactly 6 trios which contain OQR. Since O is the vertex of six side 1 sheets, the node O has exactly 36 trios. The node R admits only (1,3,2) and (1,3,7) type trios. Consider the sheets RDP and RNZ. To complete a trio, there are two choices for the side-1 sheet, specifically REX and REY. The same applies for the sheets RFM and RNV. Therefore, the node R has exactly four (1,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 1: REX, REY and RSY. Also, there are three side 1 sheets that form a trio with RCT and RFM. Consequently, R has six (1,3,7)-type trios. It follows that there are 10 trios associated to the node R, so there are 60 trios associated to a node other than O. Adding all up, there are 96 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.