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.
比较改动
选两个分支看看改了什么,再发起 PR 把工作带过去。
选两个不同的分支
PR 可以从任何一个分支合入任何另一个分支。
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.
选两个分支看看改了什么,再发起 PR 把工作带过去。
PR 可以从任何一个分支合入任何另一个分支。