arXiv Analytics

Sign in

arXiv:2003.01925 [math.NT]AbstractReferencesReviewsResources

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

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

Published 2020-03-04Version 1

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.

Categories: math.NT
Related articles: Most relevant | Search more
arXiv:1809.06158 [math.NT] (Published 2018-09-17)
Generalized Riemann Hypothesis, Time Series and Normal Distributions
arXiv:2105.06821 [math.NT] (Published 2021-05-14, updated 2021-05-27)
Atkinson's formula for the mean square of $ζ(s)$ with an explicit error term
arXiv:2303.09510 [math.NT] (Published 2023-03-16)
The Generalized Riemann Hypothesis from zeros of the zeta function

Links

Toolbox