Pentatope number
Template:Short description Template:Pascal triangle simplex numbers.svg
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 Template:Nowrap, 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:
Pentatope numbers belong to the class of figurate numbers, which can be represented as regular, discrete geometric patterns.<ref>Template:Citation</ref>
FormulaEdit
The formula for the Template:Mvarth pentatope number is represented by the 4th rising factorial of Template:Mvar divided by the factorial of 4:
- <math>P_n = \frac{n^{\overline 4}}{4!} = \frac{n(n+1)(n+2)(n+3)}{24} .</math>
The pentatope numbers can also be represented as binomial coefficients:
- <math>P_n = \binom{n + 3}{4} ,</math>
which is the number of distinct quadruples that can be selected from Template:Math objects, and it is read aloud as "Template:Math plus three choose four".
PropertiesEdit
Two of every three pentatope numbers are also pentagonal numbers. To be precise, the Template:Mathth pentatope number is always the <math>\left(\tfrac{3k^2 - k}{2}\right)</math>th pentagonal number and the Template:Mathth pentatope number is always the <math>\left(\tfrac{3k^2 + k}{2}\right)</math>th pentagonal number. The Template:Mathth pentatope number is the generalized pentagonal number obtained by taking the negative index <math>-\tfrac{3k^2 + k}{2}</math> in the formula for pentagonal numbers. (These expressions always give integers).<ref name="oeis">Template:Cite OEIS</ref>
The infinite sum of the reciprocals of all pentatope numbers is Template:Sfrac.<ref>Template:Citation. Theorem 2, p. 435.</ref> This can be derived using telescoping series.
- <math>\sum_{n=1}^\infty \frac{4!}{n(n+1)(n+2)(n+3)} = \frac{4}{3}.</math>
Pentatope numbers can be represented as the sum of the first Template:Mvar tetrahedral numbers:<ref name="oeis"/>
- <math>P_n = \sum_{ k =1}^n \mathrm{Te}_k,</math>
and are also related to tetrahedral numbers themselves:
- <math>P_n = \tfrac{1}{4}(n+3) \mathrm{Te}_n.</math>
No prime number is the predecessor of a pentatope number (it needs to check only −1 and Template:Nowrap), 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 numbersEdit
We can derive this test from the formula for the Template:Mvarth pentatope number.
Given a positive integer Template:Mvar, to test whether it is a pentatope number we can compute the positive root using Ferrari's method:
- <math>n = \frac{\sqrt{5+4\sqrt{24x+1}} - 3}{2}.</math>
The number Template:Mvar is pentatope if and only if Template:Mvar is a natural number. In that case Template:Mvar is the Template:Mvarth pentatope number.
Generating functionEdit
The generating function for pentatope numbers is<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>
- <math>\frac{x}{(1-x)^5} = x + 5x^2 + 15x^3 + 35x^4 + \dots .</math>
ApplicationsEdit
In biochemistry, the pentatope numbers represent the number of possible arrangements of n different polypeptide subunits in a tetrameric (tetrahedral) protein.
ReferencesEdit
Template:Figurate numbers Template:Classes of natural numbers