The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012
- 161 Downloads
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.
KeywordsComputation Time Computational Mathematic Actual Computation Arithmetic Progression Algorithmic Form
Unable to display preview. Download preview PDF.
- 1.D. E. Knuth,The Art of Computer Programming Vol. IISeminumerical Algorithms, Addison Wesley, Reading, Mass. (1971).Google Scholar