English

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

Number Theory 2022-07-19 v8

Abstract

The Mertens function, M(x):=nxμ(n)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):=(ω+1)1(n)g(n) := (\omega+1)^{-1}(n) is defined in terms of the shifted strongly additive function ω(n)\omega(n) that counts the number of distinct prime factors of nn without multiplicity. The Dirichlet generating function (DGF) of g(n)g(n) is ζ(s)1(1+P(s))1\zeta(s)^{-1} (1+P(s))^{-1} for (s)>1\Re(s) > 1 where P(s)=ppsP(s) = \sum_p p^{-s} is the prime zeta function. We study the distribution of the unsigned functions g(n)|g(n)| with DGF ζ(2s)1(1P(s))1\zeta(2s)^{-1}(1-P(s))^{-1} and CΩ(n)C_{\Omega}(n) with DGF (1P(s))1(1-P(s))^{-1} for (s)>1\Re(s) > 1. We establish formulas for the average order and variance of logCΩ(n)\log C_{\Omega}(n) and prove a central limit theorem for the distribution of its values on the integers nxn \leq x as xx \rightarrow \infty. Discrete convolutions of the partial sums of g(n)g(n) with the prime counting function provide new exact formulas for M(x)M(x).

Keywords

Cite

@article{arxiv.2102.05842,
  title  = {Exact formulas for partial sums of the M\"obius function expressed by partial sums weighted by the Liouville lambda function},
  author = {Maxie Dion Schmidt},
  journal= {arXiv preprint arXiv:2102.05842},
  year   = {2022}
}

Comments

M\"obius function; Mertens function; Liouville lambda function; prime omega function; Dirichlet inverse; prime zeta function; inversion of generalized convolutions

R2 v1 2026-06-23T23:03:33.188Z