Maths Olympiad Prep

Library / /125 of 348

Geometry Difficulty 4.8 AIME Find the answer

Consider an equilateral triangle TT of side length 12. Matthew cuts TT into NN smaller equilateral triangles, each of which has side length 1,3, or 8. Compute the minimum possible value of NN.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Matthew can cut TT into 16 equilateral triangles with side length 3. If he instead included a triangle of side 8, then let him include aa triangles of side length 3. He must include 1228232a=809a12^{2}-8^{2}-3^{2} a=80-9 a triangles of side length 1. Thus a8a \leq 8, giving that he includes at least (809a)+(a)+1=818a17(80-9 a)+(a)+1=81-8 a \geq 17 total triangles, so 16 is minimal.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.