AMC 8 · 2017 · #10

Grade 7 probabilitycounting
probability-basiccombinations-basicsystematic-enumeration systematic-enumerationcasework ↑ Prerequisites: fraction-arithmeticsystematic-enumeration
📏 Short solution 💡 2 insights
📘 View easy version →
Problem
A box has five cards numbered 1, 2, 3, 4, 5. We pull out 3 cards at the same time (no putting back). What is the probability that the biggest number on the cards we pulled is exactly 4?

Pick an answer.

(A)
$frac{1}{10}$
(B)
$frac{1}{5}$
(C)
$frac{3}{10}$
(D)
$frac{2}{5}$
(E)
$frac{1}{2}$

AMC 8 2017 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Make a Systematic List

Only C(5, 3) = 10 possible 3-card sets exist, so we can literally write every one of them down (Tool #2). Once the list is in front of us, Tool #3 (Eliminate) makes it easy to mark which sets have 4 as the largest: any set containing card 5 is out, and any set not containing card 4 is out. Counting what survives gives the probability directly — no combinatorial formulas needed.

1STEP 1

List every 3-card group from {1,2,3,4,5} in increasing order — a fixed ordering rule guarantees no duplicates and no gaps.

{1,2,3},{1,2,4},{1,2,5},{1,3,4},{1,3,5},{1,4,5},{2,3,4},{2,3,5},{2,4,5},{3,4,5}
2STEP 2

Count the list — it has 10 groups, so the sample space is 10 equally likely outcomes.

Total sets = 10
3STEP 3

Cross off any group containing 5 or missing 4; only 3 survive: {1,2,4},{1,3,4},{2,3,4}, each with largest 4.

Survivors: {1,2,4},{1,3,4},{2,3,4}
4STEP 4

Probability = favorable ÷ total = 3 out of 10, which is choice (C).

P(max=4) = 310\frac{3}{10} → (C)
Answer
310\frac{3}{10}
By symmetry, the largest card in a random 3-card draw from {1,…,5} is 5 with probability C(4,2)10\frac{C(4, 2)}{10}=610\frac{6}{10}, is 4 with probability C(3,2)10\frac{C(3, 2)}{10}=310\frac{3}{10}, and is 3 with probability C(2,2)10\frac{C(2, 2)}{10}=110\frac{1}{10}. These sum to 6+3+110\frac{6+3+1}{10}=1, confirming our 310\frac{3}{10} for max =4 is consistent with all possibilities.
💡Key takeaway

This AMC 8 problem only needs Grade 7 probability with organized lists you already know — write out every way, count the ones that fit, divide!