Maths Olympiad Prep

Library / /2 of 4

Geometry Difficulty 6.0 National olympiad Prove it Bulgaria

Find the least number mm for which any five equilateral triangles with combined area mm can cover an equilateral triangle of area 11.

Solution

We prove that m=2m = 2. First we show that m2m \ge 2. It suffices for any s(0,1)s \in (0,1) to find five equilateral triangles with combined area greater than 2s2s, which can not cover an equilateral triangle ABC=Δ\triangle ABC = \Delta of area 11. Let A1B1C1A_1B_1C_1 be an equilateral triangle of area (1+s)/2(1+s)/2 and vertices on the corresponding sides of Δ\Delta. Without loss of generality suppose 2BA1BC2BA_1 \le BC. Then there exist three equilateral triangles that can not cover any of the segments BA1BA_1, CB1CB_1 and AC1AC_1. Then these triangles and two equilateral triangles Δ1\Delta_1 and Δ2\Delta_2 of areas ss can not cover Δ\Delta. Otherwise Δ1\Delta_1 and Δ2\Delta_2 cover points from the given three segments and therefore one of them, say Δ1\Delta_1, covers points from two of them, say DA1BD \in A_1B and EB1CE \in B_1C. Since SA1B1C113S_{A_1B_1C_1} \ge \frac{1}{3}, we have that ≰A1B1C90\not\le A_1B_1C \ge 90^\circ (prove!) implying that the side of Δ1\Delta_1 is at least DEA1B1DE \ge A_1B_1. Therefore SΔ1SA1B1C1S_{\Delta_1} \ge S_{A_1B_1C_1}, a contradiction.

We prove now that given five equilateral triangles of areas a2,b2,c2,d2a^2, b^2, c^2, d^2 and e2e^2, such that a2+b2+c2+d2+e2=2a^2 + b^2 + c^2 + d^2 + e^2 = 2, there exist four of them that cover Δ\Delta. Let abcde>0a \ge b \ge c \ge d \ge e > 0. If a1a \ge 1 then triangle of area a2a^2 covers Δ\Delta. In the opposite case b+c>1b+c>1. This is obvious when c>1/2c > 1/2 (because bcb \ge c), and otherwise
b2=2a2c2d2e2>13c2(1c)2. b^2 = 2 - a^2 - c^2 - d^2 - e^2 > 1 - 3c^2 \ge (1-c)^2.
Therefore the triangles with areas a2,b2a^2, b^2 and c2c^2, cut from the vertices of Δ\Delta intersect each other. They do not cover Δ\Delta if f=2abc>0f = 2 - a - b - c > 0 and an equilateral triangle of area f2f^2 is not covered. We have to prove that dfd \ge f. This is obvious when d>1/2d > 1/2 (because a,b,cda, b, c \ge d), otherwise it follows from a,b,c<1a, b, c < 1 that
d2d2d2+e2=2a2b2c2>2abc=f. d \ge 2d^2 \ge d^2 + e^2 = 2 - a^2 - b^2 - c^2 > 2 - a - b - c = f.

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.