Sieve of Eratosthenes


	To get all the primes up to a certain number (the largest number in the array), strike out the multiples of the primes less than These are the numbers taken out: 4, 6, 8, 10, … , 6, 9, 12, 15, … , 10, 15, 20, 25, … , 14, 21, 28, 35, … , and so on.


	Contributed by: George Beck

Sieve of Eratosthenes (Wolfram MathWorld)

"Sieve of Eratosthenes" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/SieveOfEratosthenes/

Contributed by: George Beck

Free Download: Mathematica Player--Runs all Demonstrations & more

Greek Mathematics
Number Theory
Prime Numbers
Recreational Mathematics
High School Finite Mathematics
High School Mathematics
Middle School Mathematics

Browse all topics

Relatively Prime Numbers and Zeta(2)
Prime Gaps
Distribution of Primes
Approximations to the Distribution of Primes
Second Hardy-Littlewood Conjecture
Prime Factorization Table
Lucky Numbers
Relative Primality
Levy's Conjecture
Dirichlet's Theorem

Email
Link to URL
Embed
Bookmark

Make a new version of this Demonstration
Upload a new Demonstration

Source page:

Name (optional)

Occupation (optional)

Organization (optional)

I use Mathematica:

often

occasionally

never

Country (optional)
Remember me

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »