Lesson plan
Binomial coefficient
, in which each entry is the sum of the two immediately above.|alt=The first five rows of Pascal's triangle, arranged in a triangular formation. Values: (1, (1, 1), (1, 2, 1), (1, 3, 3, 1), (1, 4, 6, 4, 1), (1, 5, 10, 10, 5, 1)) In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom{n}{k} or . It is the coefficient of the term in the polynomial expansion of the binomial power ; this coefficient can be computed by the multiplicative formula \binom nk = \frac{n\times(n-1)\times\cdots\times(n-k+1)}{k\times(k-1)\times\cdots\times1}, which using factorial notation can be compactly expressed as \binom{n}{k} = \frac{n!}{k! (n-k)!}. For example, the fourth power of is \begin{align} (1 + x)^4 &= \tbinom{4}{0} x^0 + \tbinom{4}{1} x^1 + \tbinom{4}{2} x^2 + \tbinom{4}{3} x^3 + \tbinom{4}{4} x^4 \\ &= 1 + 4x + 6 x^2 + 4x^3 + x^4, \end{align} and the binomial coefficient \tbinom{4}{2} =\tfrac{4\times 3}{2\times1} = \tfrac{4!}{2!2!} = 6 is the coefficient of the term. Arranging the numbers \tbinom{n}{0}, \tbinom{n}{1}, \ldots, \tbinom{n}{n} in successive rows for gives a triangular array called Pascal's triangle, satisfying the recurrence relation \binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k} .…
Article summary
, in which each entry is the sum of the two immediately above.|alt=The first five rows of Pascal's triangle, arranged in a triangular formation. Values: (1, (1, 1), (1, 2, 1), (1, 3, 3, 1), (1, 4, 6, 4, 1), (1, 5, 10, 10, 5, 1)) In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom{n}{k} or . It is the coefficient of the term in the polynomial expansion of the binomial power ; this coefficient can be computed by the multiplicative formula \binom nk = \frac{n\times(n-1)\times\cdots\times(n-k+1)}{k\times(k-1)\times\cdots\times1}, which using factorial notation can be compactly expressed as \binom{n}{k} = \frac{n!}{k! (n-k)!}. For example, the fourth power of is \begin{align} (1 + x)^4 &= \tbinom{4}{0} x^0 + \tbinom{4}{1} x^1 + \tbinom{4}{2} x^2 + \tbinom{4}{3} x^3 + \tbinom{4}{4} x^4 \\ &= 1 + 4x + 6 x^2 + 4x^3 + x^4, \end{align} and the binomial coefficient \tbinom{4}{2} =\tfrac{4\times 3}{2\times1} = \tfrac{4!}{2!2!} = 6 is the coefficient of the term. Arranging the numbers \tbinom{n}{0}, \tbinom{n}{1}, \ldots, \tbinom{n}{n} in successive rows for gives a triangular array called Pascal's triangle, satisfying the recurrence relation \binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k} .…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.