analysis / Analysis, Polynomials

Erdős Problem #119

For unit-modulus complex numbers $z_i$, let $p_n(z)=\prod_{i\le n}(z-z_i)$ and $M_n=\max_{|z|=1}|p_n(z)|$. Erdős's prize question: is there $c>0$ with $\sum_{k\le n} M_k > n^{1+c}$?

13Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

analysisJul 1, 2026Significance 13/100Registry: site confirmed

Erdős Problem #119

Prior state unknownproved

For unit-modulus complex numbers $z_i$, let $p_n(z)=\prod_{i\le n}(z-z_i)$ and $M_n=\max_{|z|=1}|p_n(z)|$. Erdős's prize question: is there $c>0$ with $\sum_{k\le n} M_k > n^{1+c}$?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

For unit-modulus complex numbers $z_i$, let $p_n(z)=\prod_{i\le n}(z-z_i)$ and $M_n=\max_{|z|=1}|p_n(z)|$. Erdős's prize question: is there $c>0$ with $\sum_{k\le n} M_k > n^{1+c}$?

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.

Erdős Problem #119 — Mathematical Frontier Network