Search

## Search Loci: Convergence:

Keyword

Random Quotation

I mean the word proof not in the sense of the lawyers, who set two half proofs equal to a whole one, but in the sense of a mathematician, where half proof = 0, and it is demanded for proof that every doubt becomes impossible.

In G. Simmons, Calculus Gems, New York: McGraw Hill Inc., 1992.

See more quotations

# Sums of Powers of Positive Integers

## Pierre de Fermat (1601-1665), France

Pierre de Fermat, who lived most of his life in Toulouse, France, was a lawyer who spent his spare time doing mathematics.  Like Harriot, he never published any of his work, but he did share hints of it in letters to Marin Mersenne, Gilles Persone de Roberval, and others.  Fermat is famous for stating, but not proving, Fermat’s Last Theorem, which finally was proved by Andrew Wiles in 1994.

In letters to Mersenne and Roberval in 1636, Fermat stated the following results about the generalized triangular numbers (Mahoney, pp. 230-231):

The last side multiplied by the next greater makes twice the triangle.  The last side multiplied by the triangle of the next greater side makes three times the pyramid.  The last side multiplied by the pyramid of the next greater side makes four times the triangulotriangle.  And so on by the same progression in infinitum.

We have seen the triangular numbers.  The triangular numbers 1, 3, 6, 10, 15, 21, … are sums of successive positive integers; the pyramidal numbers 1, 4, 10, 20, 35, 56, … are sums of successive triangular numbers; the triangulotriangular numbers (as Fermat called them) 1, 5, 15, 35, 70, 126, … are sums of successive pyramidal numbers; and so on.  For example, the fourth triangular number, 10, is given by 10 = 1 + 2 + 3 + 4, and the third pyramidal number, 10, is given by 10 = 1 + 3 + 6.  If we denote the nth triangular number by $$T_n,$$ the nth pyramidal number by $$P_n,$$ and the nth triangulotriangular number by $$TT_n,$$ then we can translate Fermat’s first three sentences to the following three equations in our notation:  $$n(n + 1) = 2T_n,\ nT_{n + 1} = 3P_n, \ {\rm and}\ nP_{n + 1} = 4TT_n.$$

The first equation gives us the formula, $$T_n = {{n(n + 1)} \over 2}$$

for the nth triangular number or, equivalently, the sum of the first n positive integers.  This result, substituted into the second equation, then yields $$n\cdot{(n + 1)(n + 2) \over 2} = 3P_n\ {\rm or}\ P_n = {n(n + 1)(n + 2)\over 2 \cdot 3}$$

for the nth pyramidal number.  Finally, this last result, substituted into the third equation, gives $$TT_n = {{n(n + 1)(n + 2)(n + 3)} \over {2 \cdot 3 \cdot 4}}$$

for the nth triangulotriangular number.

In the same letters, Fermat gave two hints about sums of powers of integers.  First, he wrote the following formula for the sum of the fourth powers of the first n positive integers (Mahoney, p. 231).

If you multiply four times the greatest number increased by two by the square of the triangle of numbers, and from the product you subtract the sum of the squares of the individual numbers, five times the sum of the fourth powers will result.

Translating Fermat’s words into our modern notation, we have

$$(4n + 2)\,T_n ^2 - (1^2 + 2^2 + \cdots + n^2 ) = 5(1^4 + 2^4 + \cdots + n^4 ),$$

or, substituting formulas for $$T_n$$ and for $$1^2 + 2^2 + \cdots + n^2,$$

$$(4n + 2)\,\left( {{{n(n + 1)} \over 2}} \right)^2 - {{n(n + 1)(2n + 1)} \over 6} = 5(1^4 + 2^4 + \cdots + n^4 ).$$

Solving for $$1^4 + 2^4 + \cdots + n^4,$$

we get

$$1^4 + 2^4 + \cdots + n^4 = {{n(n + 1)(2n + 1)\left( {2\, \cdot {{n(n + 1)} \over 4} - {1 \over 6}} \right)} \over 5} = {{n(n + 1)(2n + 1)(3n^2 + 3n - 1)} \over {30}}$$

$$= {{6n^5 + 15n^4 + 10n^3 - n} \over {30}} = {{n^5 } \over 5} + {{n^4 } \over 2} + {{n^3 } \over 3} - {n \over {30}}.$$

It would make sense that Fermat would report his formula for the sum of fourth powers, because it would be the first such formula he thought was unknown (Mahoney, p. 232).  In his letter to Roberval, Fermat explained his use for the formulas described above (Mahoney, p. 231).

All these propositions, however pretty in themselves, have aided me in the quadrature that I’m pleased you value.

Fermat’s biographer, Michael Mahoney, has argued that, like Archimedes, Fermat’s results in “quadrature” would have required that he have verbal formulas for sums of powers of integers (Mahoney, pp. 231-233).  More specifically, Fermat’s success in computing the definite integral of a function of the form cxk would have required that he describe a formula for the sum of the kth powers of the first n positive integers.  In reality, an inequality like that of Archimedes or a limit involving only terms with exponent k + 1 would have sufficed, so we cannot say with certainty that Fermat had formulas beyond the one he described for the sum of fourth powers.

