Summing \(\mu(n)\): a faster elementary algorithm
From MaRDI portal
Publication:2679114
DOI10.1007/s40993-022-00408-8OpenAlexW4311502130MaRDI QIDQ2679114
Lola Thompson, Harald Andrés Helfgott
Publication date: 19 January 2023
Published in: Research in Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.08773
Cites Work
- On the exact number of primes less than a given limit
- Integer multiplication in time \(O(n\log n)\)
- On Liouville's Function
- Disproof of the Mertens conjecture.
- Computing π(x): The Meissel-Lehmer Method
- Computing π(x): An analytic method
- Computing the Summation of the Möbius Function
- Computations of the Mertens function and improved bounds on the Mertens conjecture
- Computing $\pi (x)$ analytically
- An improved sieve of Eratosthenes
- The ternary Goldbach problem
- Deterministic methods to find primes
- Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Summing \(\mu(n)\): a faster elementary algorithm
