Join
Lebesgue's universal covering problem
Find the least area of a convex shape that covers every planar set of diameter 1, now known to lie between 0.832 and 0.8440936.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.