Type: Article
Publication Date: 2008-10-13
Citations: 1
DOI: https://doi.org/10.2174/1874117700801010025
For positive integers n, let µ(n) be the Möbius function, and M (n) its sum M (n) = P n k=1 µ(k).We find some identities and recursive formulas for computing M (n); in particular, we present a two-parametric family of recursive formulas.
Action | Title | Year | Authors |
---|---|---|---|
+ PDF Chat | Computations of the Mertens function and improved bounds on the Mertens conjecture | 2017 |
Gregory B. Hurst |