In mathematics, a **pyramid number**, or **square pyramidal number**, is a figurate number that represents the number of stacked spheres in a pyramid with a square base. Square pyramidal numbers also solve the problem of counting the number of squares in an Template:Math grid.

## FormulaEdit

The first few square pyramidal numbers are:

These numbers can be expressed in a formula as

- $ P_n = \sum_{k=1}^nk^2 = \frac{n(n + 1)(2n + 1)}{6} = \frac{2n^3 + 3n^2 + n}{6} = \frac{n^3}{3} + \frac{n^2}{2} + \frac{n}{6}. $

This is a special case of Faulhaber's formula, and may be proved by a mathematical induction.^{[1]} An equivalent formula is given in Fibonacci's Liber Abaci (1202, ch. II.12).

. The Ehrhart polynomial of a pyramid whose base is a unit square with integer coordinates, and whose apex is an integer point at height one above the base plane, is Template:Math.^{[2]}

## Relations to other figurate numbersEdit

The square pyramidal numbers can also be expressed as sums of binomial coefficients:

- $ P_n = {{n + 2} \choose 3} + {{n + 1} \choose 3}. $

The binomial coefficients occurring in this representation are tetrahedral numbers, and this formula expresses a square pyramidal number as the sum of two tetrahedral numbers in the same way as square numbers are the sums of two consecutive triangular numbers.

The smaller tetrahedral number represents $ 1+3+6+\dots+T(n+1) $ and the larger $ 1+3+6+\dots+T(n+2) $. Offsetting the larger and adding, we arrive at $ 1,1+3,3+6\dots $, the square numbers.

In this sum, one of the two tetrahedral numbers counts the number of balls in a stacked pyramid that are directly above or to one side of a diagonal of the base square, and the other tetrahedral number in the sum counts the number of balls that are to the other side of the diagonal. Square pyramidal numbers are also related to tetrahedral numbers in a different way:

- $ P_n=\frac14\binom{2n+2}{3}. $

The sum of two consecutive square pyramidal numbers is an octahedral number.

Augmenting a pyramid whose base edge hasballs by adding to one of its triangular faces a tetrahedron whose base edge has Template:Math balls produces a triangular prism. Equivalently, a pyramid can be expressed as the result of subtracting a tetrahedron from a prism. This geometric dissection leads to another relation:

- $ P_n = n\binom{n+1}{2}-\binom{n+1}{3}. $

The cannonball problem asks which numbers are both square and square pyramidal. Besides Template:Math, there is only one other number that has this property: Template:Math, which is both the Template:Mathth square number and the Template:Mathth square pyramidal number. This fact was proven by G. N. Watson in 1918.

Another relationship involves the Pascal Triangle: Whereas the classical Pascal Triangle with sides Template:Math has diagonals with the natural numbers, triangular numbers, and tetrahedral numbers, generating the Fibonacci numbers as sums of samplings across diagonals, the sister Pascal with sides Template:Math has equivalent diagonals with odd numbers, square numbers, and square pyramidal numbers, respectively, and generates (by the same procedure) the Lucas numbers rather than Fibonacci.Template:Citation needed

In the same way that the square pyramidal numbers can be defined as a sum of consecutive squares, the squared triangular numbers can be defined as a sum of consecutive cubes.

Also,

- $ P_n = \binom{n+3}{4}-\binom{n+1}{4} $

which is the difference of two pentatope numbers.

This can be seen by expanding:

- $ n(n+1)(n+2)(n+3)-(n-2)(n-1)n(n+1)=n(n+1)(n^2+5n+6-n^2+3n-2)=n(n+1)(8n+4) $

and dividing through by $ 24 $.

## Squares in a squareEdit

A common mathematical puzzle involves finding the number of squares in a large bysquare grid. This number can be derived as follows:

- The number of Template:Math boxes found in the grid is Template:Math.
- The number of Template:Math boxes found in the grid is Template:Math. These can be counted by counting all of the possible upper-left corners of Template:Math boxes.
- The number of Template:Math boxes Template:Math found in the grid is Template:Math. These can be counted by counting all of the possible upper-left corners of Template:Math boxes.

