TOPICS
Search

Mertens Theorem


MertensTheorem

Consider the Euler product

 zeta(s)=product_(k=1)^infty1/(1-1/(p_k^s)),
(1)

where zeta(s) is the Riemann zeta function and p_k is the kth prime. zeta(1)=infty, but taking the finite product up to k=n, premultiplying by a factor 1/lnp_n, and letting n->infty gives

lim_(n->infty)1/(lnp_n)product_(k=1)^(n)1/(1-1/(p_k))=e^gamma
(2)
=1.781072...,
(3)

where gamma is the Euler-Mascheroni constant (Havil 2003, p. 173). This amazing result is known as the Mertens theorem.

At least for n<5.76×10^6, the sequence of finite products approaches e^gamma strictly from above (Rosser and Schoenfeld 1962). However, it is highly likely that the finite product is less than its limiting value for infinitely many values of n, which is usually the case for any such inequality due to the presence of zeros of zeta(s) on the critical line R[s]=1/2. An example is Littlewood's famous proof that the sense of the inequality pi(n)<lin, where pi(n) is the prime counting function and lin is the logarithmic integral, reverses infinitely often. While Rosser and Schoenfeld (1962) suggest that "perhaps one can extend [this] result to show that [the Mertens inequality] fails for large x; we have not investigated the matter," a full proof of the reversal of the inequality for terms in the Mertens theorem does not seem to appear anywhere in the published literature.

MertensTheoremPlus

A closely related result is obtained by noting that

 1+1/(p_k)=(1-1/(p_k^2))/(1-1/(p_k)).
(4)

Considering the variation of (3) with the + sign changed to a - sign and the lnp_n moved from the denominator to the numerator then gives

lim_(n->infty)lnp_nproduct_(k=1)^n1/(1+1/(p_k))=lim_(n->infty)lnp_nproduct_(k=1)^n(1/(1-1/(p_k^2)))/(1/(1-1/(p_k)))
(5)
=(product_(k=1)^infty1/(1-1/(p_k^2)))/(lim_(n->infty)1/(lnp_n)product_(k=1)^n1/(1-1/(p_k)))
(6)
=(zeta(2))/(e^gamma)
(7)
=(pi^2)/(6e^gamma)
(8)
=0.923563....
(9)

The sequence of finite products approaches its limiting value strictly from below for the same range as for the Mertens theorem, since this inequality from below is a consequence of the Mertens inequality from above.

Edwards (2001, pp. 5-6) remarks, "For the first 30 years after Riemann's [1859] paper was published, there was virtually no progress in the field [of prime number asymptotics]," adding as a footnote, "A major exception to this statement was Mertens's Theorem of 1874...." (The celebrated prime number theorem was not proved until 1896.)


See also

Euler Product, Infinite Product, Mertens Constant, Mertens' Second Theorem, Prime Number Theorem, Prime Products

Portions of this entry contributed by Jonathan Sondow (author's link)

Explore with Wolfram|Alpha

References

Edwards, H. M. Riemann's Zeta Function. New York: Dover, 2001.Hardy, G. H. and Wright, E. M. An Introduction to the Theory of Numbers, 5th ed. Oxford, England: Oxford University Press, p. 351, 1979.Havil, J. Gamma: Exploring Euler's Constant. Princeton, NJ: Princeton University Press, 2003.Mertens, F. "Ein Beitrag zur analytischen Zahlentheorie." J. reine angew. Math. 78, 46-62, 1874.Riesel, H. Prime Numbers and Computer Methods for Factorization, 2nd ed. Boston, MA: Birkhäuser, pp. 66-67, 1994.Rosser, J. B. and Schoenfeld, L. "Approximate Formulas for Some Functions of Prime Numbers." Ill. J. Math. 6, 64-94, 1962.

Referenced on Wolfram|Alpha

Mertens Theorem

Cite this as:

Sondow, Jonathan and Weisstein, Eric W. "Mertens Theorem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MertensTheorem.html

Subject classifications