Pascal's triangle

From Citizendium
Revision as of 06:21, 25 October 2007 by imported>Olier Raby (Correction. Precision. Layout.)
Jump to navigation Jump to search

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, the triangle 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"[2].

Using this format, it is easy to apply an index to each row :



Starting the indices at zero facilitates many calculations.

The sum of any row is , with being the row index : For instance, the sum of row 4 is .

References

  1. Abu Bekr ibn Muhammad ibn al-Husayn Al-Karaji, School of Mathematics and Statistics, University of St Andrews. Consulted 2005-09-03.
  2. 2.0 2.1 This rule does not apply to the ones bordering the triangle. We just insert them.
  3. By convention, the binomial coefficient is set to zero if k is either less than zero or greater than n.