AMC 10 · 2013 · #25

Grade 8 counting
combinations-basicprinciple-of-inclusion-exclusionsymmetry-argument complementary-countingcasework ↑ Prerequisites: combinations-basic
📏 Long solution 💡 3 insights
Problem
A regular octagon has all 20 of its diagonals drawn. Count how many distinct points strictly inside the octagon (not on its boundary) are passed through by two or more diagonals. If several diagonals go through the same interior spot, that spot still counts as just one point.

Pick an answer.

(A)
49
(B)
65
(C)
70
(D)
96
(E)
128

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

How to solve
Strategy Change Focus / Count the Complement

Chasing scattered crossing points one by one is hard, so Tool #16 (Change Focus) reframes the count: every interior crossing is made by two diagonals, which together use exactly four vertices, and those four vertices form one quadrilateral. So instead of counting points, count choices of 4 vertices, giving a clean C(8, 4). That count is only exact when no three diagonals share a point, so Tool #1 (Draw a Diagram) and the octagon's symmetry reveal where diagonals become concurrent. Tool #7 (Identify Subproblems) splits the fix into two pieces — the single center and a ring of triple points — and Tool #2 (Make a Systematic List) tallies the over-counts to subtract.

1STEP 1

Count crossings by their four corner vertices

Two diagonals crossing inside use four vertices that form one quadrilateral, so count choices of 4 vertices instead of chasing points.

one interior crossing ⇔ one choice of 4 vertices = C(8, 4)
2STEP 2

Evaluate the 4-vertex count: 70

C(8, 4) = 1680/24 = 70, so a first count of 70 crossing points — exact only if no point hosts three diagonals.

C(8, 4) = (8 × 7 × 6 × 5)/(4 × 3 × 2 × 1) = 1680/24 = 70
3STEP 3

Symmetry makes some diagonals share a point

But the regular octagon's symmetry lines extra diagonals up on one spot, and a point holding k diagonals is counted C(k, 2) times, not once.

a point with k diagonals is counted C(k, 2) times, not once
4STEP 4

The center: 4 diagonals, over-counted by 5

The 4 longest diagonals all pass through the center, so C(4, 2) = 6 quadrilaterals point at one spot: 5 counts are extra.

C(4, 2) = 6 counts for 1 point → remove 6 - 1 = 5
5STEP 5

Eight triple points: over-counted by 16

A ring of 8 points each hold exactly 3 diagonals, counted C(3, 2) = 3 times instead of once, so 8 × 2 = 16 counts are extra.

8 × ( C(3, 2) - 1 ) = 8 × (3 - 1) = 8 × 2 = 16
6STEP 6

Subtract the extras to get 49

Every other crossing was already counted once correctly, so 70 - 5 - 16 = 49 distinct interior points. The answer is (A).

70 - 5 - 16 = 49 → (A) 49
Answer
49
The plain count 70 is choice (C), exactly the trap for anyone who forgets that diagonals can share a point, which is a good sign our correction direction is right. Every correction only lowers the count, because concurrent points are over-counted and never under-counted, so the true answer must be below 70, ruling out (D) 96 and (E) 128 at once. Removing 5 + 16 = 21 extra counts lands on 49, which is choice (A). The two kinds of concurrences — one 4-fold center and eight 3-fold points — are just what the octagon's 8-fold symmetry predicts, so the size of the correction is believable.
💡Key takeaway

Count each crossing by the four corners that make it — that gives 70 — then subtract the extra counts wherever the octagon's symmetry pushes three or four diagonals through the same point.

  • Count crossings by their four corner vertices
  • Evaluate the 4-vertex count: 70
  • Symmetry makes some diagonals share a point
  • The center: 4 diagonals, over-counted by 5
  • Eight triple points: over-counted by 16
  • Subtract the extras to get 49