Skip to content

Erdős problem 119

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/119.lean

Formal Conjectures

FormalConjectures/ErdosProblems/119.leanErdos119.erdos_119.parts.i1 lineExact file
True ↔ ∀ (z : ℕ → ℂ), (∀ (i : ℕ), ‖z i‖ = 1) → Filter.limsup (fun n => ↑(Erdos119.M z n)) Filter.atTop = ⊤
SolvedStatement only, no proof

Proof manifests naming this Problem

  • PLBY Lean proofsErdosProblems.Erdos119

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Continue

Search problems.science

Find a Problem, Result, source, or page