2026 AMC 10A Problem 16
An urn contains red balls, black balls, and white balls. Suppose balls are drawn at random without replacement and a score is computed as follows:
point is given for each red ball up to a maximum of points.
point is given for each black ball up to a maximum of points.
point is given for each white ball up to a maximum of points.
For example, drawing red ball, black balls, and white balls would earn a score of . What is the probability of getting the lowest possible score?
Show solution without answering
Key insight
Balls beyond a color's cap score nothing. Waste as many as possible: the lowest score, 4, needs either no reds or all six reds.
Solution
There are three jobs: find the lowest possible score, count the draws that get it, and divide by the number of all draws.
Part 1: the lowest possible score.
- What makes a score low. Every ball scores point unless its color has already reached its cap: red stops scoring after balls, black after , white after . So the score is low when many balls are "wasted" past a cap.
- Organize by the number of red balls. The number of reds can be anything from to . Once it is chosen, the rest of the balls are black or white, with at most of each. To keep the black-and-white points low, pile as many of those balls as possible into one color, so the extras are wasted. For example, with reds there are black-and-white balls; putting in one color scores , and the fifth ball must go in the other color and scores .
| Reds | Red points | Black + white balls | Lowest-scoring split | Black + white points | Lowest score |
|---|---|---|---|---|---|
| or | |||||
| any split (each color gets at least ) | |||||
| or | |||||
| or | |||||
| or | |||||
| any split | |||||
| or |
(With red there are black-and-white balls, and since neither color can have more than , each color gets at least and scores its full points.)
3. Result. The lowest possible score is . It happens for exactly four color mixes (red, black, white):
Part 2: counting.
4. All draws. Think of the balls as all different (imagine they are numbered). Then every group of balls is equally likely, and the number of groups is
(Cancel with , with , with , with , and with .)
5. Draws with score .
- : take all blacks ( way) and of the whites ( ways): draws.
- : the same with black and white swapped: draws.
- : take all reds ( way) and of the blacks ( ways): draws.
- : the same with white instead of black: draws.
In total draws.
6. Probability. Since ,
The answer is .
Why this works
For "lowest possible" questions with several pieces, pick the one quantity that controls the most (here, the number of red balls) and make a table with a row for each value. A table makes it impossible to skip a case, and it shows that the lowest score comes from two very different-looking draws. After that it is ordinary counting: numbering the balls makes all draws equally likely, so the probability is favorable draws over .
Alternative approach
Find the lowest score by counting wasted balls. The score is minus the number of wasted balls, so we want to waste as many as possible. A color can only waste balls after it has reached its cap.
- If red is the only color wasting balls: reds score, up to more are wasted, and the th ball scores. Lowest score , with reds.
- If black and white both waste balls: they already score , so the score is at least , and exactly only with no reds.
- If red wastes together with black or white: the score is at least .
- If only black (or only white) wastes: that color scores and wastes at most , so at least of the other balls each score a point. The score is at least .
- If nothing is wasted, the score is .
So the lowest score is , from the same four mixes as before, and the counting finishes the same way.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Let the draw have red, black, white balls, . The score is .
- : with , so and the score is .
- : checking each value, the score is at least .
- : one black or white ball, score .
So the minimum is , attained by , each in ways. The probability is
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
- Introduction to Counting & Probability, Chapter 8: Basic Probability 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.