| advertise add site services publishers database health videos | ![]() | about toolbar stats live show health store more stuff JOIN/LOGIN |
Kidney Function Tests, Renal function Brisbane Australia brisbaneurology.com.au | Function of the Skin - Some of the Important Functions of your Skin skin-care-tips.org | DailyCare Biomedical-Products-Heart Function Care System-Heart Function... dcbiomed.com | the functions of the doshas,dosha,the composition of the doshas,DOSHAS... healthandyoga.com |
In number theory, the Mertens function is where μ(k) is the Möbius function. The function is named in honour of Franz Mertens. Less formally, M(n) is the count of square-free integers up to n that have an even number of prime factors, minus the count of those that have an odd number. M(n) = 0 for the n values
Because the Möbius function has only the values −1, 0, and +1, it is obvious that the Mertens function moves slowly and that there is no k such that |M(k)| > k. The Mertens conjecture went even further, stating that there would be no k where the absolute value of the Mertens function exceeds the square root of k. The Mertens conjecture was disproven in 1985. However, the Riemann hypothesis is equivalent to a weaker conjecture on the growth of M(k), namely
[edit] Representations[edit] As an integralUsing the Euler product one finds that where ζ(s) is the Riemann zeta function and the product is taken over primes. Then, using this Dirichlet series with Perron's formula, one obtains: where C is a closed curve encircling all of the roots of ζ(s). Conversely, one has the Mellin transform which holds for Re(s) > 1. A curious relation given by Mertens himself involving the second Chebyshev function is: A good evaluation, at least asymptotically, would be to obtain, by the method of steepest descent, an inequality: assuming that there are not multiple non-trivial roots of ζ(ρ) you have the "exact formula" by residue theorem: Weyl conjectured that Mertens function satisfied the approximate functional-differential equation where H(x) is the Heaviside step function, B are Bernoulli numbers and all derivatives with respect to t are evaluated at t = 0 Titchmarsh (1960) provided a Trace formula involving a sum over mobius function and zeros of Riemann Zeta in the form here 't' sums over the imaginary parts of nontrivial zeros, and (g, h) are related by a Fourier transform so [edit] As a sum over Farey sequencesAnother formula for the Mertens function is
This formula is used in the proof of the Franel–Landau theorem.[1] [edit] As a determinantM(n) is the determinant of the n × n Redheffer matrix, a (0,1) matrix in which aij is 1 if either j is 1 or i divides j. [edit] CalculationThe Mertens function has been computed for an increasing range of n.
[edit] Notes
[edit] References
|
| ↑ top of page ↑ | about thumbshots |