Euler constants from primes in arithmetic progression
Number Theory
2025-09-25 v2
Abstract
Many Dirichlet series of number theoretic interest can be written as a product of generating series , with ranging over all the primes in the primitive residue class modulo , and a function well-behaved around . In such a case the corresponding Euler constant can be expressed in terms of the Euler constants of the series involved and the (numerically more harmless) term . Here we systematically study , their numerical evaluation and discuss some examples.
Cite
@article{arxiv.2406.16547,
title = {Euler constants from primes in arithmetic progression},
author = {Alessandro Languasco and Pieter Moree},
journal= {arXiv preprint arXiv:2406.16547},
year = {2025}
}
Comments
22 pages, one table, one appendix; in the new version Remark 2 was inserted