Mertens' theorem for arithmetic progressions
From MaRDI portal
Publication:1845904
DOI10.1016/0022-314X(74)90032-8zbMath0286.10022OpenAlexW2033372322MaRDI QIDQ1845904
Publication date: 1974
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-314x(74)90032-8
Asymptotic results on arithmetic functions (11N37) Primes in congruence classes (11N13) Distribution of primes (11N05)
Related Items (19)
Distribution of root numbers of Hecke characters attached to some elliptic curves ⋮ Moments of the Hurwitz zeta function on the critical line ⋮ Prime Running Functions ⋮ Mertens’ theorem for Chebotarev sets ⋮ Distinguishing newforms by the prime divisors of their Fourier coefficients ⋮ Divisor sums representable as the sum of two squares ⋮ Integers without divisors from a fixed arithmetic progression ⋮ A note on Mertens' formula for arithmetic progressions ⋮ A generalization of a graph theory Mertens' theorem: Galois covering case ⋮ On the distribution of the order and index of \(g \pmod p\) over residue classes. II ⋮ The sum of unitary divisors of an integer in arithmetic progression. ⋮ Chebyshev’s bias for composite numbers with restricted prime divisors ⋮ Euler’s function on products of primes in a fixed arithmetic progression ⋮ Values of the Euler phi function not divisible by a given odd prime ⋮ ON THE DISTRIBUTION OF CYCLIC CUBIC FIELDS WITH INDEX 2 ⋮ Some estimates for the average of the error term of the Mertens product for arithmetic progressions ⋮ Accurate computations of Euler products over primes in arithmetic progressions ⋮ Sets whose differences avoid squares modulo 𝑚 ⋮ About a theorem of Paolo Codecà's and \(\Omega\)-estimates for arithmetical convolutions: Addendum
Cites Work
This page was built for publication: Mertens' theorem for arithmetic progressions
