Skip to published state

Erdős problem / erdos

no open offer

Problem 114

Exact records and bounded producer offers matched to this problem.

Matching finding records

1 records
  1. vf_8b0088e93e7f2825

    theoretical

    Erdős Problem #114 [status: falsifiable; formalized: no]. If p(z)C[z]p(z)\in\mathbb{C}[z] is a monic polynomial of degree nn then is the length of the curve {zC:p(z)=1}\{ z\in \mathbb{C} : \lvert p(z)\rvert=1\} maximised when p(z)=zn1p(z)=z^n-1? Current best: {/UL} Erd\H{o}s, Herzog, and Piranian [EHP58] also ask whether the length is at least 2π2\pi if {z:f(z)<1}\{ z: \lvert f(z)\rvert<1\} is connected (which znz^n shows is the best possible). Prize: $250. Tags: analysis, polynomials.

    recordedOpen record