StackExchange
New member
- Joined
- Feb 18, 2023
- Messages
- 2
My combinatorics professor has a MA, PhD from Princeton University. On our test, she asked
I handwrote, but transcribed in Latex, my answer below.
How can I improve this? What else should I've written? Professor awarded me merely 50%. She merely wrote
What's the formula for the number of [math]p[/math] permutations of [math]n_1 + n_2 + \cdots + n_{k - 1} + n_k[/math] things with [math]k[/math] kinds, where [math]n_1, \cdots , n_k[/math] = the number of each kind of thing ?
I handwrote, but transcribed in Latex, my answer below.
To deduce the EXPLICIT formula for all the unique permutations of length [math]l[/math] of [math]\{n_1,n_2,...,n_k\}[/math], we must find all combinations [math]C=\{c_1,c_2,...,c_k\}[/math] where [math]0 \leq c_k \leq n_k[/math], such that
[math]\sum_{i=1}^k c_i=l[/math].
What we need, is actually the product of the factorials of the elements of that combination:
[math]\color{limegreen}{\prod_{i=1}^k c_i!}[/math]
Presuppose that the number of combinations is J. Then to answer your question, the number of permutations is
[math]= \sum_{j=1}^J \frac{l!}{\color{limegreen}{\prod_{i=1}^k c_i!}} = \sum_{c_1+c_2+...+c_k=l} \binom{l}{c_1,c_2, \cdots ,c_n},[/math]
as a closed form expression with a Multinomial Coefficient. *QED.*
How can I improve this? What else should I've written? Professor awarded me merely 50%. She merely wrote
Your answer is correct, but your solution is too snippy. You need to elaborate.