#  A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z   

 Home

 Calculations
 Contacts
 Conversions
 Help
 Links
 Subjects


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.

Previous PageView links to and from this pageNext Page
Science & Engineering Encyclopaedia Version 2.4 © 2001-2010 Dirac Delta Consultants Limited