Computing 𝜋(𝑥): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method

Deleglise, M.; Rivat, J.

doi:10.1090/S0025-5718-96-00674-6

Computing $\pi (x)$: the Meissel, Lehmer, Lagarias, Miller, Odlyzko method
HTML articles powered by AMS MathViewer

by M. Deleglise and J. Rivat PDF

Math. Comp. 65 (1996), 235-245 Request permission

Abstract:

Let $\pi (x)$ denote the number of primes $\le x$. Our aim in this paper is to present some refinements of a combinatorial method for computing single values of $\pi (x)$, initiated by the German astronomer Meissel in 1870, extended and simplified by Lehmer in 1959, and improved in 1985 by Lagarias, Miller and Odlyzko. We show that it is possible to compute $\pi (x)$ in $O(\frac {x^{2/3}} {\log ^2x})$ time and $O(x^{1/3}\log ^3x\log \log x)$ space. The algorithm has been implemented and used to compute $\pi (10^{18})$.

References

Jan Bohman, On the number of primes less than a given limit, Nordisk Tidskr. Informationsbehandling (BIT) 12 (1972), 576–578. MR 321890, DOI 10.1007/bf01932967
J. C. Lagarias, V. S. Miller, and A. M. Odlyzko, Computing $\pi (x)$: the Meissel-Lehmer method, Math. Comp. 44 (1985), no. 170, 537–560. MR 777285, DOI 10.1090/S0025-5718-1985-0777285-5
J. C. Lagarias and A. M. Odlyzko, Computing $\pi (x)$: an analytic method, J. Algorithms 8 (1987), no. 2, 173–191. MR 890871, DOI 10.1016/0196-6774(87)90037-X
E. D. F. Meissel, Über die Bestimmung der Primzahlenmenge innerhalb gegebener Grenzen, Math. Ann. 2 (1870), 636–642.
—, Berechnung der Menge von Primzahlen, welche innerhalb der ersten hundert Millionen natürlicher Zahlen vorkommen, Math. Ann. 3 (1871), 523–525.
—, Über Primzahlenmengen, Math. Ann. 21 (1883), 304.
—, Berechnung der Menge von Primzahlen, welche innerhalb der ersten Milliarde natürlicher Zahlen vorkommen, Math. Ann. 25 (1885), 289–292.