Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Exact formulas for partial sums of the Möbius function expressed by partial sums weighted by the Liouville lambda function (2102.05842v8)

Published 11 Feb 2021 in math.NT

Abstract: The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1){-1}(n)$ is defined in terms of the shifted strongly additive function $\omega(n)$ that counts the number of distinct prime factors of $n$ without multiplicity. The Dirichlet generating function (DGF) of $g(n)$ is $\zeta(s){-1} (1+P(s)){-1}$ for $\Re(s) > 1$ where $P(s) = \sum_p p{-s}$ is the prime zeta function. We study the distribution of the unsigned functions $|g(n)|$ with DGF $\zeta(2s){-1}(1-P(s)){-1}$ and $C_{\Omega}(n)$ with DGF $(1-P(s)){-1}$ for $\Re(s) > 1$. We establish formulas for the average order and variance of $\log C_{\Omega}(n)$ and prove a central limit theorem for the distribution of its values on the integers $n \leq x$ as $x \rightarrow \infty$. Discrete convolutions of the partial sums of $g(n)$ with the prime counting function provide new exact formulas for $M(x)$.

Summary

We haven't generated a summary for this paper yet.