Solution on this : DS Archive
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 18 Jan 2017, 06:13

### 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

# Solution on this

Author Message
Intern
Joined: 12 Nov 2009
Posts: 46
Followers: 0

Kudos [?]: 18 [0], given: 2

### Show Tags

08 Dec 2009, 01:45
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 100% (01:08) wrong based on 2 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Hi,

Is the integer n odd?
(1) n is divisible by 3
(2) 2n is divisible by twice as many positive integers as n.

Thanks!
Attachments

Ques.doc [68 KiB]

Manager
Joined: 29 Oct 2009
Posts: 211
GMAT 1: 750 Q50 V42
Followers: 103

Kudos [?]: 1280 [0], given: 18

### Show Tags

08 Dec 2009, 04:10
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.

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.

_________________

Click below to check out some great tips and tricks to help you deal with problems on Remainders!
http://gmatclub.com/forum/compilation-of-tips-and-tricks-to-deal-with-remainders-86714.html#p651942

1) Translating the English to Math : http://gmatclub.com/forum/word-problems-made-easy-87346.html

Re: Solution on this   [#permalink] 08 Dec 2009, 04:10
Display posts from previous: Sort by