AMC 10 · 2023 · #7

Grade 4 arithmetic
digit-constraintsparitysystematic-enumerationplace-value caseworksystematic-enumerationidentify-subproblems ↑ Prerequisites: digit-constraintsparity
📏 Long solution 💡 3 insights
📘 View easy version →
Problem
In an eight-digit date display the year part is fixed as 2023. Count the dates within that year for which every digit from zero to nine appears an even number of times across the whole eight-digit string.

Pick an answer.

(A)
5
(B)
6
(C)
7
(D)
8
(E)
9
How to solve
Strategy Organize Information in More Ways

The first move is Tool #15 (Reorganize) — drop the calendar story and re-frame the question as a digit-parity bookkeeping problem on MMDD. The year 2023 already has odd counts only at digits 0 and 3, so the four digits of MMDD must include an odd count of 0's, an odd count of 3's, and an even count of every other digit. With four slots that pins the digit multiset down to a tiny set of cases — perfect for Tool #2 (Systematic List). Tool #7 (Identify Subproblems) handles the calendar filter: for each candidate digit multiset, list the rearrangements that form a valid MM/DD.

1STEP 1

Count the year's digits

The year uses zero and three oddly.

year parity: 0 → odd, 3 → odd, else → even
2STEP 2

Condition on the last four

Write the condition on the last four.

#{0}_MMDD ∈ {1, 3}, #{3}_MMDD ∈ {1, 3}, #{d}_MMDD ∈ {0, 2, 4} for d ∉ {0, 3}
3STEP 3

List the possible multisets

List the possible digit multisets.

cases: {0, 3, d, d}, {0, 3, 3, 3}, {0, 0, 0, 3}
4STEP 4

Kill the impossible ones

Kill the ones that cannot be dates.

{0,3,3,3}: 0, {0,0,0,3}: 0
5STEP 5

Find the candidate digit

Find which digits can appear.

candidate d: 1, 2
6STEP 6

Count the first candidate

Count the dates for the first candidate.

d=1: {0113, 0131, 0311, 1013, 1031, 1103, 1130} → 7
7STEP 7

Count the second candidate

Count the second candidate's dates.

d=2: {0223, 0322} → 2
8STEP 8

Add them up

Adding gives 9.

7 + 2 = 9 → (E)
Answer
9
Spot-check each of the 9 dates by concatenating with 2023 and tallying digits: e.g. 20230113 → digits {2,0,2,3,0,1,1,3}: 0 twice, 1 twice, 2 twice, 3 twice — all even ✓. Similarly 20230131: {2,0,2,3,0,1,3,1} — 0 twice, 1 twice, 2 twice, 3 twice ✓. 20230223 → {2,0,2,3,0,2,2,3}: 0 twice, 2 four times, 3 twice ✓. The same parity verification works on the rest. Magnitude check: with 9 qualifying dates out of 365 days in 2023, the rate is about 2.5% — a believable order of magnitude for a fairly restrictive parity constraint.
💡Key takeaway

This AMC 12 problem only needs Grade 4 pattern enumeration you already know — make 2023's odd-count digits (0 and 3) come out even by carefully choosing the four MMDD digits, then list the calendar dates that fit.