How many distinguishable arrangements are there of brown tile, purple tile, green tiles, and yellow tiles in a row from left to right? (Tiles of the same color are indistinguishable.)
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Arrange 7 tiles as if distinct (7!), then divide by 2! and 3! for the identical green and yellow tiles.
Solution
There are tiles. If all were different there would be orderings. Swapping the two green tiles among themselves ( ways) or permuting the three yellow tiles ( ways) does not change the visible arrangement, so each distinguishable arrangement was counted times:
The answer is .
Why this works
Permutations of a multiset: where the are the group sizes. The division corrects the overcount from treating identical objects as labeled. This formula is exactly the multinomial coefficient and shows up constantly in word-rearrangement and tile problems.
Alternative approach
Place colors one group at a time: choose of the positions for yellow (), then of the remaining for green (), then the last two positions get brown and purple in ways: .
The trap
Forgetting to divide by 3! for the yellow tiles, or dividing by 2 and 3 instead of 2! and 3!.
Common mistakes
- Forgetting to divide by 3! for the yellow tiles, or dividing by 2 and 3 instead of 2! and 3!.
- Using without removing already-filled positions, or treating the four colors as four objects ().
Techniques
Set up the equation/formula and compute; no special trick needed