The GMAT would restrict this problem to POSITIVE integers:
Is the positive integer n odd?
1. n is divisible by 3.
2. 2n divisible by twice as many +ve integers as n.
OA is B
Statement 1: n is divisible by 3.
Since it's possible that n=3 or that n=6, INSUFFICIENT.
Statement 2: 2n is divisible by twice as many positive integers as n.
No even integer satisfies this constraint.
If n=2 (which is divisible by 1 and 2, for a total of 2 factors), then 2n=4 (which is divisible by 1, 2 and 4, for a total of 3 factors).
If n=4 (which is divisible by 1, 2 and 4, for a total of 3 factors), then 2n=8 (which is divisible by 1, 2, 4 and 8, for a total of 4 factors).
If n=6 (which is divisible by 1, 2, 3 and 6, for a total of 4 factors), then 2n=12 (which is divisible by 1, 2, 3, 4, 6, and 12, for a total of 6 factors).
In none of these cases does 2n have twice as many factors as does n.
Since no even value satisfies statement 2, n must be ODD.
SUFFICIENT.
The correct answer is
B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at
[email protected].
Student Review #1
Student Review #2
Student Review #3