Disk covering problem $r(16)$
The smallest value $r(16)$ such that $16$ disks of radius $r(16)$ can be arranged to cover the unit disk.
Lower bound:
Unknown
Upper bound:
${\approx}0.308$
Updates
-
2018
Upper bound: ${\approx}0.308$
Jeremy Tan in 2018
[via Circles Covering Circles, Erich Friedman]