![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/f/f6/Pascal%2527s_triangle_5.svg/640px-Pascal%2527s_triangle_5.svg.png&w=640&q=50)
Binomial coefficient
Number of subsets of a given size / From Wikipedia, the free encyclopedia
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 n ≥ k ≥ 0 and is written It is the coefficient of the xk term in the polynomial expansion of the binomial power (1 + x)n; this coefficient can be computed by the multiplicative formula
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/f/f6/Pascal%27s_triangle_5.svg/320px-Pascal%27s_triangle_5.svg.png)
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/4/47/Binomial_theorem_visualisation.svg/320px-Binomial_theorem_visualisation.svg.png)
which using factorial notation can be compactly expressed as
For example, the fourth power of 1 + x is
and the binomial coefficient is the coefficient of the x2 term.
Arranging the numbers in successive rows for n = 0, 1, 2, ... gives a triangular array called Pascal's triangle, satisfying the recurrence relation
The binomial coefficients occur in many areas of mathematics, and especially in combinatorics. The symbol is usually read as "n choose k" because there are
ways to choose an (unordered) subset of k elements from a fixed set of n elements. For example, there are
ways to choose 2 elements from {1, 2, 3, 4}, namely {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4} and {3, 4}.
The binomial coefficients can be generalized to for any complex number z and integer k ≥ 0, and many of their properties continue to hold in this more general form.