默比乌斯函数的一个确定的递归关系和一些统计性质
A definite recursive relation and some statistical properties for Möbius function
摘要:
通过两种简单的方法,给出了M $\ddot{\mathrm{o}}$ bius函数$μ(n)$的一个初等递归关系.利用该递归关系,可以在不直接知道$n$的因式分解的情况下计算$μ(n)$。逐个递归地计算$μ(1) \sim μ(2 \times 10^7) $。基于这些$2\times 10^7$样本,计算了经典统计中$μ(n)$取$-1$、0和1的经验概率,并与数论中的理论概率进行了比较.这两种概率在数值上的一致性表明,当$n$较大时,$μ(n)$可以看作是一个独立的随机序列. $μ(n)$的期望和方差分别为$0$和$6 n/ π^2$。此外,我们证明了Mertens类型的任何猜想在概率意义上都是假的,并以一定的概率给出了$μ(n)$累积和的上界。
英文摘要:
An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $μ(n)$ is introduced by two simple ways. With this recursive relation, $μ(n)$ can be calculated without directly knowing the factorization of the $n$. $μ(1) \sim μ(2 \times 10^7) $ are calculated recursively one by one. Based on these $2\times 10^7$ samples, the empirical probabilities of $μ(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 $μ(n)$ could be seen as an independent random sequence when $n$ is large. The expectation and variance of the $μ(n)$ are $0$ and $6 n/ π^2$, 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 $μ(n)$ with a certain probability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。