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

From MaRDI portal
Publication:5070543




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.





Describes a project that uses

Uses Software





This page was built for publication: Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070543)