# Using Zeta Zeros to Compute the Mertens Function

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

The Mertens function, usually denoted by , is important in number theory. It is related to the famous unsolved Riemann hypothesis. The graph of is an irregular step function.

[more]
Contributed by: Robert Baillie (March 2011)

Open content licensed under CC BY-NC-SA

## Snapshots

## Details

Snapshot 1: the graphs of the step function and the formula using no zeta zeros

Snapshot 2: the graphs of and the formula using 40 pairs of zeta zeros

The Moebius mu function is defined to be 1 if ; it is if is the product of distinct primes and 0 otherwise (i.e., if is divisible by the square of a prime).

The Mertens function is defined to be the sum of for positive integers , .

In 1897, Mertens conjectured that for , is always between and . If the Mertens conjecture were true, then the Riemann hypothesis would be also have to be true. But in 1985, Odlyzko and te Riele [3] proved that the Mertens conjecture is false. This does not disprove the Riemann hypothesis, which remains one of the most important unsolved problems in mathematics.

Odlyzko and te Riele did not give a specific for which the Mertens conjecture is false. However, in 2006, Kotnik and te Riele [2] proved that there is some for which the Mertens conjecture is false. It is also known [2] that the Mertens conjecture is true for all .

This Demonstration uses the following formula to calculate :

,

where is the complex zero of the Riemann zeta function. For a proof, see [4].

The first sum runs over the first complex zeros of the zeta function.

These complex zeros occur in conjugate pairs: if is a zero, then so is .

If you use the slider to choose, say, one pair of zeta zeros, then the first sum in the above formula, in effect, combines two terms corresponding to the first conjugate pair of zeta zeros and . So, when these terms are added, their imaginary parts cancel while their real parts add. The applied to the first sum is simply an efficient way to combine the two terms for each pair of zeta zeros.

Notice that the second sum has the same form as the first, except that the second sum extends over the so-called "trivial" zeros of the zeta function, namely, . The second sum is small when is large. Notice that, without any zeta zeros being included (), this formula is close to when is large.

As we include more zeta zeros in the first sum, we more closely replicate the jumps in the step function , and we can do so for larger values of .

All known zeta zeros have multiplicity 1, which is assumed in the formula. At those values of where jumps from to , the formula converges to the midpoint, , as approaches infinity. You can see this in the graphs.

References:

[1] X. Gourdon, "The 10^13 First Zeros of the Riemann Zeta Function, and Zeros Computation at Very Large Height".

[2] T. Kotnik and H. J. J. te Riele, "The Mertens Conjecture Revisited," in *Lecture Notes in Computer Science* 4076, *Proceedings of the 7th Algorithmic Number Theory Symposium*, Berlin, 2006 pp. 156–167.

[3] A. M. Odlyzko and H. J. J. te Riele, "Disproof of the Mertens Conjecture," *J. reine angew. Math.* 357, 1985 pp. 138–160.

[4] E. C. Titchmarsh, *The Theory of the Riemann Zeta-Function*, Oxford: Clarendon Press, 1951 p. 318.

## Permanent Citation