Maths Olympiad Prep

Library / /361 of 520

Combinatorics Difficulty 3.4 AMC 10/12 Find the answer

Let TT be the triangle in the coordinate plane with vertices (0,0),(4,0),(0,0), (4,0), and (0,3).(0,3). Consider the following five isometries (rigid transformations) of the plane: rotations of 90,180,90^{\circ}, 180^{\circ}, and 270270^{\circ} counterclockwise around the origin, reflection across the xx-axis, and reflection across the yy-axis. How many of the 125125 sequences of three of these transformations (not necessarily distinct) will return TT to its original position? (For example, a 180180^{\circ} rotation, followed by a reflection across the xx-axis, followed by a reflection across the yy-axis will return TT to its original position, but a 9090^{\circ} rotation, followed by a reflection across the xx-axis, followed by another reflection across the xx-axis will not return TT to its original position.)

Pick one

Solution

Figure (Asymptote source)
size(10cm); Label f;  f.p=fontsize(6);  xaxis(-6,6,Ticks(f, 2.0));  yaxis(-6,6,Ticks(f, 2.0));  filldraw(origin--(4,0)--(0,3)--cycle, gray, black+linewidth(1));

First, any combination of motions we can make must reflect TT an even number of times. This is because every time we reflect TT, it changes orientation. Once TT has been flipped once, no combination of rotations will put it back in place because it is the mirror image; however, flipping it again changes it back to the original orientation. Since we are only allowed 33 transformations and an even number of them must be reflections, we either reflect TT 00 times or 22 times.

Case 1: 00 reflections on TT.

In this case, we must use 33 rotations to return TT to its original position. Notice that our set of rotations, {90,180,270}\{90^\circ,180^\circ,270^\circ\}, contains every multiple of 9090^\circ except for 00^\circ. We can start with any two rotations a,ba,b in {90,180,270}\{90^\circ,180^\circ,270^\circ\} and there must be exactly one cab(mod360)c \equiv -a - b \pmod{360^\circ} such that we can use the three rotations (a,b,c)(a,b,c) which ensures that a+b+c0(mod360)a + b + c \equiv 0^\circ \pmod{360^\circ}. That way, the composition of rotations a,b,ca,b,c yields a full rotation. For example, if a=b=90a = b = 90^\circ, then c9090=180(mod360)c \equiv -90^\circ - 90^\circ = -180^\circ \pmod{360^\circ}, so c=180c = 180^\circ and the rotations (90,90,180)(90^\circ,90^\circ,180^\circ) yields a full rotation.
The only case in which this fails is when cc would have to equal 00^\circ. This happens when (a,b)(a,b) is already a full rotation, namely, (a,b)=(90,270),(180,180),(a,b) = (90^\circ,270^\circ),(180^\circ,180^\circ), or (270,90)(270^\circ,90^\circ). However, we can simply subtract these three cases from the total. Selecting (a,b)(a,b) from {90,180,270}\{90^\circ,180^\circ,270^\circ\} yields 33=93 \cdot 3 = 9 choices, and with 33 that fail, we are left with 66 combinations for case 11.

Case 2: 22 reflections on TT.

In this case, we first eliminate the possibility of having two of the same reflection. Since two reflections across the x-axis maps TT back to itself, inserting a rotation before, between, or after these two reflections would change TT's final location, meaning that any combination involving two reflections across the x-axis would not map TT back to itself. The same applies to two reflections across the y-axis.
Therefore, we must use one reflection about the x-axis, one reflection about the y-axis, and one rotation. Since a reflection about the x-axis changes the sign of the y component, a reflection about the y-axis changes the sign of the x component, and a 180180^\circ rotation changes both signs, these three transformation composed (in any order) will suffice. It is therefore only a question of arranging the three, giving us 3!=63! = 6 combinations for case 2.
Combining both cases we get 6+6=(A)126+6=\boxed{\textbf{(A)} 12}.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.