A. Languasco, A. Zaccagnini
Published 2007-12-11Version 1
We give explicit numerical values with 100 decimal digits for the constant in the Mertens product over primes in the arithmetic progressions $a \bmod q$, for $q \in \{3$, ..., $100\}$ and $(a, q) = 1$.
Comments: The complete set of results can be downloaded from http://www.math.unipd.it/~languasc/MCcomput.html together with the source program in Gp and the results of the verifications of the consistency identities described in section 4
Journal: Math. Comp. 78 (2009), 315--326
Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
On the constant in the Mertens product for arithmetic progressions. I. Identities
Bounding sums of the Möbius function over arithmetic progressions
![QR code for arXiv:0712.1665 [math.NT]](http://oss.arxitics.com/images/favicon.svg)