Last visit was: 20 Nov 2025, 04:07 It is currently 20 Nov 2025, 04:07
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
User avatar
kashishh
User avatar
Joined: 02 Jun 2011
Last visit: 15 Oct 2019
Posts: 89
Own Kudos:
432
 [72]
Given Kudos: 11
Posts: 89
Kudos: 432
 [72]
If m is a positive odd integer between 2 and 30, then m is 26 Apr 2012, 02:54
5
Kudos
Add Kudos
66
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
A
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

75% (hard)

Question Stats:

54% (02:03) correct 46% (01:57) wrong based on 1046 sessions

History

Date
Time
Result
Not Attempted Yet
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

Show Spoiler
My doubt is when we analyse stat. 1, aren’t we left with
7,11,13,17,19,23,25,29
out of which isn’t 25 has a different answer to the question than the other numbers?
don’t we need stat. 2 to answer it?
ShowHide Answer
Official Answer
A
Most Helpful Reply
User avatar
KarishmaB
User avatar
Joined: 16 Oct 2010
Last visit: 19 Nov 2025
Posts: 16,267
Own Kudos:
77,002
 [6]
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 77,002
 [6]
If m is a positive odd integer between 2 and 30, then m is 26 Apr 2012, 04:26
6
Kudos
Add Kudos
Bookmarks
Bookmark this Post
kashishh
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

OA is A
My doubt is when we analyse stat. 1, aren’t we left with
7,11,13,17,19,23,25,29
out of which isn’t 25 has a different answer to the question than the other numbers?
don’t we need stat. 2 to answer it?
Show more

The question asks for "... how many different prime numbers?"
If you are thinking that 25 is divisible by 5 and 5, it still counts as one.

(1) m is not divisible by 3
m is not divisible by 2 anyway since we are talking about odd numbers. Next prime number is 5. The next one is 7 but 5*7 = 35 which is greater than 30. So even if we take the two smallest possible primes, no odd number in the given range can have both as factors. So m must have only one prime number as a factor.

(2) m is not divisible by 5
m could be divisible by 3 and 7 (since 3*7 = 21 which lies in our range). So m could be divisible by one prime or by two different primes. So this statement is not sufficient.

Answer (A)
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Nov 2025
Posts: 105,410
Own Kudos:
778,471
 [6]
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,410
Kudos: 778,471
 [6]
If m is a positive odd integer between 2 and 30, then m is 26 Apr 2012, 03:08
5
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
kashishh
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

OA is A
My doubt is when we analyse stat. 1, aren’t we left with
7,11,13,17,19,23,25,29
out of which isn’t 25 has a different answer to the question than the other numbers?
don’t we need stat. 2 to answer it?
Show more

No, since 25 (as well as all other possible values of m from statement (1)), is divisible only by one prime number - 5.

If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

Since the range is not that big we can write down all possible value of m for each statement.

(1) m is not divisible by 3 --> m can be: 5, 7, 11, 13, 17, 19, 23, 25, and 29. Each has only one distinct prime in its prime factorization. Sufficient.

(2) m is not divisible by 5 --> m can be: 3, 7, 9, 11, 13, 17, 19, 21, STOP. Each but 21 has one prime in its prime factorization, while 21 has two primes: 3 and 7. Not sufficient.

Answer: A.

Hope it's clear.
General Discussion
User avatar
jlgdr
User avatar
Joined: 06 Sep 2013
Last visit: 24 Jul 2015
Posts: 1,311
Own Kudos:
2,863
Given Kudos: 355
Concentration: Finance
Schools: Wharton '17 (A) HBS '17 (WA$)
Schools: Wharton '17 (A) HBS '17 (WA$)
Posts: 1,311
Kudos: 2,863
If m is a positive odd integer between 2 and 30, then m is 20 Jan 2014, 05:52
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
kashishh
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

OA is A
My doubt is when we analyse stat. 1, aren’t we left with
7,11,13,17,19,23,25,29
out of which isn’t 25 has a different answer to the question than the other numbers?
don’t we need stat. 2 to answer it?

No, since 25 (as well as all other possible values of m from statement (1)), is divisible only by one prime number - 5.

If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

Since the range is not that big we can write down all possible value of m for each statement.

(1) m is not divisible by 3 --> m can be: 5, 7, 11, 13, 17, 19, 23, 25, and 29. Each has only one distinct prime in its prime factorization. Sufficient.

(2) m is not divisible by 5 --> m can be: 3, 7, 9, 11, 13, 17, 19, 21, STOP. Each but 21 has one prime in its prime factorization, while 21 has two primes: 3 and 7. Not sufficient.

Answer: A.

Hope it's clear.
Show more

Sorry Bunuel but I don't quite get it, we are asked it is divisible by how many different positive prime numbers.

So from Statement 1 I understand that it can be divisible by all of them because they are all distinct prime numbers so that will be 9 numbers

