AMC 10 Step by Step

2020 AMC 10B Problem 5

P1-10~2 minPrint

How many distinguishable arrangements are there of 11 brown tile, 11 purple tile, 22 green tiles, and 33 yellow tiles in a row from left to right? (Tiles of the same color are indistinguishable.)

Log in to save your progress.
Show solution without answering

Key insight

Place the colors one group at a time: choose 3 of the 7 spots for yellow, then 2 of the remaining 4 for green, then order brown and purple.

Solution

There are 1+1+2+3=71 + 1 + 2 + 3 = 7 tiles, so think of 77 empty spots in a row. Fill them in one color at a time, starting with the biggest group.

1. Yellow. Choose which 33 of the 77 spots are yellow. The three yellow tiles look the same, so only the choice of spots matters:
(73)=7×6×53×2×1=35 ways.\binom{7}{3} = \frac{7 \times 6 \times 5}{3 \times 2 \times 1} = 35 \text{ ways}.
2. Green. Now 44 spots are left. Choose which 22 of them are green:
(42)=4×32×1=6 ways.\binom{4}{2} = \frac{4 \times 3}{2 \times 1} = 6 \text{ ways}.
3. Brown and purple. Two spots are left. Brown goes in one and purple in the other. These tiles are different, so there are 22 ways.
4. Each choice at one step can be combined with each choice at the next, so multiply:
35×6×2=420.35 \times 6 \times 2 = 420.

The answer is (B) 420\boxed{\textbf{(B)}\ 420}.

Why this works

When some objects look the same, you only have to decide where each color goes. Choosing the spots for one color at a time handles this, because choosing spots does not care about order inside a group. The count does not depend on which color you place first.

Alternative approach

Pretend for a moment that all 77 tiles are different. Then there are 7!=50407! = 5040 orders. Each real arrangement has been counted many times: the two green tiles can swap (2!=22! = 2 ways) and the three yellow tiles can be shuffled (3!=63! = 6 ways) without changing what you see. So each arrangement was counted 2×6=122 \times 6 = 12 times, and the true count is 5040÷12=4205040 \div 12 = 420.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

There are 1+1+2+3=71 + 1 + 2 + 3 = 7 tiles. If all were different there would be 7!=50407! = 5040 orderings. Swapping the two green tiles among themselves (2!2! ways) or permuting the three yellow tiles (3!3! ways) does not change the visible arrangement, so each distinguishable arrangement was counted 2!⋅3!=122! \cdot 3! = 12 times:
7!2! 3!=504012=420.\frac{7!}{2!\,3!} = \frac{5040}{12} = 420.

The answer is (B) 420\boxed{\textbf{(B)}\ 420}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.