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.
问题
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。
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.