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

 

<< PreviousWord BrowserNext >>
the lion sleeps tonight
ubenide
recess appointment
uss louisville (ssn 724)
people's democratic party of tajikistan
democratic awakening
general people's congress
people's assembly
hanukkah harry
steve mccabe
alliance for germany
patrick mercer
gillian merron
andrew miller (politician)
laura moffatt
lewis moonie
margaret moran
malcolm moss
tanglewood festival chorus
kali mountford
george mudie
german forum party
meg munn
denis murphy (uk politician)
andrew murrison
andrew mitchell
mark tami
peter tapsell (united kingdom)
dari taylor
david taylor (politician)
ian taylor
john mark taylor
association of free democrats
ered gorgoroth
clydebank
german social union
charlie (parrot)
macsbug
nikolai vavilov
george wendt
wei chen
new forum
hierophant
democracy now (east germany)