paper

Picking up the partial sums of the Möbius function problem with probabilistic number theory

arXiv:2604.23517

Abstract

We revisit several hybrid multiplicative-to-additive type functions from a recent preprint article. These functions, with Dirichlet generating function (DGF) for where is the prime zeta function, with DGF , and with DGF . Each of these function variants are defined in terms of the additive (respectively, strongly additive) functions and . These two auxiliary functions are used in the prior manuscript to relate partial sums of the classical Möbius function, , to signed partial sums involving the prime counting function, , and the Liouville lambda function, . In this article, we explore summing the identities from the first manuscript using several probabilistic assumptions about the independence of the values of and for at large . We recover proofs of the limiting asymptotic growth of whose hypotheses promise to be substantially more attainable to make rigorous than past results from other authors relying on the Riemann Hypothesis or assumption of the linear independence of the simple, non-trivial zeros of .

Keywords and phrases: Möbius function; Mertens function; Liouville lambda function; prime omega function; Dirichlet inverse; probabilistic number theory; Erdós-Kac theorem

Picking up the partial sums of the Möbius function problem with probabilistic number theory · wovepaper