Proof of Math Induction: 1^2 + 2^2 + ... + n^2 = n(n+1)(2n+1)/6

  • Context: Undergrad 
  • Thread starter Thread starter logicaljoe
  • Start date Start date
  • Tags Tags
    Induction
Click For Summary
SUMMARY

The forum discussion focuses on proving the formula for the sum of squares, specifically the equation 1^2 + 2^2 + ... + n^2 = n(n + 1)(2n + 1)/6 using mathematical induction. The discussion outlines the base case P(1) and the inductive step P(k) to P(k + 1). Participants clarify the necessity of demonstrating that if P(k) holds, then P(k + 1) must also hold, emphasizing the importance of correctly applying the inductive hypothesis. The proof is derived from Spivak's Calculus, and contributors provide guidance on completing the proof.

PREREQUISITES
  • Understanding of mathematical induction
  • Familiarity with the formula for the sum of squares
  • Basic algebraic manipulation skills
  • Knowledge of natural numbers and sequences
NEXT STEPS
  • Study the principles of mathematical induction in detail
  • Explore the derivation of the sum of squares formula
  • Practice additional induction proofs to solidify understanding
  • Review Spivak's Calculus for further mathematical concepts
USEFUL FOR

Students studying calculus, educators teaching mathematical induction, and anyone interested in formal proofs in mathematics.

logicaljoe
Messages
2
Reaction score
0
Let P(n) be the formula

1^2 + 2^2 + ... + n^2 = n(n +1)(2n +1)/6

a. Write P, is it true?(1)


1^2 + 2^2 + ... + 1^2 = 1(1 +1)(2(1) +1)/6 =

1^2 + 2^2 + ... + 1^2 = 1(1 +1)(2 +1)/6

LHS = 1^2 = 1

RHS = 2 . 3/6 = 1 True


b. Write P(k)


Basis Step

n = k

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


c. Write P(k+1)


Inductive step

n = k then n = k + 1

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

Now this is where I get confused with induction writing the proof of the inductive step.


d. use mathematical induction to prove k then k+1, n>_1


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

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

RHS = (k+3)+1(2+1)/6 combining like terms
= (k+3)+(2+1)/6
= 3k+3/6
= 6k/6
= k
= 1

Is this the kind of working that is valid? it seems right to me.
 
Physics news on Phys.org
This seems like a homework question (it's a problem in Spivak's Calculus). If it is, for future reference, these threads should be placed in the homework help sections: https://www.physicsforums.com/forumdisplay.php?f=155

This seems overly complicated and doesn't appear quite right (you seem to be confused about the inductive step). For the inductive step, assuming the P(k) is true, we need to demonstrate that this implies that P(k + 1) is true. I can help you complete the proof from what you've got.

Proof: Let [tex]P(x)[/tex] be the statement that, for some natural number [tex]x[/tex],

[tex]1^2 + 2^2 + . . . + (x - 1)^2 + x^2 = \frac{x(x+1)(2x + 1)}{6}[/tex]

Clearly [tex]P(1)[/tex] is true since,

[tex]1^2 = \frac{1(2)(3)}{6} = \frac{6}{6} = 1[/tex]

Now, suppose that [tex]P(x)[/tex] is true for some arbitrary natural number [tex]k[/tex]. To complete the proof, we need only show that [tex]P(k)[/tex] implies [tex]P(k + 1)[/tex]. Therefore,

[tex]1^2 + 2^2 + . . . + (k - 1)^2 + k^2 + (k + 1)^2 = \frac{k(k+1)(2k + 1)}{6}+ (k + 1)^2[/tex]

Try and complete the proof from here.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
6
Views
3K
  • · Replies 9 ·
Replies
9
Views
4K