scientific article; zbMATH DE number 1146548
Let \(p\) be a prime number. In 1874 Mertens proved that \[ \sum_{p\leq x}{1\over p}= \log \log x+M +O\left( {1\over\log x} \right), \] where the constant \(M\) in fact is equal to \(\sum^\infty_{p=2} \left( \log \left(1-{1\over p} \right)+{1\over p} \right)\) (e.g. Hardy and Wright, sections 22.7 and 22.8). Actually Mertens computed the constant \(M\) (using an expression for it involving the \(\zeta\)-function) as \(.261497218\dots\). Eight years earlier, in 1866, independently, Meissel announced (without proof) that \[ \sum^\infty_{p=2}{1\over p}{1\over (\log p)^\alpha} ={1\over \alpha }+K, \] for \(\alpha\) ``very small, where \(K\) is the same constant as \(M\) (at least to 10 decimal places). The authors give an elementary proof (using partial summation) that these constants are in fact the same. They suggest \(M\) be called Meissel's constant. There is a misprint at the bottom of page 176, where ``\(f(x)\) should be ``\(f(n)\).
- On the remainder in a series of Mertens
- Outline of a scientific biography of Ernst Meissel (1826-1895)
- Estimates on the number of orbits of the Dyck shift
- Computing the Mertens and Meissel-Mertens constants for sums over arithmetic progressions
- Asymptotic expansions for 1/p_n and p_n/p_n
- Counting closed orbits in discrete dynamical systems
- Another proof on the existence of Mertens's constant
- Properties of the Beurling generalized primes
- Constant components of the Mertens function and its connections with Tschebyschef's theory for counting prime numbers. II
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386486)
