Erdős Problem a Daythe open tracker

Erdős Problem #973

OPEN LEANdatabase updated 2026-10-11

No proof or disproof is known, and it isn't known whether a finite computation could settle it. A solution has been formally verified in Lean, but no human reader has digested it yet — which is why the database doesn't call it solved.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

Does there exist a constant \(C>1\) such that, for every \(n\geq 2\), there exists a sequence \(z_i\in \mathbb{C}\) with \(z_1=1\) and \(\lvert z_i\rvert \geq 1\) for all \(1\leq i\leq n\) with \(\max_{2\leq k\leq n+1}\left\lvert \sum_{1\leq i\leq n}z_i^k\right\rvert < C^{-n}\)? This is Problem 7.3 in [Ha74], where it is attributed to Erdős. The answer is no, by Luo, Yang and Zhu [LYZ26] (and via the residual-polynomial method of Tan, Wang, Huang and Chen [TWHC26]): the maximum exceeds \(e^{-\lambda n}\) for every fixed \(\lambda>0\) once \(n\) is large, so it decays subexponentially and no such \(C\) exists. See `erdos_973.variants.luo_yang_zhu` below.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 4 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/973.
Prizenone
Topicsanalysis
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/973
WORKING REPORT BY THIS SITE · JUL 31, 2026

Read our working report →

The authoritative live page is OPEN but lists “1 claimed proof for this problem”—a full proof claimed by RayYoung, Keheng Zhu, and Yanping Luo, submitted 2026-07-15—so the mandatory no-duplication gat

SKIPPED