AMC 10 · 2021 · #7

Grade 5 arithmetic
logical-deductioncontrapositiveif-then-reasoning caseworksystematic-enumeration ↑ Prerequisites: if-then-reasoning
📏 Medium solution 💡 2 insights
📘 View easy version →
Problem
Tom owns 13 snakes. Some are purple, some are happy, some can add, some can subtract. We are told three facts: every happy snake can add; no purple snake can subtract; and every snake that can't subtract also can't add. Which of the five answer-choice conclusions is forced by these three facts?

Pick an answer.

(A)
Purple snakes can add.
(B)
Purple snakes are happy.
(C)
Snakes that can add are purple.
(D)
Happy snakes are not purple.
(E)
Happy snakes can't subtract.

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

How to solve
Strategy Eliminate Possibilities

Five answer choices, all multiple-choice — Tool #3 (Eliminate Possibilities) tests each in turn against the three given facts. Tool #1 (Draw a Diagram) sketches the facts as arrows between properties so the chain is visible. Tool #7 (Identify Subproblems) splits the work: first chain facts 2 and 3, then bring in the contrapositive of fact 1, then read off which arrow lands on the answer.

1STEP 1

Turn each 'if-then' fact into an arrow between property boxes: happy → add, purple → not-subtract, not-subtract → not-add.

happy→add, purple→¬sub, ¬sub→¬add
2STEP 2

Chain facts 2 and 3: purple → not-subtract → not-add, so every purple snake cannot add.

purple → ¬sub → ¬add
3STEP 3

Read fact 1 (happy → add) backwards — its contrapositive is not-add → not-happy.

happy→add ⟺ ¬add→¬happy
4STEP 4

Chain Steps 2 and 3: purple → not-happy; its contrapositive is happy → not-purple.

purple → ¬add → ¬happy ⟺ happy→¬purple
5STEP 5

Test the choices against the chain: only (D) — happy → not-purple — is forced; (A) is the opposite, and (B), (C), (E) aren't forced.

(D): happy→¬purple ✓
Answer
Happy snakes are not purple.
Test by constructing a concrete example. Suppose a snake is happy. By fact 1 it can add. If it were also purple, then by fact 2 it cannot subtract, and by fact 3 it cannot add — but we just said it can add. Contradiction. So a happy snake cannot be purple — confirming (D). The counts 13, 4, 5 never entered the argument, exactly as the problem implied by their roundness.
💡Key takeaway

This AMC 10 problem only needs Grade 5 category reasoning you already know — turn each "all A are B" into an arrow, chain purple → not-subtract → not-add and flip happy → can-add to its contrapositive, and the chain gives happy → not-purple, which is choice (D).