Skip to main content

2003 AMC 12A Problem 20

Problem 20 of 25HarderCombinatoricsProblem-Solving Techniques

How many 1515-letter arrangements of 55 A’s, 55 B’s, and 55 C’s have no A’s in the first 55 letters, no B’s in the next 55 letters, and no C’s in the last 55 letters?

Answer choices

Show solution

Solution

Suppose the first block holds kk B’s and 5−k5-k C’s. The remaining kk C’s must go in the second block (since the third has no C’s), forcing 5−k5-k A’s there. Then the third block contains the remaining kk A’s and 5−k5-k B’s. For each k,k, the kk B’s in the first block, kk C’s in the second, and kk A’s in the third can be placed in (5k)3\binom{5}{k}^3 ways, so the total is ∑k=05(5k)3.\displaystyle\sum_{k=0}^{5}\binom{5}{k}^3. Thus, the correct answer is A.
AoPS wiki

Tagged: multiset permutations · combinations · casework

More practice