Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis

Neea Palojärvi, Anne-Maria Ernvall-Hytönen*

*Corresponding author for this work

Research output: Working paperScientific

Abstract

We prove an explicit error term for the ψ(x,χ) function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.
Original languageEnglish
PublisherarXiv
Number of pages33
Publication statusPublished - 4 Mar 2020
MoE publication typeO2 Other

Keywords

  • Prime numbers
  • Arithmetic progressions
  • Explicit

Fingerprint Dive into the research topics of 'Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis'. Together they form a unique fingerprint.

Cite this