2025 AMC 10A Problem 16
There are three jars. Each of three coins is placed in one of the three jars, chosen at random and independently of the placements of the other coins. What is the expected number of coins in a jar with the most coins?
Show solution without answering
Key insight
List the 27 equally likely ways to drop the coins. Just 3 put all coins together and 6 spread them out; the other 18 give a fullest jar of 2.
Solution
Call the coins , , and the jars , , .
Step 1: count the outcomes. Each coin has jars to choose from, so there are placements, all equally likely. For example, " in jar , in jar , in jar " is one placement.
Step 2: sort the placements by the size of the fullest jar. The fullest jar can hold , or coins.
- Fullest jar has . All coins go in the same jar. There are jars to choose, so placements.
- Fullest jar has . Each jar gets exactly one coin. Coin has jars to choose, then has , then has : that is placements.
- Fullest jar has . This is every other placement: .
Check it directly: pick which coin is alone ( ways), pick the jar for the other two ( ways), pick a different jar for the lonely coin ( ways). That gives . It matches.
| Fullest jar | Placements |
|---|---|
| total |
Step 3: take the average. The expected value is the average of the fullest-jar count over all placements:
The answer is .
Why this works
The placements are equally likely, but the patterns "all together", "two and one" and "one each" are not: "two and one" happens times out of . So count placements, not patterns. Counting the two easy cases and getting the middle one by subtraction saves work, and checking that the counts add to catches mistakes. Also notice that the answer is not a whole number, even though every jar holds a whole number of coins. An expected value is an average, so that is fine.
Alternative approach
Instead of the table, ask three yes-or-no questions about each placement and count the "yes" answers.
- "Does the fullest jar have at least coin?" Always yes: placements.
- "At least coins?" Yes unless the coins are all in different jars: placements.
- "At least coins?" Yes only when all are together: placements.
A fullest jar with coins answers yes three times, one with coins answers yes twice, and one with coin answers yes once. So the number of yes answers equals the fullest-jar count, and the total over all placements is . The average is .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Each coin picks one of three jars, so there are equally likely placements. The largest jar count is , , or ; count the placements of each kind.
Largest count . All three coins land in the same jar: placements, one per jar.
Largest count . The coins are spread , which means the three coins go to three different jars: placements.
Largest count . Everything else: placements. (Directly: choose the jar holding two coins, ways; the jar holding one, ways; and which coin is alone, ways, giving .)
The expected value is therefore
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 11: Expected Value
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
- Intermediate Counting & Probability, Chapter 6: Constructive Expectation
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.