A child builds towers using identically shaped cubes of different colors. How many different towers with a height cubes can the child build with red cubes, blue cubes, and green cubes? (One cube will be left out.)
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Arrange all 9 cubes in a line, 9!/(2! 3! 4!) = 1260 ways, and remove the top one; each tower of 8 arises from exactly one such line.
Solution
Imagine stacking all cubes, then removing the top one. The tower of that remains is exactly the kind of tower being counted, and conversely every -tower comes from exactly one -stack (put the leftover cube on top). So the number of -towers equals the number of -stacks.
Stacks of cubes with red, blue and green identical cubes number
The answer is .
Why this works
Arranging objects with repeated identical types is . The "one left out" twist can be handled by casework on the omitted color, but the cleaner idea is a bijection: the leftover cube is determined by the tower, so tacking it on top pairs -towers with -stacks one-to-one.
Alternative approach
Casework on which cube is omitted: leave out a red ( red, blue, green): ; a blue: ; a green: . Total .
The trap
Using 8! or 9! for identical cubes without dividing by the repeated colors, or forgetting to account for which color is left out.
Common mistakes
- Using 8! or 9! for identical cubes without dividing by the repeated colors, or forgetting to account for which color is left out.
- Computing only one case, such as , or adding a factor of for "which color is left out" on top of the casework.
Techniques
Map the objects to something easier to count · Split into exhaustive cases and handle each