English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

I think i'm having a brain fart. Can someone give me the formula for this series?

1^2 + 2^2 + 3^2 + ... + (n-1)^2 + n^2

2006-08-18 09:09:06 · 5 answers · asked by ChainSmokeKansasFlashDance 4 in Science & Mathematics Mathematics

5 answers

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

PS: try google, before posting here

2006-08-18 09:17:19 · answer #1 · answered by Anonymous · 2 1

12

2006-08-18 09:28:04 · answer #2 · answered by laylaylana 1 · 0 1

There is a formula for the sum of the first n integers to any integral power, but its kind of involved. Here is a link with some formulas for low powers and the general formula http://mathworld.wolfram.com/FaulhabersFormula.html

2006-08-18 15:00:47 · answer #3 · answered by TA Timmy 2 · 0 0

The sum of 1² through n² is given by
S = (n/6)*(n+1)*(2n+1)

There's an elegent canonical form for sums of the first n integers raised to any integer power that involves the Bernoulli numbers, but I don't remember it off the top of my head. You should be able to find it on the web.


Doug

EDIT: Found it at http://www.mathpages.com/home/kmath279.htm

2006-08-18 09:19:15 · answer #4 · answered by doug_donaghue 7 · 1 1

Here's how to get any such formula: for the nth powers of the first m integers, assume a polynomial in m of degree n, with n unknown coefficients. Use n specific examples to get n equations in these coefficients, and solve them. This always works.

2006-08-18 10:05:24 · answer #5 · answered by Benjamin N 4 · 0 0

fedest.com, questions and answers