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?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Sort the 27 placements by shape: 3 give 3-0-0, 6 give 1-1-1, 18 give 2-1-0, so the expectation is (9 + 6 + 36)/27.
Solution
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 .
Why this works
The coins are distinguishable and each of the placements is equally likely, so the safest route is to count placements rather than to reason about "shapes", which are not equally likely at all: the -- shape accounts for two thirds of the outcomes while -- accounts for only of . Counting the two extreme shapes and taking the rest by subtraction keeps the arithmetic short and also self-checks, since the three counts must total . Note also that the expectation is not attainable as an outcome; an expected value need not be one of the possible values.
Alternative approach
Use the tail formula for the nonnegative integer maximum . Here , , and . Adding, .
The trap
Treating the three shapes 3-0-0, 2-1-0 and 1-1-1 as equally likely and averaging 3, 2, 1 to get 2, choice (E).
Common mistakes
- Treating the three shapes 3-0-0, 2-1-0 and 1-1-1 as equally likely and averaging 3, 2, 1 to get 2, choice (E).
- Counting the -- case as a single placement instead of , which leaves the three counts failing to sum to .
- Computing the expected number of coins in one fixed jar, which is , rather than in the fullest jar.
Techniques
Split into exhaustive cases and handle each · Set up the equation/formula and compute; no special trick needed