A recursive relation and some statistical properties for Möbius function

From MaRDI portal
Publication:2960928

zbMATH Open1397.11011arXiv1608.04606MaRDI QIDQ2960928FDOQ2960928


Authors: Rong Qiang Wei Edit this on Wikidata


Publication date: 17 February 2017

Abstract: An elementary recursive relation for Mddotmathrmobius function mu(n) is introduced by two simple ways. With this recursive relation, mu(n) can be calculated without directly knowing the factorization of the n. mu(1)simmu(2imes107) are calculated recursively one by one. Based on these 2imes107 samples, the empirical probabilities of mu(n) of taking 1, 0, and 1 in classic statistics are calculated and compared with the theoretical probabilities in number theory. The numerical consistency between these two kinds of probability show that mu(n) could be seen as an independent random sequence when n is large. The expectation and variance of the mu(n) are 0 and 6n/pi2, respectively. Furthermore, we show that any conjecture of the Mertens type is false in probability sense, and present an upper bound for cumulative sums of mu(n) with a certain probability.


Full work available at URL: https://arxiv.org/abs/1608.04606




Recommendations





Cited In (3)





This page was built for publication: A recursive relation and some statistical properties for Möbius function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960928)