It is currently 17 Nov 2017, 16:27

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

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

# Is the integer N odd? (1) N is divisible by 3 (2)2N is

 post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
Director
Joined: 08 Jul 2004
Posts: 595

Kudos [?]: 281 [0], given: 0

Is the integer N odd? (1) N is divisible by 3 (2)2N is [#permalink]

### Show Tags

03 Oct 2004, 12:51
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

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

Is the integer N odd?

(1) N is divisible by 3

(2)2N is divisible by twice as many positive integer as N.

Kudos [?]: 281 [0], given: 0

Senior Manager
Joined: 19 May 2004
Posts: 291

Kudos [?]: 15 [0], given: 0

### Show Tags

03 Oct 2004, 13:32
I pick C.

Seems like only N=3 or (-3) works...
This is the only prime that is divisible by 3... And YES, it is odd.

Kudos [?]: 15 [0], given: 0

Manager
Joined: 26 Sep 2004
Posts: 136

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

### Show Tags

03 Oct 2004, 13:51
I would go with a B
2N has as many positive divisors as N.
Implies N is an odd multiple of 3.

Ok check for
2 : 1,2 ; 4 : 1,2,4 ; 8 : 1,2,4,8
3 : 1,3 ; 6 : 1,2,3,6 ; 12 : 1,2,3,4,6,12
9 : 1,3,9 ; 18: 1,2,3,6,9,18 ; 36 : 1,2,3,4,6,9,18,36

Clearly the pattern is seen
_________________

Franky
http://franky4gmat.blogspot.com

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

Senior Manager
Joined: 19 May 2004
Posts: 291

Kudos [?]: 15 [0], given: 0

### Show Tags

03 Oct 2004, 14:25
Agree.
B it is.

It also has nothing to do with primes..

Kudos [?]: 15 [0], given: 0

Manager
Joined: 28 Aug 2004
Posts: 205

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

### Show Tags

09 Oct 2004, 01:05
It is odd by B alone, but not necessarily mutliple of 3. Say N = 5. Multiples = 1,5. 2N = 10. Multiples = 1, 2, 5, 10.

...thinking of a different way rather than trial and error.

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

Director
Joined: 31 Aug 2004
Posts: 606

Kudos [?]: 153 [0], given: 0

### Show Tags

10 Oct 2004, 13:47
Statement 2:

Either N is odd (=2k+1) then 2N has obviously twice as much divisors as N
or N is even (=2k) and then 2N has twice as much factors as N.

B is the answer

Kudos [?]: 153 [0], given: 0

Director
Joined: 08 Jul 2004
Posts: 595

Kudos [?]: 281 [0], given: 0

### Show Tags

16 Jan 2005, 18:55
myfrankenstein wrote:
I would go with a B
2N has as many positive divisors as N.
Implies N is an odd multiple of 3.

Ok check for
2 : 1,2 ; 4 : 1,2,4 ; 8 : 1,2,4,8
3 : 1,3 ; 6 : 1,2,3,6 ; 12 : 1,2,3,4,6,12
9 : 1,3,9 ; 18: 1,2,3,6,9,18 ; 36 : 1,2,3,4,6,9,18,36

Clearly the pattern is seen

I am nto sure if N is 4 and 2N is 8, then this does not hold true.
So, restricitng to be factor of 3 along with statement B, should give C as answer.
S

Kudos [?]: 281 [0], given: 0

Intern
Joined: 04 Jan 2005
Posts: 5

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

### Show Tags

17 Jan 2005, 09:14
Well....
lets try n=6
n is even and 2(6) has twice the factors of 6
try n=3
n is odd and 2(3) has twice the factors of 3
so i think the ans.. should be E.

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

17 Jan 2005, 09:14
Display posts from previous: Sort by

# Is the integer N odd? (1) N is divisible by 3 (2)2N is

 post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.