Wednesday, July 19, 2017

summation - Prove by Induction : sumn3=(sumn)2

I am trying to prove that for any integer where n1, this is true:



(1+2+3++(n1)+n)2=13+23+33++(n1)3+n3



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++(k1)+k+(k+1))2=(1+2+3++(k1)+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

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...