Covering a disk with $3$ disks
The smallest radius such that $3$ disks of that radius can cover the unit disk, of radius 1.
Value: $\frac{\sqrt{3}}{2}$ (≈0.8660254) lower bound Literature upper bound Lean proof
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.
| Date | Bound | Discovery | Best evidence |
|---|---|---|---|
| undated | $\ge \frac{\sqrt{3}}{2}$ (≈0.8660254) |
Trivial or easy according to the secondary source.
[via Circles Covering Circles, Erich Friedman] |
Literature |
| undated | $\le \frac{\sqrt{3}}{2}$ (≈0.8660254) |
Trivial or easy according to the secondary source.
[via Circles Covering Circles, Erich Friedman] |
Lean proof
Certificate disk-covering-3-upper-sqrt3over2, submitted by daniel-munro, 2026-11-16 |