Welcome! Check out our free B-School Guides to learn how you compare with other applicants.
Login or Register

Is integer n odd

This topic has 1 expert reply and 10 member replies
aatech Really wants to Beat The GMAT! Default Avatar
Joined
29 Apr 2008
Posted:
192 messages
Thanked:
14 times
Is integer n odd Post Sat May 31, 2008 11:08 am
Elapsed Time: 00:00
  • Lap #[LAPCOUNT] ([LAPTIME])
    Is the integer n odd

    1) n is divisible by 3

    2) 2n is divisible by twice as many positive integers as n

    Need free GMAT or MBA advice from an expert? Register for Beat The GMAT now and post your question in these forums!
    netigen GMAT Destroyer! Default Avatar
    Joined
    18 Feb 2008
    Posted:
    631 messages
    Followed by:
    2 members
    Thanked:
    29 times
    Post Sat May 31, 2008 1:16 pm
    Assuming some factors:

    n = 1 x n
    2n = 1 x 2n x 2 x n

    (B) hold true only if the factors are as shown above

    which means n = prime

    note n=2 does not hold good for B hence n cannot be 2

    so B is sufficient to ans the question

    chidcguy GMAT Destroyer! Default Avatar
    Joined
    12 Feb 2007
    Posted:
    438 messages
    Thanked:
    24 times
    Post Sat May 31, 2008 1:54 pm
    Does n need to be prime?

    Take 9 and 18 as n and 2n, which satisfy the condition in (B)

    9 has factors 1, 3, 9 and 18 has 1,2,3,6,9,18

    How ever I agree that I arrived at B by brute force of taking a bunch of sets of n,2n

    netigen GMAT Destroyer! Default Avatar
    Joined
    18 Feb 2008
    Posted:
    631 messages
    Followed by:
    2 members
    Thanked:
    29 times
    Post Sat May 31, 2008 2:23 pm
    you are right n need not be prime.

    I should have cross checked my assumption with A which tells me that n can not be prime Smile until and unless n=3

    I think the conclusion is that n=odd (not just prime)

    aatech Really wants to Beat The GMAT! Default Avatar
    Joined
    29 Apr 2008
    Posted:
    192 messages
    Thanked:
    14 times
    Post Sat May 31, 2008 4:40 pm
    OA is B.. Thanks guys

    aj5105 GMAT Titan Default Avatar
    Joined
    06 Jul 2008
    Posted:
    1169 messages
    Followed by:
    1 members
    Thanked:
    25 times
    Post Fri Jan 16, 2009 9:16 am
    anybody more on this problem,please?

    GMAT/MBA Expert

    Ian Stewart GMAT Instructor
    Joined
    02 Jun 2008
    Posted:
    2178 messages
    Followed by:
    295 members
    Thanked:
    998 times
    GMAT Score:
    780
    Post Fri Jan 16, 2009 10:29 am
    Statement 1 is irrelevant.

    Statement 2 is trickier than most GMAT DS statements. You might persuade yourself it's sufficient by picking a few numbers, but if you want to be sure of your answer, it's probably easiest to see why Statement 2 is sufficient by looking at numerical examples, and seeing how we can list all of the divisors of a number. Let's first take an odd number, say n = 45 = 3^2 * 5. n has six divisors, all of course odd:

    1, 3, 5, (3^2), (3*5), (3^2 * 5) = 1, 3, 5, 9, 15, 45

    Now, 2n will have all of those odd divisors, but will have just as many even divisors: you find the even divisors of 2n by doubling all of the odd divisors:

    1, 3, 5, (3^2), (3*5), (3^2 * 5) = 1, 3, 5, 9, 15, 45
    2*1, 2*3, 2*5, 2*(3^2), 2*(3*5), 2*(3^2 * 5) = 2, 6, 10, 18, 30, 90

    are all of the divisors of 90. The same will be true of any odd n: if n is odd, 2n has twice as many divisors as n.

    Instead start with an even number, say n = 54 = 2*(3^3). This number has four odd divisors, and four even divisors:

    1, 3, 3^2, 3^3 = 1, 3, 9, 27
    2, 2*3, 2*(3^2), 2*(3^3) = 2, 6, 18, 54

    When we look at 2n = 108 = (2^2)*(3^3) , we'll have all of these divisors, but also all the divisors we get by doubling the divisors in the second row:

    1, 3, 3^2, 3^3 = 1, 3, 9, 27
    2, 2*3, 2*(3^2), 2*(3^3) = 2, 6, 18, 54
    2^2, (2^2)*3, (2^2)*(3^2), (2^2)*(3^3) = 4, 12, 36, 108

    We don't get twice as many, of course -- we get 50% more divisors. From this one example, hopefully it's clear why, for any even number n, 2n will never have twice as many divisors as n; 2n will always have less than twice as many if n is even.

    Of course, if you understand why we find every divisor by doing as we did above, you'll likely know how, from the exponents in a prime factorization, to calculate the number of divisors of an integer. You can use that as well to answer the question.

    _________________
    Nov 2011: After years of development, I am now making my advanced Quant books and high-level problem sets available for sale. Contact me at ianstewartgmat at gmail.com for details.

    private GMAT tutor in Toronto

    Thanked by: kaulnikhil, clock60, Rokita2465
    logitech GMAT Titan
    Joined
    20 Oct 2008
    Posted:
    2136 messages
    Followed by:
    21 members
    Thanked:
    232 times
    GMAT Score:
    730
    Post Fri Jan 16, 2009 10:37 am
    Is the integer n odd

    1) n is divisible by 3

    3- odd
    6- even

    INSUF

    2) 2n is divisible by twice as many positive integers as n[/quote]2x3 = 6

    ODD + Twice as many (1,2,3,6,) vs ( 1,3)

    2x2 = 4

    EVEN 2 vs 2

    SUF

    One more with an ODD

    2x9 = 18

    ODD

    1,2,3,6,9,18 VS 1,3,9 ( Twice as many )

    _________________
    LGTCH
    ---------------------
    "DON'T LET ANYONE STEAL YOUR DREAM!"

    goelmohit2002 GMAT Titan Default Avatar
    Joined
    24 Dec 2008
    Posted:
    1799 messages
    Followed by:
    1 members
    Thanked:
    35 times
    Post Sun Aug 23, 2009 11:24 pm
    is there a algebraic way to solve this problem rather than relying on number picking ?

    navalpike Really wants to Beat The GMAT! Default Avatar
    Joined
    04 May 2009
    Posted:
    103 messages
    Thanked:
    6 times
    Post Mon Aug 24, 2009 10:58 am
    In my opinion, this is really not a problem that lends to algebra. And if it did, Ian would have showed us.

    Post Sun Sep 27, 2009 10:47 am
    I relied on picking numbers based on Ron Purewal's advice that odd/evens follow predictable patterns. At the same time, thanks for the more conceptual explanation! Helps.

    arora007 Community Manager
    Joined
    17 Aug 2009
    Posted:
    1049 messages
    Followed by:
    26 members
    Thanked:
    47 times
    Target GMAT Score:
    XYZ
    GMAT Score:
    670
    Post Thu Aug 12, 2010 8:03 am
    "When odd number n is doubled, 2n has twice as many factors as n."

    an excellent takeaway!!

    _________________
    http://www.skiponemeal.org/
    http://twitter.com/skiponemeal
    Few things are impossible to diligence & skill.Great works are performed not by strength,but by perseverance

    pm me if you find junk/spam/abusive language, Lets keep our community clean!!

    Best Conversation Starters

    1 j_shreyans 86 topics
    2 aditya8062 41 topics
    3 RiyaR 30 topics
    4 kamalakarthi 29 topics
    5 anksm22 27 topics
    See More Top Beat The GMAT Members...

    Most Active Experts

    1 image description GMATGuruNY

    The Princeton Review Teacher

    170 posts
    2 image description Brent@GMATPrepNow

    GMAT Prep Now Teacher

    151 posts
    3 image description MBAPrepAdvantage

    MBAPrepAdvantage

    94 posts
    4 image description CriticalSquareMBA

    Critical Square

    60 posts
    5 image description Matt@VeritasPrep

    Veritas Prep

    58 posts
    See More Top Beat The GMAT Experts