Sunday, 24 February 2013

algebra precalculus - Converting (1+...+n)2(n+1)3 to (2+...+2n)2



I'm currently going through Calculus by Spivak by myself, and came across a proof by induction requiring to prove 13+...+n3=(1+...+n)2



Naturally, to prove this, I need to somehow convert (1+...+n)2+(n+1)3 to (2+...+2n)2.
After quite a bit of thinking, I'm still not sure how to do this. I think i may be forgetting about some property of squares that we're supposed to be using.



Note: Please only provide a hint, not the complete answer.
Edit: I was mistakenly taking (1+...+n)2(n+1)3 rather than (1+...+n)2+(n+1)3. Corrected.


Answer




Previous Answer



Hint:
1+2++n=n(n+1)2



Can you take it from here?



Revised Answer



My apologies for not bothering to check more closely earlier, but I think your original equation

(1+2++n)2(n+1)3=(2+4++2n)2
is not an identity.



To see why, via a quick inspection, the highest power of n on the LHS is n7, while the highest power of n on the RHS is n4, a contradiction.



Therefore, your proposed equation is not an identity.


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