AMC 10 · 2020 · #23

Grade 7 probability
probability-basicexpected-valuecaseworksystematic-enumerationconditional-probability caseworkidentify-subproblemscomplementary-counting ↑ Prerequisites: probability-basicexpected-value
📏 Long solution 💡 4 insights
Problem
Jason rolls three fair six-sided dice, sees the result, then chooses which of them to reroll so as to maximize his probability of ending with a sum of exactly 7. Over the random initial roll, find the probability that the best choice is to reroll exactly two dice.

Pick an answer.

(A)
$\frac{7}{36}$
(B)
$\frac{5}{24}$
(C)
$\frac{2}{9}$
(D)
$\frac{17}{72}$
(E)
$\frac{1}{4}$
How to solve
Strategy Identify Subproblems

Tool #7 (Subproblems): four strategies (reroll 0, 1, 2, or 3) — compute each one's win probability as a separate subproblem, then compare. Tool #9 (Easier Problem): the count of two-dice sums equaling s is a tiny lookup (s-1 for s ≤ 7). Tool #2 (Systematic List): enumerate sorted triples (a, b, c) with a ≤ b ≤ c satisfying the derived conditions, multiplying by permutation counts. Tool #3 (Eliminate Possibilities): inequality reroll-2 vs. reroll-1 rules out a whole family of states; another inequality vs. reroll-3 restricts the kept die to a ∈ {1,2,3}.

1STEP 1

Rerolling all three

Rerolling all three is low.

P(reroll 3) = 15/216 = 5/72
2STEP 2

Rerolling exactly one

When possible it is a solid one sixth.

P(reroll 1) = 1/6 & if a+b ≤ 6 ; 0 & if a+b ≥ 7
3STEP 3

Rerolling exactly two

A smaller kept die is better.

P(reroll 2) = (6 - a)/36
4STEP 4

When two wins

The one-die option must be blocked.

(6-a)/36 < 6/36 = 1/6 → need a+b ≥ 7
5STEP 5

Which die to keep

Only three values can be kept.

a ∈ {1, 2, 3}
6STEP 6

Check the initial sum is not seven

In this case the initial sum cannot be seven.

a + b ≥ 7 → a+b+c ≥ 8 → initial sum ≠ 7
7STEP 7

Count the cases

Count the cases for each value.

|a=1|=3, |a=2|=12, |a=3|=27
8STEP 8

Take the probability

Dividing gives seven thirty-sixths.

P = 42/216 = 7/36 → (A)
Answer
7/36
Quick sanity. 42/216 simplifies via gcd(42, 216) = 6 to 7/36. The cases are mutually exclusive (a sorted triple has one a value), so no double-counting. Spot-check (1,6,6): a=1, reroll-2 keeps the 1, need pair to sum to 6, which has 5 ordered ways ((1,5),(2,4),(3,3),(4,2),(5,1)), prob 5/36 ≈ 0.139. Reroll-1 alternative would keep (6,6) summing to 12 > 6, infeasible — confirming reroll-1 ruled out. Reroll-3 gives 5/72 ≈ 0.069, lower than 5/36. Reroll-0 has sum 13 ≠ 7, gives 0. So reroll-2 wins. Spot-check (4,5,6): a=4 ∉ {1,2,3} — so reroll-2 NOT optimal here. Reroll-1 feasible? a+b = 9 > 6, infeasible. Reroll-3 gives 5/72. Reroll-2 keeping 4 gives (6-4)/36 = 2/36 = 4/72 < 5/72 — so reroll-3 wins. Confirms filter a ≤ 3.
💡Key takeaway

This AMC 12 problem only needs Grade 7 dice-probability and inequality comparisons you already know — rerolling 2 dice is optimal only when (1) every pair of two dice exceeds sum 6 (a+b ≥ 7) and (2) the smallest die is in {1,2,3}; listing the 42 such ordered triples out of 216 gives 42/216 = 7/36.