AMC 10 · 2021 · #19

Grade 10 countinggeometry-2d
pair-countingarc-measuresystematic-enumerationcombinations-basic easier-related-problemidentify-subproblems ↑ Prerequisites: combinations-basicarc-measure
📏 Long solution 💡 3 insights
Problem
One circle carries four regular polygons at once, with five, six, seven, and eight sides, all inscribed in it. They are rotated so that no two share a corner and no point has three sides through it. Count the points strictly inside the circle where a side of one polygon crosses a side of another.

Pick an answer.

(A)
52
(B)
56
(C)
60
(D)
64
(E)
68
How to solve
Strategy Solve an Easier Related Problem

Four polygons on one circle is a picture nobody can count by eye, so tool #7 (Identify Subproblems) does the first cut: every crossing involves exactly two sides from two different polygons, so the whole count splits cleanly into the six two-polygon pictures. That turns the task into tool #9 (Solve an Easier Related Problem) — settle once and for all how many crossings one m-gon and one n-gon make, then reuse the result six times. For that single pair, tool #1 (Draw a Diagram) supplies the only fact needed: two chords of a circle meet inside exactly when their four endpoints alternate around the rim. Tool #16 (Change Focus) decides which polygon to count from. Counting along the sides of the bigger polygon is uneven — some of its sides get hit, some do not — but counting along the sides of the smaller polygon is perfectly even, and that evenness is what makes the pair count a clean formula. Tool #2 (Make a Systematic List) then runs the six pairs without missing or repeating one, and tool #15 (Organize Information in More Ways) adds them up by regrouping: instead of six separate pair totals, ask how many times each polygon is the smaller one.

1STEP 1

Split into six two-polygon pictures

Split into six two-polygon pictures.

total = Σ_pairs (crossings of that pair), number of pairs = C(4, 2) = 6
2STEP 2

One pair only: compare the arcs

For one pair, compare the arcs.

arc under one side of the m-gon = 360°/m > 360°/n = vertex spacing of the n-gon
3STEP 3

When do two chords cross inside?

Decide when two chords cross inside.

AB and CD cross inside ⇔ exactly one of C, D lies on arc AB
4STEP 4

Every side of the smaller polygon is hit twice

Every side of the smaller one is cut twice.

crossings on each side of the m-gon = 2 ⟹ crossings of the pair (m, n) = 2m (m < n)
5STEP 5

List the six pairs

List all six pairs.

(5,6) → 10, (5,7) → 10, (5,8) → 10, (6,7) → 12, (6,8) → 12, (7,8) → 14
6STEP 6

Regroup and add

Regrouping and adding gives 68.

2(3 · 5 + 2 · 6 + 1 · 7 + 0 · 8) = 2(15 + 12 + 7) = 2 · 34 = 68
Answer
68
Count the same 68 points a second way, from the sides they lie on. Each crossing lies on exactly two sides, so the crossings counted with multiplicity along all sides should come to 2 · 68 = 136. The 5-gon is the smaller member three times, so its sides carry 10 + 10 + 10 = 30 points. The 6-gon carries 12 + 12 from the pairs it leads plus 10 from the pair (5,6), total 34. The 7-gon carries 14 plus 10 + 12, total 36. The 8-gon leads nothing and carries 10 + 12 + 14 = 36. The four totals add to 30 + 34 + 36 + 36 = 136, exactly as required. A size check also fits: sides from different polygons form 5 · 6 + 5 · 7 + 5 · 8 + 6 · 7 + 6 · 8 + 7 · 8 = 251 pairs, each meeting at most once, so 68 is comfortably below the ceiling while being far more than a handful. The five answer choices 52, 56, 60, 64, 68 are all of the form 2 · (some total) with totals 26, 28, 30, 32, 34, so they differ only in the bookkeeping of who counts as the smaller polygon. Choice (A) 52 is exactly 2(5 + 6 + 7 + 8), the answer you get by charging each polygon once instead of once per polygon that outnumbers it; the correct bookkeeping charges the 5-gon three times, the 6-gon twice, and the 7-gon once, for a total of 34.
💡Key takeaway

Two chords of a circle cross inside exactly when their endpoints take turns around the rim, so in any pair of inscribed regular polygons the one with fewer sides sets the count: each of its sides is crossed exactly twice.

  • Split into six two-polygon pictures
  • One pair only: compare the arcs
  • When do two chords cross inside?
  • Every side of the smaller polygon is hit twice
  • List the six pairs
  • Regroup and add