2000 character limit reached
From explicit estimates for the primes to explicit estimates for the Möbius function II
Published 12 Aug 2024 in math.NT | (2408.05969v2)
Abstract: We improve on all the results of [13] by incorporating the finite range computations performed since then by several authors. Thus we have \begin{align*} \Bigg|\sum_{n\le X}\mu(n)\Bigg| &\le \frac{0.006688\,X}{\log X},&&\text{for } X\ge 1\,798\,118, \\Bigg|\sum_{n\le X}\frac{\mu(n)}{n}\Bigg| & \le \frac{0.010032}{\log X},&& \text{for } X\ge 617\,990. \end{align*} We also improve on the method described in [13] by a simple remark.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.