Binomial coefficient

Uses your system voice; voice and rate in settings.

Snapshot

≈ 30 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

, 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} .…

, 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} .

The binomial coefficients occur in many areas of mathematics, and especially in combinatorics. In combinatorics the symbol \tbinom{n}{k} is usually read as " choose " because there are \tbinom{n}{k} ways to choose an (unordered) subset of elements from a fixed set of elements. For example, there are \tbinom{4}{2}=6 ways to choose elements from , namely , , , , and .

The binomial coefficients can be extended to accept more general families of inputs. When is a nonnegative integer and is an integer such that or , it is common to define . If is a nonnegative integer and is any complex number, the first multiplicative formula above can be used to define .

Many of the properties of binomial coefficients continue to hold in these more general contexts. Another occurrence of this number is in combinatorics, where it gives the number of ways, disregarding order, that objects can be chosen from among objects; more formally, the number of -element subsets (or -combinations) of an -element set.

This number can be seen as equal to that of the first definition, independently of any of the formulas below to compute it: if in each of the factors of the power one temporarily labels the term with an index (running from to ), then each subset of indices gives after expansion a contribution , and the coefficient of that monomial in the result will be the number of such subsets. This shows in particular that \tbinom nk is a natural number for any natural numbers and .

There are many other combinatorial interpretations of binomial coefficients (counting problems for which the answer is given by a binomial coefficient expression), for instance the number of words formed of bits (digits 0 or 1) whose sum is is given by , while the number of ways to write k = a_1 + a_2 + \cdots + a_n where every is a nonnegative integer is given by . Most of these interpretations can be shown to be equivalent to counting -combinations. \binom nk = \binom{n-1}{k-1} + \binom{n-1}k for all integers n,k such that , with boundary values \binom n0 = \binom nn = 1 for all integers .

The formula follows from considering the set and counting separately (a) the -element groupings that include a particular set element, say " ", in every group (since " " is already chosen to fill one spot in every group, we need only choose from the remaining ) and (b) all the -groupings that don't include " "; this enumerates all the possible -combinations of elements. It also follows from tracing the contributions to in .

As there is zero or in , one might extend the definition beyond the above boundaries to include \tbinom nk = 0 when either or . This recursive formula then allows the construction of Pascal's triangle, surrounded by white spaces where the zeros, or the trivial coefficients, would be. \binom nk = \frac{n^{\underline{k}}}{k!} = \frac{n(n-1)(n-2)\cdots(n-(k-1))}{k(k-1)(k-2)\cdots 1} = \prod_{i=1}^k\frac{ n+1-i}{ i}, where the numerator of the first fraction, {{tmath|n^{\underline{k} } }}, is a falling factorial.

This formula is easiest to understand for the combinatorial interpretation of binomial coefficients. The numerator gives the number of ways to select a sequence of distinct objects, retaining the order of selection, from a set of objects. The denominator counts the number of distinct sequences that define the same -combination when order is disregarded.

This formula can also be stated in a recursive form. Using the "C" notation from above, , where . It is readily derived by evaluating C_{n,k} / C_{n, k-1} and can intuitively be understood as starting at the leftmost coefficient of the -th row of Pascal's triangle, whose value is always , and recursively computing the next coefficient to its right until the -th one is reached.

Due to the symmetry of the binomial coefficients with regard to and , calculation of the above product, as well as the recursive relation, may be optimised by setting its upper limit to the smaller of and . \binom nk = \frac{n!}{k!\,(n-k)!} \quad \text{for }\ 0\leq k\leq n, where denotes the factorial of . This formula follows from the multiplicative formula above by multiplying numerator and denominator by ; as a consequence it involves many factors common to numerator and denominator.

It is less practical for explicit computation (in the case that is small and is large) unless common factors are first cancelled (in particular since factorial values grow very rapidly). The formula does exhibit a symmetry that is less evident from the multiplicative formula (though it is from the definitions) which leads to a more efficient multiplicative computational routine.

