pith. machine review for the scientific record. sign in

arxiv: 0906.2132 · v1 · submitted 2009-06-11 · 🧮 math.NT

Recognition: unknown

Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions

Authors on Pith no claims yet
classification 🧮 math.NT
keywords bmodconstantequivmeissel-mertensmertensarithmeticasymptoticby-product
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Complete Answer to Erd\H{o}s Problem 690

    math.NT 2026-05 conditional novelty 8.0

    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.