answersLogoWhite

0


Best Answer

To find prime numbers less than 100, the sieve of eratosthenes filters out 1 and all multiples of 2, 3, 5, and 7. All remaining numbers less than 100 are primes.

User Avatar

Wiki User

โˆ™ 2012-03-28 17:53:00
This answer is:
User Avatar
Study guides

What is the prime factorization of 24

What is the prime factorization of 54

What is the prime factorization of 64

What is the prime factorization of 34

โžก๏ธ
See all cards
4.83
โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…
12 Reviews

Add your answer:

Earn +20 pts
Q: What is the sieve of eratosthenes to find prime numbers less than 100?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What did the sieve of Eratosthenes used to find?

prime numbers


Where did Eratosthenes Sieve invent prime no?

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


When did Eratosthenes find prime numbers?

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.


How do you find the greatest common factor of 18 and 54 using the sieve of eratosthenes?

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.


How do you find prime number?

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


Could you extend the sieve to find prime numbers greater than 100?

You can extend it indefinitely, depending on your patience!


How do you write a C program to find all the prime numbers between 1 and 1000 inclusive?

Sieve of eratothanes is a popular one.


What purpose does sieve of Eratosthenes?

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


Explain how would you find all the prime numbers between 1 and 100?

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.


What is the total of the next eight prime numbers after twenty four?

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.


How can prime numbers be used in your everyday life?

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


What is a sentence using the word sieve?

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

People also asked