AnswerTo test if a number is prime or composite by hand, the easiest thing to do is test if it's divisible by numbers you know to be prime (start with 2, 3, 5, 7, and so on). If none of them divide it, once the numbers you're dividing by get bigger than the square root of the number you're testing (roughly - you don't need to waste time actually calculating the square root), you're done and know it's prime.
For example, here's how you'd test if 107 is prime:
It's odd, so it's not divisible by 2;
It's not divisible by 3 (use the divisibility rule: 1+0+7=8, not 3 or 6 or 9)
It's not divisible by 5 (doesn't end in 5 or 0)
It's not divisible by 7 (if it were, 107-7=100 would be divisible by 7, which we know isn't true)
At this point, we know it's prime, since we'd need to check 11 next. But 11*11=121, bigger than 107, so 11 is greater than the square root of 107.
For large numbers, the best thing to do is to use a computer.
Chat with our AI personalities
The sieve of Sundaram sieves out the composite numbers just as sieve of Eratosthenes does, but even numbers are not considered; the work of "crossing out" the multiples of 2 is done by the final double-and-increment step.
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
Multiply prime numbers or prime factors to find their product.
It's not a case of working them out, you just have to know them. Here are the following prime numbers under 100:
23 and 29 are both prime numbers. The GCF of any two prime numbers is 1.