BREAKING NEWS
Square pyramidal number

## Summary

Geometric representation of the square pyramidal number 1 + 4 + 9 + 16 = 30.

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. The study of these numbers goes back to Archimedes and Fibonacci.

As well as counting spheres in a pyramid, these numbers can be used to solve several other counting problems, including counting squares in a square grid and counting acute triangles formed from the vertices of an odd regular polygon. They equal the sums of consecutive tetrahedral numbers, and are one-fourth of a larger tetrahedral number. The sum of two consecutive square pyramidal numbers is an octahedral number.

## Formula

Six copies of a square pyramid with n steps can fit in a cuboid of size n(n + 1)(2n + 1)

The first few square pyramidal numbers are:[1]

1, 5, 14, 30, 55, 91, 140, 204, 285, 385, 506, 650, 819, ... .

These numbers can be expressed in a formula as

{\displaystyle {\begin{aligned}P_{n}&=\sum _{k=1}^{n}k^{2}=1+4+9+\cdots +n^{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}}.\\\end{aligned}}}
The summation in the formula represents the decomposition of a pyramid into its square layers. Its equality with a cubic polynomial is a special case of Faulhaber's formula, and may be proved by mathematical induction.[2] Equivalent formulas are given by Archimedes[3] and Fibonacci.[4]

In modern mathematics, figurate numbers are formalized by the Ehrhart polynomials. The Ehrhart polynomial L(P,t) of a polyhedron P is a polynomial that counts the number of integer points in a copy of P that is expanded by multiplying all its coordinates by the number t. 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 (t + 1)(t + 2)(2t + 3)/6 = Pt + 1.[5]

## Geometric enumeration

All 30 squares in a 4×4 grid

A common mathematical puzzle involves finding the number of squares in a large n by n square grid.[6] This number can be derived as follows:

• The number of 1 × 1 squares found in the grid is n2.
• The number of 2 × 2 squares found in the grid is (n − 1)2. These can be counted by counting all of the possible upper-left corners of 2 × 2 squares.
• The number of k × k squares (1 ≤ kn) found in the grid is (nk + 1)2. These can be counted by counting all of the possible upper-left corners of k × k squares.

It follows that the number of squares in an n × n square grid is:

${\displaystyle n^{2}+(n-1)^{2}+(n-2)^{2}+(n-3)^{2}+\ldots ={\frac {n(n+1)(2n+1)}{6}}.}$
That is, the solution to the puzzle is given by the nth square pyramidal number.[7]

The square pyramidal number ${\displaystyle P_{n}}$ also counts the number of acute triangles formed from the vertices of a ${\displaystyle (2n+1)}$-sided regular polygon. For instance, an equilateral triangle contains only one acute triangle (itself), a regular pentagon has five acute golden triangles within it, a regular heptagon has 14 acute triangles of two shapes, etc.[1]

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

## Relations to other figurate numbers

4900 balls arranged as a square pyramid of side 24, and a square of side 70

The cannonball problem asks for the sizes of pyramids that can also be spread out to form a square array of cannonballs, or equivalently, which numbers are both square and square pyramidal. Besides 1, there is only one other number that has this property: 4900, which is both the 70th square number and the 24th square pyramidal number. This fact was proven by G. N. Watson in 1918.[9]

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

