Induction Method for Proving 1² + 2² +...+n² = (1/6)n(n+1)(2n+1)

  • Thread starter Thread starter Benny
  • Start date Start date
  • Tags Tags
    Induction
Click For Summary

Homework Help Overview

The discussion revolves around the use of mathematical induction to prove the formula for the sum of the squares of the first n natural numbers, specifically the equation 1² + 2² + ... + n² = (1/6)n(n+1)(2n+1). Participants are exploring the necessary steps and clarity required in presenting the proof.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • The original poster outlines their approach to proving the statement using induction, detailing the base case and the inductive step. They question whether their final expression sufficiently demonstrates the induction step. Other participants discuss the necessity of explicitly showing the replacement of n with (k + 1) in the final expression.

Discussion Status

Participants are actively engaging with the original poster's method, providing feedback on the clarity and completeness of the proof steps. There is a focus on ensuring that the induction step is clearly articulated, with some participants emphasizing the importance of showing the equivalence of the formulas for n and (n + 1).

Contextual Notes

Some participants mention the need to verify the base case for n = 1 as part of the induction process, indicating a common understanding of the structure of induction proofs.

Benny
Messages
577
Reaction score
0
Hello, I am wondering how explicitly a result needs to be shown in induction questions.

For example prove that 1² + 2² +...+n² = (1/6)n(n+1)(2n+1) where n is a natural number. Here is what I did.

1. P(n) is the statement that the sum of the squares of the first n positive integers is (1/6)n(n+1)(2n+1). Show P(2) is true.

Edit: Fixed first sentence of the above paragraph.

2. Assume P(k) is true where k is a positive integer.

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


3. Show that P(k+1) is true.

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

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

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

[tex] = \frac{1}{6}\left( {k + 1} \right)\left[ {2k^2 + 7k + 6} \right][/tex]

[tex] = \frac{1}{6}\left( {k + 1} \right)\left( {k + 2} \right)\left( {2k + 3} \right)[/tex]

Is it fine up to the point above? Or do I need to also have the following?

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

Any help appreciated.
 
Last edited:
Physics news on Phys.org
your last step is absolutely nessisory (sry, don't know how to spell this word)... The reason is: you must show in the P(n+1) case, your formulas is the exactly the same as P(n) with n replaced by (n+1)...
 
first you must show it is true when n = 1

which is easy enough, 1 = (1/6)*1*2*3

then do n+1 as you did

I personally would write that last line you wrote to make it very clear that n was replaced with K+1
 
Cool, thanks for the help vincent and spectre.
 

Similar threads

  • · Replies 21 ·
Replies
21
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
49
Views
4K
Replies
7
Views
1K
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
903
Replies
1
Views
2K
Replies
4
Views
3K
  • · Replies 7 ·
Replies
7
Views
1K