Monday, 14 April 2014

tricky summation proof by induction

I need to prove the following identity by induction: ni=0ini1=(n1)2n+1




I have the base case where n=1 and all that, but I'm stuck on how to turn the inductive step into the final solution. I know I need to assume the identity holds for n1, but I'm stuck on how to use that to show it holds true for n.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

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