Question Stem : Is 'n' odd?

Answer will be in the form of Yes/No.

St.(1) : 'n' is divisible by 3

If n = 9, answer to question stem is Yes.

If n = 12, answer to question stem is No.

Insufficient due to contradicting answers.

St.(2) : '2n' is divisible by twice as many positive integers as n.

'2n' can be divisible by twice as many positive integers ONLY IF every factor of 'n' when multiplied by 2 gives a new factor. This can only happen when 'n' is odd. Why? Because when 'n' is even, it will have definitely have at least '1' and '2' as its factors. To find factors of '2n', if we multiply '1' by 2, we get '2' which does not give us any new factor.

Thus for any even number 'n', '2n' will always have less than two times the factors of 'n'. (Try it out with examples!)

Since St.(2) gives us enough information to conclude that 'n' is odd, it is sufficient.

Answer : B _________________

Click below to check out some great tips and tricks to help you deal with problems on Remainders!

compilation-of-tips-and-tricks-to-deal-with-remainders-86714.html#p651942

Word Problems Made Easy!

1) Translating the English to Math : word-problems-made-easy-87346.html

2) 'Work' Problems Made Easy : work-word-problems-made-easy-87357.html

3) 'Distance/Speed/Time' Word Problems Made Easy : distance-speed-time-word-problems-made-easy-87481.html