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.
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
Eratosthenes' method of finding prime and composite number is called 'The Sieve of Eratosthene'.
It is called a sieve.
Eratosthenes
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.
The method of sieving the multiples of prime numbers until only the prime numbers remain, while attributed to Eratosthenes, is originally thought to have been the work of Nicomachus.
Eratosthenes created a sieve that will do that.
Eratosthenes, It says it is Eratosthenes.
Prime numbers are not invented.
The sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to any given limit.
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.
The algorithm for identifying prime numbers which is known as the Sieve of Eratosthenes has been accepted as accurate for thousands of years.
prime numbers