2000 character limit reached
Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis
Published 4 Mar 2020 in math.NT | (2003.01925v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.