AMC 10 · 2025 · #12

Grade 7 counting
systematic-enumerationprime-numbersparity casework ↑ Prerequisites: prime-numberssystematic-enumeration
📏 Medium solution 💡 2 insights
Problem
A passcode is an ordered string of 4 digits, each from 1 to 9 (no 0). Among the four digits, exactly one is even and exactly one is prime; the digit that is even and the digit that is prime may be the same position or different positions. Count how many such passcodes exist.

Pick an answer.

(A)
176
(B)
192
(C)
432
(D)
464
(E)
608

AMC 10 2025 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Make a Systematic List

This is a 'how many ways' count, so Tool #2 (Make a Systematic List) drives it: fix a role for each position, then multiply the independent choices. But before I can count, I must know how 'even' and 'prime' overlap among the digits 1–9, which is exactly a both/neither sorting — Tool #12 (Draw a Venn Diagram). That sorting reveals the trap digit 2, the one number sitting in the overlap. Because 2 can satisfy both conditions by itself, the count breaks into cleanly separate scenarios, so Tool #7 (Identify Subproblems) splits on whether a 2 appears and I add the pieces at the end.

1STEP 1

Sort the digits by even and prime

Label each digit from 1 to 9 as even or not and as prime or not; the two labels together split the nine digits into four groups.

even-not-prime={4,6,8}, even AND prime={2}, odd prime={3,5,7}, neither={1,9}
2STEP 2

Spot the digit that fills both slots

Only 2 is both even and prime, so one 2 fills the even slot and the prime slot at the same time — that overlap forces two separate cases.

2 ∈ (even) ∩ (prime)
3STEP 3

Case 1 — no 2 is used

Without a 2: choose the even position and its value, the prime position and its value, then fill the last two from 1 or 9 — 432 codes.

4 · 3 · 3 · 3 · 4 = 432
4STEP 4

Case 2 — exactly one 2 is used

One 2 already covers both rules, so the other three positions must each be 1 or 9: 4 places for the 2 times 8 fillings gives 32.

4 · 2³ = 4 · 8 = 32
5STEP 5

Add the two scenarios

The two cases never overlap and together cover every valid passcode, so add them: 432 plus 32 is 464.

432 + 32 = 464 → (D)
Answer
464
The count is dominated by Case 1's 432, which is answer choice (C) exactly — that is the tempting wrong answer you get if you forget the digit 2 can be both even and prime. The extra 32 passcodes are precisely the ones built from a single 2 padded with 1s and 9s, pushing the true total to 464, choice (D). The total 464 is comfortably below the 9⁴=6561 passcodes with no restriction, and well below even 608, so the size is sensible for such tight 'exactly one' conditions.
💡Key takeaway

Watch for the digit that fits two rules at once (2 is even and prime) — split into 'it shows up' vs 'it doesn't', count each, and add.

  • Sort the digits by even and prime
  • Spot the digit that fills both slots
  • Case 1 — no 2 is used
  • Case 2 — exactly one 2 is used
  • Add the two scenarios