Difference between revisions of "Sieve of Eratosthenes"
| Line 1: | Line 1: | ||
The Sieve of Eratosthenes is a simple method to quickly uncover a short list of primes. Begin by writing consecutive numbers, presumably in a rectangle (with each row wrapping over). Now, cross out every other number (multiples of two). Keep crossing out successive numbers and the numbers remaining are prime! | The Sieve of Eratosthenes is a simple method to quickly uncover a short list of primes. Begin by writing consecutive numbers, presumably in a rectangle (with each row wrapping over). Now, cross out every other number (multiples of two). Keep crossing out successive numbers and the numbers remaining are prime! | ||
| + | ===Related Links=== | ||
| + | [http://www.math.utah.edu/~pa/Eratosthenes.html Website with good visual example] | ||
Revision as of 15:23, 19 June 2006
The Sieve of Eratosthenes is a simple method to quickly uncover a short list of primes. Begin by writing consecutive numbers, presumably in a rectangle (with each row wrapping over). Now, cross out every other number (multiples of two). Keep crossing out successive numbers and the numbers remaining are prime!
