Calculating the Sieve of Eratosthenes

Authors:
Lambert Meertens
Affiliations:
Kestrel Institute, Palo Alto, CA, USA and Utrecht University, Utrecht, The Netherlands (email: lambert@kestrel.edu)
Venue:
Journal of Functional Programming
Year:
2004

Citing 3
Cited 1

A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Tabulation Techniques for Recursive Programs

ACM Computing Surveys (CSUR)
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture

The genuine sieve of eratosthenes

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Sieve of Eratosthenes is an efficient algorithm for computing the successive primes. Rendered informally, it is as follows: 1. Write down the successive “plurals”: 2, 3, 4, … 2. Repeat: (a) Take the first number that is not circled or crossed out. (b) Circle it. (c) Cross out its proper multiples. 3. What is left (i.e. the circled numbers) are the successive prime numbers.