Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. The answer to Problem 519 is yes, with some absolute constant . A. Biró, An improved estimate in a power sum problem of Turán, Indag. Math. (N.S.) 11 (2000), no. 3, 343--358, doi:10.1016/S0019-3577(00)80003-8, digested on its library card, proves in its Theorem (statement page) that there is an effectively computable absolute constant such that for complex with ,
The paper computes no value of and says that the steps of the proof would allow one (p. 344); it argues by contradiction from the assumption that each of the first power sums has modulus at most , for a slightly above , examining when near-equality could hold in the argument of Biró 1994. The result is a further full proof of the question's statement, strengthening the earlier constants. The proof is not reconstructed in this repository.
Acceptance. Refereed: the paper appeared in Indagationes Mathematicae, a refereed journal, communicated at the meeting of 27 March 2000; the issue head is dated 25 September 2000, which is this page's date. Reviewed: the site's curator, Thomas Bloom, labels the problem PROVED (LEAN) and names this paper as the improvement to an absolute constant above on erdosproblems.com/519 (page last edited 1 February 2026). No independent review is recorded in this repository and none is claimed.
Depends on. Nothing in this wiki: the argument is the paper's own.