Definition:Binomial Coefficient/Integers/Definition 2
Definition
Let $n \in \Z_{\ge 0}$ and $k \in \Z$.
The number of different ways $k$ objects can be chosen (irrespective of order) from a set of $n$ objects is denoted:
- $\dbinom n k$
This number $\dbinom n k$ is known as a binomial coefficient.
Notation
The notation $\dbinom n k$ for the binomial coefficient was introduced by Andreas Freiherr von Ettingshausen in his $1826$ work Die kombinatorische Analysis, als Vorbereitungslehre zum Studium der theoretischen höheren Mathematik.
It appears to have become the de facto standard in recent years.
As a result, $\dbinom n k$ is frequently voiced the binomial coefficient $n$ over $k$.
Other notations include:
- $C \left({n, k}\right)$
- ${}^n C_k$
- ${}_n C_k$
- $C^n_k$
- ${C_n}^k$
all of which can cause a certain degree of confusion.
Also see
- Results about binomial coefficients can be found here.
Technical Note
The $\LaTeX$ code to render the binomial coefficient $\dbinom n k$ can be written in the following ways:
\dbinom n k
or:
\ds {n \choose k}
The \dbinom
form is preferred on $\mathsf{Pr} \infty \mathsf{fWiki}$ because it is simpler.
It is in fact an abbreviated form of \ds \binom n k
, which is the preferred construction when \ds
is required for another entity in the expression.
While the form \binom n k
is valid $\LaTeX$ syntax, it renders the entity in the reduced size inline style: $\binom n k$ which $\mathsf{Pr} \infty \mathsf{fWiki}$ does not endorse.
To render compound arguments, braces are needed to delimit the parameter when using \dbinom
, but (confusingly) not \choose
.
For example, to render $\dbinom {a + b} {c d}$ the following can be used:
\dbinom {a + b} {c d}
or:
\ds {a + b \choose c d}
$\ds {a + b \choose c d}$
Again, for consistency across $\mathsf{Pr} \infty \mathsf{fWiki}$, the \dbinom
form is preferred.
Sources
- 1937: Eric Temple Bell: Men of Mathematics ... (previous) ... (next): Chapter $\text{V}$: "Greatness and Misery of Man"
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text {III}$: The Natural Numbers: $\S 19$: Combinatorial Analysis
- 1966: Richard A. Dean: Elements of Abstract Algebra ... (previous) ... (next): $\S 0.6$: Theorem $8: \ 4$
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): binomial coefficient: 1.
- 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.6$: Binomial Coefficients