Exact formulas for partial sums of the M\"obius function expressed by partial sums weighted by the Liouville lambda function

Abstract

The Mertens function, M(x) := Σn ≤ x μ(n), is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function g(n) := (ω+1)-1(n) is defined in terms of the shifted strongly additive function ω(n) that counts the number of distinct prime factors of n without multiplicity. The Dirichlet generating function (DGF) of g(n) is ζ(s)-1 (1+P(s))-1 for (s) > 1 where P(s) = Σp p-s is the prime zeta function. We study the distribution of the unsigned functions |g(n)| with DGF ζ(2s)-1(1-P(s))-1 and C(n) with DGF (1-P(s))-1 for (s) > 1. We establish formulas for the average order and variance of C(n) and prove a central limit theorem for the distribution of its values on the integers n ≤ x as x → ∞. Discrete convolutions of the partial sums of g(n) with the prime counting function provide new exact formulas for M(x).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…