Maths Olympiad Prep

Library / /116 of 158

Combinatorics Difficulty 6.4 National Olympiad Prove it Estonia

An equilateral triangle with side length 33 is divided into 99 equilateral triangles with side length 11. An integer from 11 to 1010 is written into every point that is a vertex of a small triangle (colored vertices on the figure), such that all numbers are written exactly once. For every small triangle, the sum of the numbers in the three vertices is written inside it. Prove that there exist three small triangles such that the sum of the numbers inside them is at least 4848.

Figure 1

Solutions — 2

Solution 1

Any three small triangles, from which no two have common vertices, take up nine of the ten numbers written into the vertices of the small triangles. So, the sum of the numbers inside those small triangles is 55a55 - a, where aa is the number at the last vertex. Now it is sufficient to prove that we can choose the three small triangles, from which no two have common vertices, in four different ways, always leaving a different vertex out. So, in at least one case, the number at the last vertex is at most 77, and the sum of the numbers in the three chosen triangles is at least 557=4855 - 7 = 48.

Figure 2
Fig. 11
Figure 3
Fig. 12
Figure 4
Fig. 13
Figure 5
Fig. 14

Indeed, the three triangles can be chosen so that they leave uncovered the central number (Fig. 11) or one of the corner numbers (Fig. 12, 13, 14).

Solution 2

Let mm be the number in the center of the large triangle. Then, when adding the sums of the three corner triangles we get the sum of all the numbers from 11 to 1010, except mm, so the sum of the corner triangles is 55m55 - m. If m7m \le 7, then the sum is at least 4848.

In the rest of the cases, consider any three triangles around the center point, such that no two of them share a side. Adding the numbers in them, we get the sum of all the numbers from 11 to 1010, except the three numbers in the corners, while we add the center number three times. So the sum of those triangles is at least 21+3m21 + 3m. If m9m \ge 9, then the sum is at least 4848.

This leaves the case m=8m = 8. The sum of the numbers in the triangles in the corners is at least 558=4755 - 8 = 47, so at least one of them contains a sum that is at least 1616. If none of the triangles contains a sum 1717 or greater, the number 1616 must occur in two different triangles. The sum of the numbers in any three triangles around the center point, chosen like above, is at least 21+38=4521 + 3 \cdot 8 = 45. So, in both triples at least one of the triangles contains a sum of at least 1515, and since triangles sharing an edge cannot contain the same sum as the corresponding sums differ by exactly one term, at least one of the six triangles around the center point contains a sum of at least 1616. Thus we can pick the three desired triangles from among either one corner triangle and two central triangles or two corner triangle and one central triangle that contain the largest numbers.

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.