If m is a positive odd integer between 2 and 30, then m is : GMAT Data Sufficiency (DS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 20 Jan 2017, 05:05

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

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If m is a positive odd integer between 2 and 30, then m is

Author Message
TAGS:

Hide Tags

Manager
Joined: 02 Jun 2011
Posts: 159
Followers: 1

Kudos [?]: 75 [1] , given: 11

If m is a positive odd integer between 2 and 30, then m is [#permalink]

Show Tags

26 Apr 2012, 01:54
1
KUDOS
6
This post was
BOOKMARKED
00:00

Difficulty:

75% (hard)

Question Stats:

47% (02:26) correct 53% (01:14) wrong based on 136 sessions

HideShow timer Statistics

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.

[Reveal] 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?
[Reveal] Spoiler: OA
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 7125
Location: Pune, India
Followers: 2137

Kudos [?]: 13664 [1] , given: 222

Re: If m is a positive odd integer between 2 and 30, then m is [#permalink]

Show Tags

26 Apr 2012, 03:26
1
KUDOS
Expert's post
kashishh wrote:
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.

_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for \$199

Veritas Prep Reviews

Math Expert
Joined: 02 Sep 2009
Posts: 36568
Followers: 7083

Kudos [?]: 93241 [0], given: 10553

Show Tags

26 Apr 2012, 02:08
Expert's post
2
This post was
BOOKMARKED
kashishh wrote:
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.

Hope it's clear.
_________________
Moderator
Joined: 01 Sep 2010
Posts: 3089
Followers: 785

Kudos [?]: 6525 [0], given: 1012

If m is a positive odd integer between 2 and 30, then how [#permalink]

Show Tags

04 Oct 2012, 14:09
If m is a positive odd integer between 2 and 30, then how many different positive prime numbers is m divisible by?

(1) m is not divisible by 3

(2) m is not divisible by 5
_________________
Math Expert
Joined: 02 Sep 2009
Posts: 36568
Followers: 7083

Kudos [?]: 93241 [0], given: 10553

Re: If m is a positive odd integer between 2 and 30, then how [#permalink]

Show Tags

04 Oct 2012, 14:17
carcass wrote:
If m is a positive odd integer between 2 and 30, then how many different positive prime numbers is m divisible by?

(1) m is not divisible by 3

(2) m is not divisible by 5

Merging similar topics. Please refer to the solutions above.
_________________
Current Student
Joined: 06 Sep 2013
Posts: 2035
Concentration: Finance
GMAT 1: 770 Q0 V
Followers: 62

Kudos [?]: 594 [0], given: 355

Show Tags

20 Jan 2014, 04:52
Bunuel wrote:
kashishh wrote:
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.

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?

Thank you!
Cheers!
J
Math Expert
Joined: 02 Sep 2009
Posts: 36568
Followers: 7083

Kudos [?]: 93241 [0], given: 10553

Show Tags

20 Jan 2014, 05:00
jlgdr wrote:
Bunuel wrote:
kashishh wrote:
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.

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?

Thank you!
Cheers!
J

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.
_________________
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 13460
Followers: 575

Kudos [?]: 163 [0], given: 0

Re: If m is a positive odd integer between 2 and 30, then m is [#permalink]

Show Tags

14 Sep 2015, 04:16
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.
_________________
Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 2605
GPA: 3.82
Followers: 173

Kudos [?]: 1444 [0], given: 0

Re: If m is a positive odd integer between 2 and 30, then m is [#permalink]

Show Tags

15 Sep 2015, 08:07
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.
_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
Find a 10% off coupon code for GMAT Club members.
“Receive 5 Math Questions & Solutions Daily”
Unlimited Access to over 120 free video lessons - try it yourself

Re: If m is a positive odd integer between 2 and 30, then m is   [#permalink] 15 Sep 2015, 08:07
Similar topics Replies Last post
Similar
Topics:
11 M is a positive integer, is M odd? 10 24 Jun 2016, 02:21
5 m is a positive integer ; Is M odd? 3 21 Apr 2016, 07:58
6 If m is a positive integer and m = x + y + 2z, is m odd ? 5 11 Jul 2015, 08:51
11 If p, m, and n are positive integers, n is odd, and p = m^2 9 24 Feb 2014, 07:44
If m, n, p are positive integers, is (m2 + n)(2m + p) odd 1 13 Jan 2014, 04:38
Display posts from previous: Sort by