Limited period offer- Get our entire 9 session Verbal Intensive Online Course for free. Click here for more details.

Close

DS -Odd number Check | Forums

Advanced Search:

— Forum Scope —



— Match —



— Forum Options —




Wildcard usage:
*  matches any number of characters    %  matches exactly one character

Minimum search word length is 3 characters - maximum search word length is 84 characters

Topic RSS
DS -Odd number Check
July 8, 2010
6:09 pm
gmatwarrior
Guest

Is the integer n odd?

(1) n is divisible by 3.

(2) 2n is divisible by twice as many positive integers as n. A->Can be answered by option 1 alone

B->Can be answered by option 2 alone

C->Can be answered by options 1 and 2 taken together D->Can be answered by each of the options

E->Can’t be answered

August 1, 2010
5:22 pm
ivydreamer
Guest

I think B is the right answer.

here’s the complete explanation
Statement 1 : n is divisible by 3 i.e n = {3,6,9,12…} so n can be either odd or even.
So stmnt 1 is insufficient
Statement 2 : Twice of any odd number( except for prime numbers)has twice the number of factors .
For eg .n=-9 .Factors are 1,3,9 .No of factors =3
2n= 18 .Factors are 1,2,3,6,9,18 .No of factors =6
So statement 2 is sufficient to prove that integer n is odd
Hence option B

Most Users Ever Online: 42

Currently Online:
1 Guest(s)

Currently Browsing this Page:
1 Guest(s)

Top Posters:

Team Aristotle: 32

wininblue: 16

Vorskl: 13

crackball: 13

nash.8087: 11

prep: 6

vikgmat: 5

verbalguru: 4

thang: 4

shilpatan: 3

Member Stats:

Guest Posters: 227

Members: 2590

Moderators: 0

Admins: 1

Forum Stats:

Groups: 5

Forums: 11

Topics: 662

Posts: 2093

Newest Members: kb24, rishabh3057, sac_goel, username123, gauri14f@gmail.com, gokul ram . t, ojeswilanka, harpreetkg, ashiffshaik, bayram

Administrators: admin (10)

GMATâ„¢ is a registered trademark of the Graduate Management Admission Councilâ„¢ (GMAC) which neither endorses nor is affiliated in any way with this site.