, Volume 23, Issue 2, pp 119-125

An incremental primal sieve

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Summary

A new algorithm is presented for finding all primes between 2 and an incrementally increasing value n. The algorithm executes in linear arithmetic time and space. An outline is given to show how previously developed techniques can be applied to improve the efficiency of the algorithm to O(n/loglogn) time and space.