Library/Combinatorics/Pascal's triangle and Newton's binomial

Pascal's triangle and Newton's binomial

Overview
Important

Pascal's triangle is a triangular array where the entry in the nnth row and kkth position is the binomial coefficient (nk)\binom{n}{k}. Newton's binomial theorem states that (a+b)n=k=0n(nk)ankbk(a+b)^n = \sum_{k=0}^n \binom{n}{k} a^{n-k} b^k. The coefficients in the expansion are exactly the numbers in the nnth row of Pascal's triangle.

Important properties

  • Each entry is the sum of the two entries above it: (nk)=(n1k1)+(n1k)\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}.

  • The triangle is symmetric: (nk)=(nnk)\binom{n}{k} = \binom{n}{n-k}.

  • The sum of the entries in the nnth row is 2n2^n.

  • Binomial coefficients count the number of ways to choose kk objects from nn.