Question 73
A regular hexagon $P R O F I T$ 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 $90\%$ of the hexagon's area?