AOCP/Multinomial Coefficients: Difference between revisions
From charlesreid1
| (2 intermediate revisions by the same user not shown) | |||
| Line 5: | Line 5: | ||
===Definition=== | ===Definition=== | ||
We can generalize this approach and define the multinomial coefficient: | We can generalize this approach and define the multinomial coefficient. | ||
More compactly, let n denote the sum of the ks: | |||
<math> | |||
\binom{n}{k_1 , k_2 , \dots , k_m } = \dfrac{n!}{k_1 ! k_2 ! \dots k_m !} \qquad k_i \in \mathbb{Z}, k_i \geq 0 | |||
</math> | |||
or, | |||
<math> | <math> | ||
| Line 11: | Line 19: | ||
</math> | </math> | ||
===Generalization of Binomial Theorem=== | |||
The binomial theorem gives a formula that allows powers of binomial sums to be expanded in terms of binomial coefficients: | |||
<math> | |||
(x+y)^n = \sum_{0 \leq k \leq n} \binom{n}{k} x^k y^{(n-k)} | |||
</math> | |||
There is an analogous expansion for powers of multinomial sums (sums of multiple terms), in terms of these multinomial coefficients: | |||
<math> | <math> | ||
| Line 34: | Line 50: | ||
{{AOCPFlag}} | {{AOCPFlag}} | ||
[[Category:Binomial]] | |||
[[Category:Multinomial]] | |||
[[Category:Combinatorics]] | |||
[[Category:Permutations]] | |||
Latest revision as of 10:20, 6 August 2017
Volume 1
Chapter 1: Basic Concepts: Multinomial Coefficients
Definition
We can generalize this approach and define the multinomial coefficient.
More compactly, let n denote the sum of the ks:
$ \binom{n}{k_1 , k_2 , \dots , k_m } = \dfrac{n!}{k_1 ! k_2 ! \dots k_m !} \qquad k_i \in \mathbb{Z}, k_i \geq 0 $
or,
$ \binom{k_1 + k_2 + \dots + k_m}{k_1 , k_2 , \dots , k_m } = \dfrac{(k_1 + k_2 + \dots + k_m)!}{k_1 ! k_2 ! \dots k_m !} \qquad k_i \in \mathbb{Z}, k_i \geq 0 $
Generalization of Binomial Theorem
The binomial theorem gives a formula that allows powers of binomial sums to be expanded in terms of binomial coefficients:
$ (x+y)^n = \sum_{0 \leq k \leq n} \binom{n}{k} x^k y^{(n-k)} $
There is an analogous expansion for powers of multinomial sums (sums of multiple terms), in terms of these multinomial coefficients:
$ (x_1 + x_2 + \dots + x_m)^n = \sum_{k_1 + k_2 + \dots + k_m = n} \binom{n}{k_1, k_2, \dots, k_m} x_1^{k_1} x_2^{k_2} \dots x_m^{k_m} $
Any multinomial coefficient can also be expressed in terms of binomial coefficients:
$ \binom{k_1 + k_2 + \dots + k_m}{k_1, k_2, \dots k_m} = \binom{k_1 + k_2}{k_1} \binom{k_1 + k_2 + k_3}{k_1 + k_2} \dots \binom{k_1 + k_2 + \dots + k_m}{k_1 + \dots + k_{m-1}} $
Related Pages
Flags
| The Art of Computer Programming notes from reading Donald Knuth's Art of Computer Programming
Part of the 2017 CS Study Plan.
Mathematical Foundations: AOCP/Infinite Series · AOCP/Binomial Coefficients · AOCP/Multinomial Coefficients AOCP/Harmonic Numbers · AOCP/Fibonacci Numbers Puzzles/Exercises:
Volume 2: Seminumerical Algorithms
Volume 3: Sorting and Searching AOCP/Combinatorics · AOCP/Multisets · Rubiks Cube/Permutations
AOCP/Combinatorial Algorithms · AOCP/Boolean Functions AOCP/Five Letter Words · Rubiks Cube/Tuples AOCP/Generating Permutations and Tuples
|