Sieve of Eratosthenes
From Free net encyclopedia
In mathematics, the Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to a specified integer. It is the predecessor to the modern Sieve of Atkin, which is faster but more complex. It was created by Eratosthenes, an ancient Greek mathematician. Wheel factorization is often applied on the list of integers to be checked for primality, before Sieve of Eratosthenes is used, to increase the speed.
Algorithm
Image:Animation Sieb des Eratosthenes.gif
- Write a list of numbers from 2 to the largest number you want to test for primality. Call this List A. (This is the list on the left-hand-side of the picture.)
- Write the number 2, the first prime number, in another list for primes found. Call this List B. (This is the list on the right-hand-side of the picture.)
- Strike off 2 and all multiples of 2 from List A.
- The first remaining number in the list is a prime number. Write this number into List B.
- Strike off this number and all multiples of this number from List A. The crossing-off of multiples can be started at the square of the number, as lower multiples have already been crossed out in previous steps.
- Repeat steps 4 through 6 until no more numbers are left in List A.
References
Κοσκινον Ερατοσθενους or, The Sieve of Eratosthenes. Being an Account of His Method of Finding All the Prime Numbers, by the Rev. Samuel Horsley, F. R. S., Philosophical Transactions (1683-1775), Vol. 62. (1772), pp. 327-347.
For more advanced developments, see:
External links
- Interactive animation (JavaScript required)
- Sieve of Eratosthenes at cut-the-knotbg:Решето на Ератостен
cs:Eratosthenovo síto de:Sieb des Eratosthenes es:Criba de Eratóstenes fr:Crible d'Ératosthène it:Crivello di Eratostene he:הנפה של ארטוסתנס lt:Eratosteno rėtis nl:Zeef van Eratosthenes ja:エラトステネスの篩 pl:Sito Eratostenesa ru:Решето Эратосфена simple:Sieve of Eratosthenes sk:Eratostenovo sito sl:Eratostenovo sito fi:Eratostheneen seula sv:Eratosthenes såll zh:埃拉托斯特尼筛法