2021 AMC Fall 10A Problem 21
Each of the balls is tossed independently and at random into one of the bins. Let be the probability that some bin ends up with balls, another with balls, and the other three with balls each. Let be the probability that every bin ends up with balls. What is ?
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 bins, so there are equally likely ways for the balls to land. Both and are "good ways divided by ". So
2. A counting tool. How many ways can labeled balls be split into bins with given sizes? Small example: balls into two bins, sizes and . You pick which ball goes alone: ways. The formula agrees. In general, the number of ways is
(Line up all the balls, 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 . All five bins get balls:
4. Count for . First choose which bin gets balls ( choices), then which gets balls ( choices left). That is ways. The other three bins get each. Then split the balls:
5. Divide. The cancels, and three of the s cancel:
The answer is .
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 never needs computing. In the counts, almost everything cancels. What is left is the number of ways to pick the two special bins () and a small factor from changing one bin from to and another from to .
Alternative approach
Count by moving one ball. Start from any all-fours outcome. Move one ball ( choices) to a different bin ( choices). That makes 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 ways, since any of the balls in the full bin could have been the one that moved in from the bin with . So
and .
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 equally likely outcomes, so is just the ratio of the numbers of favorable outcomes.
For : assign the distinguishable balls to bins with sizes . The count is the multinomial coefficient
For : first decide which bin gets balls ( choices) and which gets ( remaining choices); the other three get each. Then assign balls:
Divide; the cancels:
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Intermediate Counting & Probability, Chapter 4: Constructive Counting and 1-1 Correspondences (§4.4, §4.5, §4.6)
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques
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.