arXiv · 2003.01925
Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis
Abstract
We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.
Explore related subjects
Keep this discovery
Anne-Maria Ernvall-Hytönen, Neea Palojärvi. 2020-03-04. Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis. https://arxiv.org/abs/2003.01925
Cite the original work for its findings. Save a collection to share your selection of sources.