Skip to main content
Springer Nature Link
Log in

An incremental primal sieve

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley 1974

    Google Scholar 

  2. Bengelloun, S.A.: Balancing for Fixed Sequence Incremental Problems. (To be submitted for publication)

  3. Bengelloun, S.A.: An Incremental Evaluator. (In preparation)

  4. Bengelloun, S.A.: A New Variation on a Scheme of Eratosthenes. Technical Report, Dept. of Mathematics and Computer Science, Mahammad V University, Rabat, Morocco

  5. Friedman, D., Wise, D.: CONS Should Not Evaluate Its Arguments. In: Automata, Languages, and Programming, pp. 257–284. Edinburgh: University Press 1976

    Google Scholar 

  6. Gries, D., Misra, J.: A Linear Sieve Algorithm for Finding Prime Numbers. Commun. A. C. M. 21, 999–1003 (1978)

    Google Scholar 

  7. Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. New York: Oxford University Press 1960

    Google Scholar 

  8. Henderson, P., Morris, J. (Jr.): A Lazy Evaluator. In Third Annual Symposium on Principles of Programming Languages, pp. 95–103. Association for Computing Machinery 1976

  9. Mairson, H.G.: Some New Upper Bounds on the Generation of Prime Numbers. Commun. ACM 20, 664–669 (1977)

    Google Scholar 

  10. Monier, L.: Algorithmes de Factorisation d'Entiers. PhD Thesis, l'Universite Paris-Sud, Centre d'Orsay, 1980

  11. Pritchard, P.: A Sublinear Additive Sieve for Finding Prime Numbers. Commun. ACM 24, 18–23 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Computer Science, Faculty of Science, Mohammad V University, Rabat, Morocco

    S. A. Bengelloun

Authors
  1. S. A. Bengelloun
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bengelloun, S.A. An incremental primal sieve. Acta Informatica 23, 119–125 (1986). https://doi.org/10.1007/BF00289493

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289493

Keywords