- #1
John112
- 19
- 0
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.
(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.