Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
From MaRDI portal
Publication:3318858
DOI10.2307/2007579zbMath0535.10043OpenAlexW4245258307MaRDI QIDQ3318858
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2007579
Chebyshev functionsprime number theorem for arithmetic progressionsexplicit numerical estimateslocation of zeros of Dirichlet L-functions
Related Items
An explicit density estimate for Dirichlet $L$-series ⋮ Explicit zero density for the Riemann zeta function ⋮ Explicit short intervals for primes in arithmetic progressions on GRH ⋮ An improved upper bound for the argument of the Riemann zeta-function on the critical line ⋮ Numerical Computations Concerning the ERH ⋮ Values of the Euler 𝜙-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields ⋮ An explicit result for \(|L(1+it,\chi)|\) ⋮ Short effective intervals containing primes in arithmetic progressions and the seven cubes problem ⋮ An improved upper bound for the error in the zero-counting formulae for Dirichlet $L$-functions and Dedekind zeta-functions ⋮ On the explicit upper and lower bounds for the number of zeros of the Selberg class ⋮ Euler’s function on products of primes in a fixed arithmetic progression ⋮ An effective seven cube theorem ⋮ Explicit zero density theorems for Dedekind zeta functions ⋮ Medium-sized values for the prime number theorem for primes in arithmetic progressions ⋮ Counting zeros of Dirichlet $L$-functions ⋮ Bertrand's postulate for primes in arithmetical progressions ⋮ Landau and Ramanujan approximations for divisor sums and coefficients of cusp forms ⋮ Counting zeros of Dedekind zeta functions ⋮ Primes in arithmetic progressions ⋮ Every odd number greater than $1$ is the sum of at most five primes ⋮ EXPLICIT ZERO-COUNTING THEOREM FOR HECKE–LANDAU ZETA-FUNCTIONS
This page was built for publication: Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
