What is the smallest such that three disks of radius can completely cover up a unit disk?
Solution
Look at the circumference of the unit disk. Each of the disks must be capable of covering up at least of the circumference, which means it must be able to cover a chord of length . Thus, is a lower bound for . This bound is achievable: place the three centers of the disks symmetrically at a distance of from the center of the unit disk.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.