1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Inequality inductive proof

  1. Apr 26, 2013 #1
    I need a bit of help proving the following statement
    (n + 2)^n ≤ (n + 1)^n+1 where n is a positive integer. The (n+2) and (n+1) bases are making it hard for me solve this. I tried several time, I can't get the inductive step. Can someone lend me a little hand here?

    The base case is real simple with n=1; But I can't make the leap from n=k to to n=K+1.
     
  2. jcsd
  3. Apr 26, 2013 #2
    you proved it for 1
    suppose that (n + 2)^n ≤ (n + 1)^n+1
    and prove that ((n+1)+2)^n+1≤ ((n+1)+1)^(n+1)+1
    i remember when i first learned about induction these cases kinda confused me as well just go back to the lesson and re read it if you don't get it
     
  4. Apr 26, 2013 #3

    Mark44

    Staff: Mentor

    Where's the template? PF rules require that you use the template when you post a problem.

    John112 and Andrax - use parentheses!

    (n + 1)^n+1 means (n + 1)n + 1

    If you intend this as (n + 1)n + 1 then use LaTeX or the SUP tags or at the least, write it as (n + 1)^(n + 1).
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Inequality inductive proof
Loading...