benchmarks.wiki / Public workspace

Omni-MATH / A regular hexagon PROFIT has area 1. Every minute, greedy George places the…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

A regular hexagon PROFIT 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%90 \% of the hexagon's area?
Plain-text mathematical notation (without MathML)
A regular hexagon PROFIT 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?
Original LaTeX notation
A regular hexagon PROFIT 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?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import