Euler constants from primes in arithmetic progression

From MaRDI portal





The Euler constant for the arithmetic progression \(a\pmod d\) with \(a\) and \(d\) coprime is \N\[\N\gamma(d,a)=\lim_{s\to 1^+} \left(\frac{\zeta_{d,a}(s)}{\zeta_{d,a}(s)}+\frac{1}{\phi(d)(s-1)}\right),\N\]\Nwhere \N\[\N\zeta_{d,a}(s)=\prod_{p\equiv a\pmod d} \frac{1}{1-p^{-s}}.\N\]\NThis constant is also equal to \N\[\N\gamma(d,a)=\lim_{x\to\infty}\left(\frac{\log x}{\phi(d)}-\sum_{\substack{p\le x \\\Np\equiv a \pmod d}} \frac{\log p}{p-1}\right).\N\]\NThe above formula is not very useful to compute \(\gamma(d,a)\) because of the slow convergence of the right--hand side. The authors main theorem is Theorem 1 stating that \N\[\N\gamma(d,a)=\gamma_1(d,a)-\sum_{p\equiv a\pmod d} \frac{\log p}{p(p-1)}+\sum_{n\equiv a\pmod d} \frac{(1+\mu(n))\Lambda(n)}{n},\N\]\Nwhere\N\[\N\gamma_1(d,a)=\frac{1}{\phi(d)}\left(\gamma+\sum_{p\mid d} \frac{\log p}{p-1}+\sum_{\chi\ne \chi_0} {\overline{\chi(a)}} \frac{L'}{L}(1,\chi)\right),\N\]\Nwhere \(\chi\) runs over the non-principal characters modulo \(d\) and \(L(s,\chi)=\sum_{n\ge 1} \chi(n)n^{-s}\) is the associated Dirichlet \(L\)-function. The paper also contains some sections dealing with the particular cases \(a=1\), \(d=3,~d=4,~d=5,~d=7,~d=8,~d=9,~d=12\) together with an algorithm to compute \(\gamma(d,a)\) in the general case.



Cites work









This page was built for publication: Euler constants from primes in arithmetic progression

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