benchmarks.wiki / Public workspace

Omni-MATH / What is the smallest number of regular hexagons of side length 1 needed to…

Problem

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

problem

What is the smallest number of regular hexagons of side length 1 needed to completely cover a disc of radius 1 ?

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