Let \(X\) be a finite set with exactly \(n\) elements \((|X|=n)\). The number of possible combinations of size \(k\), \(0\le k\le n\) is called the binomial coefficient and denoted it by \[\binom nk.\] The symbol \(\binom nk\) is read "\(n\) choose \(k\)".
Examples: 1
Explanations: 2
Proofs: 3 4 5 6 7 8 9 10
Propositions: 11 12 13 14 15 16 17
Theorems: 18