AMC 10 Step by Step

2024 AMC 10A Problem 13

P11-15~4 minPrint

Two transformations are said to commute if applying the first followed by the second gives the same result as applying the second followed by the first. Consider these four transformations of the coordinate plane:

  • a translation 22 units to the right,
  • a 90∘90^{\circ} -rotation counterclockwise about the origin,
  • a reflection across the xx -axis, and
  • a dilation centered at the origin with scale factor 2.2.

Of the 66 pairs of distinct transformations from this list, how many commute?

Log in to save your progress.
Show solution without answering

Key insight

Write each move as a rule for where (x, y) goes, then do each pair in both orders. Only three pairs give the same point both ways.

Solution

"Commute" means the order does not matter. The surest way to check is to write each move as a rule saying where a point (x,y)(x, y) goes.

1. The four rules.
- Translation TT (2 units right): (x,y)→(x+2, y)(x, y) \to (x + 2,\ y).
- Rotation RR (90∘90^\circ counterclockwise): (x,y)→(−y, x)(x, y) \to (-y,\ x). For example (1,0)→(0,1)(1, 0) \to (0, 1).
- Reflection FF (across the xx-axis): (x,y)→(x, −y)(x, y) \to (x,\ -y).
- Dilation DD (scale by 22): (x,y)→(2x, 2y)(x, y) \to (2x,\ 2y).
2. Check each pair both ways. "First TT, then RR" means apply TT's rule, then apply RR's rule to the result.

pairfirst one, then the otherother ordersame?
TT, RRTT then RR: (−y, x+2)(-y,\ x + 2)RR then TT: (−y+2, x)(-y + 2,\ x)no
TT, FFTT then FF: (x+2, −y)(x + 2,\ -y)FF then TT: (x+2, −y)(x + 2,\ -y)yes
TT, DDTT then DD: (2x+4, 2y)(2x + 4,\ 2y)DD then TT: (2x+2, 2y)(2x + 2,\ 2y)no
RR, FFRR then FF: (−y, −x)(-y,\ -x)FF then RR: (y, x)(y,\ x)no
RR, DDRR then DD: (−2y, 2x)(-2y,\ 2x)DD then RR: (−2y, 2x)(-2y,\ 2x)yes
FF, DDFF then DD: (2x, −2y)(2x,\ -2y)DD then FF: (2x, −2y)(2x,\ -2y)yes
  1. Three of the six pairs commute: translation with reflection, rotation with dilation, and reflection with dilation.

The answer is (C) 3\boxed{\textbf{(C)}\ 3}.

Why this works

Writing a move as a rule for (x,y)(x, y) turns "does the order matter?" into a quick algebra check. Some reasons are worth remembering. Scaling from the origin just makes everything bigger, so it works with any rotation or reflection about the origin. Sliding right does not care about flipping up and down, so those two commute. But a slide gets turned by a rotation and stretched by a dilation, so it does not commute with those.

Alternative approach

To show two moves do not commute, one point is enough. Take (1,0)(1, 0):

  • TT then RR: (3,0)→(0,3)(3, 0) \to (0, 3); RR then TT: (0,1)→(2,1)(0, 1) \to (2, 1). Different.
  • TT then DD: (3,0)→(6,0)(3, 0) \to (6, 0); DD then TT: (2,0)→(4,0)(2, 0) \to (4, 0). Different.
  • RR then FF: (0,1)→(0,−1)(0, 1) \to (0, -1); FF then RR: (1,0)→(0,1)(1, 0) \to (0, 1). Different.

The other three pairs agree on every point (see the table above), so the count is 33.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Write the four maps as formulas:
T(x,y)=(x+2, y),R(x,y)=(−y, x),F(x,y)=(x, −y),D(x,y)=(2x, 2y).T(x,y) = (x+2,\, y),\quad R(x,y) = (-y,\, x),\quad F(x,y) = (x,\, -y),\quad D(x,y) = (2x,\, 2y).
Now compose each pair both ways.

  • T,RT, R: R(T(x,y))=(−y, x+2)R(T(x,y)) = (-y,\, x+2) but T(R(x,y))=(−y+2, x)T(R(x,y)) = (-y+2,\, x). Fail.
  • T,FT, F: F(T(x,y))=(x+2, −y)=T(F(x,y))F(T(x,y)) = (x+2,\, -y) = T(F(x,y)). Commute.
  • T,DT, D: D(T(x,y))=(2x+4, 2y)D(T(x,y)) = (2x+4,\, 2y) but T(D(x,y))=(2x+2, 2y)T(D(x,y)) = (2x+2,\, 2y). Fail.
  • R,FR, F: F(R(x,y))=(−y, −x)F(R(x,y)) = (-y,\, -x) but R(F(x,y))=(y, x)R(F(x,y)) = (y,\, x). Fail.
  • R,DR, D: D(R(x,y))=(−2y, 2x)=R(D(x,y))D(R(x,y)) = (-2y,\, 2x) = R(D(x,y)). Commute.
  • F,DF, D: D(F(x,y))=(2x, −2y)=F(D(x,y))D(F(x,y)) = (2x,\, -2y) = F(D(x,y)). Commute.

Exactly three pairs commute.

The answer is (C) 3\boxed{\textbf{(C)}\ 3}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.