But from Statement 2, I don't understand it that well. OK we have 21 that has two primes 3, and 7 but we had already considered them early in the list, so what's the deal with having them again? Since we are asked for different primes then we just ignore these.

Are we being asked to count them all even with repetitions?

Please clarify
Thank you!
Cheers!
J :)
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 20 Nov 2025
Posts: 105,410
Own Kudos:
778,471
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,410
Kudos: 778,471
If m is a positive odd integer between 2 and 30, then m is 20 Jan 2014, 06:00
Kudos
Add Kudos
Bookmarks
Bookmark this Post
jlgdr
Bunuel
kashishh
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

OA is A
My doubt is when we analyse stat. 1, aren’t we left with
7,11,13,17,19,23,25,29
out of which isn’t 25 has a different answer to the question than the other numbers?
don’t we need stat. 2 to answer it?

No, since 25 (as well as all other possible values of m from statement (1)), is divisible only by one prime number - 5.

If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

Since the range is not that big we can write down all possible value of m for each statement.

(1) m is not divisible by 3 --> m can be: 5, 7, 11, 13, 17, 19, 23, 25, and 29. Each has only one distinct prime in its prime factorization. Sufficient.

(2) m is not divisible by 5 --> m can be: 3, 7, 9, 11, 13, 17, 19, 21, STOP. Each but 21 has one prime in its prime factorization, while 21 has two primes: 3 and 7. Not sufficient.

Answer: A.

Hope it's clear.

Sorry Bunuel but I don't quite get it, we are asked it is divisible by how many different positive prime numbers.

So from Statement 1 I understand that it can be divisible by all of them because they are all distinct prime numbers so that will be 9 numbers

But from Statement 2, I don't understand it that well. OK we have 21 that has two primes 3, and 7 but we had already considered them early in the list, so what's the deal with having them again? Since we are asked for different primes then we just ignore these.

Are we being asked to count them all even with repetitions?

Please clarify
Thank you!
Cheers!
J :)
Show more

For (2):

If m=3, then m is divisible by ONE prime factor, 3.
If m=21, then m is divisible by TWO prime factors, 3 and 7.

So, we have two different answers, which means that the statement is not sufficient.

Hope it's clear.
User avatar
MathRevolution
User avatar
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Last visit: 27 Sep 2022
Posts: 10,070
Own Kudos:
19,394
Given Kudos: 4
GMAT 1: 760 Q51 V42
GPA: 3.82
Expert
Expert reply
GMAT 1: 760 Q51 V42
Posts: 10,070
Kudos: 19,394
If m is a positive odd integer between 2 and 30, then m is 15 Sep 2015, 09:07
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Forget conventional ways of solving math questions. In DS, Variable approach is the easiest and quickest way to find the answer without actually solving the problem.
Remember equal number of variables and independent equations ensures a solution.


If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

In the original condition we have 1 variable and we need 1 equation to match the number of variables and equations. Since there is 1 each in 1) and 2), there is high probability that D is the answer.

In case of 1), m=5(5),25(5),7(7),11(11),13(13),17(17),19(19),29(29) and the different prime factors is 1, therefore the condition is sufficient.
In case of 2), m=3, 15 and since 3 have 1(3), 15 have 2(3,5) prime factors the answer is not unique and therefore not sufficient. Thus the answer is A.

Normally for cases where we need 1 more equation, such as original conditions with 1 variable, or 2 variables and 1 equation, or 3 variables and 2 equations, we have 1 equation each in both 1) and 2). Therefore D has a high chance of being the answer, which is why we attempt to solve the question using 1) and 2) separately. Here, there is 59 % chance that D is the answer, while A or B has 38% chance. There is 3% chance that C or E is the answer for the case. Since D is most likely to be the answer according to DS definition, we solve the question assuming D would be our answer hence using 1) and 2) separately. Obviously there may be cases where the answer is A, B, C or E.
User avatar
jabhatta2
User avatar
Joined: 15 Dec 2016
Last visit: 21 Apr 2023
Posts: 1,294
Own Kudos:
317
Given Kudos: 188
Posts: 1,294
Kudos: 317
If m is a positive odd integer between 2 and 30, then m is 20 Mar 2020, 14:55
Kudos
Add Kudos
Bookmarks
Bookmark this Post
VeritasKarishma
kashishh
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

OA is A
My doubt is when we analyse stat. 1, aren’t we left with
7,11,13,17,19,23,25,29
out of which isn’t 25 has a different answer to the question than the other numbers?
don’t we need stat. 2 to answer it?

The question asks for "... how many different prime numbers?"
If you are thinking that 25 is divisible by 5 and 5, it still counts as one.

(1) m is not divisible by 3
m is not divisible by 2 anyway since we are talking about odd numbers. Next prime number is 5. The next one is 7 but 5*7 = 35 which is greater than 30. So even if we take the two smallest possible primes, no odd number in the given range can have both as factors. So m must have only one prime number as a factor.

