Show that when n is even,
I don't know how to approach this question, the 'when n is even' is throwing me, and even without that part, I think I'd struggle. How should I begin?
Follow Math Help Forum on Facebook and Google+
Did you try proving it by induction? It seems fit for this kind of problem.
No, I didn't try induction. The reason is that this chapter is before induction in the textbook, and we didn't cover induction in class untill after the work was set. I suppose it's worth a try though.
Did you cover the formula for summing cubes ?
Yes Traveller, if by that you mean :
But I still can't see a way of applying it to this question specifically.
Last edited by Quacky; September 29th 2010 at 11:14 AM.
Originally Posted by Quacky Yes traveller, if by that you mean :
But I still can't see a way of applying it to this question specifically. You can write each odd number as 2k-1 and each even number as 2k and then apply this formula. Then you can add and subtract suitable terms to bring it to the required form.
I'll try that now.
It seems I am still unable to solve this problem. Would you elaborate on your post above slightly? I've clearly misunderstood your method.
for n even.
Originally Posted by Quacky It seems I am still unable to solve this problem. Would you elaborate on your post above slightly? I've clearly misunderstood your method.
Sorry, I was wrong.
HallsofIvy is correct. You don't need anything else to prove the formula.
Could you please tell me the name of the book from which you got the sum you posted above ? Thanks a lot .....
Originally Posted by HallsofIvy
for n even. Yeah, I see this now! From here, I simply have to take out a factor of from the last part of the second expression, which gives:
Which can then be summarised by the third expression which I am asked to show in the question.
Thanks for the helpful reply.