AMC 10 · 2024 · #13

Grade 8 geometry-2dcounting
coordinate-geometryreflection-symmetrysystematic-enumerationcombinations-basic caseworksystematic-enumeration ↑ Prerequisites: coordinate-geometryreflection-symmetry
📏 Long solution 💡 3 insights
Problem
Four plane transformations are given: T₁ = translate 2 units right, T₂ = rotate 90^° counterclockwise about the origin, T₃ = reflect across the x-axis, T₄ = dilate from the origin by factor 2. Two transformations commute if applying them in either order gives the same result. Of the C(4, 2) = 6 pairs, how many commute?

Pick an answer.

(A)
~1
(B)
~2
(C)
~3
(D)
~4
(E)
~5

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

How to solve
Strategy Make a Systematic List

The question itself names a finite collection — C(4, 2) = 6 pairs — and asks how many satisfy a yes/no condition. That is the signature of Tool #2 (Make a Systematic List): enumerate every pair, decide each one, then count the yeses. The deciding mechanism is Tool #13 (Convert to Algebra): once each geometric move is written as a coordinate rule, "do they commute" reduces to comparing two ordered pairs symbolically. Algebra is the right tool here because tracing pictures by hand for six pairs would be slow and error-prone, while the coordinate rules let each check fit on one line.

1STEP 1

Read each geometric move off as a coordinate rule, so composing two moves becomes plain substitution.

T₁(x,y) = (x+2, y), T₂(x,y) = (-y, x), T₃(x,y) = (x, -y), T₄(x,y) = (2x, 2y)
2STEP 2

List all 6 pairs in index order so none is missed, then compose each pair both orders on (x,y) and compare.

Pairs to test: {1,2}, {1,3}, {1,4}, {2,3}, {2,4}, {3,4}
3STEP 3

Pair {1,2}: translating then rotating carries the shift around, so the two orders differ — they do not commute.

T₂(T₁(x,y)) = T₂(x+2, y) = (-y, x+2) ; T₁(T₂(x,y)) = T₁(-y, x) = (-y+2, x) ; (-y, x+2) ≠ (-y+2, x) → not commute
4STEP 4

Pair {1,3}: translation touches only x and reflection only y, so they act on disjoint coordinates and commute.

T₃(T₁(x,y)) = T₃(x+2, y) = (x+2, -y) ; T₁(T₃(x,y)) = T₁(x, -y) = (x+2, -y) ; Equal → commute
5STEP 5

Pair {1,4}: dilation from the origin scales the 2-unit shift too but pure translation does not, so they do not commute.

T₄(T₁(x,y)) = T₄(x+2, y) = (2x+4, 2y) ; T₁(T₄(x,y)) = T₁(2x, 2y) = (2x+2, 2y) ; (2x+4, 2y) ≠ (2x+2, 2y) → not commute
6STEP 6

Pair {2,3}: both move both coordinates, and the two orders land on different points, so they do not commute.

T₃(T₂(x,y)) = T₃(-y, x) = (-y, -x) ; T₂(T₃(x,y)) = T₂(x, -y) = (-(-y), x) = (y, x) ; (-y, -x) ≠ (y, x) → not commute
7STEP 7

Pair {2,4}: both fix the origin, and scaling by 2 slides through the rotation's coordinate swap, so they commute.

T₄(T₂(x,y)) = T₄(-y, x) = (-2y, 2x) ; T₂(T₄(x,y)) = T₂(2x, 2y) = (-2y, 2x) ; Equal → commute
8STEP 8

Pair {3,4}: reflection scales y by -1 and dilation scales both by 2, and constant factors reorder freely, so they commute.

T₄(T₃(x,y)) = T₄(x, -y) = (2x, -2y) ; T₃(T₄(x,y)) = T₃(2x, 2y) = (2x, -2y) ; Equal → commute
9STEP 9

Of the six pairs, the ones that commute are {1,3}, {2,4}, {3,4} — three in all, giving (C).

Commuting pairs = {{1,3}, {2,4}, {3,4}}, count = 3 → (C)
Answer
~3
Spot-check each commuting pair on a concrete point. Take (x,y) = (3, 5). Pair {1,3}: T₃ ° T₁ gives (5, -5) and T₁ ° T₃ gives (5, -5) — match. Pair {2,4}: T₄ ° T₂ gives (-10, 6) and T₂ ° T₄ gives (-10, 6) — match. Pair {3,4}: T₄ ° T₃ gives (6, -10) and T₃ ° T₄ gives (6, -10) — match. Spot-check a non-commuting pair, say {1,2}: T₂ ° T₁ gives (-5, 5) but T₁ ° T₂ gives (-3, 3) — clearly different. Numbers line up with the algebraic count of 3.
💡Key takeaway

When a problem asks how many out of a small collection satisfy a rule, list every case and decide each one — and once each geometric move is written as a coordinate formula, deciding "do they commute" is just checking whether two short expressions match.