Inductive Proof on Well Known Sum

  • Thread starter Thread starter Shackman
  • Start date Start date
  • Tags Tags
    Proof Sum
Click For Summary

Homework Help Overview

The discussion revolves around proving the equation (1+2+...+n)^2 = 1^3 + 2^3 + ... + n^3 using mathematical induction. Participants are exploring the structure of the proof and the validity of the proposed equation.

Discussion Character

  • Exploratory, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants discuss the typical structure of inductive proofs and express uncertainty about how to apply it to this specific equation. There are attempts to clarify the sum of integers and the sum of squares, with some questioning the correctness of the expressions used.

Discussion Status

The discussion is ongoing, with participants providing insights and questioning the assumptions behind the proof structure. Some guidance has been offered regarding the left-hand side of the equation, but there is no explicit consensus on the inductive approach yet.

Contextual Notes

Participants are grappling with the correct formulation of the inductive proof and the implications of the equation being discussed. There is mention of the binomial theorem as a potential tool for understanding the proof structure.

Shackman
Messages
22
Reaction score
2

Homework Statement


Use induction to prove the equation
(1+2+...+n)^2 = 1^3 + 2^3 + ... + n^3

2. The attempt at a solution
I've done three inductive proofs previous to this one where I showed that the equation was true for some case (usually n=1), then assumed it was true for n, and proved it was true for n+1. This proof doesn't seem to fit that form though because for the other proofs I could write it as the right hand side of the equation (since it's assumed that it is true for n) plus the right hand side of the equation when n+1 is plugged in. But in this case..

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

So, I guess I haven't done a proof like this and could use a nudge in the right direction..
 
Physics news on Phys.org
What is \sum^{n}_{i=1} i?
 
n(n+1)/2

In an effort to see where you're going with this, I thought I'd do the same for i^2 and got

n^2(n^2 + 1)/4

Either this isn't correct or I'm not sure where you're headed.
 
Last edited:
Shackman said:
n(n+1)/2

In an effort to see where you're going with this, I thought I'd do the same for i^2 and got

n^2(n^2 + 1)/4

Either this is correct or I'm not sure where you're headed.

Well, the second part isn't correct at all (\sum^{n}_{i=1} i^2 = \frac{n(n+1)(2n+1)}{6}), but that wasn't really my point. Look at the left hand side of your proposed equality.
 
Alright, so the left hand side is equal to ((n(n+1))/2)^2 or (n^4 +2n^3 +n^2)/4...
 
So prove that (n(n+1)/2)^2 is equal to the right hand side. Much easier to verify.
 
That is a proof of the equality but it isn't inductive though. Inductive proofs always follow the form:
1) prove the base case
2) write the induction hypothesis for the case of n (assume its true basically)
3) use 2) to prove for n+1
 
Shackman said:
(1+2+...+n+(n+1))^2 != (1+2+...+n)^2 + (n+1)^2
As you say, that is not the correct formula for the square of two things. Fortunately, you know the right formula for the square of two things... (right?)
 
You're talking about the binomial theorem right?
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K