arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.07566math.NT
收藏

默滕斯函数的实际计算:\(M(10^{24})\) 和 \(M(10^{25})\)

Practical Computations of the Mertens Function: $M(10^{24})$ and $M(10^{25})$

Greg Hurst

AI总结:

本文计算默滕斯函数\(M(x)\)在\(x = 10^{24}\)和\(x = 10^{25}\)处的值,扩展了计算记录。介绍经典算法及依赖的筛法,给出渐近更快算法的优化实现,进行可重现计算和实现研究,方法选择取决于输入大小和硬件。

摘要:

默滕斯函数定义为\(M(x)=\sum_{n\leq x}\mu(n)\),其中\(\mu(n)\)是莫比乌斯函数。本文描述了用于在孤立值处计算\(M(x)\)的经典\(O(x^{2/3+\varepsilon})\)算法的实际实现,以及它所依赖的分段莫比乌斯和默滕斯筛法。利用该实现计算出\(M(10^{24}) = 7189337839\)和\(M(10^{25}) = -258560632948\),分别用时\(7.0\)天和\(34.6\)天,将之前\(M(10^{23})\)的记录扩展了两个数量级。还给出了渐近更快的Helfgott - Thompson算法的优化实现,运行速度比原始实现快约四倍。贡献在于可重现的计算和实现研究。

英文摘要:

The Mertens function is defined as $M(x)=\sum_{n\leq x}μ(n)$, where $μ(n)$ is the Möbius function. This paper describes a practical implementation of the classical $O(x^{2/3+\varepsilon})$ algorithm for computing $M(x)$ at isolated values, together with the segmented Möbius and Mertens sieve on which it relies. The implementation was used to compute $M(10^{24}) = 7189337839$ and $M(10^{25}) = -258560632948$, taking $7.0$ days and $34.6$ days, respectively. These computations extend the previous record of $M(10^{23})$ by two orders of magnitude. Run standalone, the segmented sieve computed all Mertens values through $10^{16}$ in approximately $7.4$ days, compared with the $7.5$-month runtime of the author's 2018 computation. In pursuit of the most practical isolated-value method, an optimized implementation of the asymptotically faster Helfgott-Thompson algorithm is also presented, running roughly four times faster than the original implementation. With both implementations optimized, the choice between methods depends on input size and hardware. The contribution is a reproducible computation and implementation study, rather than a new asymptotic algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