Advertisement

BIT Numerical Mathematics

, Volume 17, Issue 2, pp 121–127 | Cite as

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

  • Carter Bays
  • Richard H. Hudson
Article

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.

Keywords

Computation Time Computational Mathematic Actual Computation Arithmetic Progression Algorithmic Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. E. Knuth,The Art of Computer Programming Vol. IISeminumerical Algorithms, Addison Wesley, Reading, Mass. (1971).Google Scholar

Copyright information

© BIT Foundations 1977

Authors and Affiliations

  • Carter Bays
    • 1
  • Richard H. Hudson
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of South CarolinaColumbiaUSA

Personalised recommendations