Eratosthenes's sieve for prime numbers

Eratosthenes's sieve for prime numbers

A900/0143 Rights Managed

Request low-res file

530 pixels on longest edge, unwatermarked

Request/Download high-res file

Uncompressed file size: 79.9MB

Downloadable file size: 1.9MB

Price image Pricing

Please login to use the price calculator


Caption: Eratosthenes's sieve for prime numbers. Diagram showing a method for identifying prime numbers, described by the Ancient Greek mathematician Eratosthenes (276 BC-194 BC). The method involves eliminating all multiples of prime numbers as they are discovered. Here, the multiples of two, the first prime number, have already been eliminated, and the sieve has been applied to the set of odd numbers from 1 to 359. The next prime number, 3, is identified and its multiples eliminated (green lines). This leaves 5 as the next prime number, and its multplies are eliminated (pink). This is repeated for 7 (blue), 11 (orange), 13 (red) and 17 (purple). The remaining numbers are all prime numbers (eg. 19, 23 ... 353, 359), with 359 being the 72nd prime number.

Release details: Model release not required. Property release not required.

Keywords: 359, 72nd prime, algorithm, ancient greek, calculator, diagram, elimination, erastosthenes, eratosthenes, eratosthenes's, eratosthenes's sieve, grid, illustration, line, lines, mathematical, mathematics, maths, multiple, multiples, number, odd number, primality, prime number, program, sieve

Licence fees: A licence fee will be charged for any media (low or high resolution) used in your project.