Bunuel
In a particular gumball machine, there are 4 identical blue gumballs, 3 identical red gumballs, 2 identical green gumballs, and 1 yellow gumball. In how many different ways can the gumballs be dispensed, 1 at a time, if the 3 red gumballs are dispensed last?
A. 105
B. 210
C. 315
D. 420
E. 630
The 3 red gumballs selected at the end are irrelevant, since they can be arranged only 1 way:
RRR
Thus, the question stem can be rephrased as follows:
Before the 3 red gumballs are selected at the end, in how many different ways can the other 7 gumballs be selected?
Number of ways to arrange 7 distinct elements = 7!
But the elements here are not all distinct; some are IDENTICAL.
When an arrangement includes identical elements, we must divide by the number of ways each set of identical elements can be arranged.
The reason:
When the identical elements swap positions, the arrangement doesn't change, reducing the total number of unique arrangements.
Here, we must divide by the number of ways to arrange the 4 identical blue gumballs (4!) and the number of ways to arrange the 2 identical green gumballs (2!):
\(\frac{7!}{4!2! } = 105\)