Sunday, 31 December 2017

summation - Prove by Induction : $sum n^3=(sum n)^2$

I am trying to prove that for any integer where $n \ge 1$, this is true:



$$ (1 + 2 + 3 + \cdots + (n-1) + n)^2 = 1^3 + 2^3 + 3^3 + \cdots + (n-1)^3 + n^3$$



I've done the base case and I am having problems in the step where I assume that the above is true and try to prove for $k = n + 1$.



I managed to get,



$$(1 + 2 + 3 + \cdots + (k-1) + k + (k+1))^2 = (1 + 2 + 3 + \cdots + (k-1) + k)^2 + (k + 1)^3$$




but I'm not quite sure what to do next as I haven't dealt with cases where both sides could sum up to an unknown integer.

No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

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