Using the falling factorial notation, \binom nk = \begin{cases} n^{\underline{k}}/k! & \text{if }\ k \le \frac{n}{2} \\ n^{\underline{n-k}}/(n-k)! & \text{if }\ k > \frac{n}{2} \end{cases}. \binom \alpha k = \frac{\alpha^{\underline k}}{k!} = \frac{\alpha(\alpha-1)(\alpha-2)\cdots(\alpha-k+1)}{k(k-1)(k-2)\cdots 1} \quad\text{for } k\in\N \text{ and arbitrary } \alpha. With this definition one has a generalization of the binomial formula (with one of the variables set to 1), which justifies still calling the \tbinom\alpha k binomial coefficients: This formula is valid for all complex numbers and with .

It can also be interpreted as an identity of formal power series in , where it actually can serve as definition of arbitrary powers of power series with constant coefficient equal to 1; the point is that with this definition all identities hold that one expects for exponentiation, notably (1+X)^\alpha(1+X)^\beta=(1+X)^{\alpha+\beta} \quad\text{and}\quad ((1+X)^\alpha)^\beta=(1+X)^{\alpha\beta}. If is a nonnegative integer , then all terms with are zero, and the infinite series becomes a finite sum, thereby recovering the binomial formula.

However, for other values of , including negative integers and rational numbers, the series is really infinite. (x + y)^5 = \underline{1}x^5 + \underline{5}x^4y + \underline{10}x^3y^2 + \underline{10}x^2y^3 + \underline{5}xy^4 + \underline{1}y^5.

For any nonnegative integer , the expression \binom{t}{k} can be written as a polynomial with denominator : \binom{t}{k} = \frac{t^\underline{k}}{k!} = \frac{t(t-1)(t-2)\cdots(t-k+1)}{k(k-1)(k-2)\cdots2 \cdot 1}; this presents a polynomial in with rational coefficients. As such, it can be evaluated at any real or complex number to define binomial coefficients with such first arguments.

These "generalized binomial coefficients" appear in Newton's generalized binomial theorem. For each , the polynomial \tbinom{t}{k} can be characterized as the unique degree polynomial satisfying and . Its coefficients are expressible in terms of Stirling numbers of the first kind: \binom{t}{k} = \sum_{i=0}^k s(k,i)\frac{t^i}{k!}.

The derivative of \tbinom{t}{k} can be calculated by logarithmic differentiation: \frac{\mathrm{d}}{\mathrm{d}t} \binom{t}{k} = \binom{t}{k} \sum_{i=0}^{k-1} \frac{1}{t-i}. This can cause a problem when evaluated at integers from 0 to , but using identities below we can compute the derivative as: \frac{\mathrm{d}}{\mathrm{d}t} \binom{t}{k} = \sum_{i=0}^{k-1} \frac{(-1)^{k-i-1}}{k-i} \binom{t}{i}.

Over any field of characteristic 0 (that is, any field that contains the rational numbers), each polynomial of degree at most is uniquely expressible as a linear combination \sum_{k=0}^d a_k \binom{t}{k} of binomial coefficients, because the binomial coefficients consist of one polynomial of each degree. The coefficient is the -th difference of the sequence , , , .

Explicitly, 9\binom{t}{2} + 6 \binom{t}{1} + 0\binom{t}{0}. \binom {n-1}{k} - \binom{n-1}{k-1} = \frac{n-2k}{n} \binom{n}{k}. We can also get \binom {n-1}{k} = \frac{n-k}{n} \binom {n}{k}. Moreover, the following may be useful: \binom{n}{k}\binom{k}{j} = \binom{n}{j}\binom{n-j}{k-j}=\binom{n}{k-j}\binom{n-k+j}{j}.

For constant , we have the following recurrence: \binom{n}{k} = \frac{n-k+1}{k} \binom{n}{k-1}. To sum up, we have \binom {n}{k} = \binom n{n-k} = \frac{n-k+1}{k} \binom {n}{k-1} = \frac{n}{n-k} \binom {n-1}{k} = \frac{n}{k} \binom {n-1}{k-1} = \frac{n}{n-2k} \Bigg(\binom {n-1}{k} - \binom{n-1}{k-1}\Bigg) = \binom{n-1}k + \binom{n-1}{k-1}. \sum_{k=0}^n k^2 \binom n k = (n + n^2)2^{n-2} follow from the binomial theorem after differentiating with respect to (twice for the latter) and then substituting .

The Chu–Vandermonde identity, which holds for any complex values and and any non-negative integer , is and can be found by examination of the coefficient of x^k in the expansion of using equation ( ). When , equation ( ) reduces to equation ( ).

In the special case , using ( ), the expansion ( ) becomes (as seen in Pascal's triangle at right) {{Image frame|width=395 |content= \begin{array}{c} 1 \\ 1 \qquad 1 \\ 1 \qquad 2 \qquad 1 \\ {\color{blue}1 \qquad 3 \qquad 3 \qquad 1} \\ 1 \qquad 4 \qquad 6 \qquad 4 \qquad 1 \\ 1 \qquad 5 \qquad 10 \qquad 10 \qquad 5 \qquad 1 \\ 1 \qquad 6 \qquad 15 \qquad {\color{red}20} \qquad 15 \qquad 6 \qquad 1 \\ 1 \qquad 7 \qquad 21 \qquad 35 \qquad 35 \qquad 21 \qquad 7 \qquad 1 \end{array} |caption=Pascal's triangle, rows 0 through 7. Equation for is illustrated in rows 3 and 6 as . }} where the term on the right side is a central binomial coefficient.

Another form of the Chu–Vandermonde identity, which applies for any integers , , and satisfying , is The proof is similar, but uses the binomial series expansion ( ) with negative integer exponents. When , equation ( ) gives the hockey-stick identity \sum_{m=k}^n \binom m k = \binom {n+1}{k+1} and its relative \sum_{r=0}^m \binom {n+r} r = \binom {n+m+1}{m}.

Let denote the -th Fibonacci number. Then \sum_{k=0}^{\lfloor n/2\rfloor} \binom {n-k} k = F(n+1). This can be proved by induction using ( ) or by Zeckendorf's representation.

A combinatorial proof is given below. \binom{n}{t}+\binom{n}{t+s}+\binom{n}{t+2s}+\ldots=\frac{1}{s}\sum_{j=0}^{s-1}\left(2\cos\frac{\pi j}{s}\right)^n\cos\frac{\pi(n-2t)j}{s}. For small , these series have particularly nice forms; for example, \binom{n}{0} + \binom{n}{3}+\binom{n}{6}+\cdots = \frac{1}{3}\left(2^n +2 \cos\frac{n\pi}{3}\right) \binom{n}{1} + \binom{n}{4}+\binom{n}{7}+\cdots = \frac{1}{3}\left(2^n +2 \cos\frac{(n-2)\pi}{3}\right) \binom{n}{2} + \binom{n}{5}+\binom{n}{8}+\cdots = \frac{1}{3}\left(2^n +2 \cos\frac{(n-4)\pi}{3}\right) \binom{n}{0} + \binom{n}{4}+\binom{n}{8}+\cdots = \frac{1}{2}\left(2^{n-1} +2^{\frac{n}{2}} \cos\frac{n\pi}{4}\right) \binom{n}{1} + \binom{n}{5}+\binom{n}{9}+\cdots = \frac{1}{2}\left(2^{n-1} +2^{\frac{n}{2}} \sin\frac{n\pi}{4}\right) \binom{n}{2} + \binom{n}{6}+\binom{n}{10}+\cdots = \frac{1}{2}\left(2^{n-1} -2^{\frac{n}{2}} \cos\frac{n\pi}{4}\right) \binom{n}{3} + \binom{n}{7}+\binom{n}{11}+\cdots = \frac{1}{2}\left(2^{n-1} -2^{\frac{n}{2}} \sin\frac{n\pi}{4}\right) \sum_{j=0}^k \binom n j of binomial coefficients, one can again use ( ) and induction to show that for , \sum_{j=0}^k (-1)^j\binom{n}{j} = (-1)^k\binom {n-1}{k}, with special case \sum_{j=0}^n (-1)^j\binom n j = 0 for .

This latter result is also a special case of the result from the theory of finite differences that for any polynomial of degree less than , \sum_{j=0}^n (-1)^j\binom n j P(j) = 0. Differentiating ( ) times and setting yields this for , when , and the general case follows by taking linear combinations of these.

When is of degree less than or equal to , where a_n is the coefficient of degree in . More generally for ( ), \sum_{j=0}^n (-1)^j\binom n j P(m+(n-j)d) = d^n n! a_n where and are complex numbers.

This follows immediately applying ( ) to the polynomial instead of , and observing that still has degree less than or equal to , and that its coefficient of degree is d n a n . The series \frac{k-1}{k} \sum_{j=0}^\infty \frac 1 {\binom {j+x} k}= \frac 1 {\binom{x-1}{k-1}} is convergent for . This formula is used in the analysis of the German tank problem.

It follows from \frac{k-1}k\sum_{j=0}^{M}\frac 1 {\binom{j+x} k}=\frac 1{\binom{x-1}{k-1}}-\frac 1{\binom{M+x}{k-1}} which is proved by induction on . \sum_{k=q}^n \binom{n}{k} \binom{k}{q} = 2^{n-q}\binom{n}{q} (which reduces to ( ) when ) can be given a double counting proof, as follows. The left side counts the number of ways of selecting a subset of with at least elements, and marking elements among those selected.

The right side counts the same thing, because there are \tbinom n q ways of choosing a set of elements to mark, and 2^{n-q} to choose which of the remaining elements of also belong to the subset. In Pascal's identity \binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}, both sides count the number of -element subsets of : the two terms on the right side group them into those that contain element and those that do not.

The identity ( ) also has a combinatorial proof. The identity reads \sum_{k=0}^n \binom{n}{k}^2 = \binom{2n}{n}. Suppose you have 2n empty squares arranged in a row and you want to mark (select) of them.

There are \tbinom {2n}n ways to do this. On the other hand, you may select your squares by selecting squares from among the first and n-k squares from the remaining squares; any from 0 to will work. This gives \sum_{k=0}^n\binom n k\binom n{n-k} = \binom {2n} n. Now apply ( ) to get the result.

If one denotes by the sequence of Fibonacci numbers, indexed so that , then the identity \sum_{k=0}^{\left\lfloor n/2\right\rfloor} \binom {n-k} k = F(n) has the following combinatorial proof. One may show by induction that counts the number of ways that a strip of squares may be covered by and tiles.

On the other hand, if such a tiling uses exactly of the tiles, then it uses of the tiles, and so uses tiles total. There are \tbinom{n-k}{k} ways to order these tiles, and so summing this coefficient over all possible values of gives the identity.

The number of -combinations for all , {{tmath|1=\sum_{0\leq{k}\leq{n} }\binom nk = 2^n}}, is the sum of the -th row (counting from 0) of the binomial coefficients. These combinations are enumerated by the 1 digits of the set of base 2 numbers counting from 0 to , where each digit position is an item from the set of . \sum_{k=-a}^{a}(-1)^{k}\binom{2a}{k+a}^3 =\frac{(3a)!}{(a!)^3} or, more generally, \sum_{k=-a}^a(-1)^k\binom{a+b}{a+k} \binom{b+c}{b+k}\binom{c+a}{c+k} = \frac{(a+b+c)!}{a!\,b!\,c!}\,, where , , and are non-negative integers. \int_{-\pi}^{\pi} \cos((2m-n)x)\cos^n(x)\ dx = \frac{\pi}{2^{n-1}} \binom{n}{m} \int_{-\pi}^{\pi} \sin((2m-n)x)\sin^n(x)\ dx = \begin{cases} (-1)^{m+(n+1)/2} \frac{\pi}{2^{n-1}} \binom{n}{m}, & n \text{ odd} \\ 0, & \text{otherwise} \end{cases} \int_{-\pi}^{\pi} \cos((2m-n)x)\sin^n(x)\ dx = \begin{cases} (-1)^{m+(n/2)} \frac{\pi}{2^{n-1}} \binom{n}{m}, & n \text{ even} \\ 0, & \text{otherwise} \end{cases} These can be proved by using Euler's formula to convert trigonometric functions to complex exponentials, expanding using the binomial theorem, and integrating term by term.

If is prime, then \binom {n-1}k \equiv (-1)^k \mod n for every with . More generally, this remains true if is any number and is such that all the numbers between 1 and are coprime to .

Indeed, we have \binom {n-1} k = {(n-1)(n-2)\cdots(n-k)\over 1\cdot 2\cdots k} = \prod_{i=1}^{k}{n-i\over i}\equiv \prod_{i=1}^{k}{-i\over i} = (-1)^k \mod n. \sum_{k=0}^\infty \binom{n}{k} x^k = (1+x)^n. For a fixed non-negative integer , the ordinary generating function of the sequence , is \sum_{n=0}^\infty \binom{n}{k} y^n = \frac{y^k}{(1-y)^{k+1}}. The bivariate generating function of the binomial coefficients is \sum_{n=0}^\infty \sum_{k=0}^n \binom{n}{k} x^k y^n = \frac{1}{1-y-xy}.

A symmetric bivariate generating function of the binomial coefficients is \sum_{n=0}^\infty \sum_{k=0}^\infty \binom{n+k}{k} x^k y^n = \frac{1}{1-x-y}. which is the same as the previous generating function after the substitution . \sum_{n=0}^\infty \sum_{k=0}^\infty \binom{n+k}{k} \frac{x^k y^n}{(n+k)!} = e^{x+y}. \lim_{N\to\infty} \frac{f(N)}{N(N+1)/2} = 1. Since the number of binomial coefficients \tbinom n k with is , this implies that the density of binomial coefficients divisible by goes to 1.

Binomial coefficients have divisibility properties related to least common multiples of consecutive integers. For example: \binom{n+k}k divides {{tmath|\frac{\operatorname{lcm}(n,n+1,\ldots,n+k)}n}}. \binom{n+k}k is a multiple of {{tmath|\frac{\operatorname{lcm}(n,n+1,\ldots,n+k)}{n\cdot \operatorname{lcm}(\binom{k}0,\binom{k}1,\ldots,\binom{k}k)} }}.

Another fact: An integer is prime if and only if all the intermediate binomial coefficients \binom n 1, \binom n 2, \ldots, \binom n{n-1} are divisible by . Proof: When is prime, divides \binom p k = \frac{p \cdot (p-1) \cdots (p-k+1)}{k \cdot (k-1) \cdots 1} for all because \tbinom p k is a natural number and divides the numerator but not the denominator.

When is composite, let be the smallest prime factor of and let . Then and \binom n p = \frac{n(n-1)(n-2)\cdots(n-p+1)}{p!}=\frac{k(n-1)(n-2)\cdots(n-p+1)}{(p-1)!}\not\equiv 0 \pmod{n} otherwise the numerator has to be divisible by , this can only be the case when is divisible by .

But is divisible by , so does not divide and because is prime, we know that does not divide and so the numerator cannot be divisible by . \frac{n^k}{k^k} \le \binom{n}{k} \le \frac{n^k}{k!} The first inequality follows from the fact that \binom{n}{k} = \frac{n}{k} \cdot \frac{n-1}{k-1} \cdots \frac{n-(k-1)}{1} and each of these k terms in this product is . A similar argument can be made to show the second inequality.

The final strict inequality is equivalent to , that is clear since the RHS is a term of the exponential series . From the divisibility properties we can infer that \frac{\operatorname{lcm}(n-k, \ldots, n)}{(n-k) \cdot \operatorname{lcm}\left(\binom{k}{0}, \ldots, \binom{k}{k}\right)}\leq\binom{n}{k} \leq \frac{\operatorname{lcm}(n-k, \ldots, n)}{n - k}, where both equalities can be achieved.

