Tuesday, November 26, 2019

proof writing - Prove 13+23+cdots+n3=(1+2+cdots+n)2 using Induction





Prove 13+23++n3=(1+2++n)2 using Induction



My proof so far:



Let P(n) be 13+23++n3=(1+2++n)2







Base Case



P(1):



LHS = 13=1



RHS = (1)2=1




Since LHS = RHS, therefore base case holds






Induction Hypothesis



Let nN be arbitrary



Assume P(n) holds







Induction Step



Prove P(n+1) holds:



13+23++n3+(n+1)3=(1+2++n)2+(n+1)3 (by Induction Hypothesis)=(1+2++n)2+(n3+3n2+3n+1)






This is where I get stuck. I don't know how to prove that my last step is equivalent to:



(1+2++n+(n+1))2



Answer



So basically you want that last expression to turn out to be (1+2++n+(n+1))2, so you want (n+1)3 to be equal to the difference



(1+2++n+(n+1))2(1+2++n)2.



That’s a difference of two squares, so you can factor it as



(n+1)(2(1+2++n)+(n+1)).



To show that (1) is just a fancy way of writing (n+1)3, you need to show that




2(1+2++n)+(n+1)=(n+1)2.



Do you know a simpler expression for 1+2++n?



Work forward from this...



Okay so going forward.



Basically, Induction works like this, I'll use your question as an example:




Consider the case when n=1. If so, then we will have 13=12.



Now suppose that 13+23+33++n3=(1+2+3++n)2 for some nN.



Recall first that (1+2+3++n)=n(n+1)2 so we know 13+23+33++n3=(n(n+1)2)2.



Now consider 13+23+33++n3+(n+1)3=(n(n+1)2)2+(n+1)3=n2(n+1)2+4(n+1)34=((n+1)(n+2)2)2.



Hence, the statement holds for the n+1 case. Thus by the mathematical induction 13+23+33++n3=(1+2+3++n)2 for each nN.




Q.E.D


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