Explicit estimates: from Λ(n) in arithmetic progressions to Λ(n)/n

David J Platt, Olivier Ramaré

Research output: Contribution to journalArticle (Academic Journal)

3 Citations (Scopus)
242 Downloads (Pure)

Abstract

We denote by ψ(x; q, a) the sum of Λ(n)/n for all n≤x and congruent to a mod q and similarly by ψ(x; q, a) the sum of Λ(n) over the same set. We show that the error term in ψ(x; q, a) − (log x)/ϕ(q) − C(q, a) for a suitable constant C(q, a) can be controlled by that of ψ(y; q, a)−y/ϕ(q) for y of size x, up to a small error term. As a consequence, if a partial generalized Riemann hypothesis has been verified for the L-functions attached to characters modulo q up to height H, this error term is bounded by O(eH/8) when xH. Previous methods had at best O(1/H) instead. We further compute the asymptotics for the L2-average of a quantity closely related to C(q, a).
Original languageEnglish
Pages (from-to)77-92
Number of pages15
JournalExperimental Mathematics
Volume26
Issue number1
Early online date8 Jul 2016
DOIs
Publication statusPublished - 18 Jan 2017

Keywords

  • prime numbers in arithmetic progressions
  • explicit formulae
  • explicit estimates

Fingerprint Dive into the research topics of 'Explicit estimates: from Λ(<i>n</i>) in arithmetic progressions to Λ(<i>n)</i>/<i>n</i>'. Together they form a unique fingerprint.

  • Cite this