parthatayi wrote:
i think the answer is E.
Taking (1) into consideration:
n can be 6 or 9
Considering statement (2):
2n is always divisible by 2n irrespective whether n is odd.
Even by combining both the statements we cannot narrow down whether n is odd.
Nope,The answer looks more like B.
Question Stem: Is the integer n odd?
Statement 2: 2n is divisible by twice as many positive integers as n
Let n=3 --3^1---No. of factors can be given as (1+1)=2
therefore, 2n =6--(2^1)*(3^1)---No of factors=(1+1)*(1+1)=4.
Sufficient Let n=2---No. of factors=2
2n=4---no. of factors =3. Hence n has to be odd for statement 2 and stem to satisfy.
Final iteration, Let n=9. No. of factors =3
Therefore, 2n=18. No. of factors =6.
Therefore,
When odd number n is doubled, 2n has twice as many factors as n.