Changes

The '''Sieve of Eratosthenes''' is a simple [[algorithm]] for identifying all prime numbers up to a certain integer. It was discovered by the ancient [[Greek]] [[mathematician]] [[Eratosthenes]].   

The '''Sieve of Eratosthenes''' is a simple [[algorithm]] for identifying all [[prime number]]s up to a certain integer. It was discovered by the ancient [[Greek]] [[mathematician]] [[Eratosthenes]].   

The [[algorithm]] is as follows:

The [[algorithm]] is as follows:

# Continue this process until all multiples have been checked for primality.

# Continue this process until all multiples have been checked for primality.

# the unstriked numbers are all the [[prime]]s on the original list.

# the unstriked numbers are all the [[prime]]s on the original list.

 

[[Category:Prime Numbers]]

[[Category:Number Theory]]