Mertens' theorem for arithmetic progressions

From MaRDI portal





Let \(k\) be an integer \(\ge 11\) and let \(\ell\) be an integer such that \(1\le \ell\le k\), \((\ell,k)=1\). An asymptotic formula (valid for large \(x)\) is obtained for the product \[ \prod_{\substack{p\le x \\ p\equiv \ell\pmod k}} (1-\tfrac1p), \] generalizing a classical result of Mertens.




Cited in
(29)








This page was built for publication: Mertens' theorem for arithmetic progressions

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