Computing the Mertens and Meissel–Mertens Constants for Sums over Arithmetic Progressions

DOI10.1080/10586458.2010.10390624zbMath1292.11140arXiv0906.2132OpenAlexW3101545390MaRDI QIDQ2911505

Alessandro Zaccagnini, Alessandro Languasco

Publication date: 31 August 2012

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.2132

zbMATH Keywords

arithmetic progressionsMertens constantsMertens-Meissel constants

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Evaluation of number-theoretic constants (11Y60)

Related Items (10)

Parity of the coefficients of modular forms ⋮ Sieve methods for odd perfect numbers ⋮ LARGE BIAS FOR INTEGERS WITH PRIME FACTORS IN ARITHMETIC PROGRESSIONS ⋮ Inequalities between sums over prime numbers in progressions ⋮ Values of the Euler 𝜙-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields ⋮ On Erdős and Sárközy's sequences with Property P ⋮ Unnamed Item ⋮ Euler’s function on products of primes in a fixed arithmetic progression ⋮ Accurate computations of Euler products over primes in arithmetic progressions ⋮ Quasiperfect numbers with the same exponent

Cites Work

• Unnamed Item
• Approximation of singular series and automata
• A note on Mertens' formula for arithmetic progressions
• On the constant in the Mertens product for arithmetic progressions. II: Numerical values

This page was built for publication: Computing the Mertens and Meissel–Mertens Constants for Sums over Arithmetic Progressions