AMC 10 · 2003 · #24

Grade 4 number-theory
divisibility-ruleslogical-deductionfactors caseworksystematic-enumeration ↑ Prerequisites: divisibility-rules
📏 Long solution 💡 3 insights
📘 View easy version →
Problem
Sally has five red cards numbered 1 through 5 and four blue cards numbered 3 through 6. She stacks all nine cards in one pile so that the colors alternate and so that the number on each red card divides evenly into the number on every blue card touching it. What is the sum of the numbers on the middle three cards?

Pick an answer.

(A)
8
(B)
9
(C)
10
(D)
11
(E)
12

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

How to solve
Strategy Eliminate Possibilities

There are too many card orders to try one by one, so the smart move is to let the divisibility rule delete options until only one stack survives. Tool #2 (Make a Systematic List) first records exactly which red cards divide each blue card, turning a vague rule into a small table. Tool #14 (Extreme Principle) then spots the fussiest cards: the two reds that divide only a single blue have nowhere flexible to go and get pinned to the ends. From there Tool #3 (Eliminate Possibilities) chains each forced choice into the next until every slot is filled. Tool #1 (Draw a Diagram) keeps the nine slots in front of us so we can see the middle three.

1STEP 1

List which red card divides each blue

Colors must alternate, so reds take both ends and each blue sits between two reds; list which reds divide each blue.

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

Pin the fussiest reds to the ends

Red 5 divides only blue 5 and red 4 only blue 4, but an interior red must divide two blues — so reds 4 and 5 are forced to the ends.

5 ∣ 5 only, 4 ∣ 4 only → reds 4,5 at the ends
3STEP 3

Chain the forced neighbors inward

Blue 5 then forces red 1, blue 4 forces red 2, and red 3 lands in the center: 5,5,1,3,3,6,2,4,4.

5, 5, 1, 3, 3, 6, 2, 4, 4
4STEP 4

Add the three middle cards

The fourth, fifth, and sixth cards are blue 3, red 3, blue 6, so the middle sum is 12, choice (E).

3+3+6=12 → (E)
Answer
12
Read the full stack 5,5,1,3,3,6,2,4,4 and check every touching pair: 5 ∣ 5, 1 ∣ 5, 1 ∣ 3, 3 ∣ 3, 3 ∣ 6, 2 ∣ 6, 2 ∣ 4, 4 ∣ 4 — all eight divisions come out even, and the colors alternate the whole way. Because every step was forced, this is the only stack that works, so the middle sum 12 is not one option among many but the answer, matching choice (E).
💡Key takeaway

Find the pieces that fit in only one place, lock those down first, and each forced choice will point you to the next until the whole puzzle solves itself.

  • List which red card divides each blue
  • Pin the fussiest reds to the ends
  • Chain the forced neighbors inward
  • Add the three middle cards