${\displaystyle P_{n}={\binom {n+2}{3}}+{\binom {n+1}{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.[10] If a tetrahedron is reflected across one of its faces, the two copies form a triangular bipyramid. The square pyramidal numbers are also the figurate numbers of the triangular bipyramids, and this formula can be interpreted as an equality between the square pyramidal numbers and the triangular bipyramidal numbers.[1] Analogously, reflecting a square pyramid across its base produces an octahedron, from which it follows that each octahedral number is the sum of two consecutive square pyramidal numbers.[11]

Square pyramidal numbers are also related to tetrahedral numbers in a different way: the points from four copies of the same square pyramid can be rearranged to form a single tetrahedron of slightly more than twice the edge length. That is,[12]

${\displaystyle 4P_{n}={\binom {2n+2}{3}}.}$

## Other properties

The alternating series of unit fractions with the square pyramidal numbers as denominators is closely related to the Leibniz formula for π, although it converges more quickly. It is:[13]

{\displaystyle {\begin{aligned}\sum _{i=1}^{\infty }&(-1)^{i-1}{\frac {1}{P_{i}}}\\&=1-{\frac {1}{5}}+{\frac {1}{14}}-{\frac {1}{30}}+{\frac {1}{55}}-{\frac {1}{91}}+{\frac {1}{140}}-{\frac {1}{204}}+\cdots \\&=6(\pi -3)\\&\approx 0.849556.\\\end{aligned}}}

## References

1. ^ a b c Sloane, N. J. A. (ed.), "Sequence A000330 (Square pyramidal numbers)", The On-Line Encyclopedia of Integer Sequences, OEIS Foundation
2. ^ Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2007), Introduction to Automata Theory, Languages, and Computation (3 ed.), Pearson/Addison Wesley, p. 20, ISBN 9780321455369
3. ^ Archimedes, On Conoids and Spheroids, Lemma to Prop. 2, and On Spirals, Prop. 10. See "Lemma to Proposition 2", The Works of Archimedes, translated by T. L. Heath, Cambridge University Press, 1897, pp. 107–109
4. ^ Fibonacci (1202), Liber Abaci, ch. II.12. See Fibonacci's Liber Abaci, translated by Laurence E. Sigler, Springer-Verlag, 2002, pp. 260–261, ISBN 0-387-95419-8
5. ^ Beck, M.; De Loera, J. A.; Develin, M.; Pfeifle, J.; Stanley, R. P. (2005), "Coefficients and roots of Ehrhart polynomials", Integer Points in Polyhedra—Geometry, Number Theory, Algebra, Optimization, Contemporary Mathematics, 374, Providence, Rhode Island: American Mathematical Society, pp. 15–36, arXiv:math/0402148, MR 2134759
6. ^ Duffin, Janet; Patchett, Mary; Adamson, Ann; Simmons, Neil (November 1984), "Old squares new faces", Mathematics in School, 13 (5): 2–4, JSTOR 30216270
7. ^ Robitaille, David F. (May 1974), "Mathematics and chess", The Arithmetic Teacher, 21 (5): 396–400, JSTOR 41190919
8. ^ Stein, Robert G. (1971), "A combinatorial proof that ${\displaystyle \textstyle \sum k^{3}=(\sum k)^{2}}$", Mathematics Magazine, 44 (3): 161–162, doi:10.2307/2688231, JSTOR 2688231
9. ^ Anglin, W. S. (1990), "The square pyramid puzzle", American Mathematical Monthly, 97 (2): 120–124, doi:10.2307/2323911, JSTOR 2323911
10. ^ Beiler, A. H. (1964), Recreations in the Theory of Numbers, Dover, pp. 194, ISBN 0-486-21096-0
11. ^ Caglayan, Günhan; Buddoo, Horace (September 2014), "Tetrahedral numbers", The Mathematics Teacher, 108 (2): 92–97, doi:10.5951/mathteacher.108.2.0092, JSTOR 10.5951/mathteacher.108.2.0092
12. ^ Alsina, Claudi; Nelsen, Roger B. (2015), "Challenge 2.13", A Mathematical Space Odyssey: Solid Geometry in the 21st Century, The Dolciani Mathematical Expositions, 50, Washington, DC: Mathematical Association of America, pp. 43, 234, ISBN 978-0-88385-358-0, MR 3379535
13. ^ Fearnehough, Alan (November 2006), "90.67 A series for the 'bit'", Notes, The Mathematical Gazette, 90 (519): 460–461, JSTOR 40378200