A formula for the exact number of primes below a given bound in any arithmetic progression
From MaRDI portal
Publication:4100160
DOI10.1017/S0004972700023017zbMath0333.10029OpenAlexW2115104453MaRDI QIDQ4100160
Publication date: 1977
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700023017
Related Items (2)
Zeros of Dirichlet \(L\)-functions near the real axis and Chebyshev's bias ⋮ The mean behavior of primes in arithmetic progressions.
Cites Work
This page was built for publication: A formula for the exact number of primes below a given bound in any arithmetic progression
