Is the integer n odd?

This topic has expert replies
Legendary Member
Posts: 1112
Joined: Sat Feb 26, 2011 11:16 am
Thanked: 77 times
Followed by:49 members

Is the integer n odd?

by atulmangal » Tue Apr 26, 2011 12:44 pm
Is the integer n odd?
(1) n is divisible by 3.
(2) 2n is divisible by twice as many positive integers as n.

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3835
Joined: Fri Apr 02, 2010 10:00 pm
Location: Milpitas, CA
Thanked: 1854 times
Followed by:523 members
GMAT Score:770

by Anurag@Gurome » Tue Apr 26, 2011 9:47 pm
atulmangal wrote:Is the integer n odd?
(1) n is divisible by 3.
(2) 2n is divisible by twice as many positive integers as n.
(1) n = 9 (ODD), and n = 12 (EVEN). Both of them are divisible by 3, so no definite answer.
So, (1) is NOT SUFFICIENT.

(2) If n = 2 (EVEN), then 2n = 4, which is divisible by 1, 2, and 4. 2 is divisible by 1 and 2. Here 2n does not have twice as many divisors as n.
If n = 3 (ODD), then 2n = 6, which is divisible by 1, 2, 3, and 6. 3 is divisible by 1 and 3. Here, 2n has twice as many divisors as n.
If n = 9 (ODD), then 2n = 18, which is divisible by 1, 2, 3, 6, 9 and 18. 3 is divisible by 1, 3, and 9. Here, 2n has twice as many divisors as n.
So, if n is ODD, then 2n will have twice as many divisors as n.
Hence, (2) is SUFFICIENT.

The correct answer is B.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/

Legendary Member
Posts: 1112
Joined: Sat Feb 26, 2011 11:16 am
Thanked: 77 times
Followed by:49 members

by atulmangal » Tue Apr 26, 2011 10:04 pm
Anurag@Gurome wrote:
atulmangal wrote:Is the integer n odd?
(1) n is divisible by 3.
(2) 2n is divisible by twice as many positive integers as n.
(1) n = 9 (ODD), and n = 12 (EVEN). Both of them are divisible by 3, so no definite answer.
So, (1) is NOT SUFFICIENT.

(2) If n = 2 (EVEN), then 2n = 4, which is divisible by 1, 2, and 4. 2 is divisible by 1 and 2. Here 2n does not have twice as many divisors as n.
If n = 3 (ODD), then 2n = 6, which is divisible by 1, 2, 3, and 6. 3 is divisible by 1 and 3. Here, 2n has twice as many divisors as n.
If n = 9 (ODD), then 2n = 18, which is divisible by 1, 2, 3, 6, 9 and 18. 3 is divisible by 1, 3, and 9. Here, 2n has twice as many divisors as n.
So, if n is ODD, then 2n will have twice as many divisors as n.
Hence, (2) is SUFFICIENT.

The correct answer is B.
Hi Anurag,

Thanks a lot but i have one doubt...in this question don't u think, Op B interpret something else than what u interpret...actually this is why i was not able to solve this question..

Op B: 2n is divisible by twice as many positive integers as n

i interpret it as "2n" is divisible by "2n" numbers---> this is nonsensical but this is what the language of Op B suggest...m i wrong ???

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3835
Joined: Fri Apr 02, 2010 10:00 pm
Location: Milpitas, CA
Thanked: 1854 times
Followed by:523 members
GMAT Score:770

by Anurag@Gurome » Tue Apr 26, 2011 10:18 pm
atulmangal wrote: Hi Anurag,

Thanks a lot but i have one doubt...in this question don't u think, Op B interpret something else than what u interpret...actually this is why i was not able to solve this question..

Op B: 2n is divisible by twice as many positive integers as n

i interpret it as "2n" is divisible by "2n" numbers---> this is nonsensical but this is what the language of Op B suggest...m i wrong ???
Hi Atul!

I think you are getting a little bit confused by the language of statement (2).
2n is divisible by twice as many positive integers as n is divisible by, which means 2n has twice as many factors as that of n.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/

User avatar
Master | Next Rank: 500 Posts
Posts: 135
Joined: Tue Mar 22, 2011 12:01 pm
Thanked: 21 times
Followed by:3 members
GMAT Score:720

by sourabh33 » Wed Apr 27, 2011 2:23 am
Hi Anurag

A small clarification to be made

If n = 6 (Even), then 2n = 12; n is divisible by 1,2,3 & 6....while 2n is divisible by 1,2,3,4,6 and 12. Here, 2n has twice as many divisors as n, so even statement B should be insufficient.

Now, taking 1&2 together, if we choose 3 and 6 as test numbers both qualify in statements 1 & 2. So the answer should be E




In addition, if we consider Atul's interpretation to be correct (although I do not agree with that)
then for statement 2 to be true, n has to be 1.

If n = 1 (odd), then 2n = 2; n is divisible by only 1....while 2n is divisible by 1 and 2. Here, 2n has twice as many divisors as n, so only in this case B could be sufficient.

Please clarify



Best Regards
Sourabh

Junior | Next Rank: 30 Posts
Posts: 12
Joined: Sun Apr 17, 2011 9:47 pm
Thanked: 1 times

by Subeg Gill » Wed Apr 27, 2011 3:13 am
sourabh33 wrote:Hi Anurag

A small clarification to be made

If n = 6 (Even), then 2n = 12; n is divisible by 1,2,3 & 6....while 2n is divisible by 1,2,3,4,6 and 12. Here, 2n has twice as many divisors as n, so even statement B should be insufficient.
n has 4 while 2n has 6 factors.
B is sufficient.

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3835
Joined: Fri Apr 02, 2010 10:00 pm
Location: Milpitas, CA
Thanked: 1854 times
Followed by:523 members
GMAT Score:770

by Anurag@Gurome » Wed Apr 27, 2011 3:42 am
sourabh33 wrote:Hi Anurag

A small clarification to be made

If n = 6 (Even), then 2n = 12; n is divisible by 1,2,3 & 6....while 2n is divisible by 1,2,3,4,6 and 12. Here, 2n has twice as many divisors as n, so even statement B should be insufficient.

Now, taking 1&2 together, if we choose 3 and 6 as test numbers both qualify in statements 1 & 2. So the answer should be E




In addition, if we consider Atul's interpretation to be correct (although I do not agree with that)
then for statement 2 to be true, n has to be 1.

If n = 1 (odd), then 2n = 2; n is divisible by only 1....while 2n is divisible by 1 and 2. Here, 2n has twice as many divisors as n, so only in this case B could be sufficient.

Please clarify

Best Regards
Sourabh
Hi Sourabh!

I think your query is already being answered by Subeg. If there is still any query, please let me know.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/