Can You Prove the Sum of Cubes Equals the Square of the Sum?

  • Context: Undergrad 
  • Thread starter Thread starter dleacock
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary

Discussion Overview

The discussion centers around proving the identity that the sum of the cubes of the first n natural numbers equals the square of the sum of the first n natural numbers, specifically expressed as 1^3 + 2^3 + 3^3 + ... + n^3 = (1 + 2 + 3 + ... + n)^2. Participants explore various approaches to this proof, including mathematical induction and algebraic manipulation.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Homework-related

Main Points Raised

  • One participant outlines their approach to proving the identity using the formula for the sum of the first n natural numbers, S_n = n(n+1)/2, and attempts to derive the result through algebraic manipulation.
  • Another participant suggests that the proof should utilize mathematical induction, detailing the base step and inductive step required for such a proof.
  • Concerns are raised about the validity of certain algebraic steps, particularly regarding the manipulation of square roots and the assumption that certain expressions can be simplified directly.
  • A later reply acknowledges the potential error in squaring terms without justification and expresses a willingness to revisit the proof.
  • Further clarification is provided on how to express the inductive hypothesis and what needs to be shown for k + 1.

Areas of Agreement / Disagreement

Participants generally agree on the need for a structured proof, particularly through induction, but there is no consensus on the correctness of the initial algebraic manipulations or the approach taken by the first participant.

Contextual Notes

Some participants express uncertainty about specific algebraic steps, particularly regarding the manipulation of square roots and the conditions under which certain identities hold. There are unresolved mathematical details in the proposed proofs.

dleacock
hey everyone,
I recently bought the the Dover Series book on Number Theory, and the 2nd example on page 5 asks your to prove
[tex]1^3 + 2^3 + 3^3 ... + n^3 = (1 + 2 + 3...)^2[/tex]

Now, we've already proved that [tex]S_n = \frac{n(n+1)}{2}[/tex]

So here's how I proved it...
[tex] (S_n)^2 = (\frac{n(n+1)}{2})^2[/tex]

before we proved how [tex]S_k+1 = S_k + (k + 1)[/tex]

Which lead me to...
[tex]\frac{1}(k+1)^2((k+1)+1)^2{4} + (k+1)^2[/tex]
[tex]= \sqrt{\frac{(k+1)^2((k+1)+1)^2}{4} + (k+1)^2}[/tex]
[tex]= \frac{(k+1)((k+1)+1)}{2} + (k+1)[/tex]
therefor...
[tex]S_k+1 = Sk + (k+1)[/tex]


Now I'm worried that I didnt really solve anything. I'm totally knew at this, and I'm open to criticism and help, just be kind :)
(ps.. this is my first time posting formulas, hopefully I did it right)


Thanks
dleacock
 
Physics news on Phys.org
just a repost to clean up the math...[tex]\frac{1}{4}(k+1)^2((k+1)+1)^2 + (k+1)^2[/tex]

[tex]= \sqrt{\frac{(k+1)^2((k+1)+1)^2}{4} + (k+1)^2}[/tex]

[tex]= \frac{(k+1)((k+1)+1)}{2} + (k+1)[/tex]
 
I don't own the book, but I looked at the pages on amazon, and it looks like you want to prove it using mathematical induction. This usually works in this way.

Proof:
Base Step (here, it will be n = 1)

Inductive Step Assume it is true for some k, and then show that it is true for k+1.
QED.Now you don't have to use induction, but it is what I think they want you to use. So first you should prove that the statement is true for n = 1, or k = 1. Meaning that if you plug 1 into the formula you will get the same thing, which is true.
[tex]1^3 = (1)^2[/tex]
[tex]=> 1 = 1[/tex]

So then do the inductive hypothesis.

You would say that the statement is true for some k, then show that it is true for k + 1.

This would mean that you would want to show that:

[tex]1^3 + 2^3 + 3^3 ... + k^3 + (k+1)^3 = (1 + 2 + 3 + ... + k + (k+1) )^2[/tex]
Using the fact that the statement is true for k.

Meaning, prove the previous statement with the fact that: [tex]1^3 + 2^3 + 3^3 ... + k^3 = (1 + 2 + 3 + ... + k)^2[/tex]

--------

dleacock said:
just a repost to clean up the math...[tex]\frac{1}{4}(k+1)^2((k+1)+1)^2 + (k+1)^2[/tex]

[tex]= \sqrt{\frac{(k+1)^2((k+1)+1)^2}{4} + (k+1)^2}[/tex]

[tex]= \frac{(k+1)((k+1)+1)}{2} + (k+1)[/tex]

I am not sure what you were doing here. But you can't just take the square root of something out of nowhere, also [tex]\sqrt{ a^2 + b^2 } \neq a + b[/tex] except in a few cases, so that is not allowed.
 
Last edited:
yeah, that's exactly what I thouhgt the problem was. I just squared it out of nowhere. oh well, back to work I go. thanks for the response and the tip!
 
mattmns said:
You would say that the statement is true for some k, then show that it is true for k + 1.

This would mean that you would want to show that:

[tex]1^3 + 2^3 + 3^3 ... + k^3 + (k+1)^3 = (1 + 2 + 3 + ... + k + (k+1) )^2[/tex]
Using the fact that the statement is true for k.

Meaning, prove the previous statement with the fact that: [tex]1^3 + 2^3 + 3^3 ... + k^3 = (1 + 2 + 3 + ... + k)^2[/tex]

--------
In other words show, [tex]k^{2}(k+1)^{2} - k^{2}(k-1)^{2} = 4k^{3}[/tex]
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 20 ·
Replies
20
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K