Acta Informatica

, Volume 23, Issue 2, pp 119–125

An incremental primal sieve

  • S. A. Bengelloun
Article

DOI: 10.1007/BF00289493

Cite this article as:
Bengelloun, S.A. Acta Informatica (1986) 23: 119. doi:10.1007/BF00289493

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.

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • S. A. Bengelloun
    • 1
  1. 1.Dept. of Mathematics and Computer Science, Faculty of ScienceMohammad V UniversityRabatMorocco