Results 1 to 11 of 11

Thread: [RESOLVED] I need to prove something.

  1. #1

    Thread Starter
    Kitten CornedBee's Avatar
    Join Date
    Aug 2001
    Location
    In a microchip!
    Posts
    11,594

    [RESOLVED] I need to prove something.

    This is a school assignment, so all the people that don't like to help at such problems are warned.

    I have to use complete deduction to prove that
    3n + 2^n < 3^n
    is true for every n >= 3.

    I can prove that it is true for n0 = 3 (surprise), then I tried to prove that the difference:
    (3ni + 2^ni) - (3ni-1 + 2^ni-1) < (3^ni) - (3^ni-1)

    I end up with
    18 + (3*2^ni) < 4*3^ni
    but I can't get the n down from the powers. I can't use logarithm because of the addition.

    Anyone knows how to solve this, or knows a completly different better solution? It has to use deduction though.
    Last edited by CornedBee; Nov 4th, 2002 at 05:13 AM.
    All the buzzt
    CornedBee

    "Writing specifications is like writing a novel. Writing code is like writing poetry."
    - Anonymous, published by Raymond Chen

    Don't PM me with your problems, I scan most of the forums daily. If you do PM me, I will not answer your question.

  2. #2
    Fanatic Member bugzpodder's Avatar
    Join Date
    Jun 2002
    Location
    Ontario, Canada
    Posts
    787
    well i ended up with something different.

    i get:

    3+2k<2*3k

    which is true for all k>3
    Massey RuleZ! ^-^__Cheers!__^-^ Massey RuleZ!


    Did you know that...
    The probability that a random rational number has an even denominator is 1/3 (Salamin and Gosper 1972)? This result is independently verified by me (2002)!

  3. #3

    Thread Starter
    Kitten CornedBee's Avatar
    Join Date
    Aug 2001
    Location
    In a microchip!
    Posts
    11,594
    But how do I prove that? It's just a reformulation of the original problem, right?
    All the buzzt
    CornedBee

    "Writing specifications is like writing a novel. Writing code is like writing poetry."
    - Anonymous, published by Raymond Chen

    Don't PM me with your problems, I scan most of the forums daily. If you do PM me, I will not answer your question.

  4. #4
    Fanatic Member sql_lall's Avatar
    Join Date
    Jul 2002
    Location
    Up Above (i.e. AUS)
    Posts
    571

    Hmm...

    You have proved:
    3n + 2^n < 3^n (by putting n = 3)

    Now all you have to show is:
    3(n+1) + 2^(n+1) < 3^(n+1) (where n >3)
    OR:

    3n + 3 +2^(n+1) < 3^n * 3

    _____3n + 2^n < 3^n (shown for n = 3)
    ____________3<3^n (always true when n >3)
    ______2^(n+1) < 3^n (always true when n >3)
    --------------------------------------
    3n+3 + 2^(n+1) < 3^n *3


    (i'm not exactly sure about this, but it may be right. ALso, this is induction, not deduction, but i am guessing they are similar??)
    sql_lall

  5. #5
    vbuggy krtxmrtz's Avatar
    Join Date
    May 2002
    Location
    In a probability cloud
    Posts
    5,573

    Lightbulb

    If you assume that,

    3n > 2n + 3n

    holds up to n, then if you can prove it for n+1, you will have proved it for any positive integer (>3).

    Multiply both sides of the above inequality by 3:

    3n+1 > 3( 2n ) + 3(3n) > 2( 2n ) + 3(3n) = 2n+1 + 9n > 2n+1 + 3(n +1)

    and there you go!

    The last step follows from the fact that 9n > 3(n+1) or equivalently 3n > n+1 for all n >=1.

  6. #6

    Thread Starter
    Kitten CornedBee's Avatar
    Join Date
    Aug 2001
    Location
    In a microchip!
    Posts
    11,594
    sql: Yes, I meant induction, I just used the wrong word.

    Thanks to you all, I understand none of your proofs, mainly because I don't quite get how they are written. Thanks anyway, by now I've solved the problem by other means.

    krt: How did you get those numbers up?
    All the buzzt
    CornedBee

    "Writing specifications is like writing a novel. Writing code is like writing poetry."
    - Anonymous, published by Raymond Chen

    Don't PM me with your problems, I scan most of the forums daily. If you do PM me, I will not answer your question.

  7. #7
    vbuggy krtxmrtz's Avatar
    Join Date
    May 2002
    Location
    In a probability cloud
    Posts
    5,573
    Originally posted by CornedBee
    krt: How did you get those numbers up?
    If you mean the superindices, use the "[sup]" tag.

  8. #8

    Thread Starter
    Kitten CornedBee's Avatar
    Join Date
    Aug 2001
    Location
    In a microchip!
    Posts
    11,594
    Thanks
    All the buzzt
    CornedBee

    "Writing specifications is like writing a novel. Writing code is like writing poetry."
    - Anonymous, published by Raymond Chen

    Don't PM me with your problems, I scan most of the forums daily. If you do PM me, I will not answer your question.

  9. #9
    So Unbanned DiGiTaIErRoR's Avatar
    Join Date
    Apr 1999
    Location
    /dev/null
    Posts
    4,111
    n could = 2.2

  10. #10
    vbuggy krtxmrtz's Avatar
    Join Date
    May 2002
    Location
    In a probability cloud
    Posts
    5,573

    so...?

    2.2 is not an integer. (Even so, for n=2.2 the inequality is still true!)

  11. #11

    Thread Starter
    Kitten CornedBee's Avatar
    Join Date
    Aug 2001
    Location
    In a microchip!
    Posts
    11,594
    Gotta prove it for integers. But it's now long resolved, thanks anyway.
    All the buzzt
    CornedBee

    "Writing specifications is like writing a novel. Writing code is like writing poetry."
    - Anonymous, published by Raymond Chen

    Don't PM me with your problems, I scan most of the forums daily. If you do PM me, I will not answer your question.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  



Click Here to Expand Forum to Full Width