, Volume 17, Issue 4, pp 477-485

Explaining the wheel sieve

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

A preliminary version of this paper was presented at the fourth Australian Computer Science Conference, Brisbane, 1981