This is what I've been able to do:
Base case: n=1
L.H.S:13=1
R.H.S:(1)2=1
Therefore it's true for n=1.
I.H.: Assume that, for some k∈N, 13+23+...+k3=(1+2+...+k)2.
Want to show that 13+23+...+(k+1)3=(1+2+...+(k+1))2
13+23+...+(k+1)3
=13+23+...+k3+(k+1)3
=(1+2+...+k)2+(k+1)3 by I.H.
Annnnd I'm stuck. Not sure how to proceed from here on.
Answer
HINT: You want that last expression to turn out to be (1+2+…+k+(k+1))2, so you want (k+1)3 to be equal to the difference
(1+2+…+k+(k+1))2−(1+2+…+k)2.
That’s a difference of two squares, so you can factor it as
(k+1)(2(1+2+…+k)+(k+1)).
To show that (1) is just a fancy way of writing (k+1)3, you need to show that
2(1+2+…+k)+(k+1)=(k+1)2.
Do you know a simpler expression for 1+2+…+k?
(Once you get the computational details worked out, you can arrange them more neatly than this; I wrote this specifically to suggest a way to proceed from where you got stuck.)
No comments:
Post a Comment