Pentatope number

Number in the 5th cell of any row of Pascal's triangle
Derivation of pentatope numbers from a left-justified Pascal's triangle.
  Natural numbers
  Triangular numbers
  Tetrahedral numbers
  Pentatope numbers
  5-simplex numbers
  6-simplex numbers
  7-simplex numbers

In number theory, a pentatope number is a number in the fifth cell of any row of Pascal's triangle starting with the 5-term row 1 4 6 4 1, either from left to right or from right to left. It is named because it represents the number of 3-dimensional unit spheres which can be packed into a pentatope (a 4-dimensional tetrahedron) of increasing side lengths.

The first few numbers of this kind are:

1, 5, 15, 35, 70, 126, 210, 330, 495, 715, 1001, 1365 (sequence A000332 in the OEIS)
A pentatope with side length 5 contains 70 3-spheres. Each layer represents one of the first five tetrahedral numbers. For example, the bottom (green) layer has 35 spheres in total.

Pentatope numbers belong to the class of figurate numbers, which can be represented as regular, discrete geometric patterns.[1]

Formula

The formula for the nth pentatope number is represented by the 4th rising factorial of n divided by the factorial of 4:

P n = n 4 ¯ 4 ! = n ( n + 1 ) ( n + 2 ) ( n + 3 ) 24 . {\displaystyle P_{n}={\frac {n^{\overline {4}}}{4!}}={\frac {n(n+1)(n+2)(n+3)}{24}}.}

The pentatope numbers can also be represented as binomial coefficients:

P n = ( n + 3 4 ) , {\displaystyle P_{n}={\binom {n+3}{4}},}

which is the number of distinct quadruples that can be selected from n + 3 objects, and it is read aloud as "n plus three choose four".

Properties

Two of every three pentatope numbers are also pentagonal numbers. To be precise, the (3k − 2)th pentatope number is always the ( 3 k 2 k 2 ) {\displaystyle \left({\tfrac {3k^{2}-k}{2}}\right)} th pentagonal number and the (3k − 1)th pentatope number is always the ( 3 k 2 + k 2 ) {\displaystyle \left({\tfrac {3k^{2}+k}{2}}\right)} th pentagonal number. The (3k)th pentatope number is the generalized pentagonal number obtained by taking the negative index 3 k 2 + k 2 {\displaystyle -{\tfrac {3k^{2}+k}{2}}} in the formula for pentagonal numbers. (These expressions always give integers).[2]

The infinite sum of the reciprocals of all pentatope numbers is 4/3.[3] This can be derived using telescoping series.

n = 1 4 ! n ( n + 1 ) ( n + 2 ) ( n + 3 ) = 4 3 . {\displaystyle \sum _{n=1}^{\infty }{\frac {4!}{n(n+1)(n+2)(n+3)}}={\frac {4}{3}}.}

Pentatope numbers can be represented as the sum of the first n tetrahedral numbers:[2]

P n = k = 1 n T e n , {\displaystyle P_{n}=\sum _{k=1}^{n}\mathrm {Te} _{n},}

and are also related to tetrahedral numbers themselves:

P n = 1 4 ( n + 3 ) T e n . {\displaystyle P_{n}={\tfrac {1}{4}}(n+3)\mathrm {Te} _{n}.}

No prime number is the predecessor of a pentatope number (it needs to check only -1 and 4 = 22), and the largest semiprime which is the predecessor of a pentatope number is 1819.

Similarly, the only primes preceding a 6-simplex number are 83 and 461.

Test for pentatope numbers

We can derive this test from the formula for the nth pentatope number.

Given a positive integer x, to test whether it is a pentatope number we can compute the positive root using Ferrari's method:

n = 5 + 4 24 x + 1 3 2 . {\displaystyle n={\frac {{\sqrt {5+4{\sqrt {24x+1}}}}-3}{2}}.}

The number x is pentatope if and only if n is a natural number. In that case x is the nth pentatope number.

Generating function

The generating function for pentatope numbers is[4]

x ( 1 x ) 5 = x + 5 x 2 + 15 x 3 + 35 x 4 + . {\displaystyle {\frac {x}{(1-x)^{5}}}=x+5x^{2}+15x^{3}+35x^{4}+\dots .}

Applications

In biochemistry, the pentatope numbers represent the number of possible arrangements of n different polypeptide subunits in a tetrameric (tetrahedral) protein.

References

  1. ^ Deza, Elena; Deza, M. (2012), "3.1 Pentatope numbers and their multidimensional analogues", Figurate Numbers, World Scientific, p. 162, ISBN 9789814355483
  2. ^ a b Sloane, N. J. A. (ed.). "Sequence A000332". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ Rockett, Andrew M. (1981), "Sums of the inverses of binomial coefficients" (PDF), Fibonacci Quarterly, 19 (5): 433–437. Theorem 2, p. 435.
  4. ^ "Wolfram MathWorld site".
  • v
  • t
  • e
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Higher dimensional
non-centered
  • v
  • t
  • e
Classes of natural numbers
Of the form a × 2b ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Numeral system-dependent numbers
Arithmetic functions
and dynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Generated via a sieve
  • Mathematics portal
Stub icon

This article about a number is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e