AMC 8 · 2003 · #12
Grade 7 probabilityPick an answer.
AMC 8 2003 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
There are only 6 possible outcomes (one for each face being hidden), so we could check them one by one. But Tool #11 (Find an Invariant) gives a shorter path: ask whether the divisibility-by-6 status of the visible product is the same for every outcome. Tool #7 (Identify Subproblems) splits "divisible by 6" into the two independent questions "divisible by 2?" and "divisible by 3?". If both answers stay "yes" no matter which face hides, the probability is forced to 1.
Split the goal with Tool #7: the product is divisible by 6 exactly when it is divisible by both 2 and 3.
Grade 4 factor-pair thinking: 6 = 2 × 3, and these two primes are independent factors.
4.OA.B.4Identify SubproblemsSubproblem A: three faces are even {2, 4, 6}; hiding one leaves at least two evens, so a factor of 2 always survives.
You cannot hide three things by removing only one — the count of evens is the invariant that protects the factor of 2.
4.OA.B.4Work BackwardsSubproblem B: {3, 6} are the only multiples of 3; one hidden face removes at most one, so a multiple of 3 always stays visible.
Same idea: you cannot hide two faces with one bottom slot, so a multiple of 3 always survives.
4.OA.B.4Work BackwardsBoth subproblems always hold, so every outcome's product is divisible by 6 — the probability is 1, choice (E).
Grade 7 probability: a certain event has probability 1. Both subproblems are certain, so the combined event is certain too.
7.SP.C.5Work BackwardsOnly one face hides, and the die has three evens and two multiples of 3 — too many to wipe out with a single hidden face. So the product is always divisible by 6, and the probability is 1.