Saturday, 21 June 2014

discrete mathematics - Proof by induction: sum2n1i=1(2i1)=(2n1)2

2n1i=1(2i1)=(2n1)2



I get stuck after proving the base case is true. Usually with induction I assume the left and right sides are equal at some k, but I'm not sure how to approach this problem since the left side is a sum.

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}...