Acta Informatica

, Volume 17, Issue 4, pp 477–485

Explaining the wheel sieve

  • Paul Pritchard

DOI: 10.1007/BF00264164

Cite this article as:
Pritchard, P. Acta Informatica (1982) 17: 477. doi:10.1007/BF00264164


In a previous paper, an algorithm was presented for the classical problem of finding all prime numbers up to a given limit. The algorithm was derived therein by transforming a prior algorithm in accordance with some essentially ad hoc observations on the problem.

The present paper complements the former by developing a simple mathematical framework, which leads to a smoother and more insightful derivation of the new algorithm, and which may be of independent interest to the number theorist.

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • Paul Pritchard
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations