Study guides

☆

Q: What is the sieve of eratosthenes to find prime numbers less than 100?

Write your answer...

Submit

Still have questions?

Related questions

prime numbers

The Sieve did not invent prime numbers. It was used to find them.

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.

By finding all the factors of the numbers and see which one is the biggest # they have in common. Or look at the Sieve of Eratosthenes table at google.com and there you will find the answer.or by looking at a sieve of Eratosthenes and crossing out the factors of each number and seeing which two factors are the same but the highest out of them both.

A prime number is defined as one that is only divisible by itself or 1. So you can find out if its prime by testing that definition. To find small prime numbers use the Sieve of Eratosthenes, which is a simple method to compute primes. Large prime numbers have to be done by computers using other types of tests such as the Miller-Rabin primality test

You can extend it indefinitely, depending on your patience!

Sieve of eratothanes is a popular one.

it is a brute force way to find all the primes in a given range. Remove all the composites, and you are left with the primes

I would use the Sieve of Eratosthenes. Write out the numbers 1 to 100 in 10 rows. Cross out 1. Start at 2 and cross out multiples of 2. That will eliminate all the rest of the even numbers. Go to the next uncrossed-out number (3) and cross out all of its multiples. Some of them will already be crossed out. Proceed in this fashion. Five will be next. You can stop by the time you get to ten. All of the uncrossed-out numbers are prime.

Just go to a table of prime numbers, find the prime numbers, and add them.Just go to a table of prime numbers, find the prime numbers, and add them.Just go to a table of prime numbers, find the prime numbers, and add them.Just go to a table of prime numbers, find the prime numbers, and add them.

Prime numbers are used to find the LCM of numbers Prime numbers are used to find the HCF of numbers Prime numbers are used to simplify fractions Prime numbers are used to find the LCD of fractions

You can use a sieve to find all the primes numbers between 2 and any given number n.

People also asked