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

12y ago
This answer is:
User Avatar

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

Where did Eratosthenes Sieve invent prime no?

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


What did the sieve of Eratosthenes used to find?

prime numbers


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.


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.


What are the prime numbers between 10000 and 10050?

The numbers 10007, 10009, 10037 and 10039 are prime.


How do you find prime number?

Prime numbers are the numbers that can only be divided by 1 and them selves. As in 13 if you were to factor it using only whole numbers you would see that its factors are only 1 and 13. There for it is prime. While 12 you see that the factors are 1,2,3,4,6,12 meaning that it is not prime.You test several numbers, to see whether they are prime numbers, until you find a prime number.


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

You can extend it indefinitely, depending on your patience!


What is the sieve of Eratosthenes's?

It is a method for finding the prime and composite numbersHere is an example of the sieve. Firstly the definition of a prime is a number divisible only by itself and one. From that we can build this sieve, it can of course go on as far as you wish. Though with very large numbers it becomes impractical.1 2 3 4 5 6 7 89 10 11 12 13 1415 16 17 18 19 20 2122 23 24 25 26 27Then starting at 1 we highlight all those numbers which can be divided by numbers lower than themselves. Each number in bold is not a Prime number because a number below it can be divided into it with no remainder. Each number in italics is a prime, because, as we have said it can only be divided by 1 and itself. It should also be noted that 2 is the only even prime number, all other even numbers can be divided by 2. So if you are asked if a number is prime and it is an even number then you do not have to check because it is not.The Sieve of Eratosthenes is a way of determining which numbers are prime.Zero and one are, by definition, not prime.Write a list of numbers from two up to the highest number in which you are interested.The first number, 2, is prime and every multiple of it can not be prime, so cross them out -- that is 4, 6, 8, 10, and so onThe next number not crossed out will be 3. That is prime but its multiples can't be, so cross them out -- 6, 9, 12, 15, and so on.4 is crossed out, so the next number not crossed out is 5. That is prime, so cross out its multiples, 10, 15, 20, and so on.Continue this process until you can not cross out any more numbers (about halfway down the list)When you have finished, all numbers not crossed out are prime.


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.


Why is the square root the key to the Sieve of Eratosthenes and finding prime numbers?

Let p be the number we are testing for primality.The reason we don't have to check beyong sqrt(p) is if any number n larger than sqrt(p) divides p, then p/n, which is greater than n, also divides p.Consider the following example with 101.We check to see that 2, 3, 5, and 7 do not divide 101.11*11 = 121 implies 11*X = 101 only if X is smaller than 11. But we already checked the numbers smaller than 11.


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


How do you learn prime numbers?

Prime numbers are any numbers that are only divisible by one, and itself. For example, 3 is prime because the only numbers that go into it are 3 and 1. 6 isn't prime because not only can 6 and 1 go into it, but 3 and two can as well.