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
Publication date: 17 February 2017
Abstract: An elementary recursive relation for Mbius function is introduced by two simple ways. With this recursive relation, can be calculated without directly knowing the factorization of the . are calculated recursively one by one. Based on these samples, the empirical probabilities of of taking , 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 could be seen as an independent random sequence when is large. The expectation and variance of the are and , 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 with a certain probability.
Full work available at URL: https://arxiv.org/abs/1608.04606
Recommendations
Arithmetic functions; related numbers; inversion formulas (11A25) Calculation of integer sequences (11Y55) Analytic computations (11Y35) Values of arithmetic functions; tables (11Y70)
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)