How many ternary strings (i.e., the only allowable characters are 0, 1, and 2) of length 15 are there containing exactly four 0s, five 1s, and six 2s?
The Answer to the Question
is below this banner.
Here's the Solution to this Question
If M is a finite multiset, then a multiset permutation is an ordered arrangement of elements of M in which each element appears a number of times equal exactly to its multiplicity in M. An anagram of a word having some repeated letters is an example of a multiset permutation. If the multiplicities of the elements of M (taken in some order) are and their sum (that is, the size of M) is n, then the number of multiset permutations of M is given by the multinomial coefficient,
In our case, the number of ternary strings of length 15 are there containing exactly four 0s, five 1s, and six 2s is