answersLogoWhite

0

Eratosthenes' method of finding prime and composite number is called 'The Sieve of Eratosthene'.

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake

Add your answer:

Earn +20 pts
Q: What is the name of Eratosthenes' method of finding composite numbers?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Basic Math

What is the longest string of consecutive composite numbers?

when i did this problem i was doing a eratosthenes sieve method and the numbers was from 1-100 so i got the longest string of consecutive composite numbers on the grid are 74-82 this should be right. BTW I'm 13 doing my moms college work Sorry, but 79 is a prime number. I got 90~96


How do you notice that it is factors or prime or composite numbers?

First of all, every number is a factor - of its multiples.There is no general way to distinguish between prime and composite numbers. At one level, though, there are some simple ways. If the number is not 2, but ends in 0, 2, 4, 6 or 8 then it is a composite, If the number is not 5 but ends in 0 or 5 it is composite. If the number is not 3 but the sum of all the digits of a number is 3 or divisible by 3, then it is composite. There are moderately complicated divisibility rules for 7 and 11. But this method does not identify all composite numbers and there is no guaranteed method.


What are the prime numbers between 10000 and 10050?

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


How do you use the greatest common factor subtraction method?

If you have two numbers A and B, and A > B, then GCF(A, B) = (A-B, B) Thus the problem of finding the GCF of A and B has been reduced to finding the GCF of B and a smaller number, A-B. This process can be continued until the two numbers are the same: and that number is the GCF.


A prime number is an integer greater than 1 whose only positive divisors are and the integer itself one method for finding all the prime numbers in the range 2 through n is known as the sieve of erat?

The sieve is just a method for finding primes. You write down the numbers 2 through n (lets say n = 100). And you go through the list crossing off numbers in a set way. You start with 2, and cross off 4,6,8,10, etc etc, all the way to 100. Then you go to 3, and cross off 6,9,12,15, etc all the way to 100. Then you go to the next number (four has already been crossed off when you did 2 so we're at 5 now), cross off 10,15,20,25, etc.. all the way to 100, etc etc etc through the list till you do the last one at n/2 (50). What you have in front of you now is a list of all the prime numbers from 2 to n (100), since everything else that is composite (not prime), has been crossed out.