About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Mathematics of Computation
Paper
Computing n(X) the meissel-lehmer method
Abstract
E. D. F. Meissel, a German astronomer, found in the 1870's a method for computing individual values of ir(x), the counting function for the number of primes $ x. His method was based on recurrences for partial sieving functions, and he used it to compute w(109). D. H. Lehmer simplified and extended Meissels method. We present further refinements of the Meissel-Lehmer method which incorporate some new sieving techniques. We give an asymptotic running time analysis of the resulting algorithm, showing that for every e0 it computes w(.x) using at most 0(x23 + l) arithmetic operations and using at most 0(x1/3 + F) storage locations on a Random Access Machine (RAM) using words of length [log2 x] + 1 bits. The algorithm can be further speeded up using parallel processors. We show that there is an algorithm which, when given M RAM parallel processors, computes w(x) in time at most 0(Mlx2/3 + F) using at most 0(x1/3 + f) storage locations on each parallel processor, provided M x1. A variant of the algorithm was implemented and used to compute ir(4 X 1016). © 1985 American Mathematical Society.