|
|
| Line 1: |
Line 1: |
| {{no footnotes|date=January 2013}}
| | If you should speed up the PC then we have come to the right destination. I will show you, at the moment, five fast techniques to dramatically better the computer's performance.<br><br>Google Chrome crashes on Windows 7 by the corrupted cache contents plus problems with the stored browsing data. Delete the browsing information plus well-defined the contents of the cache to solve this problem.<br><br>Windows is actually pretty dumb. It only knows how to follow commands plus instructions, meaning that when we install a program, which system has to tell Windows what to do. This really is done by storing an "training file" in the registry of the system. All the computer programs place these "manuals" into the registry, allowing a computer to run a broad range of programs. Whenever we load up one of those programs, Windows simply looks up the system file inside the registry, plus carries out its instructions.<br><br>Analysis the files and clean it up regularly. Destroy all the unnecessary and unused files considering they only jam the computer system. It usually definitely enhance the speed of the computer plus be cautious that your computer never infected by a virus. Remember usually to update a antivirus software every time. If you do not employ a computer rather frequently, we can take a free antivirus.<br><br>The [http://bestregistrycleanerfix.com/tune-up-utilities tuneup utilities 2014] must come because standard with a back up plus restore center. This ought to be an convenient to implement procedure.That means which in the event you encounter a problem with the PC following using a registry cleaning you are able to just restore the settings.<br><br>Although I always utilize the many recent version of browser, occasionally different extensions plus plugins become the cause of errors with my browser and the program. The same is the story with my browser that was crashing frequently possibly due to the Flash player error.<br><br>Your registry is the destination all the significant configurations for hardware, software and user profile configurations plus needs are stored. Every time one of these items is changed, the database then begins to expand. Over time, the registry may become bloated with unwanted files. This causes a general slow down however, in extreme situations could cause significant tasks and programs to stop working all together.<br><br>Fortunately, there's a simple technique to fix all your computer mistakes. You merely want to be able to fix corrupt registry files on the computer. And to do that, we can only employ a tool acknowledged as a registry cleaner. These simple pieces of software really scan through the PC plus fix every corrupt file that could result a issue to Windows. This enables the computer to use all of the files it wants, that not just speeds it up - however also stops all errors on a system because well. |
| In [[mathematics]], '''Pascal's pyramid''' is a three-dimensional arrangement of the trinomial numbers, which are the coefficients of the [[trinomial expansion]] and the [[trinomial distribution]]. Pascal's Pyramid is the three-dimensional analog of the two-dimensional [[Pascal's triangle]], which contains the binomial numbers and relates to the [[binomial expansion]] and the [[binomial distribution]]. The binomial and trinomial numbers, coefficients, expansions, and distributions are subsets of the multinomial constructs with the same names. Pascal's Pyramid is more precisely called "Pascal's tetrahedron", since it has four triangular surfaces. (The pyramids of ancient Egypt had five surfaces: a square base and four triangular sides.)
| |
| | |
| ==Structure of the tetrahedron==
| |
| Because the tetrahedron is a three-dimensional object it is difficult to display it on a piece of paper or a computer screen. Assume the tetrahedron is divided into a number of levels, or floors, or 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:
| |
| <center>
| |
| Layer 0<br>
| |
| 1<br>
| |
| <br>
| |
| Layer 1<br>
| |
| 1 1<br>
| |
| 1<br>
| |
| <br>
| |
| Layer 2<br>
| |
| 1 2 1<br>
| |
| 2 2<br>
| |
| 1<br>
| |
| <br>
| |
| Layer 3<br>
| |
| 1 3 3 1<br>
| |
| 3 6 3<br>
| |
| 3 3<br>
| |
| 1<br>
| |
| <br>
| |
| Layer 4<br>
| |
| 1 4 6 4 1<br>
| |
| 4 12 12 4<br>
| |
| 6 12 6<br>
| |
| 4 4<br>
| |
| 1<br>
| |
| <br>
| |
| Layer 5<br>
| |
| 1 5 10 10 5 1<br>
| |
| 5 20 30 20 5<br>
| |
| 10 30 30 10<br>
| |
| 10 20 10<br>
| |
| 5 5<br>
| |
| 1<br>
| |
| </center>
| |
| The layers of the Tetrahedron have been deliberately displayed with the point down so that the Tetrahedron is not confused with Pascal's triangle.
| |
| | |
| ==Overview of the tetrahedron==
| |
| * There is three-way symmetry of the numbers in each layer.
| |
| * The number of terms in the ''n''<sup>th</sup> Layer is the ''n''<sup>th</sup> triangular number: (n + 1) × (n + 2) / 2.
| |
| * The sum of the values of the numbers in the ''n''<sup>th</sup> Layer is 3<sup>''n''</sup>.
| |
| * Each number in any layer is the sum of the three adjacent numbers in the layer above.
| |
| * Each number in any layer is a simple whole number ratio of the adjacent numbers in the same layer.
| |
| * Each number in any layer is a coefficient of the Trinomial Distribution and the trinomial expansion. This non-linear arrangement makes it easier to:
| |
| ** display the trinomial expansion in a coherent way;
| |
| ** compute the coefficients of the Trinomial Distribution;
| |
| ** calculate the numbers of any Tetrahedron layer.
| |
| * The numbers along the three edges of the ''n''<sup>th</sup> Layer are the numbers of the ''n''<sup>th</sup> Line of Pascal's triangle. And almost all the properties listed above have parallels with Pascal's triangle and Multinomial Coefficients.
| |
| | |
| ==Trinomial expansion connection==
| |
| The numbers of the Tetrahedron are derived from trinomial expansion. The ''n''<sup>th</sup> Layer is the detached coefficient matrix (no variables or exponents) of a trinomial expression (e.g.: ''A + B + C'') raised to the ''n''<sup>th</sup> power. The trinomial is expanded by repeatedly multiplying the trinomial by itself:
| |
| <center>
| |
| (''A + B + C'')<sup>1</sup> × (''A + B + C'')<sup>''n''</sup> = (''A + B + C'')<sup>''n''+1</sup>
| |
| </center>
| |
| Each term in the first expression is multiplied by each term in the second expression; and then the coefficients of like terms (same variables and exponents) are added together. Here is the expansion of (''A + B + C'')<sup>4</sup>:
| |
| <center>
| |
| 1''A''<sup>4</sup>''B''<sup>0</sup>''C''<sup>0</sup> + 4''A''<sup>3</sup>''B''<sup>0</sup>''C''<sup>1</sup> + 6''A''<sup>2</sup>''B''<sup>0</sup>''C''<sup>2</sup> + 4''A''<sup>1</sup>''B''<sup>0</sup>''C''<sup>3</sup> + 1''A''<sup>0</sup>''B''<sup>0</sup>''C''<sup>4</sup> +<br>
| |
| 4''A''<sup>3</sup>''B''<sup>1</sup>''C''<sup>0</sup> + 12''A''<sup>2</sup>''B''<sup>1</sup>''C''<sup>1</sup> + 12''A''<sup>1</sup>''B''<sup>1</sup>''C''<sup>2</sup> + 4''A''<sup>0</sup>''B''<sup>1</sup>''C''<sup>3</sup> +<br>
| |
| 6''A''<sup>2</sup>''B''<sup>2</sup>''C''<sup>0</sup> + 12''A''<sup>1</sup>''B''<sup>2</sup>''C''<sup>1</sup> + 6''A''<sup>0</sup>''B''<sup>2</sup>''C''<sup>2</sup> +<br>
| |
| 4''A''<sup>1</sup>''B''<sup>3</sup>''C''<sup>0</sup> + 4''A''<sup>0</sup>''B''<sup>3</sup>''C''<sup>1</sup> +<br>
| |
| 1''A''<sup>0</sup>''B''<sup>4</sup>''C''<sup>0</sup> <br>
| |
| </center>
| |
| 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''A''" is "''A''"; "''B''<sup>1</sup>" is "''B''"; and "''C''<sup>0</sup>" is "1"; etc.) The exponents of each term sum to the Layer number (''n''), 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: (''x + y + z'')! / (''x''! × ''y''! × ''z''!), where ''x, y, z'' are the exponents of ''A, B, C,'' respectively, and "!" means factorial (e.g.: ''n''! = 1 × 2 ×...× ''n''). The exponent formulas for the 4th Layer are:
| |
| <center>
| |
| <math>\textstyle {(4+0+0)!\over 4!\times 0!\times 0!} \ {(3+0+1)!\over 3!\times 0!\times 1!} \ {(2+0+2)!\over 2!\times 0!\times 2!} \ {(1+0+3)!\over 1!\times 0!\times 3!} \ {(0+0+4)!\over 0!\times 0!\times 4!}</math>
| |
| | |
| <math>\textstyle {(3+1+0)!\over 3!\times 1!\times 0!} \ {(2+1+1)!\over 2!\times 1!\times 1!} \ {(1+1+2)!\over 1!\times 1!\times 2!} \ {(0+1+3)!\over 0!\times 1!\times 3!}</math>
| |
| | |
| <math>\textstyle {(2+2+0)!\over 2!\times 2!\times 0!} \ {(1+2+1)!\over 1!\times 2!\times 1!} \ {(0+2+2)!\over 0!\times 2!\times 2!}</math>
| |
| | |
| <math>\textstyle {(1+3+0)!\over 1!\times 3!\times 0!} \ {(0+3+1)!\over 0!\times 3!\times 1!}</math>
| |
| | |
| <math>\textstyle {(0+4+0)!\over 0!\times 4!\times 0!}</math>
| |
| | |
| </center>
| |
| 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.
| |
| | |
| ==Trinomial distribution connection==
| |
| 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:
| |
| <center>
| |
| [ ''n''! / ( ''x''! × ''y''! × ''z''!) ] × [ (P<sub>A</sub>)<sup>''x''</sup> × (P<sub>B</sub>)<sup>''y''</sup> × (P<sub>C</sub>)<sup>''z''</sup>]</center>
| |
| where ''x, y, z'' are the number of times each of the three outcomes does occur; ''n'' is the number of trials and equals the sum of ''x+y+z''; and P<sub>A</sub>, P<sub>B</sub>, P<sub>C</sub> are the probabilities that each of the three events could occur.
| |
| | |
| 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:
| |
| <center> | |
| [ 4! / ( 1! × 1! × 2!) ] × [ (16%)<sup>1</sup> × (30%)<sup>1</sup> × (54%)<sup>2</sup>] = 12 × 0.0140 = 17%
| |
| </center>
| |
| 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:
| |
| <center>
| |
| <math>\textstyle {4!\over 4!\times 0!\times 0!} \ {4!\over 3!\times 0!\times 1!} \ {4!\over 2!\times 0!\times 2!} \ {4!\over 1!\times 0!\times 3!} \ {4!\over 0!\times 0!\times 4!}</math>
| |
| | |
| <math>\textstyle {4!\over 3!\times 1!\times 0!} \ {4!\over 2!\times 1!\times 1!} \ {4!\over 1!\times 1!\times 2!} \ {4!\over 0!\times 1!\times 3!}</math>
| |
| | |
| <math>\textstyle {4!\over 2!\times 2!\times 0!} \ {4!\over 1!\times 2!\times 1!} \ {4!\over 0!\times 2!\times 2!}</math>
| |
| | |
| <math>\textstyle {4!\over 1!\times 3!\times 0!} \ {4!\over 0!\times 3!\times 1!}</math>
| |
| | |
| <math>\textstyle {4!\over 0!\times 4!\times 0!}</math>
| |
| | |
| </center>
| |
| 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.
| |
| | |
| Shorthand is normally used to express combinatorial functions in the following "choose" format (which is read as "4 choose 4, 0, 0", etc.).
| |
| <center>
| |
| <math>\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}</math>
| |
| | |
| <math>\textstyle {4\choose 3,1,0} \ {4\choose 2,1,1} \ {4\choose 1,1,2} \ {4\choose 0,1,3}</math>
| |
| | |
| <math>\textstyle {4\choose 2,2,0} \ {4\choose 1,2,1} \ {4\choose 0,2,2}</math>
| |
| | |
| <math>\textstyle {4\choose 1,3,0} \ {4\choose 0,3,1}</math>
| |
| | |
| <math>\textstyle {4\choose 0,4,0}</math>
| |
| | |
| </center>
| |
| 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 (''n'').
| |
| | |
| This notation makes an easy way to express the sum of all the coefficients of Layer ''n'':
| |
| <center><math>\textstyle \sum_{x,y,z} {n \choose x,y,z}</math> = 3<sup>''n''</sup>.</center>
| |
| | |
| ==Addition of coefficients between layers==
| |
| The numbers on every layer (''n'') of the Tetrahedron are the sum of the three adjacent numbers in the layer (''n''−1) "above" it. This relationship is rather difficult to see without intermingling the layers. Below are ''italic Layer 3 numbers'' interleaved among '''bold Layer 4 numbers''':
| |
| <center>
| |
| '''1 4 6 4 1'''<br>
| |
| ''1 3 3 1''<br>
| |
| '''4 12 12 4'''<br>
| |
| ''3 6 3''<br>
| |
| '''6 12 6'''<br>
| |
| ''3 3''<br>
| |
| '''4 4'''<br>
| |
| ''1''<br>
| |
| '''1'''<br>
| |
| </center>
| |
| | |
| 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 is not a magical coincidence. Rather, it comes about through the two-step trinomial expansion process.
| |
| | |
| Continuing with this example, in Step 1, each term of (''A + B + C'')<sup>3</sup> is multiplied by each term of (''A + B + C'')<sup>1</sup>. Only three of these multiplications are of interest in this example:
| |
| <center><table>
| |
| <tr><td>Layer 3 term <td>Multiply by <td>Product term
| |
| <tr><td>6''A''<sup>1</sup>''B''<sup>1</sup>''C''<sup>1</sup> <td>1''B''<sup>1</sup> <td>6''A''<sup>1</sup>''B''<sup>2</sup>''C''<sup>1</sup>
| |
| <tr><td>3''A''<sup>1</sup>''B''<sup>2</sup>''C''<sup>0</sup> <td>1''C''<sup>1</sup> <td>3''A''<sup>1</sup>''B''<sup>2</sup>''C''<sup>1</sup>
| |
| <tr><td>3''A''<sup>0</sup>''B''<sup>2</sup>''C''<sup>1</sup> <td>1''A''<sup>1</sup> <td>3''A''<sup>1</sup>''B''<sup>2</sup>''C''<sup>1</sup>
| |
| </table></center>
| |
| (The multiplication of like variables causes the addition of exponents; e.g.: ''D''<sup>1</sup> × ''D''<sup>2</sup> = ''D''<sup>3</sup>.)
| |
| | |
| Then, in Step 2, the summation of like terms (same variables and exponents) results in: 12''A''<sup>1</sup>''B''<sup>2</sup>''C''<sup>1</sup>, which is the term of (''A + B + C'')<sup>4</sup>; while 12 is the coefficient of the 4th Layer of the Tetrahedron.
| |
| | |
| Symbolically, the additive relation can be expressed as:
| |
| <center>C(''x,y,z'') = C(''x''−1'',y,z'') + C(''x,y''−1'',z'') + C(''x,y,z''−1)</center>
| |
| where C(''x,y,z'') is the coefficient of the term with exponents ''x, y, z'' and ''x+y+z = n'' is the layer of the Tetrahedron.
| |
| | |
| 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".
| |
| | |
| ==Ratio between coefficients of same layer==
| |
| 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:
| |
| <center>
| |
| '''1''' <1:4> '''4''' <2:3> '''6''' <3:2> '''4''' <4:1> '''1'''<br>
| |
| '''4''' <1:3> '''12''' <2:2> '''12''' <3:1> '''4'''<br>
| |
| '''6''' <1:2> '''12''' <2:1> '''6'''<br>
| |
| '''4''' <1:1> '''4'''<br>
| |
| '''1'''<br>
| |
| </center>
| |
| 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.
| |
| | |
| 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: | |
| <center>'''4''' <1:3> '''12'''</center>
| |
| The corresponding terms of the trinomial expansion are:
| |
| <center>
| |
| 4''A''<sup>3</sup>''B''<sup>1</sup>''C''<sup>0</sup> and 12''A''<sup>2</sup>''B''<sup>1</sup>''C''<sup>1</sup>
| |
| </center>
| |
| The following rules apply to the coefficients of all adjacent pairs of terms of the trinomial expansion:
| |
| * The exponent of one of the variables remains unchanged (''B'' in this case) and can be ignored.
| |
| * For the other two variables, one exponent increases by 1 and one exponent decreases by 1.
| |
| ** The exponents of ''A'' are 3 and 2 (the larger being in the left term).
| |
| ** The exponents of ''C'' are 0 and 1 (the larger being in the right term).
| |
| * The coefficients and larger exponents are related:
| |
| ** 4 × 3 = 12 × 1
| |
| ** 4 / 12 = 1 / 3
| |
| * These equations yield the ratio: "1:3".
| |
| The rules are the same for all horizontal and diagonal pairs. The variables ''A, B, C'' will change.
| |
| | |
| This ratio relationship provides another (somewhat cumbersome) way to calculate tetrahedron coefficients:
| |
| :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.
| |
| The ratio of the adjacent coefficients may be a little clearer when expressed symbolically. Each term can have up to six adjacent terms:
| |
| <center>
| |
| For ''x'' = 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''<br>
| |
| For ''y'' = 0: C(''x''−1'',y,z'') = C(''x,y,z''−1) × ''x / z'' C(''x,y,z''−1) = C(''x''−1'',y,z'') × ''z / x''<br>
| |
| For ''z'' = 0: C(''x,y''−1'',z'') = C(''x''−1'',y,z'') × ''y / x'' C(''x''−1'',y,z'') = C(''x,y''−1'',z'') × ''x / y''<br>
| |
| </center>
| |
| where C(''x,y,z'') is the coefficient and ''x, y, z'' 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 tedious algebraic expansions or clumsy factorial computations.
| |
| | |
| 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".
| |
| | |
| ==Relationship with Pascal's triangle==
| |
| It is well known that the numbers along the three outside edges of the ''n''<sup>th</sup> Layer of the tetrahedron are the same numbers as the ''n''<sup>th</sup> 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.
| |
| <center>
| |
| Pascal's triangle<br>
| |
| 1<br>
| |
| 1 1<br>
| |
| 1 2 1<br>
| |
| 1 3 3 1<br>
| |
| 1 4 6 4 1<br>
| |
| <br>
| |
| Tetrahedron Layer 4<br>
| |
| 1 4 6 4 1<br>
| |
| 4 12 12 4<br>
| |
| 6 12 6<br>
| |
| 4 4<br>
| |
| 1<br>
| |
| </center>
| |
| Multiplying the numbers of each line of Pascal's triangle down to the ''n''<sup>th</sup> Line by the numbers of the ''n''<sup>th</sup> Line generates the ''n''<sup>th</sup> Layer of the Tetrahedron. In the following example, ''the lines of Pascal's triangle are in italic font'' and '''the rows of the tetrahedron are in bold font'''.
| |
| <center>
| |
| ''1''<br>
| |
| × 1 =<br>
| |
| '''1'''
| |
| | |
| ''1 1''<br>
| |
| × 4 =<br>
| |
| '''4 4'''
| |
| | |
| ''1 2 1''<br>
| |
| × 6 =<br>
| |
| '''6 12 6'''
| |
| | |
| ''1 3 3 1''<br>
| |
| × 4 =<br>
| |
| '''4 12 12 4'''
| |
| | |
| ''1 4 6 4 1''<br>
| |
| × 1 =<br>
| |
| '''1 4 6 4 1'''<br>
| |
| </center>
| |
| The multipliers (1 4 6 4 1) compose Line 4 of Pascal's triangle.
| |
| | |
| 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.)
| |
| | |
| If the coefficients of Pascal's triangle are labeled C(''i,j'') and the coefficients of the Tetrahedron are labeled C(''n,i,j''), where ''n'' is the layer of the Tetrahedron, ''i'' is the row, and ''j'' is the column, then the relation can be expressed symbolically as:
| |
| <center>C(''i,j'') × C(''n,i'') = C(''n,i,j'') ''i'' = 0 to ''n, j'' = 0 to ''i''</center>
| |
| [It is important to understand that ''i, j, n'' are not exponents here, just sequential labeling indexes.]
| |
| | |
| ==Parallels to Pascal's triangle and Multinomial Coefficients==
| |
| This table summarizes the properties of the trinomial expansion and the trinomial distribution, and it compares them to the binomial and multinomial expansions and distributions: | |
| <table>
| |
| <tr><td>Type of polynomial <td>bi-nomial <td>tri-nomial <td>multi-nomial
| |
| <tr><td>Order of polynomial <td>2 <td>3 <td>''m''
| |
| <tr><td>Example of polynomial <td>''A+B'' <td>''A+B+C'' <td>''A+B+C+...+M''
| |
| <tr><td>Geometric structure (1) <td>triangle <td>tetrahedron <td>''m''-simplex
| |
| <tr><td>Element structure <td>line <td>layer <td>group
| |
| <tr><td>Symmetry of element <td>2-way <td>3-way <td>''m''-way
| |
| <tr><td>Number of terms per element <td>''n''+1 <td>(''n''+1) × (''n''+2) / 2
| |
| <td>(''n''+1) × (''n''+2) ×...× (''n''+''m''−1) / (''m''−1)
| |
| <tr><td>Sum of values per element <td>2<sup>''n''</sup> <td>3<sup>''n''</sup> <td>''m''<sup>''n''</sup>
| |
| <tr><td>Example of term <td>''A<sup>x</sup>B<sup>y''</sup>
| |
| <td>''A<sup>x</sup>B<sup>y</sup>C<sup>z''</sup>
| |
| <td>''A<sup>x</sup>B<sup>y</sup>C<sup>z</sup>...M<sup>m''</sup>
| |
| <tr><td>Sum of exponents, all terms <td>''n'' <td>''n'' <td>''n''
| |
| <tr><td>Coefficient equation (2) <td>''n''! / (''x''! × ''y''!) <td>''n''! / (''x''! × ''y''! × ''z''!)
| |
| <td>''n''! / (''x''<sub>1</sub>! × ''x''<sub>2</sub>! × ''x''<sub>3</sub>! ×...× ''x''<sub>''m''</sub>!)
| |
| <tr><td>Sum of coefficients "above" <td>2 <td>3 <td>''m''
| |
| <tr><td>Ratio of adjacent coefficients <td>2 <td>6 <td>''m'' × (''m''−1)
| |
| </table>
| |
| (1) A simplex is the simplest linear geometric form that exists in any dimension. Tetrahedrons and triangles are examples in 3 and 2 dimensions, respectively.<br>
| |
| (2) The formula for the binomial coefficient is usually expressed as: ''n''! / (''x''! × (''n−x'')!); where ''n−x = y''.
| |
| | |
| ==Other properties==
| |
| | |
| ===Exponentional construction===
| |
| Arbitrary layer ''n'' can be obtained in a single step using the following formula:
| |
| | |
| :<math>
| |
| \left(b^{d\left(n+1\right)}+b^d+1\right)^n,
| |
| </math>
| |
| | |
| where ''b'' is the radix and ''d'' is the number of digits of any of the [[Multinomial theorem#Central multinomial coefficients|central multinomial coefficients]], that is
| |
| | |
| :<math>
| |
| \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 \le k_i \le \left\lceil\frac{n}{3}\right\rceil,
| |
| </math>
| |
| | |
| then wrapping the digits of its result by ''d(n+1)'', spacing by ''d'' and removing leading zeros.
| |
| | |
| This method generalised to arbitrary dimension can be used to obtain slices of any [[Pascal's simplex]].
| |
| | |
| ====Examples====
| |
| For radix ''b'' = 10, ''n'' = 5, ''d'' = 2:
| |
| | |
| :<math>
| |
| \textstyle\left(10^{12} + 10^2 + 1\right)^5
| |
| </math>
| |
| | |
| = 1000000000101<sup>5</sup>
| |
| = 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
| |
| | |
| For radix ''b'' = 10, ''n'' = 20, ''d'' = 9:
| |
| | |
| :<math>
| |
| \textstyle\left(10^{189} + 10^9 + 1\right)^{20}
| |
| </math>
| |
| | |
| [[Image:Pascal's pyramid layer 20.png|378px|none|thumb|Pascal's pyramid layer #20.]]
| |
| | |
| ===Sum of coefficients of a layer by rows===
| |
| Summing the numbers in each row of a layer ''n'' of Pascal's pyramid gives
| |
| | |
| :<math>
| |
| \left(b^d + 2\right)^n,
| |
| </math>
| |
| | |
| where ''b'' is the [[radix]] and ''d'' is the number of digits of the sum of the 'central' row (the one with the greatest sum).
| |
| | |
| For radix ''b'' = 10:
| |
| | |
| 1 ~ 1 \ 1 ~ 1 \ 1 ~ 1 \ 1 ~ 1 \ 1 ~ 1
| |
| --- 1 \ 1 ~ 2 \ 2 \ 2 ~ 4 \ 3 \ 3 ~ 06 \ 4 \ 4 ~ 08
| |
| 1 ----- 1 \ 2 \ 1 ~ 4 \ 3 \ 6 \ 3 ~ 12 \ 6 \12 \ 6 ~ 24
| |
| 1 2 --------- 1 \ 3 \ 3 \ 1 ~ 08 \ 4 \12 \12 \ 4 ~ 32
| |
| 1 4 4 ------------- 1 \ 4 \ 6 \ 4 \ 1 ~ 16
| |
| 1 06 12 08 ------------------
| |
| 1 08 24 32 16
| |
|
| |
| 12<sup>0</sup> 12<sup>1</sup> 12<sup>2</sup> 102<sup>3</sup> 102<sup>4</sup>
| |
| | |
| ===Sum of coefficients of a layer by columns===
| |
| Summing the numbers in each column of a layer ''n'' of Pascal's pyramid gives
| |
| | |
| :<math>
| |
| \left(b^{2d} + b^d + 1\right)^n,
| |
| </math>
| |
| | |
| where ''b'' is the [[radix]] and ''d'' is the number of digits of the sum of the 'central' column (the one with the greatest sum).
| |
| | |
| For radix ''b'' = 10:
| |
| | |
| 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
| |
|
| |
| 111<sup>0</sup> 111<sup>1</sup> 111<sup>2</sup> 111<sup>3</sup> 10101<sup>4</sup> 10101<sup>5</sup>
| |
| | |
| ==Usage==
| |
| While studying genetics, it's common to use the Pascal's pyramid to find out the proportion between different genotypes on the same crossing. This is done by checking the line that is equivalent to the number of phenotypes (genotypes + 1). That line will be the proportion.<sup>[more detail needed]</sup>
| |
| | |
| ==See also==
| |
| *[[Multinomial theorem]]
| |
| *[[Trinomial expansion]]
| |
| *[[Pascal's triangle]]
| |
| *[[Pascal's simplex]]
| |
| | |
| ==External links==
| |
| *[http://www.4dsolutions.net/ocn/urner.html Beyond Flatland: Geometry for the 21st century. PART I: Pascal's Tetrahedron]
| |
| *[http://buckydome.com/math/Article2.htm Pascal's Pyramid Or Pascal's Tetrahedron?]
| |
| *[http://www.math.rutgers.edu/~erowland/pascalssimplices.html Pascal's Simplices]
| |
| | |
| [[Category:Factorial and binomial topics]]
| |
| [[Category:Triangles of numbers]]
| |
| [[Category:Blaise Pascal]]
| |