It follows that the number of squares in an Template:Math square grid is:

- $ n^2 + (n-1)^2 + (n-2)^2 + (n-3)^2 + \ldots + 1^2 = \frac{n(n+1)(2n+1)}{6}. $

That is, the solution to the puzzle is given by the square pyramidal numbers.

The number of rectangles in a square grid is given by the squared triangular numbers.

## Derivation of the summation formulaEdit

The difference of two consecutive square numbers is always an odd number. More precisely, because of the identity Template:Math, the difference between theth and the Template:Mathth square number is Template:Math. This yields the following scheme:

- $ \begin{array}{ccccccccccccccc} 0&&1&& 4 && 9 && 16 && 25 &\ldots & (n-1)^2 && n^2 \\ &1&&3&& 5 &&7 &&9 && \ldots && 2n-1 & \end{array} $

square numbers:

- $ \begin{array}{rcccccccc} \scriptstyle 1^2 \scriptstyle = &1&&&&&&& \\ \scriptstyle 2^2\scriptstyle = &1&3&&&&&&\\ \scriptstyle 3^2\scriptstyle = &1&3&5&&&&&\\ \scriptstyle 4^2\scriptstyle = &1&3&5&7&&&&\\ \scriptstyle 5^2\scriptstyle = &1&3&5&7&9&&&\\ \vdots&\vdots&&&&&\ddots&&\\ \scriptstyle (n-1)^2\scriptstyle = &1&\cdots&&&&\cdots&\scriptstyle 2n-3& \\ \scriptstyle n^2\scriptstyle = &1&\cdots&&&&\cdots&\scriptstyle 2n-3&\scriptstyle 2n-1 \end{array} $

The same odd numbers are now arranged in two different ways in congruent triangles.

- $ \begin{array}{cccccccc} \scriptstyle 2n-1&&&&&& \\ \scriptstyle 2n-3&\scriptstyle 2n-3&&&&& \\ \vdots&&\ddots&&&&\\ 9&\cdots&\cdots&9&&&&\\ 7&\cdots&\cdots&7&7&&&\\ 5&\cdots&\cdots&5&5&5\\ 3&\cdots&\cdots&3&3&3&3\\ 1&\cdots&\cdots&1&1&1&1&1 \\ \hline \scriptstyle =n^2& \scriptstyle =(n-1)^2&\cdots& \scriptstyle =5^2& \scriptstyle =4^2& \scriptstyle =3^2& \scriptstyle =2^2& \scriptstyle =1^2 \end{array} $ $ \begin{array}{cccccccc} 1&&&&&&& \\ 3&1&&&&&&\\ 5&3&1&&&&&\\ 7&5&3&1&&&&\\ 9&7&5&3&1&&&\\ \vdots&&&&&\ddots&&\\ \scriptstyle 2n-3&\cdots&&&&\cdots&1& \\ \scriptstyle 2n-1&\scriptstyle 2n-3&&&&\cdots&&1 \\ \hline \scriptstyle =n^2& \scriptstyle =(n-1)^2&\cdots& \scriptstyle =5^2& \scriptstyle =4^2& \scriptstyle =3^2& \scriptstyle =2^2& \scriptstyle =1^2 \end{array} $

Stacking the three triangles on top of each other's yields you columns consisting of three numbers, which have the property that their sum is always $ 2''n'' + 1 $. At each vertex the sum of the column is $ 1=2''n'' − 1 + 1 + 1 = 2''n'' + 1 $. Now if you move from one column to another then in one triangle the number will increase by two but in a second triangle it decrease by two and remain the same in the third triangle, hence the sum of the column stays constant. There are $ 1+2+\ldots+n=\tfrac{n(n+1)}{2} $ such columns, so the sum of the numbers in all three triangles is $ \tfrac{n(n+1)(2n+1)}{2} $. This is thrice the sum of the first n square numbers, so it yields:

- $ P_n=\frac{n(n+1)(2n+1)}{6} $

## Sources Edit

- ↑ Hopcroft, Motwani & Ullman (2007), [[[:Template:Google books]] p. 20]
- ↑ Template:Citation.