Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Pascal's pyramid
open-in-new
<h2 id="structure-of-the-tetrahedron">Structure of the tetrahedron</h2> <p>Because the <a href="/facts/Tetrahedron/7mkSrl6j">tetrahedron</a> is a three-dimensional object, displaying it on a piece of paper, a computer screen, or other two-dimensional medium is difficult. Assume the tetrahedron is divided into a number of levels, floors, slices, or layers. The top layer (the apex) is labeled "Layer 0". Other layers can be thought of as overhead views of the tetrahedron with the previous layers removed. The first six layers are as follows: </p> <table><tbody><tr><td><table><tbody><tr><th>Layer 0</th><td>1</td></tr></tbody></table><table><tbody><tr><th rowspan="2">Layer 1</th><td>1</td><td></td><td>1</td></tr><tr><td></td><td>1</td><td></td></tr></tbody></table><table><tbody><tr><th rowspan="3">Layer 2</th><td>1</td><td></td><td>2</td><td></td><td>1</td></tr><tr><td></td><td>2</td><td></td><td>2</td><td></td></tr><tr><td></td><td></td><td>1</td><td></td><td></td></tr></tbody></table><table><tbody><tr><th rowspan="4">Layer 3</th><td>1</td><td></td><td>3</td><td></td><td>3</td><td></td><td>1</td></tr><tr><td></td><td>3</td><td></td><td>6</td><td></td><td>3</td><td></td></tr><tr><td></td><td></td><td>3</td><td></td><td>3</td><td></td><td></td></tr><tr><td></td><td></td><td></td><td>1</td><td></td><td></td><td></td></tr></tbody></table><table><tbody><tr><th rowspan="5">Layer 4</th><td>1</td><td></td><td>4</td><td></td><td>6</td><td></td><td>4</td><td></td><td>1</td></tr><tr><td></td><td>4</td><td></td><td>12</td><td></td><td>12</td><td></td><td>4</td><td></td></tr><tr><td></td><td></td><td>6</td><td></td><td>12</td><td></td><td>6</td><td></td><td></td></tr><tr><td></td><td></td><td></td><td>4</td><td></td><td>4</td><td></td><td></td><td></td></tr><tr><td></td><td></td><td></td><td></td><td>1</td><td></td><td></td><td></td><td></td></tr></tbody></table><table><tbody><tr><th rowspan="6">Layer 5</th><td>1</td><td></td><td>5</td><td></td><td>10</td><td></td><td>10</td><td></td><td>5</td><td></td><td>1</td></tr><tr><td></td><td>5</td><td></td><td>20</td><td></td><td>30</td><td></td><td>20</td><td></td><td>5</td><td></td></tr><tr><td></td><td></td><td>10</td><td></td><td>30</td><td></td><td>30</td><td></td><td>10</td><td></td><td></td></tr><tr><td></td><td></td><td></td><td>10</td><td></td><td>20</td><td></td><td>10</td><td></td><td></td><td></td></tr><tr><td></td><td></td><td></td><td></td><td>5</td><td></td><td>5</td><td></td><td></td><td></td><td></td></tr><tr><td></td><td></td><td></td><td></td><td></td><td>1</td><td></td><td></td><td></td><td></td><td></td></tr></tbody></table></td></tr></tbody></table> <p>The layers of the tetrahedron have been deliberately displayed with the point down so that they are not individually confused with Pascal's triangle. </p> <h2 id="overview-of-the-tetrahedron">Overview of the tetrahedron</h2> <ul><li>There is three-way symmetry of the numbers in each layer.</li> <li>The number of terms in the <i>n</i>th layer is the (<i>n</i>+1)th <a href="/facts/Triangular_number/KHonHtQJ">triangular number</a>: ( n + 1 ) ( n + 2 ) 2 {\displaystyle {\frac {(n+1)(n+2)}{2}}} .</li> <li>The sum of the values of the numbers in the <i>n</i>th layer is 3<i>n</i>.</li> <li>Each number in any layer is the sum of the three adjacent numbers in the layer above.</li> <li>Each number in any layer is a simple whole number ratio of the adjacent numbers in the same layer.</li> <li>Each number in any layer is a coefficient of the trinomial distribution and the trinomial expansion. This non-linear arrangement makes it easier to: <ul><li>display the trinomial expansion in a coherent way;</li> <li>compute the coefficients of the trinomial distribution;</li> <li>calculate the numbers of any tetrahedron layer.</li></ul></li> <li>The numbers along the three edges of the <i>n</i>th layer are the numbers of the <i>n</i>th line of Pascal's triangle. And almost all the properties listed above have parallels with Pascal's triangle and multinomial coefficients.</li></ul> <h2 id="trinomial-expansion-connection">Trinomial expansion connection</h2> <p>The numbers of the tetrahedron are derived from the <a href="/facts/Trinomial_expansion/xtlRHY8F">trinomial expansion</a>. The <i>n</i>th layer is the detached coefficient matrix (no variables or exponents) of a trinomial expression (e. g.: <i>A + B + C</i>) raised to the <i>n</i>th power. The <i>n</i>th power of the trinomial is expanded by repeatedly multiplying the trinomial by itself: </p> ( A + B + C ) ( A + B + C ) n = ( A + B + C ) n + 1 {\displaystyle (A+B+C)(A+B+C)^{n}=(A+B+C)^{n+1}} <p>Each term in the first expression is multiplied by each term in the second expression; and then the coefficients of <a href="/facts/Like_terms/fsPC7rXn">like terms</a> (same variables and exponents) are added together. Here is the expansion of (<i>A + B + C</i>)4: </p> 1<i>A</i>4<i>B</i>0<i>C</i>0 + 4<i>A</i>3<i>B</i>0<i>C</i>1 + 6<i>A</i>2<i>B</i>0<i>C</i>2 + 4<i>A</i>1<i>B</i>0<i>C</i>3 + 1<i>A</i>0<i>B</i>0<i>C</i>4 + <p>4<i>A</i>3<i>B</i>1<i>C</i>0 + 12<i>A</i>2<i>B</i>1<i>C</i>1 + 12<i>A</i>1<i>B</i>1<i>C</i>2 + 4<i>A</i>0<i>B</i>1<i>C</i>3 + 6<i>A</i>2<i>B</i>2<i>C</i>0 + 12<i>A</i>1<i>B</i>2<i>C</i>1 + 6<i>A</i>0<i>B</i>2<i>C</i>2 + 4<i>A</i>1<i>B</i>3<i>C</i>0 + 4<i>A</i>0<i>B</i>3<i>C</i>1 + </p> 1<i>A</i>0<i>B</i>4<i>C</i>0 <p>Writing the expansion in this non-linear way shows the expansion in a more understandable way. It also makes the connection with the tetrahedron obvious−the coefficients here match those of layer 4. All the implicit coefficients, variables, and exponents, which are normally not written, are also shown to illustrate another relationship with the tetrahedron. (Usually, "1<i>A</i>" is "<i>A</i>"; "<i>B</i>1" is "<i>B</i>"; and "<i>C</i>0" is "1"; etc.) The exponents of each term sum to the layer number (<i>n</i>), or 4, in this case. More significantly, the value of the coefficients of each term can be computed directly from the exponents. The formula is (<i>x</i>+<i>y</i>+<i>z</i>)!/<i>x</i>!<i>y</i>!<i>z</i>! , where <i>x, y, z</i> are the exponents of <i>A, B, C,</i> respectively, and "!" is the factorial, i. e.: n ! = 1 ⋅ 2 ⋅ 3 ⋯ n {\displaystyle n!=1\cdot 2\cdot 3\cdots n} . The exponent formulas for the 4th layer are: </p> <table><tbody><tr><td><p> ( 4 + 0 + 0 ) ! 4 ! ⋅ 0 ! ⋅ 0 ! ( 3 + 0 + 1 ) ! 3 ! ⋅ 0 ! ⋅ 1 ! ( 2 + 0 + 2 ) ! 2 ! ⋅ 0 ! ⋅ 2 ! ( 1 + 0 + 3 ) ! 1 ! ⋅ 0 ! ⋅ 3 ! ( 0 + 0 + 4 ) ! 0 ! ⋅ 0 ! ⋅ 4 ! {\displaystyle \textstyle {(4+0+0)! \over 4!\cdot 0!\cdot 0!}\ {(3+0+1)! \over 3!\cdot 0!\cdot 1!}\ {(2+0+2)! \over 2!\cdot 0!\cdot 2!}\ {(1+0+3)! \over 1!\cdot 0!\cdot 3!}\ {(0+0+4)! \over 0!\cdot 0!\cdot 4!}} </p><p> ( 3 + 1 + 0 ) ! 3 ! ⋅ 1 ! ⋅ 0 ! ( 2 + 1 + 1 ) ! 2 ! ⋅ 1 ! ⋅ 1 ! ( 1 + 1 + 2 ) ! 1 ! ⋅ 1 ! ⋅ 2 ! ( 0 + 1 + 3 ) ! 0 ! ⋅ 1 ! ⋅ 3 ! {\displaystyle \textstyle {(3+1+0)! \over 3!\cdot 1!\cdot 0!}\ {(2+1+1)! \over 2!\cdot 1!\cdot 1!}\ {(1+1+2)! \over 1!\cdot 1!\cdot 2!}\ {(0+1+3)! \over 0!\cdot 1!\cdot 3!}} </p><p> ( 2 + 2 + 0 ) ! 2 ! ⋅ 2 ! ⋅ 0 ! ( 1 + 2 + 1 ) ! 1 ! ⋅ 2 ! ⋅ 1 ! ( 0 + 2 + 2 ) ! 0 ! ⋅ 2 ! ⋅ 2 ! {\displaystyle \textstyle {(2+2+0)! \over 2!\cdot 2!\cdot 0!}\ {(1+2+1)! \over 1!\cdot 2!\cdot 1!}\ {(0+2+2)! \over 0!\cdot 2!\cdot 2!}} </p><p> ( 1 + 3 + 0 ) ! 1 ! ⋅ 3 ! ⋅ 0 ! ( 0 + 3 + 1 ) ! 0 ! ⋅ 3 ! ⋅ 1 ! {\displaystyle \textstyle {(1+3+0)! \over 1!\cdot 3!\cdot 0!}\ {(0+3+1)! \over 0!\cdot 3!\cdot 1!}} </p><p> ( 0 + 4 + 0 ) ! 0 ! ⋅ 4 ! ⋅ 0 ! {\displaystyle \textstyle {(0+4+0)! \over 0!\cdot 4!\cdot 0!}} </p></td></tr></tbody></table> <p>The exponents of each expansion term can be clearly seen and these formulae simplify to the expansion coefficients and the tetrahedron coefficients of layer 4. </p> <h2 id="trinomial-distribution-connection">Trinomial distribution connection</h2> <p>The numbers of the tetrahedron can also be found in the trinomial distribution. This is a discrete probability distribution used to determine the chance some combination of events occurs given three possible outcomes−the number of ways the events could occur is multiplied by the probabilities that they would occur. The formula for the trinomial distribution is: </p> n ! x ! y ! z ! ( P A ) x ( P B ) y ( P C ) z {\displaystyle {\frac {n!}{x!y!z!}}(P_{A})^{x}(P_{B})^{y}(P_{C})^{z}} <p>where <i>x, y, z</i> are the number of times each of the three outcomes does occur; <i>n</i> is the number of trials and equals the sum of <i>x+y+z</i>; and <i>P</i>A, <i>P</i>B, <i>P</i>C are the probabilities that each of the three events could occur. </p><p>For example, in a three-way election, the candidates got these votes: A, 16 %; B, 30 %; C, 54 %. What is the chance that a randomly selected four-person focus group would contain the following voters: 1 for A, 1 for B, 2 for C? The answer is: </p> 4 ! 1 ! 1 ! 2 ! ( 16 % ) 1 ( 30 % ) 1 ( 54 % ) 2 = 12 ⋅ 0.0140 = 17 % {\displaystyle {\frac {4!}{1!1!2!}}(16\,\%)^{1}(30\,\%)^{1}(54\,\%)^{2}=12\cdot 0.0140=17\,\%} <p>The number 12 is the coefficient of this probability and it is number of combinations that can fill this "112" focus group. There are 15 different arrangements of four-person focus groups that can be selected. Expressions for all 15 of these coefficients are: </p> <p> 4 ! 4 ! ⋅ 0 ! ⋅ 0 ! 4 ! 3 ! ⋅ 0 ! ⋅ 1 ! 4 ! 2 ! ⋅ 0 ! ⋅ 2 ! 4 ! 1 ! ⋅ 0 ! ⋅ 3 ! 4 ! 0 ! ⋅ 0 ! ⋅ 4 ! {\displaystyle \textstyle {4! \over 4!\cdot 0!\cdot 0!}\ {4! \over 3!\cdot 0!\cdot 1!}\ {4! \over 2!\cdot 0!\cdot 2!}\ {4! \over 1!\cdot 0!\cdot 3!}\ {4! \over 0!\cdot 0!\cdot 4!}} </p><p> 4 ! 3 ! ⋅ 1 ! ⋅ 0 ! 4 ! 2 ! ⋅ 1 ! ⋅ 1 ! 4 ! 1 ! ⋅ 1 ! ⋅ 2 ! 4 ! 0 ! ⋅ 1 ! ⋅ 3 ! {\displaystyle \textstyle {4! \over 3!\cdot 1!\cdot 0!}\ {4! \over 2!\cdot 1!\cdot 1!}\ {4! \over 1!\cdot 1!\cdot 2!}\ {4! \over 0!\cdot 1!\cdot 3!}} </p><p> 4 ! 2 ! ⋅ 2 ! ⋅ 0 ! 4 ! 1 ! ⋅ 2 ! ⋅ 1 ! 4 ! 0 ! ⋅ 2 ! ⋅ 2 ! {\displaystyle \textstyle {4! \over 2!\cdot 2!\cdot 0!}\ {4! \over 1!\cdot 2!\cdot 1!}\ {4! \over 0!\cdot 2!\cdot 2!}} </p><p> 4 ! 1 ! ⋅ 3 ! ⋅ 0 ! 4 ! 0 ! ⋅ 3 ! ⋅ 1 ! {\displaystyle \textstyle {4! \over 1!\cdot 3!\cdot 0!}\ {4! \over 0!\cdot 3!\cdot 1!}} </p><p> 4 ! 0 ! ⋅ 4 ! ⋅ 0 ! {\displaystyle \textstyle {4! \over 0!\cdot 4!\cdot 0!}} </p> <p>The numerator of these fractions (above the line) is the same for all expressions. It is the sample size−a four-person group−and indicates that the coefficients of these arrangements can be found on layer 4 of the tetrahedron. The three numbers of the denominator (below the line) are the number of the focus group members that voted for A, B, C, respectively. </p><p>Shorthand is normally used to express combinatorial functions in the following "choose" format (which is read as "4 choose 4, 0, 0", etc.). </p> <p> ( 4 4 , 0 , 0 ) ( 4 3 , 0 , 1 ) ( 4 2 , 0 , 2 ) ( 4 1 , 0 , 3 ) ( 4 0 , 0 , 4 ) {\displaystyle \textstyle {4 \choose 4,0,0}\ {4 \choose 3,0,1}\ {4 \choose 2,0,2}\ {4 \choose 1,0,3}\ {4 \choose 0,0,4}} </p><p> ( 4 3 , 1 , 0 ) ( 4 2 , 1 , 1 ) ( 4 1 , 1 , 2 ) ( 4 0 , 1 , 3 ) {\displaystyle \textstyle {4 \choose 3,1,0}\ {4 \choose 2,1,1}\ {4 \choose 1,1,2}\ {4 \choose 0,1,3}} </p><p> ( 4 2 , 2 , 0 ) ( 4 1 , 2 , 1 ) ( 4 0 , 2 , 2 ) {\displaystyle \textstyle {4 \choose 2,2,0}\ {4 \choose 1,2,1}\ {4 \choose 0,2,2}} </p><p> ( 4 1 , 3 , 0 ) ( 4 0 , 3 , 1 ) {\displaystyle \textstyle {4 \choose 1,3,0}\ {4 \choose 0,3,1}} </p><p> ( 4 0 , 4 , 0 ) {\displaystyle \textstyle {4 \choose 0,4,0}} </p> <p>But the value of these expression is still equal to the coefficients of the 4th layer of the tetrahedron. And they can be generalized to any layer by changing the sample size (<i>n</i>). </p><p>This notation makes an easy way to express the sum of all the coefficients of layer <i>n</i>: </p> ∑ x , y , z ( n x , y , z ) = 3 n {\displaystyle \textstyle \sum _{x,y,z}{n \choose x,y,z}=3^{n}} . <h2 id="addition-of-coefficients-between-layers">Addition of coefficients between layers</h2> <p>The numbers on every layer (<i>n</i>) of the tetrahedron are the sum of the three adjacent numbers in the layer (<i>n</i>−1) "above" it. This relationship is rather difficult to see without intermingling the layers. Below are <i>italic</i> layer 3 numbers interleaved among bold layer 4 numbers: </p> <table><tbody><tr><td>1</td><td></td><td>4</td><td></td><td>6</td><td></td><td>4</td><td></td><td>1</td></tr><tr><td></td><td>1</td><td></td><td>3</td><td></td><td>3</td><td></td><td>1</td></tr><tr><td></td><td>4</td><td></td><td>12</td><td></td><td>12</td><td></td><td>4</td></tr><tr><td></td><td></td><td>3</td><td></td><td>6</td><td></td><td>3</td></tr><tr><td></td><td></td><td>6</td><td></td><td>12</td><td></td><td>6</td></tr><tr><td></td><td></td><td></td><td>3</td><td></td><td>3</td></tr><tr><td></td><td></td><td></td><td>4</td><td></td><td>4</td></tr><tr><td></td><td></td><td></td><td></td><td>1</td></tr><tr><td></td><td></td><td></td><td></td><td>1</td></tr></tbody></table> <p>The relationship is illustrated by the lower, central number 12 of the 4th layer. It is "surrounded" by three numbers of the 3rd layer: 6 to the "north", 3 to the "southwest", 3 to the "southeast". (The numbers along the edge have only two adjacent numbers in the layer "above" and the three corner numbers have only one adjacent number in the layer above, which is why they are always "1". The missing numbers can be assumed as "0", so there is no loss of generality.) This relationship between adjacent layers comes about through the two-step trinomial expansion process. </p><p>Continuing with this example, in Step 1, each term of (<i>A</i> + <i>B</i> + <i>C</i>)3 is multiplied by each term of (<i>A</i> + <i>B</i> + <i>C</i>)1. Only three of these multiplications are of interest in this example: </p> <table><tbody><tr><th>Layer 3 term </th><th>Multiply by </th><th>Product term</th></tr><tr><td>6<i>A</i>1<i>B</i>1<i>C</i>1</td><td>1<i>B</i>1</td><td>6<i>A</i>1<i>B</i>2<i>C</i>1</td></tr><tr><td>3<i>A</i>1<i>B</i>2<i>C</i>0</td><td>1<i>C</i>1</td><td>3<i>A</i>1<i>B</i>2<i>C</i>1</td></tr><tr><td>3<i>A</i>0<i>B</i>2<i>C</i>1</td><td>1<i>A</i>1</td><td>3<i>A</i>1<i>B</i>2<i>C</i>1</td></tr></tbody></table> <p>Then in Step 2, the summation of like terms (same variables and exponents) results in: 12<i>A</i>1<i>B</i>2<i>C</i>1, which is the term of (<i>A</i> + <i>B</i> + <i>C</i>)4; while 12 is the coefficient of the 4th layer of the tetrahedron. </p><p>Symbolically, the additive relation can be expressed as: </p> C ( x , y , z ) = C ( x − 1 , y , z ) + C ( x , y − 1 , z ) + C ( x , y , z − 1 ) {\displaystyle C(x,y,z)=C(x-1,y,z)+C(x,y-1,z)+C(x,y,z-1)} <p>where C(<i>x,y,z</i>) is the coefficient of the term with exponents <i>x, y, z</i> and x + y + z = n {\displaystyle x+y+z=n} is the layer of the tetrahedron. </p><p>This relationship will work only if the trinomial expansion is laid out in the non-linear fashion as it is portrayed in the section on the "trinomial expansion connection". </p> <h2 id="ratio-between-coefficients-of-same-layer">Ratio between coefficients of same layer</h2> <p>On each layer of the tetrahedron, the numbers are simple whole number ratios of the adjacent numbers. This relationship is illustrated for horizontally adjacent pairs on the 4th layer by the following: </p> <p>1 ⟨1:4⟩ 4 ⟨2:3⟩ 6 ⟨3:2⟩ 4 ⟨4:1⟩ 1 4 ⟨1:3⟩ 12 ⟨2:2⟩ 12 ⟨3:1⟩ 4 6 ⟨1:2⟩ 12 ⟨2:1⟩ 6 4 ⟨1:1⟩ 4 1 </p> <p>Because the tetrahedron has three-way symmetry, the ratio relation also holds for diagonal pairs in both directions, as well as for the horizontal pairs shown. </p><p>The ratios are controlled by the exponents of the corresponding adjacent terms of the trinomial expansion. For example, one ratio in the illustration above is: </p> 4 ⟨1:3⟩ 12 <p>The corresponding terms of the trinomial expansion are: </p> <p> 4 A 3 B 1 C 0 {\displaystyle 4A^{3}B^{1}C^{0}} and 12 A 2 B 1 C 1 {\displaystyle 12A^{2}B^{1}C^{1}} </p> <p>The following rules apply to the coefficients of all adjacent pairs of terms of the trinomial expansion: </p> <ul><li>The exponent of one of the variables remains unchanged (<i>B</i> in this case) and can be ignored.</li> <li>For the other two variables, one exponent increases by 1 and one exponent decreases by 1. <ul><li>The exponents of <i>A</i> are 3 and 2 (the larger being in the left term).</li> <li>The exponents of <i>C</i> are 0 and 1 (the larger being in the right term).</li></ul></li> <li>The coefficients and larger exponents are related: <ul><li>4 × 3 = 12 × 1</li> <li>4 / 12 = 1 / 3</li></ul></li> <li>These equations yield the ratio: "1:3".</li></ul> <p>The rules are the same for all horizontal and diagonal pairs. The variables <i>A, B, C</i> will change. </p><p>This ratio relationship provides another (somewhat cumbersome) way to calculate tetrahedron coefficients: </p> The coefficient of the adjacent term equals the coefficient of the current term multiplied by the current-term exponent of the decreasing variable divided by the adjacent-term exponent of the increasing variable. <p>The ratio of the adjacent coefficients may be a little clearer when expressed symbolically. Each term can have up to six adjacent terms: </p> For <i>x</i> = 0: C ( x , y , z − 1 ) = C ( x , y − 1 , z ) ⋅ z y , C ( x , y − 1 , z ) = C ( x , y , z − 1 ) ⋅ y z {\displaystyle C(x,y,z-1)=C(x,y-1,z)\cdot {\frac {z}{y}},\quad C(x,y-1,z)=C(x,y,z-1)\cdot {\frac {y}{z}}} For <i>y</i> = 0: <i> C ( x − 1 , y , z ) = C ( x , y , z − 1 ) ⋅ x z , C ( x , y , z − 1 ) = C ( x − 1 , y , z ) ⋅ z x {\displaystyle C(x-1,y,z)=C(x,y,z-1)\cdot {\frac {x}{z}},\quad C(x,y,z-1)=C(x-1,y,z)\cdot {\frac {z}{x}}} </i> For <i>z</i> = 0: <i> C ( x , y − 1 , z ) = C ( x − 1 , y , z ) ⋅ y x , C ( x − 1 , y , z ) = C ( x , y − 1 , z ) ⋅ x y {\displaystyle C(x,y-1,z)=C(x-1,y,z)\cdot {\frac {y}{x}},\quad C(x-1,y,z)=C(x,y-1,z)\cdot {\frac {x}{y}}} </i> <p>where C(<i>x,y,z</i>) is the coefficient and <i>x, y, z</i> are the exponents. In the days before pocket calculators and personal computers, this approach was used as a school-boy short-cut to write out binomial expansions without the tedious algebraic expansions or clumsy factorial computations. </p><p>This relationship will work only if the trinomial expansion is laid out in the non-linear fashion as it is portrayed in the section on the "trinomial expansion connection". </p> <h2 id="relationship-with-pascals-triangle">Relationship with Pascal's triangle</h2> <p>It is well known that the numbers along the three outside edges of the <i>n</i>th layer of the tetrahedron are the same numbers as the <i>n</i>th line of Pascal's triangle. However, the connection is actually much more extensive than just one row of numbers. This relationship is best illustrated by comparing Pascal's triangle down to line 4 with layer 4 of the tetrahedron. </p> <p>Pascal's triangle 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 Tetrahedron Layer 4 1 4 6 4 1 4 12 12 4 6 12 6 4 4 1 </p> <p>Multiplying the numbers of each line of Pascal's triangle down to the <i>n</i>th line by the numbers of the <i>n</i>th line generates the <i>n</i>th layer of the tetrahedron. In the following example, the lines of Pascal's triangle are in <i>italic</i> font and the rows of the tetrahedron are in bold font.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> </p> <i>1</i> <p>× 1 = 1 </p><p><i>1 1</i> × 4 = 4 4 </p><p><i>1 2 1</i> × 6 = 6 12 6 </p><p><i>1 3 3 1</i> × 4 = 4 12 12 4 </p><p><i>1 4 6 4 1</i> × 1 = </p> 1 4 6 4 1 <p>The multipliers (1 4 6 4 1) compose line 4 of Pascal's triangle. </p><p>This relationship demonstrates the fastest and easiest way to compute the numbers for any layer of the tetrahedron without computing factorials, which quickly become huge numbers. (Extended precision calculators become very slow beyond tetrahedron layer 200.) </p><p>If the coefficients of Pascal's triangle are labeled C(<i>i,j</i>) and the coefficients of the tetrahedron are labeled C(<i>n,i,j</i>), where <i>n</i> is the layer of the tetrahedron, <i>i</i> is the row, and <i>j</i> is the column, then the relation can be expressed symbolically as: </p> C ( i , j ) × C ( n , i ) = C ( n , i , j ) , 0 ≤ i ≤ n , 0 ≤ j ≤ i {\displaystyle C(i,j)\times C(n,i)=C(n,i,j),\quad 0\leq i\leq n,\ 0\leq j\leq i} <p>[<i>i, j, n</i> are not exponents here, just sequential labeling indexes.] </p> <h2 id="parallels-to-pascals-triangle-and-multinomial-coefficients">Parallels to Pascal's triangle and multinomial coefficients</h2> <p>This table summarizes the properties of the trinomial expansion and the trinomial distribution. It compares them to the binomial and multinomial expansions and distributions: </p> <table><tbody><tr><th>Type of polynomial</th><th>bi-nomial</th><th>tri-nomial</th><th>multi-nomial</th></tr><tr><td>Order of polynomial</td><td>2</td><td>3</td><td><i>m</i></td></tr><tr><td>Example of polynomial</td><td> A + B {\displaystyle A+B} </td><td> A + B + C {\displaystyle A+B+C} </td><td> A + B + C + ⋯ + M {\displaystyle A+B+C+\cdots +M} </td></tr><tr><td>Geometric structure[1]</td><td>triangle</td><td>tetrahedron</td><td><i>m</i>-simplex</td></tr><tr><td>Element structure</td><td>line</td><td>layer</td><td>group</td></tr><tr><td>Symmetry of element</td><td>2-way</td><td>3-way</td><td><i>m</i>-way</td></tr><tr><td>Number of terms per element</td><td><i>n</i>+1</td><td>(<i>n</i>+1)(<i>n</i>+2)/2</td><td>(<i>n</i>+1)(<i>n</i>+2)...(<i>n</i>+<i>m</i>−1)/(<i>m</i>−1)! = (<i>n</i>+<i>m</i>−1)!/<i>n</i>!(<i>m</i>−1)!</td></tr><tr><td>Sum of coefficients per element</td><td>2<i>n</i></td><td>3<i>n</i></td><td><i>m</i><i>n</i></td></tr><tr><td>Example of term</td><td><i>AxBy</i></td><td><i>AxByCz</i></td><td><i>AxByCz</i>...<i>Mm</i></td></tr><tr><td>Sum of exponents, all terms</td><td><i>n</i></td><td><i>n</i></td><td><i>n</i></td></tr><tr><td>Coefficient equation[2]</td><td><i>n</i>!/<i>x</i>!<i>y</i>!</td><td><i>n</i>!/<i>x</i>!<i>y</i>!<i>z</i>!</td><td><i>n</i>!/<i>x</i>! <i>y</i>! <i>z</i>! ... <i>x</i><i>m</i>!</td></tr><tr><td>Sum of coefficients "above"</td><td>2</td><td>3</td><td><i>m</i></td></tr><tr><td>Ratio of adjacent coefficients</td><td>2</td><td>6</td><td><i>m</i>(<i>m</i>−1)</td></tr></tbody></table> <ul><li>^1 A simplex is the simplest linear geometric form that exists in any dimension. Tetrahedra and triangles are examples in 3 and 2 dimensions, respectively.</li> <li>^2 The formula for the <a href="/facts/Binomial_coefficient/Tsx7eY5h">binomial coefficient</a> is usually expressed as <i>n</i>!/<i>x</i>!(<i>n</i>−<i>x</i>)!, where <i>n</i>−<i>x</i> = <i>y</i>.</li></ul> <h2 id="other-properties">Other properties</h2> <h3>Exponential construction</h3> <p>Arbitrary layer <i>n</i> can be obtained in a single step using the following formula: </p> ( b d ( n + 1 ) + b d + 1 ) n , {\displaystyle \left(b^{d\left(n+1\right)}+b^{d}+1\right)^{n},} <p>where <i>b</i> is the radix and <i>d</i> is the number of digits of any of the <a href="/facts/Multinomial_theorem/0kyhtHvf">central multinomial coefficients</a>, that is </p> d = 1 + ⌊ log b ( n k 1 , k 2 , k 3 ) ⌋ , ∑ i = 1 3 k i = n , ⌊ n 3 ⌋ ≤ k i ≤ ⌈ n 3 ⌉ , {\displaystyle \textstyle d=1+\left\lfloor \log _{b}{n \choose k_{1},k_{2},k_{3}}\right\rfloor ,\ \sum _{i=1}^{3}{k_{i}}=n,\ \left\lfloor {\frac {n}{3}}\right\rfloor \leq k_{i}\leq \left\lceil {\frac {n}{3}}\right\rceil ,} <p>then wrapping the digits of its result by <i>d</i>(<i>n</i>+1), spacing by <i>d</i> and removing leading zeros. </p><p>This method generalised to arbitrary dimension can be used to obtain slices of any <a href="/facts/Pascal%2527s_simplex/EIIHMhdE">Pascal's simplex</a>. </p> <h4>Examples</h4> <p>For radix <i>b</i> = 10, <i>n</i> = 5, <i>d</i> = 2: </p> ( 10 12 + 10 2 + 1 ) 5 {\displaystyle \textstyle \left(10^{12}+10^{2}+1\right)^{5}} = 10000000001015 = 1000000000505000000102010000010303010000520302005010510100501 1 1 1 000000000505 00 00 00 00 05 05 .. .. .. .. .5 .5 000000102010 00 00 00 10 20 10 .. .. .. 10 20 10 ~ 000010303010 ~ 00 00 10 30 30 10 ~ .. .. 10 30 30 10 000520302005 00 05 20 30 20 05 .. .5 20 30 20 .5 010510100501 01 05 10 10 05 01 .1 .5 10 10 .5 .1 wrapped by d(n+1) spaced by d leading zeros removed <p>For radix <i>b</i> = 10, <i>n</i> = 20, <i>d</i> = 9: </p> ( 10 189 + 10 9 + 1 ) 20 {\displaystyle \textstyle \left(10^{189}+10^{9}+1\right)^{20}} <h3>Sum of coefficients of a layer by rows</h3> <p>Summing the numbers in each row of a layer <i>n</i> of Pascal's pyramid gives </p> ( b d + 2 ) n , {\displaystyle \left(b^{d}+2\right)^{n},} <p>where <i>b</i> is the <a href="/facts/Radix/J5RGWRJF">radix</a> and <i>d</i> is the number of digits of the sum of the 'central' row (the one with the greatest sum). </p><p>For radix <i>b</i> = 10: </p> 1 ~ 1 \ 1 ~ 1 \ 1 ~ 1 \ 1 ~ 1 \ 1 ~ 1 --- 1 \ 1 ~ 02 \ 2 \ 2 ~ 04 \ 3 \ 3 ~ 06 \ 4 \ 4 ~ 08 1 ----- 1 \ 2 \ 1 ~ 04 \ 3 \ 6 \ 3 ~ 12 \ 6 \12 \ 6 ~ 24 1 02 --------- 1 \ 3 \ 3 \ 1 ~ 08 \ 4 \12 \12 \ 4 ~ 32 1 04 04 ------------- 1 \ 4 \ 6 \ 4 \ 1 ~ 16 1 06 12 08 ------------------ 1 08 24 32 16 1020 1021 1022 1023 1024 <h3>Sum of coefficients of a layer by columns</h3> <p>Summing the numbers in each column of a layer <i>n</i> of Pascal's pyramid gives </p> ( b 2 d + b d + 1 ) n , {\displaystyle \left(b^{2d}+b^{d}+1\right)^{n},} <p>where <i>b</i> is the <a href="/facts/Radix/J5RGWRJF">radix</a> and <i>d</i> is the number of digits of the sum of the 'central' column (the one with the greatest sum). </p><p>For radix <i>b</i> = 10: </p> 1 |1| |1| |1| | 1| | 1| --- 1| |1 |2| |2| |3| |3| | 4| | 4| | 5| | 5| 1 ----- 1| |2| |1 |3| |6| |3| | 6| |12| | 6| |10| |20| |10| 1 1 1 --------- 1| |3| |3| |1 | 4| |12| |12| | 4| |10| |30| |30| |10| 1 2 3 2 1 ------------- 1| | 4| | 6| | 4| | 1 | 5| |20| |30| |20| | 5| 1 3 6 7 6 3 1 -------------------------- 1| | 5| |10| |10| | 5| | 1 1 04 10 16 19 16 10 04 01 -------------------------------- 1 05 15 30 45 51 45 30 15 05 01 1110 1111 1112 1113 101014 101015 <h2 id="pascals-simplex">Pascal's simplex</h2> <p>In <a href="/facts/Mathematics/pxTouaz4">mathematics</a>, Pascal's simplex is a generalisation of <a href="/facts/Pascal%2527s_triangle/tb6BKXbc">Pascal's triangle</a> into arbitrary number of <a href="/facts/Dimensions/0ktmUyac">dimensions</a>, based on the <a href="/facts/Multinomial_theorem/0kyhtHvf">multinomial theorem</a>. </p> <h3>Generic Pascal's <i>m</i>-simplex</h3> <p>Let <i>m</i> (<i>m</i> > 0) be a number of terms of a polynomial and <i>n</i> (<i>n</i> ≥ 0) be a power the polynomial is raised to. </p><p>Let ∧ {\displaystyle \wedge } <i>m</i> denote a Pascal's <i>m</i>-<a href="/facts/Simplex/0FCfNRN8">simplex</a>. Each Pascal's <i>m</i>-<a href="/facts/Simplex/0FCfNRN8">simplex</a> is a <a href="/facts/Semi-infinite/0c13Cg1u">semi-infinite</a> object, which consists of an infinite series of its components. </p><p>Let ∧ {\displaystyle \wedge } <i>m</i><i>n</i> denote its <i>n</i>th component, itself a finite (<i>m</i> − 1)-<a href="/facts/Simplex/0FCfNRN8">simplex</a> with the edge length <i>n</i>, with a notational equivalent △ n m − 1 {\displaystyle \vartriangle _{n}^{m-1}} . </p> <h4><i>n</i>th component</h4> <p> ∧ n m = △ n m − 1 {\displaystyle \wedge _{n}^{m}=\vartriangle _{n}^{m-1}} consists of the <a href="/facts/Multinomial_theorem/0kyhtHvf">coefficients of multinomial expansion</a> of a polynomial with <i>m</i> terms raised to the power of <i>n</i>: </p> | x | n = ∑ | k | = n ( n k ) x k ; x ∈ R m , k ∈ N 0 m , n ∈ N 0 , m ∈ N {\displaystyle |x|^{n}=\sum _{|k|=n}{{\binom {n}{k}}x^{k}};\ \ x\in \mathbb {R} ^{m},\ k\in \mathbb {N} _{0}^{m},\ n\in \mathbb {N} _{0},\ m\in \mathbb {N} } <p>where | x | = ∑ i = 1 m x i , | k | = ∑ i = 1 m k i , x k = ∏ i = 1 m x i k i . {\displaystyle \textstyle |x|=\sum _{i=1}^{m}{x_{i}},\ |k|=\sum _{i=1}^{m}{k_{i}},\ x^{k}=\prod _{i=1}^{m}{x_{i}^{k_{i}}}.} </p> <h4>Example for ⋀4</h4> <p>Pascal's 4-simplex (sequence A189225 in the <a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a>), sliced along the <i>k</i>4. All points of the same color belong to the same <i>n</i>th component, from red (for <i>n</i> = 0) to blue (for <i>n</i> = 3). </p> <h3>Specific Pascal's simplices</h3> <h4>Pascal's 1-simplex</h4> <p> ∧ {\displaystyle \wedge } 1 is not known by any special name. </p> <h5><i>n</i>th component</h5> <p> ∧ n 1 = △ n 0 {\displaystyle \wedge _{n}^{1}=\vartriangle _{n}^{0}} (a point) is the <a href="/facts/Multinomial_theorem/0kyhtHvf">coefficient of multinomial expansion</a> of a polynomial with 1 term raised to the power of <i>n</i>: </p> ( x 1 ) n = ∑ k 1 = n ( n k 1 ) x 1 k 1 ; k 1 , n ∈ N 0 {\displaystyle (x_{1})^{n}=\sum _{k_{1}=n}{n \choose k_{1}}x_{1}^{k_{1}};\ \ k_{1},n\in \mathbb {N} _{0}} <h6>Arrangement of △ n 0 {\displaystyle \vartriangle _{n}^{0}} </h6> ( n n ) {\displaystyle \textstyle {n \choose n}} <p>which equals 1 for all <i>n</i>. </p> <h4>Pascal's 2-simplex</h4> <p> ∧ 2 {\displaystyle \wedge ^{2}} is known as <a href="/facts/Pascal%2527s_triangle/tb6BKXbc">Pascal's triangle</a> (sequence A007318 in the <a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a>). </p> <h5><i>n</i>th component</h5> <p> ∧ n 2 = △ n 1 {\displaystyle \wedge _{n}^{2}=\vartriangle _{n}^{1}} (a line) consists of the coefficients of <a href="/facts/Binomial_expansion/hd4SmkUd">binomial expansion</a> of a polynomial with 2 terms raised to the power of <i>n</i>: </p> ( x 1 + x 2 ) n = ∑ k 1 + k 2 = n ( n k 1 , k 2 ) x 1 k 1 x 2 k 2 ; k 1 , k 2 , n ∈ N 0 {\displaystyle (x_{1}+x_{2})^{n}=\sum _{k_{1}+k_{2}=n}{n \choose k_{1},k_{2}}x_{1}^{k_{1}}x_{2}^{k_{2}};\ \ k_{1},k_{2},n\in \mathbb {N} _{0}} <h6>Arrangement of △ n 1 {\displaystyle \vartriangle _{n}^{1}} </h6> ( n n , 0 ) , ( n n − 1 , 1 ) , … , ( n 1 , n − 1 ) , ( n 0 , n ) {\displaystyle \textstyle {n \choose n,0},{n \choose n-1,1},\ldots ,{n \choose 1,n-1},{n \choose 0,n}} <h4>Pascal's 3-simplex</h4> <p> ∧ 3 {\displaystyle \wedge ^{3}} is known as <a href="/facts/Pascal%2527s_tetrahedron/2ukt5A26">Pascal's tetrahedron</a> (sequence A046816 in the <a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a>). </p> <h5><i>n</i>th component</h5> <p> ∧ n 3 = △ n 2 {\displaystyle \wedge _{n}^{3}=\vartriangle _{n}^{2}} (a triangle) consists of the coefficients of <a href="/facts/Trinomial_expansion/xtlRHY8F">trinomial expansion</a> of a polynomial with 3 terms raised to the power of <i>n</i>: </p> ( x 1 + x 2 + x 3 ) n = ∑ k 1 + k 2 + k 3 = n ( n k 1 , k 2 , k 3 ) x 1 k 1 x 2 k 2 x 3 k 3 ; k 1 , k 2 , k 3 , n ∈ N 0 {\displaystyle (x_{1}+x_{2}+x_{3})^{n}=\sum _{k_{1}+k_{2}+k_{3}=n}{n \choose k_{1},k_{2},k_{3}}x_{1}^{k_{1}}x_{2}^{k_{2}}x_{3}^{k_{3}};\ \ k_{1},k_{2},k_{3},n\in \mathbb {N} _{0}} <h6>Arrangement of △ n 2 {\displaystyle \vartriangle _{n}^{2}} </h6> ( n n , 0 , 0 ) , ( n n − 1 , 1 , 0 ) , … … , ( n 1 , n − 1 , 0 ) , ( n 0 , n , 0 ) ( n n − 1 , 0 , 1 ) , ( n n − 2 , 1 , 1 ) , … … , ( n 0 , n − 1 , 1 ) ⋮ ( n 1 , 0 , n − 1 ) , ( n 0 , 1 , n − 1 ) ( n 0 , 0 , n ) {\displaystyle {\begin{aligned}\textstyle {n \choose n,0,0}&,\textstyle {n \choose n-1,1,0},\ldots \ldots ,{n \choose 1,n-1,0},{n \choose 0,n,0}\\\textstyle {n \choose n-1,0,1}&,\textstyle {n \choose n-2,1,1},\ldots \ldots ,{n \choose 0,n-1,1}\\&\vdots \\\textstyle {n \choose 1,0,n-1}&,\textstyle {n \choose 0,1,n-1}\\\textstyle {n \choose 0,0,n}\end{aligned}}} <h3>Properties</h3> <h4>Inheritance of components</h4> <p> ∧ n m = △ n m − 1 {\displaystyle \wedge _{n}^{m}=\vartriangle _{n}^{m-1}} is numerically equal to each (<i>m</i> − 1)-face (there is <i>m</i> + 1 of them) of △ n m = ∧ n m + 1 {\displaystyle \vartriangle _{n}^{m}=\wedge _{n}^{m+1}} , or: </p> ∧ n m = △ n m − 1 ⊂ △ n m = ∧ n m + 1 {\displaystyle \wedge _{n}^{m}=\vartriangle _{n}^{m-1}\subset \ \vartriangle _{n}^{m}=\wedge _{n}^{m+1}} <p>From this follows, that the whole ∧ m {\displaystyle \wedge ^{m}} is (<i>m</i> + 1)-times included in ∧ m + 1 {\displaystyle \wedge ^{m+1}} , or: </p> ∧ m ⊂ ∧ m + 1 {\displaystyle \wedge ^{m}\subset \wedge ^{m+1}} <h5>Example</h5> <table><tbody><tr><th></th><th> ∧ 1 {\displaystyle \wedge ^{1}} </th><th> ∧ 2 {\displaystyle \wedge ^{2}} </th><th> ∧ 3 {\displaystyle \wedge ^{3}} </th><th> ∧ 4 {\displaystyle \wedge ^{4}} </th></tr><tr><th> ∧ 0 m {\displaystyle \wedge _{0}^{m}} </th><td> 1 </td><td> 1</td><td> 1</td><td> 1</td></tr><tr><th> ∧ 1 m {\displaystyle \wedge _{1}^{m}} </th><td> 1 </td><td> 1 1</td><td> 1 1 1</td><td> 1 1 1 1</td></tr><tr><th> ∧ 2 m {\displaystyle \wedge _{2}^{m}} </th><td> 1 </td><td> 1 2 1</td><td> 1 2 1 2 2 1</td><td> 1 2 1 2 2 1 2 2 2 1</td></tr><tr><th> ∧ 3 m {\displaystyle \wedge _{3}^{m}} </th><td> 1 </td><td>1 3 3 1</td><td>1 3 3 1 3 6 3 3 3 1</td><td>1 3 3 1 3 6 3 3 3 1 3 6 3 6 6 3 3 3 3 1</td></tr></tbody></table> <p>For more terms in the above array refer to (sequence A191358 in the <a href="/facts/On-Line_Encyclopedia_of_Integer_Sequences/yow6cVsU">OEIS</a>) </p> <h4>Equality of sub-faces</h4> <p>Conversely, ∧ n m + 1 = △ n m {\displaystyle \wedge _{n}^{m+1}=\vartriangle _{n}^{m}} is (<i>m</i> + 1)-times bounded by △ n m − 1 = ∧ n m {\displaystyle \vartriangle _{n}^{m-1}=\wedge _{n}^{m}} , or: </p> ∧ n m + 1 = △ n m ⊃ △ n m − 1 = ∧ n m {\displaystyle \wedge _{n}^{m+1}=\vartriangle _{n}^{m}\supset \vartriangle _{n}^{m-1}=\wedge _{n}^{m}} <p>From this follows, that for given <i>n</i>, all <i>i</i>-faces are numerically equal in <i>n</i>th components of all Pascal's (<i>m</i> > <i>i</i>)-simplices, or: </p> ∧ n i + 1 = △ n i ⊂ △ n m > i = ∧ n m > i + 1 {\displaystyle \wedge _{n}^{i+1}=\vartriangle _{n}^{i}\subset \vartriangle _{n}^{m>i}=\wedge _{n}^{m>i+1}} <h5>Example</h5> <p>The 3rd component (2-simplex) of Pascal's 3-simplex is bounded by 3 equal 1-faces (lines). Each 1-face (line) is bounded by 2 equal 0-faces (vertices): </p> 2-simplex 1-faces of 2-simplex 0-faces of 1-face 1 3 3 1 1 . . . . . . 1 1 3 3 1 1 . . . . . . 1 3 6 3 3 . . . . 3 . . . 3 3 3 . . 3 . . 1 1 1 . <p>Also, for all <i>m</i> and all <i>n</i>: </p> 1 = ∧ n 1 = △ n 0 ⊂ △ n m − 1 = ∧ n m {\displaystyle 1=\wedge _{n}^{1}=\vartriangle _{n}^{0}\subset \vartriangle _{n}^{m-1}=\wedge _{n}^{m}} <h4>Number of coefficients</h4> <p>For the <i>n</i>th component ((<i>m</i> − 1)-simplex) of Pascal's <i>m</i>-simplex, the number of the <a href="/facts/Multinomial_theorem/0kyhtHvf">coefficients of multinomial expansion</a> it consists of is given by: </p> ( ( n − 1 ) + ( m − 1 ) ( m − 1 ) ) + ( n + ( m − 2 ) ( m − 2 ) ) = ( n + ( m − 1 ) ( m − 1 ) ) = ( ( m n ) ) , {\displaystyle {(n-1)+(m-1) \choose (m-1)}+{n+(m-2) \choose (m-2)}={n+(m-1) \choose (m-1)}=\left(\!\!{\binom {m}{n}}\!\!\right),} <p>(where the latter is the <a href="/facts/Multiset/bPFJGMDo">multichoose</a> notation). We can see this either as a sum of the number of coefficients of an (<i>n</i> − 1)th component ((<i>m</i> − 1)-simplex) of Pascal's <i>m</i>-simplex with the number of coefficients of an <i>n</i>th component ((<i>m</i> − 2)-simplex) of Pascal's (<i>m</i> − 1)-simplex, or by a number of all possible partitions of an <i>n</i>th power among <i>m</i> exponents. </p> <h5>Example</h5> Number of coefficients of <i>n</i>th component ((<i>m</i> − 1)-simplex) of Pascal's <i>m</i>-simplex<table><tbody><tr><th>m-simplex</th><th><i>n</i>th component</th><th><i>n</i> = 0</th><th><i>n</i> = 1</th><th><i>n</i> = 2</th><th><i>n</i> = 3</th><th><i>n</i> = 4</th><th><i>n</i> = 5</th></tr><tr><td>1-simplex</td><th>0-simplex</th><td>1</td><td>1</td><td>1</td><td>1</td><td>1</td><td>1</td></tr><tr><td>2-simplex</td><th>1-simplex</th><td>1</td><td>2</td><td>3</td><td>4</td><td>5</td><td>6</td></tr><tr><td>3-simplex</td><th>2-simplex</th><td>1</td><td>3</td><td>6</td><td>10</td><td>15</td><td>21</td></tr><tr><td>4-simplex</td><th>3-simplex</th><td>1</td><td>4</td><td>10</td><td>20</td><td>35</td><td>56</td></tr><tr><td>5-simplex</td><th>4-simplex</th><td>1</td><td>5</td><td>15</td><td>35</td><td>70</td><td>126</td></tr><tr><td>6-simplex</td><th>5-simplex</th><td>1</td><td>6</td><td>21</td><td>56</td><td>126</td><td>252</td></tr></tbody></table> <p>The terms of this table comprise a Pascal triangle in the format of a symmetric <a href="/facts/Pascal_matrix/jYJuazpz">Pascal matrix</a>. </p> <h4>Symmetry</h4> <p>An <i>n</i>th component ((<i>m</i> − 1)-simplex) of Pascal's <i>m</i>-simplex has the (<i>m</i>!)-fold spatial symmetry. </p> <h4>Geometry</h4> <p>Orthogonal axes <i>k</i>1, ..., <i>k</i><i>m</i> in <i>m</i>-dimensional space, vertices of component at <i>n</i> on each axis, the tip at [0, ..., 0] for <i>n</i> = 0. </p> <h4>Numeric construction</h4> <p>Wrapped <i>n</i>th power of a big number gives instantly the <i>n</i>th component of a Pascal's simplex. </p> | b d p | n = ∑ | k | = n ( n k ) b d p ⋅ k ; b , d ∈ N , n ∈ N 0 , k , p ∈ N 0 m , p : p 1 = 0 , p i = ( n + 1 ) i − 2 {\displaystyle \left|b^{dp}\right|^{n}=\sum _{|k|=n}{{\binom {n}{k}}b^{dp\cdot k}};\ \ b,d\in \mathbb {N} ,\ n\in \mathbb {N} _{0},\ k,p\in \mathbb {N} _{0}^{m},\ p:\ p_{1}=0,p_{i}=(n+1)^{i-2}} <p>where b d p = ( b d p 1 , ⋯ , b d p m ) ∈ N m , p ⋅ k = ∑ i = 1 m p i k i ∈ N 0 {\displaystyle \textstyle b^{dp}=(b^{dp_{1}},\cdots ,b^{dp_{m}})\in \mathbb {N} ^{m},\ p\cdot k={\sum _{i=1}^{m}{p_{i}k_{i}}}\in \mathbb {N} _{0}} . </p> <h2 id="usage">Usage</h2> <p>In genetics, it is common to use Pascal's pyramid to find out the proportion between different <a href="/facts/Genotypes/MlzK1Mfz">genotypes</a> on the same crossing. This is done by checking the line that is equivalent to the number of <a href="/facts/Phenotype/vxWXKGLj">phenotypes</a> (genotypes + 1). That line will be the proportion. </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Multinomial_theorem/0kyhtHvf">Multinomial theorem</a></li> <li><a href="/facts/Trinomial_expansion/xtlRHY8F">Trinomial expansion</a></li> <li><a href="/facts/Pascal%2527s_triangle/tb6BKXbc">Pascal's triangle</a></li> <li><a href="/facts/Pascal%2527s_simplex/EIIHMhdE">Pascal's simplex</a></li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="http://www.4dsolutions.net/ocn/urner.html">Beyond Flatland: Geometry for the 21st century. PART I: Pascal's Tetrahedron</a></li> <li><a href="https://web.archive.org/web/20071021233230/http://buckydome.com/math/Article2.htm">Pascal's Pyramid Or Pascal's Tetrahedron?</a></li> <li><a href="https://web.archive.org/web/20110527043438/http://www.math.rutgers.edu/~erowland/pascalssimplices.html">Pascal's Simplices</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Staib, J.; Staib, L. (1978). "The Pascal Pyramid". The Mathematics Teacher. 71 (6): 505–510. doi:10.5951/MT.71.6.0505. JSTOR 27961325. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Pedersen, Jean; Hilton, Peter; Holton, Derek (2002). Mathematical vistas : from a room with many windows. New York, NY [u.a.]: Springer. ISBN 978-0387950648. <a href="978-0387950648" target="_blank">978-0387950648</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> </ol>