Sieve Of Eratosthenes

The algorithm that determines whether a number is prime. To determine whether n is prime, n is divided by all the primes less than , if none are factors then n is prime. There are more sophisticated sieves for prime numbers.

This method was developed by Eratosthenes around 230BC.

See also: Prime Numbers.