HMMT 2019 U8
- Guts
- Answer
A regular hexagon has area 1. Every minute, greedy George places the largest possible equilateral triangle that does not overlap with other already-placed triangles in the hexagon, with ties broken arbitrarily. How many triangles would George need to cover at least of the hexagon's area?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
46
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.