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

preprint2009arXivOpen access

Abstract

We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the asymptotic formula for ∑p≤xp≡amodq1/p\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 ∑p≡a mod q(log⁡(1−1/p)+1/p)\sum_{p\equiv a \bmod{q}} (\log(1-1/p)+1/p), for q∈{3q \in \{3, ..., 100}100\} and (q,a)=1(q, a) = 1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.