Computing π(x): The Meissel-Lehmer Method
From MaRDI portal
Publication:3677807
DOI10.2307/2007973zbMath0564.10006OpenAlexW4256082111MaRDI QIDQ3677807
Victor S. Miller, Jeffrey C. Lagarias, Andrew M. Odlyzko
Publication date: 1985
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2007973
tablescomplexityalgorithmcounting functionparallel processorscomputational number theorynumber of primes
Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Analytic computations (11Y35) Values of arithmetic functions; tables (11Y70)
Related Items
Counting primes in residue classes ⋮ Computing Dirichlet character sums to a power-full modulus ⋮ Summing \(\mu(n)\): a faster elementary algorithm ⋮ Physical mathematics in number theory ⋮ Computing 𝜋(𝑥): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method ⋮ Deterministic methods to find primes ⋮ Maximal product of primes whose sum is bounded ⋮ Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸ ⋮ Zeros of Dirichlet \(L\)-functions near the real axis and Chebyshev's bias ⋮ Computing $\pi (x)$ analytically ⋮ Computing prime harmonic sums ⋮ An improved analytic method for calculating \(\pi(x)\) ⋮ A new bound for the smallest $x$ with $\pi(x) > \mathrm{li}(x)$ ⋮ Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function ⋮ Computing 𝜓(𝑥) ⋮ A practical analytic method for calculating $\pi (x)$ ⋮ New results for witnesses of Robin’s criterion
