加入
Covering a polynomial lemniscate by discs
Show that the set where a monic polynomial has modulus at most 1 can be covered by discs whose radii sum to at most 2.
Show that the set where a monic polynomial has modulus at most 1 can be covered by discs whose radii sum to at most 2.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.