Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Counting sums of two squares: the Meissel-Lehmer method

Author: P. Shiu
Journal: Math. Comp. 47 (1986), 351-360
MSC: Primary 11Y35; Secondary 11N37, 11P05
MathSciNet review: 842141
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In 1870, E. D. F. Meissel developed a method for computing the individual values of the prime-counting function, and, in 1959, D. H. Lehmer simplified and extended Meissel's method. Let $ W(x)$ count the numbers not exceeding x that are sums of two squares. We develop a variant of the Meissel-Lehmer method for $ W(x)$ and use it to calculate $ W({10^{12}})$.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y35, 11N37, 11P05

Retrieve articles in all journals with MSC: 11Y35, 11N37, 11P05

Additional Information

Keywords: Meissel-Lehmer method, sums of two squares
Article copyright: © Copyright 1986 American Mathematical Society

American Mathematical Society