Maths Olympiad Prep

Library / /25 of 26

Geometry Difficulty 5.9 AIME, harder Find the answer United States

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 2 units to the right,
* a 9090^\circ-rotation counterclockwise about the origin,
* a reflection across the xx-axis, and
* a dilation centered at the origin with scale factor 22.
Of the 66 pairs of distinct transformations from this list, how many commute?

Pick one

Solution

Denote the transformations by TT, RR, FF, and DD in the order given in the problem statement. Then the images of point (x,y)(x, y) are T(x,y)=(x+2,y)T(x, y) = (x + 2, y), R(x,y)=(y,x)R(x, y) = (-y, x), F(x,y)=(x,y)F(x, y) = (x, -y), and D(x,y)=(2x,2y)D(x, y) = (2x, 2y). The results of applying a pair of transformations in either order are as follows:
* T(R(x,y))=T(y,x)=(y+2,x)T(R(x, y)) = T(-y, x) = (-y + 2, x) and R(T(x,y))=R(x+2,y)=(y,x+2)R(T(x, y)) = R(x + 2, y) = (-y, x + 2). The results are different, so TT and RR do not commute.
* T(F(x,y))=T(x,y)=(x+2,y)T(F(x, y)) = T(x, -y) = (x + 2, -y) and F(T(x,y))=F(x+2,y)=(x+2,y)F(T(x, y)) = F(x + 2, y) = (x + 2, -y). The results are the same, so TT and FF do commute.

* T(D(x,y))=T(2x,2y)=(2x+2,2y)T(D(x, y)) = T(2x, 2y) = (2x+2, 2y) and D(T(x,y))=D(x+2,y)=(2x+4,2y)D(T(x, y)) = D(x+2, y) = (2x+4, 2y). The results are different, so TT and DD do not commute.
* R(F(x,y))=R(x,y)=(y,x)R(F(x, y)) = R(x, -y) = (y, x) and F(R(x,y))=F(y,x)=(y,x)F(R(x, y)) = F(-y, x) = (-y, -x). The results are different, so RR and FF do not commute.
* R(D(x,y))=R(2x,2y)=(2y,2x)R(D(x, y)) = R(2x, 2y) = (-2y, 2x) and D(R(x,y))=D(y,x)=(2y,2x)D(R(x, y)) = D(-y, x) = (-2y, 2x). The results are the same, so RR and DD do commute.
* D(F(x,y))=D(x,y)=(2x,2y)D(F(x, y)) = D(x, -y) = (2x, -2y) and F(D(x,y))=F(2x,2y)=(2x,2y)F(D(x, y)) = F(2x, 2y) = (2x, -2y). The results are the same, so DD and FF do commute.
Thus 33 of the 66 pairs commute.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.