Maths Olympiad Prep

Library / /46 of 48

Combinatorics Difficulty 7.3 National olympiad, round 2 Prove it Greece

Let ABΓAB\Gamma be an equilateral triangle of side kk cm. We divide ABΓAB\Gamma with parallel lines into k2k^2 small equilateral triangles of side 11 cm. In this way, we create a grid (see figure for k=7k=7). Inside every small triangle we put exactly one positive integer from 11 to k2k^2, so that there are not two triangles with the same number. With vertices the points of the grid, we define regular hexagons of side 11 cm. We call the value of a hexagon the sum of the numbers of its 6 small triangles. Find, as a function of kk, the greatest possible value of the sum of the values of all hexagons.

Figure 1
Figure 2

Solution

The small triangles are divided in four categories.

1st category: They have one vertex AA or BB or Γ\Gamma.

These are not members of any hexagon and so their numbers do not take part in the final sum of values of all hexagons.

2nd category: Contains small triangles which belong only to one hexagon. On every side of ABΓAB\Gamma there exist k2k-2 such triangles and so totally we have 3(k2)+3=3k33(k-2)+3 = 3k-3 in this category.

3rd category: Contains small triangles which belong exactly to two hexagons. On every side of ABΓAB\Gamma there are k3k-3 such triangles and so there are totally 3(k3)3(k-3) triangles in this category.

Note that for the computation of the final sums we must take into account that we will sum two times the numbers of the triangles of the second category.

4th category: Contains small triangles which belong exactly to three hexagons. These triangles are inside the triangle ΔEZ\Delta EZ, see figure. These triangles are totally (k3)2(k-3)^2.

In order to obtain the greatest possible sum, we have to put as many as possible big numbers into triangles of higher category (then they will be counted more times). According to this reasoning we must put:

Figure 3

(1) The numbers of the set A={1,2,3}A = \{1, 2, 3\} into the triangles of the first category.

(2) The numbers of the set B={4,5,6,,3k}B = \{4, 5, 6, \dots, 3k\} into 3k33k-3 triangles of the second category, with partial sum
SB=4+5+6++3k=4+3k2(3k3)=(3k3)(3k+4)2. S_B = 4 + 5 + 6 + \dots + 3k = \frac{4+3k}{2}(3k-3) = \frac{(3k-3)(3k+4)}{2}.

(3) The numbers of the set Γ={(3k+1),(3k+2),,(6k9)}\Gamma = \{(3k+1), (3k+2), \dots, (6k-9)\} into 3k93k-9 triangles of the third category, with partial sum:
SΓ=(3k+1)+(3k+2)++(6k9)=(3k+1)+(6k9)2(3k9). S_{\Gamma} = (3k+1) + (3k+2) + \dots + (6k-9) = \frac{(3k+1) + (6k-9)}{2} (3k-9).

(4) The numbers of the set Δ={(6k8),(6k7),,k2}\Delta = \{(6k-8), (6k-7), \dots, k^2\} into k26k+9k^2-6k+9 triangles of the fourth category, with partial sum:
SΔ=(6k8)+(6k7)++k2=k2+6k82(k26k+9). S_{\Delta} = (6k-8) + (6k-7) + \dots + k^2 = \frac{k^2 + 6k - 8}{2} (k^2 - 6k + 9).

Hence the greatest possible sum of values is:
Smax=SA+SB+2SΓ+3SΔ=3(k414k2+33k24)2. S_{\max} = S_A + S_B + 2S_{\Gamma} + 3S_{\Delta} = \frac{3(k^4 - 14k^2 + 33k - 24)}{2}.

Let now γ\gamma be a member of the set Γ\Gamma and δ\delta a member of the set Δ\Delta. Then in the final sum SmaxS_{\max} there exists the summand 2γ+3δ2\gamma+3\delta. In the case of interchange of the position of the members of the sets Γ\Gamma and Δ\Delta, then in the final sum SmaxS_{\max} we will have the summand 2δ+3γ2\delta+3\gamma. Since γ<δ\gamma < \delta and 2<32 < 3, it follows that 2δ+3γ<2γ+3δ2\delta+3\gamma < 2\gamma+3\delta. Hence the sum we have found is the maximal.

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.