The disk covering problem about finding the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to…
The disk covering problem about finding the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the unit disk.
Open the “Covering and packing” section on Wikipedia →
Source: List of unsolved problems in mathematics (CC BY-SA 4.0)