(2) m is not divisible by 5
m could be divisible by 3 and 7 (since 3*7 = 21 which lies in our range). So m could be divisible by one prime or by two different primes. So this statement is not sufficient.

Answer (A)
Show more

Hi VeritasKarishma

I am struggling to see what the question is asking

We are being asked per my understanding -- m is divisible by how many different prime numbers ?

Isn't thus the answer to S1 /S2 plausibly -- 1 prime is divisible only / 2 primes are divisible only / 3 primes are divisible only /4 prime numbers are divisible only only .......n prime numbers are divisible only

If i solve for S1 -- i see 9 different prime numbers possibly [5 / 7 / 11 / 13 / 17 / 19 / 23 / 25 (5x5 is still one prime number only, i.e. 5) / 29 ]

I marked S1 as sufficient because i got 9 different prime numbers

Is my answer to S1 (=9) incorrect ?

--------------------------------
On the other hand my answer to S2 is 9 as well

S2 set : 3 / 7 / 9 / 11 / 13 / 17 / 19 / 23 / 25(5*5) / 29

prime numbers = 3 / 7 / 11 / 13 / 17 / 19 / 23 / 5 / 29

Please let me know, where is the break in my logic
User avatar
KarishmaB
User avatar
Joined: 16 Oct 2010
Last visit: 19 Nov 2025
Posts: 16,267
Own Kudos:
77,002
 [1]
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 77,002
 [1]
If m is a positive odd integer between 2 and 30, then m is 21 Mar 2020, 03:07
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
jabhatta@umail.iu.edu
VeritasKarishma
kashishh
If m is a positive odd integer between 2 and 30, then m is divisible by how many different positive prime numbers?

(1) m is not divisible by 3.
(2) m is not divisible by 5.

OA is A
My doubt is when we analyse stat. 1, aren’t we left with
7,11,13,17,19,23,25,29
out of which isn’t 25 has a different answer to the question than the other numbers?
don’t we need stat. 2 to answer it?

The question asks for "... how many different prime numbers?"
If you are thinking that 25 is divisible by 5 and 5, it still counts as one.

(1) m is not divisible by 3
m is not divisible by 2 anyway since we are talking about odd numbers. Next prime number is 5. The next one is 7 but 5*7 = 35 which is greater than 30. So even if we take the two smallest possible primes, no odd number in the given range can have both as factors. So m must have only one prime number as a factor.

(2) m is not divisible by 5
m could be divisible by 3 and 7 (since 3*7 = 21 which lies in our range). So m could be divisible by one prime or by two different primes. So this statement is not sufficient.

Answer (A)

Hi VeritasKarishma

I am struggling to see what the question is asking

We are being asked per my understanding -- m is divisible by how many different prime numbers ?

Isn't thus the answer to S1 /S2 plausibly -- 1 prime is divisible only / 2 primes are divisible only / 3 primes are divisible only /4 prime numbers are divisible only only .......n prime numbers are divisible only

If i solve for S1 -- i see 9 different prime numbers possibly [5 / 7 / 11 / 13 / 17 / 19 / 23 / 25 (5x5 is still one prime number only, i.e. 5) / 29 ]

I marked S1 as sufficient because i got 9 different prime numbers

Is my answer to S1 (=9) incorrect ?

--------------------------------
On the other hand my answer to S2 is 9 as well

S2 set : 3 / 7 / 9 / 11 / 13 / 17 / 19 / 23 / 25(5*5) / 29

prime numbers = 3 / 7 / 11 / 13 / 17 / 19 / 23 / 5 / 29

Please let me know, where is the break in my logic
Show more

I don't think you have understood the question. Let me break it down:

Given: "m is a positive odd integer between 2 and 30."
Conclusion: m can be 3/5/7/9/11/13... 29

Question: m is divisible by how many different positive prime numbers?
Answer; Depends on the value of m.
If m is 3, answer is that m is divisible by 1 prime number.
If m is 5, answer is that m is divisible by 1 prime number.
...
If m is 15, answer is that m is divisible by 2 prime numbers.
...

Let's look at the stmnts that will give us more info about m.

(1) m is not divisible by 3.
- m could be 5 in which case it has 1 prime factor.
- m could have 2 prime factors the smallest acceptable ones being 5 and 7. But that would mean m = 5*7 = 35 but m must be less than 30. So m cannot have 2 prime factors and then obviously, not more than 2 either.
Hence m must have only 1 different positive prime factor.
Sufficient

(2) m is not divisible by 5.
- m could be 3 in which case it has 1 prime factor.
- m could be 21 in which it has 2 prime factors (3 and 7)
Not sufficient.

Answer (A)
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,597
Own Kudos:
1,079
Posts: 38,597
Kudos: 1,079
If m is a positive odd integer between 2 and 30, then m is 11 Nov 2024, 04:41
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
Moderators:
Bunuel
Math Expert
105409 posts
kingbucky
496 posts