Based on the evidence above, Mahoney surmised that Fermat used the following method to derive sums of powers (Mahoney, pp. 231-232).  We will assume that Fermat already knew or had derived formulas for the sums of the first n positive integers and of their squares and cubes, and now wished to obtain a formula for the sum of the fourth powers of the first n positive integers.  The generalized triangular numbers after the triangulotriangular numbers are sometimes called triangulopyramidal numbers.  If $$TP_n$$ is the nth triangulopyramidal number, then, by definition, $$TP_n$$ is the sum of the first n triangulotriangular numbers; that is, $$TP_n = \sum_{k = 1}^n {TT_k }.$$

According to Fermat’s first result above and our reasoning there, $$TP_n = {{n(n + 1)(n + 2)(n + 3)(n + 4)} \over {2 \cdot 3 \cdot 4 \cdot 5}}.$$

Using our formula for $$TT_n,$$ the defining equation then becomes $${{n(n + 1)(n + 2)(n + 3)(n + 4)} \over {2 \cdot 3 \cdot 4 \cdot 5}} = \sum_{k = 1}^n {{{k(k + 1)(k + 2)(k + 3)} \over {2 \cdot 3 \cdot 4}}},$$

or $${{n(n + 1)(n + 2)(n + 3)(n + 4)} \over {2 \cdot 3 \cdot 4 \cdot 5}} = \sum_{k = 1}^n {{{k^4 + 6k^3 + 11k^2 + 6k} \over {24}}}.$$

Solving for the sum of the fourth powers,  we obtain $${1 \over {24}}\sum_{k = 1}^n {k^4 } = {{n(n + 1)(n + 2)(n + 3)(n + 4)} \over {120}} - {1 \over 4}\sum_{k = 1}^n {k^3 } - {{11} \over {24}}\sum_{k = 1}^n {k^2 } - {1 \over 4}\sum_{k = 1}^n k .$$

If we now substitute our formulas for the sums of the first n positive integers and of their squares and cubes, multiply both sides of the equation by 24, and simplify, we will obtain one (or all) of the formulas for the sums of fourth powers given above.

Harriot actually wrote symbolic formulas like those labeled $$T_n,$$ $$P_n,$$ $$TT_n,$$ and $$TP_n$$ (Harriot, folios 108-109; or Beery and Stedall, pp. 58-61), but, as we have seen, he used another method to derive his formulas for sums of powers of integers.  This method, explained in detail above, was described more briefly in the book by Beery and Stedall (pp. 19-20).

Exercise 15: Show how to write Fermat’s formula for the sum of the first n fourth powers as a (rational) multiple of n(n + 1)(2n + 1)/6.

Exercise 16:  Write Fermat’s formula for the sixth order triangular numbers, 1, 7, 28, 84, … in words and in symbols, perhaps denoting the nth sixth order triangular number as Tn6Note:  The second order triangular numbers are the triangular numbers 1, 3, 6, 10, …; the third order triangular numbers the pyramidal numbers 1, 4, 10, 20, …; the fourth order triangular numbers the triangulotriangular numbers 1, 5, 15, 35, …; and the fifth order triangular numbers the triangulopyramidal numbers 1, 6, 21, 56, ….

Exercise 17:  Use your formula for the nth sixth order triangular number Tn6 from Exercise 16, along with the formula for the nth triangulopyramidal number TPn (or Tn5) and the four formulas already derived for the sums of the first n positive integers and their squares, cubes, and fourth powers, to derive a formula for the sum of the first n fifth powers.

For solutions to these exercises, click here.

Pages: | 1 |  2 |  3 |  4 |  5 |  6 |  7 |  8 |  9 |  10 |  11 |  12 |  13 |  14 |  15 |  16 |  17 |  18 |  19 |  20 |  21 |

Beery, Janet, "Sums of Powers of Positive Integers," Loci (February 2009), DOI: 10.4169/loci003284

### Karaji's solution

I just wonder if the Karaji Generalized his method of solutions? Is there any information about that. For instance did he found sum of fifth powers?

Al-Karaji and higher powers by Janet Beery (posted: 01/20/2010 )
My understanding is that there is no evidence that al-Karaji derived a "formula" for the sum of the fourth, fifth, or higher powers. His justification for his formula for the sum of the cubes was ingenious but al-Haytham's idea seems more readily generalizable.

### On the symmetry of the resulting polynomials

== Conjecture == It would be interesting to know that * sums of odd powers can be factored as a polynomial on (n Ã¢â€¹â€¦ (n + 1) / 2) and is therefore symmetric with the center at (Ã¢Ë†â€™Ã‚Â½); and that * sums of even powers can be factored to a function like above multiplied by (2 Ã¢â€¹â€¦ n + 1) and therefore antisymmetric with the center at (Ã¢Ë†â€™Ã‚Â½). It would be interesting to know whether any rule concerning the polynomials thus obtained.

#### Replies:

Re: On the symmetry of the resulting polynomials by Rick Mabry (posted: 12/30/2011 )
Christopher, see the following article, especially section 3 (Faulhaber Polynomials). Although my browsers don't let me view the code you pasted, I think the article confirms some of what you're getting at (some of which might be gleaned from page 8 of the article we're viewing). A. F. Beardon, Sums of Powers of Integers, American Mathematical Monthly, Vol. 103, No. 3 (Mar., 1996), pp. 201-213.

More about symmetry: by Janet Beery (posted: 01/03/2013 )
The most succinct, beautiful, and perhaps even historically plausible explanation I've seen for the symmetry of the Faulhaber polynomials about -1/2 was in a recent article by Reuben Hersh in the College Math Journal 43:4 (Sept. 2012), pp. 322-4. His approach? Extend the polynomials to negative values of n.