It is called Eratosthenes' Sieve. Here is a brief illustration of it:
First, make a sequential list of the numbers you wish to check, starting with 1.
1 2 3 4 5 6 7 8 9 10
Ignore 1 and move to 2. Cross off every second number after 2.
1 2 3 4 5 6 7 8 9 10
Move to the next number which is not crossed off - in this case, 3. Cross off every third number after 3.
1 2 3 4 5 6 7 8 9 10
Continue with each number that is not crossed off. The numbers that remain are the prime numbers.
Chat with our AI personalities
One method for finding prime numbers is called the "Sieve of Eratosthenes" because it basically "sifts" through the numbers looking for numbers that are not not prime.
Eratosthenes created a sieve that will do that.
Prime numbers are not invented.
Eratosthenes lived between 276 and 194 B.C. He didn't discover prime numbers; he devised a simple way to determine what numbers are prime in a given range.
One