Squared triangular number

History

Nicomachus, at the end of Chapter 20 of his Introduction to Arithmetic, pointed out that if one writes a list of the odd numbers, the first is the cube of 1, the sum of the next two is the cube of 2, the sum of the next three is the cube of 3, and so on. He does not go further than this, but from this it follows that the sum of the first n cubes equals the sum of the first \tfrac{n(n+1)}{2} odd numbers, that is, the odd numbers from 1 to n(n+1)-1. The average of these numbers is obviously \tfrac{n(n+1)}{2}, and there are \tfrac{n(n+1)}{2} of them, so their sum is \left(\tfrac{n(n+1)}{2}\right)^2.

Many early mathematicians have studied and provided proofs of Nicomachus's theorem. claims that "every student of number theory surely must have marveled at this miraculous fact". finds references to the identity not only in the works of Nicomachus in what is now Jordan in the first century CE, but also in those of Aryabhata in India in the 5th century, and in those of Al-Karaji in Persia. mentions several additional early mathematical works on this formula, by Al-Qabisi (10th century Arabia), Gersonides (, France), and Nilakantha Somayaji (, India); he reproduces Nilakantha's visual proof.

Numeric values; geometric and probabilistic interpretation

The sequence of squared triangular numbers is These numbers can be viewed as figurate numbers, a four-dimensional hyperpyramidal generalization of the triangular numbers and square pyramidal numbers.

As observes, these numbers also count the number of rectangles with horizontal and vertical sides formed in an n\times n grid. For instance, the points of a 4\times 4 grid (or a square made up of three smaller squares on a side) can form 36 different rectangles. The number of squares in a square grid is similarly counted by the square pyramidal numbers.

The identity also admits a natural probabilistic interpretation as follows. Let X,Y,Z,W be four integer numbers independently and uniformly chosen at random between 1 and n. Then, the probability that W is the largest of the four numbers equals the probability that Y is at least as large as X and that W is at least as large as Z. That is, \Pr[\max(X,Y,Z)\le W]=\Pr[X\le Y\wedge Z\le W]. For any particular value of W, the combinations of X, Y, and Z that make W largest form a cube 1\le X,Y,Z\le n so (adding the size of this cube over all choices of W}) the number of combinations of X,Y,Z,W for which W is largest is a sum of cubes, the left hand side of the Nichomachus identity. The sets of pairs (X,Y) with X\le Y and of pairs (Z,W) with Z\le W form isosceles right triangles, and the set counted by the right hand side of the equation of probabilities is the Cartesian product of these two triangles, so its size is the square of a triangular number on the right hand side of the Nichomachus identity. The probabilities themselves are respectively the left and right sides of the Nichomachus identity, normalized to make probabilities by dividing both sides by n^4.

Proofs

gives a particularly simple derivation, by expanding each cube in the sum into a set of consecutive odd numbers. He begins by giving the identity n^3 = \underbrace{\left(n^2-n+1\right) + \left(n^2-n+1+2\right) + \left(n^2-n+1+4\right)+ \cdots + \left(n^2+n-1\right)}{n \text{ consecutive odd numbers}}. That identity is related to triangular numbers T_n in the following way: n^3 =\sum {k=T{n-1}+1}^{T{n}} (2 k-1), and thus the summands forming n^3 start off just after those forming all previous values 1^3 up to (n-1)^3. Applying this property, along with another well-known identity: n^2 = \sum_{k=1}^n (2k-1), produces the following derivation: \begin{align} \sum_{k=1}^n k^3 &= 1 + 8 + 27 + 64 + \cdots + n^3 \ &= \underbrace{1}{1^3} + \underbrace{3+5}{2^3} + \underbrace{7 + 9 + 11}{3^3} + \underbrace{13 + 15 + 17 + 19}{4^3} + \cdots + \underbrace{\left(n^2-n+1\right) + \cdots + \left(n^2+n-1\right)}{n^3} \ &= \underbrace{\underbrace{\underbrace{\underbrace{1}{1^2} + 3}{2^2} + 5}{3^2} + \cdots + \left(n^2 + n - 1\right)}{\left( \frac{n^{2}+n}{2} \right)^{2}} \ &= (1 + 2 + \cdots + n)^2 \ &= \left(\sum{k=1}^n k\right)^2. \end{align}

obtains another proof by summing the numbers in a square multiplication table in two different ways. The sum of the ith row is i times a triangular number, from which it follows that the sum of all the rows is the square of a triangular number. Alternatively, one can decompose the table into a sequence of nested gnomons, each consisting of the products in which the larger of the two terms is some fixed value. The sum within each gnomon is a cube, so the sum of the whole table is a sum of cubes.

In the more recent mathematical literature, provides a proof using summation by parts. uses the rectangle-counting interpretation of these numbers to form a geometric proof of the identity. Stein observes that it may also be proved easily (but uninformatively) by induction, and states that provides "an interesting old Arabic proof". provides a purely visual proof, provide two additional proofs, and gives seven geometric proofs.

Generalizations

A similar result to Nicomachus's theorem holds for all power sums, namely that odd power sums (sums of odd powers) are a polynomial in triangular numbers. These are called Faulhaber polynomials, of which the sum of cubes is the simplest and most elegant example. However, in no other case is one power sum a square of another.

studies more general conditions under which the sum of a consecutive sequence of cubes forms a square. and study polynomial analogues of the square triangular number formula, in which series of polynomials add to the square of another polynomial.

Notes

References

• {{citation
• {{citation
• {{citation | author-link = David Bressoud
• {{citation
• {{citation |doi-access=free
• {{citation | editor-last = Shure | editor-first = Loren
• {{citation
• {{citation
• {{citation
• .
• {{citation
• {{citation
• {{citation | author-link = Otto Toeplitz
• {{citation |doi-access=free
• {{citation | author-link = Charles Wheatstone | doi-access = free

References

1. {{harvtxt. Stein. 1971; see also {{harvnb. Benjamin. Quinn. Wurtz. 2006
2. {{harvtxt. Garrett. Hummel. 2004; {{harvtxt. Warnaar. 2004