In mathematics, Pascal's triangle is an infinite triangular array of the binomial coefficients which play a crucial role in probability theory, combinatorics, and algebra. In much of the Western world, it is named after the French mathematician Blaise Pascal, although other mathematicians studied it centuries before him in India, Persia, China, Germany, and Italy. The rows of Pascal's triangle are conventionally enumerated starting with row n = 0 {\displaystyle n=0} at the top (the 0th row). The entries in each row are numbered from the left beginning with k = 0 {\displaystyle k=0} and are usually staggered relative to the numbers in the adjacent rows. The triangle may be constructed in the following manner: In row 0 (the topmost row), there is a unique nonzero entry 1. Each entry of each subsequent row is constructed by adding the number above and to the left with the number above and to the right, treating blank entries as 0. For example, the initial number of row 1 (or any other row) is 1 (the sum of 0 and 1), whereas the numbers 1 and 3 in row 3 are added to produce the number 4 in row 4.
Formula In the n {\displaystyle n} th row of Pascal's triangle, the k {\displaystyle k} th entry is denoted ( n k ) {\displaystyle {\tbinom {n}{k}}} , pronounced "n choose k" because it describes the number of combinations: the number of ways of choosing k {\displaystyle k} things from among a collection of n {\displaystyle n} things. Row numbering starts at 0, and likewise entries within a row are numbered from 0. For example, the topmost entry is ( 0 0 ) = 1 {\displaystyle {\tbinom {0}{0}}=1} . With this notation, the construction of the previous paragraph may be written as
( n k ) = ( n − 1 k − 1 ) + ( n − 1 k ) {\displaystyle {n \choose k}={n-1 \choose k-1}+{n-1 \choose k}} for any positive integer n {\displaystyle n} and any integer 0 ≤ k ≤ n {\displaystyle 0\leq k\leq n} . This recurrence for the binomial coefficients is known as Pascal's rule. An arbitrary binomial coefficient can be calculated as
( n k ) = n ! k ! ( n − k ) ! . {\displaystyle {n \choose k}={\frac {n!}{k!(n-k)!}}.}
History
The pattern of numbers that forms Pascal's triangle was known well before Pascal's time.
… excerpt ends here. Continue reading the full article.






