Maths Olympiad Prep

Library / /3 of 3

Geometry Difficulty 6.7 National olympiad Prove it North Macedonia

Let n>3n > 3 be a positive integer. An equilateral triangle ABCABC is divided into n2n^2 identical equilateral "small" triangles using lines parallel to its sides. The figure below illustrates the case n=4n = 4. Let mm be the number of rhombi consisting of 2 "small" triangles. Let dd be the number of rhombi consisting of 8 "small" triangles. Find the difference mdm - d in terms of nn.
Figure 1

Solution

Each line segment with ends from the set SS of length kn\frac{k}{n} (not lying on a side of the triangle) is the diagonal of one and only one rhombus of type MM. The segments parallel to one side of the triangle are
1+2+3++(n1)=n(n1)2. 1 + 2 + 3 + \ldots + (n-1) = \frac{n(n-1)}{2}.
Therefore, the total number of rhombi of type MM is:
m=3n(n1)2. m = 3 \frac{n(n-1)}{2}.

For the counting of rhombi of type DD, we distinguish the points of SS which are interior points of the triangle ABCABC into three categories as follows.
Figure 2

The first category of points are centers of exactly one rhombus of type DD. These points are only 3, for every nn. In figure (3) you can see the case for n=8n = 8.

The second category consists of points which are centers of exactly two rhombi of type DD. These points lie on the segments which are parallel to the sides of the triangle ABCABC and at the shortest possible distance from them. On each such segment there exist n4n-4 such points, and therefore we have 3(n4)3(n-4) points of this category. In figure (4) you can see these points for n=8n = 8.
Figure 3

The third category consists of the rest of the points which are centers of three rhombi of type DD. These points are totally:
1+2++(n5)=(n5)(n4)2. 1 + 2 + \ldots + (n-5) = \frac{(n-5)(n-4)}{2}.
In figure (5) you can see these points for n=8n = 8.
Figure 4

Hence, the number of rhombi of type DD is the following:
d=3+3(n4)+3(n5)(n4)2d=32[2+(n1)(n4)]. d = 3 + 3(n-4) + 3 \frac{(n-5)(n-4)}{2} \Leftrightarrow d = \frac{3}{2}[2 + (n-1)(n-4)].

Finally, we have md=3(2n3)m - d = 3(2n - 3).

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 and solution reproduced as published; topic and difficulty added by this site.