Consider an equilateral triangle of side length 12. Matthew cuts into smaller equilateral triangles, each of which has side length 1,3, or 8. Compute the minimum possible value of .
Solution
Matthew can cut into 16 equilateral triangles with side length 3. If he instead included a triangle of side 8, then let him include triangles of side length 3. He must include triangles of side length 1. Thus , giving that he includes at least 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.