Turan's problem 10 revisited

Original · EN

In this paper we prove that inf|zₖ| ₌> ₁ maxᵥ₌₁,...,ₙ₂ |sumₖ₌₁ⁿ zₖᵛ| = sqrt n+O(n0.2625+epsilon). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of n+1 being a prime we have previously proved the much sharper result that the quantity lies in the interval [sqrt(n),sqrt(n+1)] The method of proof combines a general lower bound (of Andersson), explicit arithmetical constructions (of Montgomery, Fabrykowski or Andersson), moments (probabilistic methods) and estimates for the difference of consecutive primes (of Baker, Harman and Pintz). We also prove some (conditional and unconditional) related results.