Recognition: unknown
Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
classification
🧮 math.NT
keywords
bmodconstantequivmeissel-mertensmertensarithmeticasymptoticby-product
read the original abstract
We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the asymptotic formula for $\sum\limits_{\substack{p\leq x p\equiv a \bmod{q}}}1/p$ and, as a by-product, for the Meissel-Mertens constant defined as $\sum_{p\equiv a \bmod{q}} (\log(1-1/p)+1/p)$, for $q \in \{3$, ..., $100\}$ and $(q, a) = 1$.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
A Complete Answer to Erd\H{o}s Problem 690
For every k ≥ 4 the map p to the natural density of integers whose k-th smallest prime divisor is p fails to be unimodal.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.