Proving (n+1) Sum of Squares with Induction

In summary, the conversation involves proving by induction that the sum of the first n "squares" is n(n+1)(2n+1)/6, and the conversation includes the base case and the induction case. The conversation also discusses the attempt at finding the solution and the need to work it out to the expression (k+1)(k+2)(2k+3)/6 and the importance of factoring out k+1.
  • #1
mikky05v
53
0

Homework Statement



Prove by induction that the sum of the first n "squares" is n(n+1)(2n+1)/6
In other words prove ([itex]\forall[/itex]n) P(n) where P (n) is [itex]\sum[/itex][itex]^{n}_{i=1}[/itex]¡[itex]^{2}[/itex]=[itex]\frac{n(n+1)(2n+1)}{6}[/itex]

Homework Equations


This is just not clicking for me right now. I have no idea if i am just epic failing at factoring or doing something else wrong.


The Attempt at a Solution


I did the base case and proved P (1) true easily enough.
Induction case: suppose P (k), then [itex]\sum[/itex][itex]^{k}_{i=1}[/itex]i[itex]^{2}[/itex]=[itex]\frac{k (k+1)(2k+1)}{6}[/itex] show P (k+1) is true, then ∑[itex]^{k+1}_{i=1}[/itex]i[itex]^{2}[/itex]=[itex]\frac{(k+1)(k+1)(2k+1)}{6}[/itex]

[itex]\sum[/itex][itex]^{k+1}_{i=1}[/itex]i[itex]^{2}[/itex]=[itex]\sum[/itex][itex]^{k}_{i=1}[/itex]i[itex]^{2}[/itex]+(k+1)[itex]^{2}[/itex]
=[itex]\frac{k (k+1)(2k+1)}{6}[/itex] + (k+1)[itex]^{2}[/itex]

Now i know i need to get itto work out to the [itex]\frac{(k+1)(k+1)(2k+3)}{6}[/itex] but i can't manage to get itto work out at all.
 
Physics news on Phys.org
  • #2
mikky05v said:

Homework Statement



Prove by induction that the sum of the first n "squares" is n(n+1)(2n+1)/6
In other words prove ([itex]\forall[/itex]n) P(n) where P (n) is [itex]\sum[/itex][itex]^{n}_{i=1}[/itex]¡[itex]^{2}[/itex]=[itex]\frac{n(n+1)(2n+1)}{6}[/itex]

Homework Equations


This is just not clicking for me right now. I have no idea if i am just epic failing at factoring or doing something else wrong.

The Attempt at a Solution


I did the base case and proved P (1) true easily enough.
Induction case: suppose P (k), then [itex]\sum[/itex][itex]^{k}_{i=1}[/itex]i[itex]^{2}[/itex]=[itex]\frac{k (k+1)(2k+1)}{6}[/itex] show P (k+1) is true, then ∑[itex]^{k+1}_{i=1}[/itex]i[itex]^{2}[/itex]=[itex]\frac{(k+1)(k+1)(2k+1)}{6}[/itex]

[itex]\sum[/itex][itex]^{k+1}_{i=1}[/itex]i[itex]^{2}[/itex]=[itex]\sum[/itex][itex]^{k}_{i=1}[/itex]i[itex]^{2}[/itex]+(k+1)[itex]^{2}[/itex]
=[itex]\frac{k (k+1)(2k+1)}{6}[/itex] + (k+1)[itex]^{2}[/itex]

Now i know i need to get it to work out to the [itex]\frac{(k+1)(k+1)(2k+3)}{6}[/itex] but i can't manage to get itto work out at all.

You mean you need to work it out to ##\frac{(k+1)(k+\color{red}2)(2k+3)}{6}##. You just need to continue with the algebra. Add up those two terms and simplify it by factoring out ##k+1##.
 
  • Like
Likes 1 person
  • #3
Oh gees you that's probably what my problem was, thank you sometimes you just need another set of eyes.
 

FAQ: Proving (n+1) Sum of Squares with Induction

What is the concept of "Proving (n+1) Sum of Squares with Induction"?

The concept of proving (n+1) sum of squares with induction involves using mathematical induction to prove that the sum of the first n+1 square numbers is equal to (n+1)(n+2)(2n+3)/6. This is a commonly used technique in mathematics to prove statements about sequences or equations.

What is mathematical induction?

Mathematical induction is a method of mathematical proof that is used to prove statements for all natural numbers. It involves proving a base case, usually n=1, and then showing that if the statement is true for n=k, then it is also true for n=k+1. This process is repeated until the statement is proven to be true for all natural numbers.

Why is mathematical induction used to prove the (n+1) Sum of Squares?

Mathematical induction is used to prove the (n+1) sum of squares because it allows us to prove that the formula holds true for all natural numbers, rather than just a select few cases. This is important because it gives us a more complete understanding of the relationship between the sum of squares and natural numbers.

What is the base case for proving the (n+1) Sum of Squares with induction?

The base case for proving the (n+1) sum of squares is typically n=1. This means that we need to show that the formula holds true for when n=1. In this case, the formula simplifies to 1, which is true for the sum of the first square number.

Can the (n+1) Sum of Squares be proven using methods other than induction?

Yes, there are other methods that can be used to prove the (n+1) sum of squares, such as direct proof or proof by contradiction. However, mathematical induction is a commonly used method that is specifically designed for proving statements about sequences or equations, making it a useful tool for proving the (n+1) sum of squares.

Similar threads

Replies
15
Views
2K
Replies
6
Views
936
Replies
6
Views
2K
Replies
12
Views
4K
Replies
5
Views
877
Replies
3
Views
1K
Back
Top