Just by removing 3 &5 from the factors we can get the numbers, but the soln says a diff story.
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?
I. m is not divisible by 3
II. m is not divisible by 5
Hi Ryan,
what you mean by removing 3 and 5 we can get the numbers. I didnt get that.
Here is my solution for this question. Answer has to be A.
Statement I is sufficient:
m is not divisible by 3.
So m could be,
5, 7, 11, 13, 17, 19, 23, 25, and 29.
Each has only one distinct prime in its prime factorization.
So sufficient.
Statement II is insufficient
m is not divisible by 5.
So again here m could be,
3, 7, 9, 11, 13, 17, 19, 21, 23, 27,29.
If you look at it, each but 21 has one prime in its prime factorization, while 21 has two primes 3 and 7.
So not sufficient.
Answer has to be A.
Hope this helps.
