Wednesday, February 15, 2017

calculus - Proof without using induction




How to prove that
12+22+...+n2=n(n+1)(2n+1)6
without using induction.



If we don't know the right side of this expression, how to get right expression. I tried with partial sums and binomial formula but can't get it.



So the problem is:

12+22+...+n2=?



Thanks for replies.


Answer



Assume we know nk=1k=n(n+1)2. Compute the following cubes



13=1(1+1)3=13+312+31+13=n3=(n1)3+3(n1)2+3(n1)+13(n+1)3=n3+3n2+3n+13



Add these equations together and cancel the cubes you have on both sides you get



(n+1)3=1+3nk=1k2+3nk=1k+n=(n+1)3n+22+3nk=1k2



This yields




nk=1k2=n+13(n2+2n+13n+22)=(n+1)(2n2+n)6



Factoring n we get the result expected


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