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.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.