Pascal's triangle: Difference between revisions
imported>Olier Raby (Corrections.) |
imported>Olier Raby (== Properties ==) |
||
| Line 1: | Line 1: | ||
The '''Pascal's triangle''' is a convenient tabular presentation for the [[binomial coefficients]]. Already known in the 11th century<ref>[http://www-gap.dcs.st-and.ac.uk/~history/Biographies/Al-Karaji.html ''Abu Bekr ibn Muhammad ibn al-Husayn Al-Karaji''], School of Mathematics and Statistics, University of St Andrews. Consulted 2005-09-03.</ref>, it was adopted in [[Western world]] under this name after [[Blaise Pascal]] published his ''Traité du triangle arithmétique'' ("Treatise on the Arithmetical Triangle") in 1654. | The '''Pascal's triangle''' is a convenient tabular presentation for the [[binomial coefficients]]. Already known in the 11th century<ref>[http://www-gap.dcs.st-and.ac.uk/~history/Biographies/Al-Karaji.html ''Abu Bekr ibn Muhammad ibn al-Husayn Al-Karaji''], School of Mathematics and Statistics, University of St Andrews. Consulted 2005-09-03.</ref>, it was adopted in [[Western world]] under this name after [[Blaise Pascal]] published his ''Traité du triangle arithmétique'' ("Treatise on the Arithmetical Triangle") in 1654. | ||
For instance, we can use Pascal's triangle to compute the | For instance, we can use Pascal's triangle to compute the binomial expansion of | ||
<math>(x+y)^4 = 1 \times a^4 + 4 \times a^3b + 6 \times a^2b^2 + 4 \times ab^3 + 1 \times b^4 ~</math> | <math>(x+y)^4 = 1 \times a^4 + 4 \times a^3b + 6 \times a^2b^2 + 4 \times ab^3 + 1 \times b^4 ~</math> | ||
The | The [[coefficient]]s 1, 4, 6, 4, 1 appear directly in the triangle. | ||
<center> | <center> | ||
<math> | <math> | ||
| Line 30: | Line 30: | ||
Those coefficients have applications in [[algebra]] and in [[probabilities]]. From the triangle, we can equally compute the [[Fibonacci number]]s and create the [[Sierpinski triangle]]. After studying it, [[Isaac Newton]] expanded it and found new methods to extract the [[square root]] and to calculate the natural [[logarithm]] of a number. | Those coefficients have applications in [[algebra]] and in [[probabilities]]. From the triangle, we can equally compute the [[Fibonacci number]]s and create the [[Sierpinski triangle]]. After studying it, [[Isaac Newton]] expanded it and found new methods to extract the [[square root]] and to calculate the natural [[logarithm]] of a number. | ||
== Properties == | |||
In order to ease the understanding of some properties, it should be presented differently : | |||
<math> | |||
\begin{array}{cccccccc} | |||
1 & & & & & & & \\ | |||
1 & 1 & & & & & & \\ | |||
1 & 2 & 1 & & & & & \\ | |||
1 & 3 & 3 & 1 & & & & \\ | |||
1 & 4 & 6 & 4 & 1 & & & \\ | |||
1 & 5 & 10& 10& 5 & 1 & & \\ | |||
1 & 6 & 15& 20& 15& 6 & 1 & \\ | |||
1 & 7 & 21& 35& 35& 21& 7 & 1 \\ | |||
...&...&...&...&...&...&...&...\\ | |||
\end{array} | |||
</math> | |||
Each coefficient is the sum of the coefficient exactly over it and the other to its left. For instance, <math>3 + 3 = 6</math>. | |||
Let's call this rule the "addition rule", to which the ones on the left do not follow. | |||
== References == | == References == | ||
Revision as of 05:42, 25 October 2007
The Pascal's triangle is a convenient tabular presentation for the binomial coefficients. Already known in the 11th century[1], it was adopted in Western world under this name after Blaise Pascal published his Traité du triangle arithmétique ("Treatise on the Arithmetical Triangle") in 1654.
For instance, we can use Pascal's triangle to compute the binomial expansion of
The coefficients 1, 4, 6, 4, 1 appear directly in the triangle.
Each coefficient in the triangle is the sum of the two coefficients over it[2]. For instance, . The binomial coefficients relate to this construction by Pascal's rule, which states that if
is the kth binomial coefficient in the binomial expansion of (x+y)n, then
for any nonnegative integer n and any integer k between 0 and n.[3]
Those coefficients have applications in algebra and in probabilities. From the triangle, we can equally compute the Fibonacci numbers and create the Sierpinski triangle. After studying it, Isaac Newton expanded it and found new methods to extract the square root and to calculate the natural logarithm of a number.
Properties
In order to ease the understanding of some properties, it should be presented differently :
Each coefficient is the sum of the coefficient exactly over it and the other to its left. For instance, .
Let's call this rule the "addition rule", to which the ones on the left do not follow.
References
- ↑ Abu Bekr ibn Muhammad ibn al-Husayn Al-Karaji, School of Mathematics and Statistics, University of St Andrews. Consulted 2005-09-03.
- ↑ This rule does not apply to the ones bordering the triangle. We just insert them.
- ↑ By convention, the binomial coefficient is set to zero if k is either less than zero or greater than n.
