Skip to main content
SpringerLink
Log in

The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The sieve of Eratosthenes, a well known tool for finding primes, is presented in several algorithmic forms. The algorithms are analyzed, with theoretical and actual computation times given. The authors use the sieve in a refined form (the “dual sieve”) to find the distribution of primes in twenty arithmetic progressions to 1012. Tables of values are included.

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

Access this article

Log in via an institution

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. D. E. Knuth,The Art of Computer Programming Vol. IISeminumerical Algorithms, Addison Wesley, Reading, Mass. (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of South Carolina, 29208, Columbia, S.C., USA

    Carter Bays & Richard H. Hudson

Authors
  1. Carter Bays
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard H. Hudson
    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

Bays, C., Hudson, R.H. The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012 . BIT 17, 121–127 (1977). https://doi.org/10.1007/BF01932283

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation