gives the binomial coefficient .


  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
  • In general, is defined by or suitable limits of this.
  • For integers and certain other special arguments, Binomial automatically evaluates to exact values.
  • Binomial is automatically evaluated symbolically for simple cases; FunctionExpand gives results for other cases.
  • Binomial can be evaluated to arbitrary numerical precision.
  • Binomial automatically threads over lists.

Background & Context

  • Binomial represents the binomial coefficient function, which returns the binomial coefficient TemplateBox[{n, k}, Binomial] of and . For non-negative integers and , the binomial coefficient has value TemplateBox[{n, k}, Binomial]=(n!)/(k! (n-k)!), where is the Factorial function. By symmetry, TemplateBox[{n, k}, Binomial]=TemplateBox[{n, {n, -, k}}, Binomial]. The binomial coefficient is important in probability theory and combinatorics and is sometimes also denoted
  • For non-negative integers and , the binomial coefficient TemplateBox[{n, k}, Binomial] gives the number of subsets of length contained in the set . This is also the number of distinct ways of picking elements (without replacement and ignoring order) from the first positive integers and for this reason is often voiced as " choose ".
  • The binomial coefficient lies at the heart of the binomial formula, which states that for any non-negative integer , (x+y)^n=sum_(k=0)^nTemplateBox[{n, k}, Binomial] x^(n-k)y^k. This interpretation of binomial coefficients is related to the binomial distribution of probability theory, implemented via BinomialDistribution. Another important application is in the combinatorial identity known as Pascal's rule, which relates the binomial coefficient with shifted arguments according to TemplateBox[{n, k}, Binomial]=TemplateBox[{{n, -, 1}, {k, -, 1}}, Binomial]+TemplateBox[{{n, -, 1}, k}, Binomial].
  • Expressing factorials as gamma functions generalizes the binomial coefficient to complex and as TemplateBox[{x, y}, Binomial]=(TemplateBox[{{x, +, 1}}, Gamma])/(TemplateBox[{{y, +, 1}}, Gamma] TemplateBox[{{x, -, y, +, 1}}, Gamma]). Using the symmetry formula (TemplateBox[{{s, -, a, +, 1}}, Gamma])/(TemplateBox[{{s, -, b, +, 1}}, Gamma])=(-1)^(b-a)( TemplateBox[{{b, -, s}}, Gamma])/(TemplateBox[{{a, -, s}}, Gamma]) for integer and and complex then allows the definition of the binomial coefficient to be extended to negative integer arguments, making it continuous at all integer arguments as well as continuous for all complex arguments except for negative integer and noninteger (in which case it is infinite). This definition for negative and integer , written explicitly as  (-1)^k TemplateBox[{{k, -, n, -, 1}, k}, Binomial] k>=0; (-1)^(n-k) TemplateBox[{{{-, k}, -, 1}, {n, -, k}}, Binomial] k<=n; 0 otherwise; is in agreement with both the binomial theorem and most combinatorial identities (with a few special exceptions).
  • Binomial coefficients are generalized by multinomial coefficients. Multinomial returns the multinomial coefficient (n;n1,,nk) of given numbers n1,,nk summing to , where . The binomial coefficient TemplateBox[{n, k}, Binomial] is the multinomial coefficient (n;k,n-k).


open all close all

Basic Examples  (2)

Evaluate 10 choose 3:

Click for copyable input

Construct Pascal's triangle:

Click for copyable input

Scope  (26)

Generalizations & Extensions  (2)

Applications  (11)

Properties & Relations  (7)

Possible Issues  (3)

Neat Examples  (6)

Introduced in 1988