Three coloured unit disks are placed so that they have a common (3-way) intersection, but none of the disks covers the intersection of the other two disks. What is the minimum radius of the disk that would cover all intersections at once, in all cases?
Scroll down for a solution to this problem.
The minimal black radius is 2/√3.
A proof by Marshall W. Buck using inversion can be found here.