Skip to content

Erdős problem 119

For unit-modulus complex numbers ziz_i, let pn(z)=∏i≤n(z−zi)p_n(z)=\prod_{i\le n}(z-z_i) and Mn=max⁡∣z∣=1∣pn(z)∣M_n=\max_{|z|=1}|p_n(z)|. Erdős's prize question: is there c>0c>0 with ∑k≤nMk>n1+c\sum_{k\le n} M_k > n^{1+c}?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:85f9f9061e0961d7bc2757c2258c1a3f10bf9c012e863b8b7605df17ff8d0985
Metadata
sha256:a4523cac74a4566fa4894a2e4d6587ca8c52de4e5ad2284ab7889ecbdea2035c
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:c9950901cf41216bf1528ce65ca3a6b01577db47391a90fecdee368d89fd3439
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb