AMC 10 Step by Step

2021 AMC Fall 10A Problem 21

P21-25~5 minPrint

Each of the 2020 balls is tossed independently and at random into one of the 55 bins. Let pp be the probability that some bin ends up with 33 balls, another with 55 balls, and the other three with 44 balls each. Let qq be the probability that every bin ends up with 44 balls. What is pq\frac{p}{q} ?

Log in to save your progress.
Show solution without answering

Key insight

Both probabilities share the bottom 5 to the 20th, so compare counts. Most cancels, leaving 20 ways to pick the special bins times 4/5.

Solution

1. Same bottom. Each ball can land in 55 bins, so there are 5205^{20} equally likely ways for the balls to land. Both pp and qq are "good ways divided by 5205^{20}". So
pq=number of ways for the 3-5-4-4-4 patternnumber of ways for the 4-4-4-4-4 pattern.\frac{p}{q} = \frac{\text{number of ways for the 3-5-4-4-4 pattern}}{\text{number of ways for the 4-4-4-4-4 pattern}}.
2. A counting tool. How many ways can labeled balls be split into bins with given sizes? Small example: 44 balls into two bins, sizes 11 and 33. You pick which ball goes alone: 44 ways. The formula 4!1! 3!=246=4\frac{4!}{1!\,3!} = \frac{24}{6} = 4 agrees. In general, the number of ways is
(total)!(size1)! (size2)!⋯.\frac{(\text{total})!}{(\text{size}_1)!\,(\text{size}_2)!\cdots}.
(Line up all the balls, 20!20! orders, and put the first few in bin 1, the next few in bin 2, and so on. Reordering balls inside a bin does not change anything, so divide by those factorials.)
3. Count for qq. All five bins get 44 balls:
20!4! 4! 4! 4! 4!.\frac{20!}{4!\,4!\,4!\,4!\,4!}.
4. Count for pp. First choose which bin gets 33 balls (55 choices), then which gets 55 balls (44 choices left). That is 5×4=205 \times 4 = 20 ways. The other three bins get 44 each. Then split the balls:
20×20!3! 5! 4! 4! 4!.20 \times \frac{20!}{3!\,5!\,4!\,4!\,4!}.
5. Divide. The 20!20! cancels, and three of the 4!4!s cancel:
pq=20×4! 4!3! 5!=20×4!3!×4!5!=20×4×15=16.\frac{p}{q} = 20 \times \frac{4!\,4!}{3!\,5!} = 20 \times \frac{4!}{3!} \times \frac{4!}{5!} = 20 \times 4 \times \frac{1}{5} = 16.

The answer is (E) 16\boxed{\textbf{(E)}\ 16}.

Why this works

When two events come from the same set of equally likely outcomes, the ratio of their probabilities is just the ratio of their counts, so the huge 5205^{20} never needs computing. In the counts, almost everything cancels. What is left is the number of ways to pick the two special bins (2020) and a small factor 45\frac45 from changing one bin from 44 to 33 and another from 44 to 55.

Alternative approach

Count by moving one ball. Start from any all-fours outcome. Move one ball (2020 choices) to a different bin (44 choices). That makes 8080 moves, and each one gives a 3-5-4-4-4 outcome. Now go backwards: a given 3-5-4-4-4 outcome can be reached this way in exactly 55 ways, since any of the 55 balls in the full bin could have been the one that moved in from the bin with 33. So
80×(ways for q)=5×(ways for p),80 \times (\text{ways for } q) = 5 \times (\text{ways for } p),
and pq=805=16\frac{p}{q} = \frac{80}{5} = 16.

Concise solution

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

Every toss sequence is one of 5205^{20} equally likely outcomes, so p/qp/q is just the ratio of the numbers of favorable outcomes.

For qq: assign the 2020 distinguishable balls to bins with sizes 4,4,4,4,44, 4, 4, 4, 4. The count is the multinomial coefficient
Nq=20!(4!)5.N_q = \frac{20!}{(4!)^5}.

For pp: first decide which bin gets 33 balls (55 choices) and which gets 55 (44 remaining choices); the other three get 44 each. Then assign balls:
Np=5⋅4⋅20!3! 5! (4!)3.N_p = 5 \cdot 4 \cdot \frac{20!}{3!\,5!\,(4!)^3}.

Divide; the 20!20! cancels:
pq=NpNq=20⋅(4!)53! 5! (4!)3=20⋅4!3!⋅4!5!=20⋅4⋅15=16.\frac{p}{q} = \frac{N_p}{N_q} = 20 \cdot \frac{(4!)^5}{3!\,5!\,(4!)^3} = 20 \cdot \frac{4!}{3!} \cdot \frac{4!}{5!} = 20 \cdot 4 \cdot \frac{1}{5} = 16.

The answer is (E) 16\boxed{\textbf{(E)}\ 16}.

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.