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

preprint2022arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0