Mertens function
In number theory, the Mertens function is defined for all positive integers n as
where μ(k) is the Möbius function. The function is named in honour of Franz Mertens. This definition can be extended to positive real numbers as follows:
Less formally, M(x) is the count of square-free integers up to x that have an even number of prime factors, minus the count of those that have an odd number.
The first 143 M(n) is: (sequence in the OEIS)
The Mertens function slowly grows in positive and negative directions both on average and in peak value, oscillating in an apparently chaotic manner passing through zero when n has the values
Because the Möbius function only takes the values −1, 0, and +1, the Mertens function moves slowly and there is no x such that |M(x)| > x. The Mertens conjecture went further, stating that there would be no x where the absolute value of the Mertens function exceeds the square root of x. The Mertens conjecture was proven false in 1985 by Andrew Odlyzko and Herman te Riele. However, the Riemann hypothesis is equivalent to a weaker conjecture on the growth of M(x), namely M(x) = O(x1/2 + ε). Since high values for M(x) grow at least as fast as the square root of x, this puts a rather tight bound on its rate of growth. Here, O refers to Big O notation.
The true rate of growth of M(x) is not known. An unpublished conjecture of Steve Gonek states that
Probabilistic evidence towards this conjecture is given by Nathan Ng.
Using the Euler product one finds that
where is the Riemann zeta function and the product is taken over primes. Then, using this Dirichlet series with Perron's formula, one obtains:
...
Wikipedia