How Do You Derive the Formula for the Sum of Consecutive Squares?

  • Thread starter Thread starter sitedesigner
  • Start date Start date
  • Tags Tags
    Squares
Click For Summary

Homework Help Overview

The original poster seeks to derive a formula for the sum of the squares of the first n consecutive integers, specifically expressed as 1^2 + 2^2 + 3^2 + ... + n^2. They mention a known formula for the sum of consecutive numbers and request a detailed explanation suitable for their professor's requirements.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Some participants provide a formula for the sum of squares and suggest proving it by induction, while others express confusion about the concept of induction and request clarification on how the formula was derived. There are also mentions of using sequences of differences as a potential approach.

Discussion Status

The discussion includes various lines of reasoning and attempts to clarify the derivation process. Participants are exploring different methods and seeking understanding rather than reaching a consensus on a single approach.

Contextual Notes

Participants note the need for a detailed derivation rather than a proof, indicating a focus on understanding the underlying concepts. There is mention of external resources like Dr. Math for additional explanations.

sitedesigner
Messages
20
Reaction score
0
ok, i need to derive a formula that will add the consecutive squares of n numbers.

for example [tex]1^2 + 2^2 + 3^2 + ... + (n-2)^2 + (n-1)^2 + (n)^2[/tex]

I have worked on this problem for quite some time and haven't been able to come up with anything.

I do know that the sum of consecutive numbers starting at one is

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

A very detailed explanation would be excellent as that's what my professor wants.
 
Last edited:
Physics news on Phys.org
[tex]S(n) = \frac{n(n+1)(2n+1)}{6}[/tex].

You should be able to prove it by induction.
 
what's induction?

can you explain how you came to the answer?
 
inductions like this...
prove it works for 1
assume it works for n
and prove it works for n+1
 
(n-1)^2-n^2-1/-2=t
s=summation of t
we will get s
 
Dr. Math has answered a lot of questions concerning the sum of consecutive squares here. He explains that there are several ways to derive the formula.
 
ok, so i understand what inductions are, but can you explain how you got to the proof for the sum of the sequence of [tex]n^2[/tex]

*** edit *** i just posted the above before reading the previous 3 posts. i'll go ahead and read dr math's explanation and then come back to this :)
 
daveed said:
inductions like this...
prove it works for 1
assume it works for n
and prove it works for n+1


i need to derive the forumula... not prove it :)
 
sitedesigner said:
i need to derive the forumula... not prove it :)

Sequence of Differences. Search here or Dr. Math, there are explanations at both places.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
Replies
15
Views
2K
Replies
14
Views
5K
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
12
Views
5K
  • · Replies 3 ·
Replies
3
Views
4K