Tetrahedral number

A pyramid with side length 5 contains 35 spheres. Each layer represents one of the first five triangular numbers.

A tetrahedral number, or triangular pyramidal number, is a figurate number that represents a pyramid with a triangular base and three sides, called a tetrahedron. The nth tetrahedral number, Te_n, is the sum of the first n triangular numbers, that is,

$Te_{n}=\sum _{k=1}^{n}T_{k}=\sum _{k=1}^{n}{\frac {k(k+1)}{2}}=\sum _{k=1}^{n}\left(\sum _{i=1}^{k}i\right)$

The tetrahedral numbers are:

1, 4, 10, 20, 35, 56, 84, 120, 165, 220, ... (sequence A000292 in the OEIS)

Formula

Derivation of Tetrahedral number from a left-justified Pascal's triangle.

  Natural numbers

  Triangular numbers

  Tetrahedral numbers

  Pentatope numbers

  5-simplex numbers

  6-simplex numbers

  7-simplex numbers

The formula for the nth tetrahedral number is represented by the 3rd rising factorial of n divided by the factorial of 3:

$Te_{n}={\frac {n(n+1)(n+2)}{6}}={\frac {n^{\overline {3}}}{3!}}$

The tetrahedral numbers can also be represented as binomial coefficients:

$Te_{n}={\binom {n+2}{3}}.$

Tetrahedral numbers can therefore be found in the fourth position either from left or right in Pascal's triangle.

Proofs of formula

This proof uses the fact that the nth triangular number is given by

$T_{n}={\frac {n(n+1)}{2}}.$

It proceeds by induction.

Base case

$Te_{1}=1={\frac {1\cdot 2\cdot 3}{6}}.$

Inductive step

${\begin{aligned}Te_{n+1}\quad &=Te_{n}+T_{n+1}={\frac {n(n+1)(n+2)}{6}}+{\frac {(n+1)(n+2)}{2}}\\&={\frac {(n+1)(n+2)(n+3)}{6}}.\end{aligned}}$

The formula can also be proved by Gosper's algorithm.

Geometric interpretation

Tetrahedral numbers can be modelled by stacking spheres. For example, the fifth tetrahedral number (Te₅ = 35) can be modelled with 35 billiard balls and the standard triangular billiards ball frame that holds 15 balls in place. Then 10 more balls are stacked on top of those, then another 6, then another three and one ball at the top completes the tetrahedron.

When order-n tetrahedra built from Te_n spheres are used as a unit, it can be shown that a space tiling with such units can achieve a densest sphere packing as long as n ≤ 4.

Properties

• Te_n + Te_n−1 = 1² + 2² + 3² ... + n²
• A. J. Meyl proved in 1878 that only three tetrahedral numbers are also perfect squares, namely:

  Te₁ = 1² = 1

  Te₂ = 2² = 4

  Te₄₈ = 140² = 19600.

• Sir Frederick Pollock conjectured that every number is the sum of at most 5 tetrahedral numbers: see Pollock tetrahedral numbers conjecture.
• The only tetrahedral number that is also a square pyramidal number is 1 (Beukers, 1988), and the only tetrahedral number that is also a perfect cube is 1.
• The infinite sum of tetrahedral numbers' reciprocals is 3/2, which can be derived using telescoping series:

  $\sum _{n=1}^{\infty }{\frac {6}{n(n+1)(n+2)}}={\tfrac {3}{2}}.$

• The parity of tetrahedral numbers follows the repeating pattern odd-even-even-even.
• An observation of tetrahedral numbers:

  Te₅ = Te₄ + Te₃ + Te₂ + Te₁

• Numbers that are both triangular and tetrahedral must satisfy the binomial coefficient equation:

  $T_{n}={\binom {n+1}{2}}={\binom {m+2}{3}}=Te_{m}.$

The only numbers that are both tetrahedral and triangular numbers are (sequence A027568 in the OEIS):

Te₁ = T₁ = 1

Te₃ = T₄ = 10

Te₈ = T₁₅ = 120

Te₂₀ = T₅₅ = 1540

Te₃₄ = T₁₁₉ = 7140

Popular culture

Number of gifts of each type and number received each day and their relationship to figurate numbers

Te₁₂ = 364 is the total number of gifts "my true love sent to me" during the course of all 12 verses of the carol, "The Twelve Days of Christmas". The cumulative total number of gifts after each verse is also Te_n for verse n.

The number of possible KeyForge three-house combinations is also a tetrahedral number, Te_n−2 where n is the number of houses.

See also

• Centered triangular number

External links

• Weisstein, Eric W. "Tetrahedral Number". MathWorld.
• Geometric Proof of the Tetrahedral Number Formula by Jim Delany, The Wolfram Demonstrations Project.