The following bounds are useful in information theory: \frac{1}{n+1} 2^{nH(k/n)} \leq \binom{n}{k} \leq 2^{nH(k/n)} where H(p) = -p\log_2(p) -(1-p)\log_2(1-p) is the binary entropy function. It can be further tightened to \sqrt{\frac{n}{8k(n-k)}} 2^{nH(k/n)} \leq \binom{n}{k} \leq \sqrt{\frac{n}{2\pi k(n-k)}} 2^{nH(k/n)} for all . \binom{n}{k} \sim \sqrt{n\over 2\pi k (n-k)} \cdot {n^n \over k^k (n-k)^{n-k}} Because the inequality forms of Stirling's formula also bound the factorials, slight variants on the above asymptotic approximation give exact bounds.

In particular, when n is sufficiently large, one has \binom{2n}{n} \sim \frac{2^{2n}}{\sqrt{n\pi }} and . More generally, for and (again, by applying Stirling's formula to the factorials in the binomial coefficient), \sqrt{n}\binom{mn}{n} \ge \frac{m^{m(n-1)+1}}{(m-1)^{(m-1)(n-1)}}. If is large and is linear in , various precise asymptotic estimates exist for the binomial coefficient .

For example, if | n/2 - k | = o(n^{2/3}) then \binom{n}{k} \sim \binom{n}{\frac{n}{2}} e^{-d^2/(2n)} \sim \frac{2^n}{\sqrt{\frac{1}{2}n \pi }} e^{-d^2/(2n)} where . \binom{n}{k} \sim \left(\frac{n e}{k} \right)^k \cdot (2\pi k)^{-1/2} \cdot \exp\left(- \frac{k^2}{2n}(1 + o(1))\right) where again is the little o notation. \sum_{i=0}^k \binom{n}{i} \leq \sum_{i=0}^k n^i \leq \sum_{i=0}^k \binom ki \,n^i\cdot 1^{k-i} =(n+1)^k. More precise bounds are given by \frac{1}{\sqrt{8n\varepsilon(1-\varepsilon)}} \cdot 2^{H(\varepsilon) \cdot n} \leq \sum_{i=0}^{k} \binom{n}{i} \leq 2^{H(\varepsilon) \cdot n}, valid for all integers n > k \geq 1 with . (-1)^k \binom{z}{k}= \binom{-z+k-1 }{k} = \frac{1}{\Gamma(-z)} \frac{1}{(k+1)^{z+1}} \prod_{j=k+1} \frac{\left(1+\frac{1}{j}\right)^{-z-1}}{1-\frac{z+1}{j}} which yields the asymptotic formulas \binom{z}{k} \approx \frac{(-1)^k}{\Gamma(-z) k^{z+1}} \qquad \text{and} \qquad \binom{z+k}{k} = \frac{k^z}{\Gamma(z+1)}\left( 1+\frac{z(z+1)}{2k}+\mathcal{O}\left(k^{-2}\right)\right) as .

This asymptotic behaviour is contained in the approximation \binom{z+k}{k}\approx \frac{e^{z(H_k-\gamma)}}{\Gamma(z+1)} as well. (Here H_k is the -th harmonic number and \gamma is the Euler–Mascheroni constant.)

Further, the asymptotic formula \frac{\binom{z+k}{j}}{\binom{k}{j}}\to \left(1-\frac{j}{k}\right)^{-z}\quad\text{and}\quad \frac{\binom{j}{j-k}}{\binom{j-z}{j-k}}\to \left(\frac{j}{k}\right)^z hold true, whenever k\to\infty and j/k \to x for some complex number . \binom{n}{k_1,k_2,\ldots,k_r} =\frac{n!}{k_1!k_2!\cdots k_r!} where \sum_{i=1}^rk_i=n. While the binomial coefficients represent the coefficients of , the multinomial coefficients represent the coefficients of the polynomial (x_1 + x_2 + \cdots + x_r)^n. The case gives binomial coefficients: \binom{n}{k_1,k_2}=\binom{n}{k_1, n-k_1}=\binom{n}{k_1}= \binom{n}{k_2}. The combinatorial interpretation of multinomial coefficients is distribution of distinguishable elements over (distinguishable) containers, each containing exactly k i elements, where is the index of the container.

Multinomial coefficients have many properties similar to those of binomial coefficients, for example the recurrence relation: \binom{n}{k_1,k_2,\ldots,k_r} =\binom{n-1}{k_1-1,k_2,\ldots,k_r}+\binom{n-1}{k_1,k_2-1,\ldots,k_r}+\ldots+\binom{n-1}{k_1,k_2,\ldots,k_r-1} and symmetry: \binom{n}{k_1,k_2,\ldots,k_r} =\binom{n}{k_{\sigma_1},k_{\sigma_2},\ldots,k_{\sigma_r}} where (\sigma_i) is a permutation of . \begin{align} \binom{z}{k} = \frac{1}{k!}\sum_{i=0}^k z^i s_{k,i}&=\sum_{i=0}^k (z- z_0)^i \sum_{j=i}^k \binom{z_0}{j-i} \frac{s_{k+i-j,i}}{(k+i-j)!} \\ &=\sum_{i=0}^k (z-z_0)^i \sum_{j=i}^k z_0^{j-i} \binom{j}{i} \frac{s_{k,j}}{k!}.\end{align} \binom{1/2}{k}=\binom{2k}{k}\frac{(-1)^{k+1}}{2^{2k}(2k-1)}. This shows up when expanding \sqrt{1+x} into a power series using the Newton binomial series : \sqrt{1+x}=\sum_{k\geq 0}{\binom{1/2}{k}}x^k. \binom{z}{m} \binom{z}{n} = \sum_{k=0}^{\min(m,n)} \binom{m + n - k}{k, m - k, n - k} \binom{z}{m + n - k}, where the connection coefficients are multinomial coefficients.

In terms of labelled combinatorial objects, the connection coefficients represent the number of ways to assign labels to a pair of labelled combinatorial objects—of weight and respectively—that have had their first labels identified, or glued together to get a new labelled combinatorial object of weight . (That is, to separate the labels into three portions to apply to the glued part, the unglued part of the first object, and the unglued part of the second object.)

In this regard, binomial coefficients are to exponential generating series what falling factorials are to ordinary generating series. The product of all binomial coefficients in the -th row of the Pascal triangle is given by the formula: \prod_{k=0}^{n}\binom{n}{k}=\prod_{k=1}^{n}k^{2k-n-1}. \frac{1}{\binom{z}{n}}= \sum_{i=0}^{n-1} (-1)^{n-1-i} \binom{n}{i} \frac{n-i}{z-i}, \qquad \frac{1}{\binom{z+n}{n}}= \sum_{i=1}^n (-1)^{i-1} \binom{n}{i} \frac{i}{z+i}.

(1+z)^{\alpha} = \sum_{n=0}^{\infty}\binom{\alpha}{n}z^n = 1+\binom{\alpha}{1}z+\binom{\alpha}{2}z^2+\cdots. The identity can be obtained by showing that both sides satisfy the differential equation . The radius of convergence of this series is 1.

An alternative expression is \frac{1}{(1-z)^{\alpha+1}} = \sum_{n=0}^{\infty}\binom{n+\alpha}{n}z^n where the identity \binom{n}{k} = (-1)^k \binom{k-n-1}{k} is applied. \binom{f}{k}=\left(\!\!\binom{r}{k}\!\!\right)=\binom{r+k-1}{k}. One possible alternative characterization of this identity is as follows: We may define the falling factorial as (f)_{k}=f^{\underline k}=(f-k+1)\cdots(f-3)\cdot(f-2)\cdot(f-1)\cdot f, and the corresponding rising factorial as r^{(k)}=\,r^{\overline k}=\,r\cdot(r+1)\cdot(r+2)\cdot(r+3)\cdots(r+k-1); so, for example, 17\cdot18\cdot19\cdot20\cdot21=(21)_{5}=21^{\underline 5}=17^{\overline 5}=17^{(5)}.

Then the binomial coefficients may be written as \binom{f}{k} = \frac{(f)_{k}}{k!} =\frac{(f-k+1)\cdots(f-2)\cdot(f-1)\cdot f}{1\cdot2\cdot3\cdot4\cdot5\cdots k} , while the corresponding multiset coefficient is defined by replacing the falling with the rising factorial: \left(\!\!\binom{r}{k}\!\!\right)=\frac{r^{(k)}}{k!}=\frac{r\cdot(r+1)\cdot(r+2)\cdots(r+k-1)}{1\cdot2\cdot3\cdot4\cdot5\cdots k}. \begin{align}\binom{-n}{k} &= \frac{-n\cdot-(n+1)\dots-(n+k-2)\cdot-(n+k-1)}{k!}\\ &=(-1)^k\;\frac{n\cdot(n+1)\cdot(n+2)\cdots (n + k - 1)}{k!}\\ &=(-1)^k\binom{n + k - 1}{k}\\ &=(-1)^k\left(\!\!\binom{n}{k}\!\!\right)\;.\end{align} In particular, binomial coefficients evaluated at negative integers are given by signed multiset coefficients. In the special case , this reduces to .

For example, if and , then and : \begin{align}\binom{-4}{7} &= \frac {-10\cdot-9\cdot-8\cdot-7\cdot-6\cdot-5\cdot-4} {1\cdot2\cdot3\cdot4\cdot5\cdot6\cdot7}\\ &=(-1)^7\;\frac{4\cdot5\cdot6\cdot7\cdot8\cdot9\cdot10} {1\cdot2\cdot3\cdot4\cdot5\cdot6\cdot7}\\ &=\left(\!\!\binom{-7}{7}\!\!\right)\left(\!\!\binom{4}{7}\!\!\right)=\binom{-1}{7}\binom{10}{7}.\end{align} \binom{x}{y}= \frac{\Gamma(x+1)}{\Gamma(y+1) \Gamma(x-y+1)}= \frac{1}{(x+1) \Beta(y+1, x-y+1)}. This definition inherits these following additional properties from : \binom{x}{y}= \frac{\sin (y \pi)}{\sin(x \pi)} \binom{-y-1}{-x-1}= \frac{\sin((x-y) \pi)}{\sin (x \pi)} \binom{y-x-1}{y}; moreover, \binom{x}{y} \cdot \binom{y}{x}= \frac{\sin((x-y) \pi)}{(x-y) \pi}.

The resulting function has been little-studied, apparently first being graphed in . Notably, many binomial identities fail: \binom{n }{ m} = \binom{n }{ n-m} but \binom{-n}{m} \neq \binom{-n}{-n-m} for positive (so -n negative).

The behavior is quite complex, and markedly different in various octants (that is, with respect to the and axes and the line ), with the behavior for negative having singularities at negative integer values and a checkerboard of positive and negative regions: in the octant 0 \leq y \leq x it is a smoothly interpolated form of the usual binomial, with a ridge ("Pascal's ridge"). in the octant 0 \leq x \leq y and in the quadrant x \geq 0, y \leq 0 the function is close to zero. in the quadrant x \leq 0, y \geq 0 the function is alternatingly very large positive and negative on the parallelograms with vertices (-n,m+1), (-n,m), (-n-1,m-1), (-n-1,m) in the octant 0 > x > y the behavior is again alternatingly very large positive and negative, but on a square grid. in the octant -1 > y > x + 1 it is close to zero, except for near the singularities. \binom{\alpha}{\beta} = \left| \left\{ B \subseteq A : \left|B\right| = \beta \right\} \right| where is some set with cardinality . One can show that the generalized binomial coefficient is well-defined, in the sense that no matter what set we choose to represent the cardinal number , {\alpha \choose \beta} will remain the same.

For finite cardinals, this definition coincides with the standard definition of the binomial coefficient. Assuming the Axiom of Choice, one can show that \binom{\alpha}{\alpha} = 2^{\alpha} for any infinite cardinal .

Text derived from https://en.wikipedia.org/w/index.php?oldid=1376065730 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.