BIGpedia.com - Mertens function - Encyclopedia and Dictionary Online
encyclopedia search

Mertens function

In number theory, the Mertens function is

M(n) = \sum_{1\le k \le n} \mu(k)

where μ(k) is the Möbius function.

Because the Möbius function has only the return values -1, 0 and +1, it's obvious that the Mertens function moves slowly and that there is no x such that M(x) > x. The Mertens conjecture goes even further, stating that there is no x where the absolute value of the Mertens function exceeds the square root of x. The Mertens conjecture was disproven in 1985. However, the Riemann hypothesis is equivalent to a weaker conjecture on the growth of M(x), namely M(x) = o(x^{\frac12 + \epsilon}). Since high values for M grow at least as fast as the square root of x, this puts a rather tight bound on its rate of growth.

External links



The contents of this article are licensed from Wikipedia.org under the GNU Free Documentation License.
How to see transparent copy

01-04-2007 01:21:04