Along with 1-1-1, 1-1-2, 1-2-1 ans 2-1-1 also need to be ignored.
GMATinsight,
I'm hoping one of you can explain
why the 1-1-1 combination is ignored in answering this question. The question asks:
Quote:
How many ways can 5 different colored marbles be placed in 3 distinct pockets such that any pocket contains at least 1 marble?
Would the answer not include
5P3? Since we can have at least 1 marble (i.e. exactly one marble) in each spot and the question does not specify that we must use all five of the marbles. Additionally, I think that permutation is the right way of counting for the 1-1-1 combination since a marble arrangement of
Green-Blue-Red in pockets one-two-three is different from
Blue-Red-Green in pockets one-two-three and so forth.
For the
1-1-1 combination, we will have:
5!/(5-3)! = 60 different arrangements.
Then we come to the 3-1-1 and 2-2-1 combinations.
For the
3-1-1 combination, in pocket one we can have any three of the five distinct marbles. The order inside one pocket doesn't matter. Therefore, we will use
5C3. For the 2nd pocket, we have two marbles left and we can only pick one because we must leave one for the third pocket. Therefore, we will use
2C1. And for the last (third) pocket we only have one choice. Now, we have
5C3,
2C1 and
1C1 in pockets one-two-three. These can be ordered in 3!/2! different ways because
2C1 = 1C1, and we have already counted the possibility of different colors in each pocket.
So for
3-1-1 combination, we have:
5C3 * 2C1 * 1C1 * 3!/2! = 60 different arrangements.
Similarly, for the
2-2-1 combination we have:
5C2 * 3C2 * 1C1 * 3!/2! = 90 different arrangements.
Finally, we will get
60+60+90 = 210 arrangements if we consider 1-1-1 to be a valid option - since the question does not explicitly exclude this possibility.
Could you please explain why we ignored 1-1-1 combination?