Euler constants from primes in arithmetic progression

Abstract

Many Dirichlet series of number theoretic interest can be written as a product of generating series ${\zeta }_{d,a}(s)=\prod _{p\equiv a(\mathrm{mod}d)}(1-p^{-s}{)}^{-1}$, with $p$ ranging over all the primes in the primitive residue class modulo $a(\mathrm{mod}d)$, and a function $H(s)$ well-behaved around $s=1$. In such a case the corresponding Euler constant can be expressed in terms of the Euler constants $\gamma (d,a)$ of the series ${\zeta }_{d,a}(s)$ involved and the (numerically more harmless) term $H^{\prime }(1)/H(1)$. Here we systematically study $\gamma (d,a)$, their numerical evaluation and discuss some examples.

22 pages, one table, one appendix; in the new version Remark 2 was inserted

References in corpus (7)

• Euler's constant: Euler's work and modern developments
• A fast algorithm to compute the Ramanujan-Deninger gamma-function and some number-theoretic applications
• On the constant in the Mertens product for arithmetic progressions. II. Numerical values
• Efficient computation of the Euler-Kronecker constants of prime cyclotomic fields
• Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
• On the constant in the Mertens product for arithmetic progressions. I. Identities
• Landau and Ramanujan approximations for divisor sums and coefficients of cusp forms