Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have 4 red {A, B, C, D}, 3 green {E, F, G} and 2 blue books {H, I}. How many ways to stack them is there? What is the formula for computing this?

share|cite|improve this question
(1) How many ways would there be to stack the books if they were all different colors? (2) If two are the same color, how many fewer unique possibilities are there? (Hint: each possibility happens twice) (3) What about if three are the same color? – badatmath Feb 4 '12 at 16:11
up vote 4 down vote accepted

Your notation is confusing because you make it seems like all the books are distinguishable, but I think you mean they are not?

However, let's start with distinguishable. If you had 9 different books, I think you would agree that there are $9 * 8 * 7 * \dots * 2 * 1 = 9!$ ways to stack them.

But now some of them are the same. So you need use the multinomial formula. The idea is that if you have the red books arranged in some way, you could rearrange just the red and it doesn't change the outcome. So you need to effectively divide out the duplicates.

\begin{equation} \dfrac{9!}{4!3!2!} \end{equation}

The $4!$ for the number of ways you could rearrange just the red, then the 3 for just the green, and the 2 for just the blue. You are basically saying "If I could distinguish these same-color books, how many ways could I rearrange them to get the same answer.

share|cite|improve this answer
By the way, when I learned about this, the classic question was "How many ways can you rearrange the letters in the word 'Mississippi'". So it's all about permutations and avoiding multi-counting results. – Tom Feb 4 '12 at 16:16
The multinomial coefficient is the answer – hidarikani Feb 4 '12 at 16:42

Assume that books of the same colour are indistinguishable. The positions of the $2$ blue books can be chosen in $\dbinom{9}{2}$ ways. For each such choice, the positions of the $3$ green books can be chosen in $\dbinom{7}{3}$ ways. Once we have done that, the positions of the red books are determined. So the total number of ways is $$\binom{9}{2}\binom{7}{3}.$$

Remark: The above was not precisely a formula, it was more a procedure, a way of thinking. For this exact type of problem, there is, as was pointed out in other posts, a formula, since the answer is a multinomial coefficient. However, for many problems, there is no single formula that deals with the problem, so one has to thread together two or more ideas.

share|cite|improve this answer

The number of ways of doing the task is given by the mutinomial coefficient $\dfrac{9!}{4!3!2!}$.

share|cite|improve this answer

Imagine you put sticky-notes with labels 1-9 on the books. In this case, the books are all distinct, so there are 9! ways to order them. Now remove the labels from the red books. There are 4! ways to label these books; we see that the count of 9! counts every ordering of the books is counted 4! times when we strip of the labels from the red books. Now repeat this for the green and the blue books and you get a result of $${9!\over 4!3!2!}.$$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.