AMC 10 · 2002 · #14
Grade 7 arithmeticPick an answer.
Four circles crossing all at once looks tangled, but the crossings never happen between three circles — every crossing point belongs to exactly one pair of circles. Tool #7 (Identify Subproblems) uses that to split the whole count into a sum over pairs: the total is just (points per pair) times (number of pairs). Tool #1 (Draw a Diagram) pins down the first factor — two circles cross at most twice. Tool #2 (Make a Systematic List) pins down the second — carefully list the pairs of four circles so none is missed or double-counted. Tool #14 (Extreme Principle) closes the argument: the total is largest when every pair truly meets twice and no three circles share a point, and we check that this best case is actually drawable.
Two circles cross at most twice
Two distinct circles can meet at most twice — never three times.
A circle is fixed once you know its center and radius, so two circles just can't wrap around each other enough to cross a third time.
4.OA.A.3Draw A DiagramEvery crossing belongs to one pair
Each crossing lies on exactly two circles, so it is owned by one pair.
Splitting a messy count into one tidy count per pair turns a tangle into simple arithmetic.
Every crossing point belongs to exactly one pair of circles, so counting pairs counts the crossings.
▸ Why?
A crossing is named by the two circles that make it, so crossings and pairs line up one for one.
▸ Why?
Different pairs contribute different crossings and every crossing comes from some pair, so the pair counts simply add.
List the pairs of circles
Listing pairs of four circles without repeats gives 6 pairs.
Listing pairs in order — smaller number first — guarantees you count each pair exactly once.
7.SP.C.8Make A Systematic ListMultiply, then check it is reachable
Six pairs at two points each gives 12, reachable with no triple point, choice (D).
The most points appears when every pair is pushed to its limit of two and no crossing is shared away.
3.OA.A.1Extreme PrincipleTwo circles can cross at most twice, so count how many pairs of circles there are and double it.
- Two circles cross at most twice
- Every crossing belongs to one pair
- List the pairs of circles
- Multiply, then check it is reachable