Thursday, 7 November 2013

discrete mathematics - Proof by Mathematical Induction for Inequality



Prove, by mathematical induction, that ni=1ii+1n2n+1
(When n is a natural number.)



So I went through all the typical steps you'd go through with mathematical induction, and after assuming that the statement at n+1 was true, I ended up with the following:



n+1i=1ii+1(n+1)2n+2
... (algebra) ...

ni=1ii+1n2+nn+2



But since the right hand side of the inequality I ended up with is greater than the original right hand side of the inequality I wanted to end up with, this doesn't help me prove the original statement. So I've either done something wrong with my algebra or I'm not thinking far enough outside the box; how do I use induction to prove this?


Answer



Suppose that i=ni=1ii+1n2n+1,



i=n+1i=1ii+1n2n+1+n+1n+2.



n2n+1+n+1n+2=




n2(n+2)+(n+1)2(n+1)(n+2)



n(n2+2n+1)+(n+1)2(n+1)(n+2)



=n(n+1)2+(n+1)2(n+1)(n+2)=(n+1)2n+2.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...