Content deleted Content added
Geometry guy (talk | contribs) →The triangle: put back row numbering |
Geometry guy (talk | contribs) →Uses of Pascal's triangle: Rewrite and copyedit |
||
Line 51:
1 16 120 560 1820 4368 8008 11440 12870 11440 8008 4368 1820 560 120 16 1
==
Pascal's triangle
:(''x'' + ''y'')<sup>2</sup> = ''x''<sup>2</sup> + 2''xy'' + ''y''<sup>2</sup> = '''1'''''x''<sup>2</sup>''y''<sup>0</sup> + '''2'''''x''<sup>1</sup>''y''<sup>1</sup> + '''1'''''x''<sup>0</sup>''y''<sup>2</sup>.
Notice the coefficients are the
In general, when a [[binomial]] like ''x'' + ''y'' is raised to a positive integer power we have:
:(''x'' + ''y'')<sup>''n''</sup> = ''a''<sub>0</sub>''x''<sup>''n''</sup> + ''a''<sub>1</sub>''x''<sup>''n''−1</sup>''y'' + ''a''<sub>2</sub>''x''<sup>''n''−2</sup>''y''<sup>2</sup> + … + ''a''<sub>''n''−1</sub>''xy''<sup>''n''−1</sup> + ''a''<sub>''n''</sub>''y''<sup>''n''</sup>,
where the coefficients ''a''<sub>''i''</sub> in this expansion are precisely the numbers on row ''n''
:<math>a_i = {n \choose i}.</math>
Line 68:
This is the [[binomial theorem]].
To see how the binomial theorem relates to the simple construction of Pascal's triangle, consider the problem of calculating the coefficients of the expansion of (''x'' + 1)<sup>''n''+1</sup> in terms of the corresponding coefficients of (''x'' + 1)<sup>''n''</sup> (setting ''y'' = 1 for simplicity). Suppose then that
:<math>\sum_{i=0}^n a_i x^i</math>▼
▲:<math>(x+1)^n=\sum_{i=0}^n a_i x^i.</math>
Now
Line 76 ⟶ 78:
:<math>(x+1)^{n+1} = (x+1)(x+1)^n = x(x+1)^n + (x+1)^n = \sum_{i=0}^n a_i x^{i+1} + \sum_{i=0}^n a_i x^i</math>
The two summations can be reorganized as follows:
::<math>\sum_{i=0}^{n } a_{i } x^{i+1} + \sum_{i=0}^n a_i x^i = </math>
Line 84 ⟶ 86:
::<math>\sum_{i=1}^{n } (a_{i-1} + a_i)x^{i } + x^0 + x^{n+1}</math> (because of how raising a polynomial to a power works, ''a''<sub>0</sub> = ''a''<sub>''n''</sub> = 1)
We now have an expression for the polynomial (''x'' + 1)<sup>''n''+1</sup> in terms of the coefficients of (''x'' + 1)<sup>''n''</sup> (these are the ''a''<sub>''i''</sub>s), which is what we need if we want to express a line in terms of the line above it. Recall that all the terms in a diagonal going from the upper-left to the lower-right correspond to the same power of ''x'', and that the a-terms are the coefficients of the polynomial (''x'' + 1)<sup>''n''</sup>, and we are determining the coefficients of (''x'' + 1)<sup>''n''+1</sup>. Now, for any given ''i'' not 0 or ''n'' + 1, the coefficient of the ''x''<sup>''i''</sup> term in the polynomial (''x'' + 1)<sup>''n''+1</sup> is equal to ''a''<sub>''i''</sub> (the figure above and to the left of the figure to be determined, since it is on the same diagonal) + ''a''<sub>''i''−1</sub> (the figure to the immediate right of the first figure).
It is not difficult to turn this argument into a [[proof (mathematics)|proof]] (by [[mathematical induction]]) of the binomial theorem.
:<math> {n \choose 0} + {n \choose 1} + \cdots +{n \choose n-1} + {n \choose n} = 2^n. </math>
==Properties of Pascal's triangle==
|