Proving the Sum of Cubes Formula Using Induction

  • Thread starter Thread starter EbolaPox
  • Start date Start date
  • Tags Tags
    Induction Proof
Click For Summary

Homework Help Overview

The discussion revolves around proving the formula for the sum of cubes, specifically that the sum of the cubes of the first k natural numbers equals the square of the sum of the first k natural numbers. Participants are exploring proof by induction as a method to establish this relationship.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the initial steps of proof by induction, including checking the base case and assuming the inductive hypothesis. There is a focus on expressing the sum of the first k natural numbers and how it relates to the proof. Some participants suggest using known formulas to simplify the proof process.

Discussion Status

The discussion is active, with participants providing feedback and guidance on the induction process. Some have confirmed the correctness of approaches taken, while others emphasize the importance of using established formulas to facilitate the proof. There is acknowledgment of the complexity involved in the problem.

Contextual Notes

Participants mention the need for explicit expressions for sums and the challenges of applying induction effectively. There is a reference to using specific textbooks for practice, indicating a structured approach to learning induction.

EbolaPox
Messages
99
Reaction score
1
I'm new to Proof by Induction. I've gotten a few so far, but this one has eluded me for some reason.

" Prove that 1^3 + 2^3 + 3^3...k^3 = (1 +2 + 3...k)^2"

I checked for n =1 and , yes it does work. So, I assumed A(k) is true, so I'll try for A(k+1)

I started assuming A(k) and added (k+1)^3 to both sides (as this would be the next term

1^3 + 2^3 ... k^3 + (k+1)^3 = (1 + 2... k)^2 + (k+1)^3 = (1 + 2...k + (k + 1) )^2

So, I must now show that

(1 +2 + ... k + (k+1))^2 = (1 + 2 + ...k)^2 + (k+1)^3
Does this look right so far?

Unfortunately, I haven't thought of a way to demonstrate this yet. If I prove that statement true, I prove the original assertion. Should I try proving that statement with induction or something...?
 
Physics news on Phys.org
There was a thread about this not too long ago, but I can't find it. I think you'll have to use the explicit expression for the sum 1+2+...+k. Do you know what this is? If not, you can find it by thinking about the following figures:

#0

#00
##0

#000
##00
###0

...
 
Last edited:
Oh! Are you suggesting express
1 + 2 + 3 ... k = k(k+1)/2. I'll prove that at the end, but I'll assume that fact is true and use it. (I proved that one earlier, but I'll post a proof of that at the end to make sure it is right also.) . I didn't even think to use that! Well, using that
(1 +2 + ... k + (k+1))^2 = (1 + 2 + ...k)^2 + (k+1)^3

goes down to
((k+1)(k+2) /2 )^2 = ((k+1)k/2)^2 + (k+1)^3

Now, expanding these lovely algebraic nightmares leads me to

(1/4) (k^4 + 6k^3 + 13k^2 + 8k + 4) = (1/4) (k^4 + 2k^3 + k^2) + (k+1)^3

Multiplying through by four, and then subtracting like terms leads me to

4k^3 + 12k^2 + 12k+4 = 4(k+1)^3
Arithmetic leads me to
k^3 +3k^2 + 3k +1 = (k+1)^3
Which is true! Thank you very much!

Now, I should prove the statement I used above \sum_1^k i = k(k+1)/2

So, I start about by Checking A(1) (True). I assume A(k) is true. And go to show k+1 is true. Adding k+1 to both sides leads to

1 +2 + 3 ... k + (k+1) = k(k+1)/2 + (k+1) = (k+1)(k+2) /2
Working with the middle and right hand side, I can show those are equal and I will prove it.
So, Expanding leads to

(1/2) (k^2 + k) + (k+1) = (k^2 +3k + 2) /2<br /> <br /> k^2 + k + 2(k+1) = k^2 + 3k + 2<br /> k^2 + 3k + 2 = k^2 + 3k + 2<br /> <br /> Q.E.D.<br /> <br /> Thank you very much for the hint! That made it make complete sense. I didn&#039;t think about using an idea I proved earlier. Does it look logical/correct? Thanks!
 
Yes, that looks right. The reason you have to use that result is that when you expand the expression you get after evaluating at k+1 you have:

((1+2+...+k) + (k+1))^2 = (1+2+...+k)^2 + 2 (1+2+..+k)(k+1) +(k+1)^2

You can apply the induction to handle the first term, but you can't do anything with the second term unless you know the expression for that sum. This is essentially two problems in one, finding 1+2+...+k and 13+23+...k3.
 
Yeah, I should have realized that the question would require more than a direct attack. I've been using Apostol for problem sets to practice Induction. It can be tricky at times. Glad to know I finally got it though. Thank you once again for helping :)
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 22 ·
Replies
22
Views
2K