Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2020 AMC 10A Problems/Problem 23"

(→‎Solution)
(→‎Solution)
Line 8: Line 8:
 
First, any combination of motions we can make must reflect <math>T</math> an even number of times. This is because every time we reflect <math>T</math>, it changes orientation. Once <math>T</math> 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 <math>3</math> transformations and an even number of them must be reflections, we either reflect <math>T</math> <math>0</math> times or <math>2</math> times.
 
First, any combination of motions we can make must reflect <math>T</math> an even number of times. This is because every time we reflect <math>T</math>, it changes orientation. Once <math>T</math> 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 <math>3</math> transformations and an even number of them must be reflections, we either reflect <math>T</math> <math>0</math> times or <math>2</math> times.
  
−
[b]Case 1: 0 reflections on T[/b]
+
Case 1: 0 reflections on T
  
−
In this case, we must use <math>3</math> rotations to return <math>T</math> to its original position. Notice that our set of rotations, <math>\{90^\circ,180^\circ,270^\circ\}</math>, contains every multiple of <math>90^\circ</math> except for <math>0^\circ</math>. We can start with any two rotations <math>a,b</math> in <math>\{90^\circ,180^\circ,270^\circ\}</math> and there must be exactly one <math>c \congruent -a - b \pmod{360^\circ}</math> such that we can use the three rotations <math>(a,b,c)</math> which
+
In this case, we must use <math>3</math> rotations to return <math>T</math> to its original position. Notice that our set of rotations, <math>\{90^\circ,180^\circ,270^\circ\}</math>, contains every multiple of <math>90^\circ</math> except for <math>0^\circ</math>. We can start with any two rotations <math>a,b</math> in <math>\{90^\circ,180^\circ,270^\circ\}</math> and there must be exactly one <math>c \equiv -a - b \pmod{360^\circ}</math> such that we can use the three rotations <math>(a,b,c)</math> which ensures that <math>a + b + c \equiv 0^\circ \pmod{360^\circ}</math>. That way, the composition of rotations <math>a,b,c</math> yields a full rotation. For example, if <math>a = b = 90^\circ</math>, then <math>c \equiv -90^\circ - 90^\circ = -180^\circ \pmod{360^\circ}</math>, so <math>c = 180^\circ</math> and the rotations <math>(90^\circ,90^\circ,180^\circ)</math> yields a full rotation.
 +
 
 +
The only case in which this fails is when <math>c</math> would have to equal <math>0^\circ</math>. This happens when <math>(a,b)</math> is already a full rotation, namely, <math>(a,b) = (90^\circ,270^\circ),(180^\circ,180^\circ),</math> or <math>(270^\circ,90^\circ)</math>. However, we can simply subtract these three cases from the total. Selecting <math>(a,b)</math> from <math>\{90^\circ,180^\circ,270^\circ\}</math> yeilds <math>3 \cdot 3 = 9</math> choices, and with <math>3</math> that fail, we are left with <math>6</math> combinations for case 1.
 +
 
 +
Case 2: 2 reflections on T
 +
 
 +
In this case, we first eliminate the possibility of having two of the same reflection. Since two reflections across the x-axis maps <math>T</math> back to itself, inserting a rotation before, between, or after these two reflections would change <math>T</math>'s final location, meaning that any combination involving two reflections across the x-axis would not map <math>T</math> 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 <math>180^\circ</math> 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 <math>3! = 6</math> combinations for case 2.
 +
 
 +
Combining both cases we get <math>6 + 6 = </math>
  
 
==See Also==
 
==See Also==

Revision as of 22:17, 31 January 2020

Problem

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

$\textbf{(A) } 12 \qquad \textbf{(B) } 15 \qquad \textbf{(C) } 17 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 25$

Solution

First, any combination of motions we can make must reflect $T$ an even number of times. This is because every time we reflect $T$, it changes orientation. Once $T$ 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 $3$ transformations and an even number of them must be reflections, we either reflect $T$ $0$ times or $2$ times.

Case 1: 0 reflections on T

In this case, we must use $3$ rotations to return $T$ to its original position. Notice that our set of rotations, $\{90^\circ,180^\circ,270^\circ\}$, contains every multiple of $90^\circ$ except for $0^\circ$. We can start with any two rotations $a,b$ in $\{90^\circ,180^\circ,270^\circ\}$ and there must be exactly one $c \equiv -a - b \pmod{360^\circ}$ such that we can use the three rotations $(a,b,c)$ which ensures that $a + b + c \equiv 0^\circ \pmod{360^\circ}$. That way, the composition of rotations $a,b,c$ yields a full rotation. For example, if $a = b = 90^\circ$, then $c \equiv -90^\circ - 90^\circ = -180^\circ \pmod{360^\circ}$, so $c = 180^\circ$ and the rotations $(90^\circ,90^\circ,180^\circ)$ yields a full rotation.

The only case in which this fails is when $c$ would have to equal $0^\circ$. This happens when $(a,b)$ is already a full rotation, namely, $(a,b) = (90^\circ,270^\circ),(180^\circ,180^\circ),$ or $(270^\circ,90^\circ)$. However, we can simply subtract these three cases from the total. Selecting $(a,b)$ from $\{90^\circ,180^\circ,270^\circ\}$ yeilds $3 \cdot 3 = 9$ choices, and with $3$ that fail, we are left with $6$ combinations for case 1.

Case 2: 2 reflections on T

In this case, we first eliminate the possibility of having two of the same reflection. Since two reflections across the x-axis maps $T$ back to itself, inserting a rotation before, between, or after these two reflections would change $T$'s final location, meaning that any combination involving two reflections across the x-axis would not map $T$ 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 $180^\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! = 6$ combinations for case 2.

Combining both cases we get $6 + 6 =$

See Also

2020 AMC 10A (Problems • Answer Key • Resources)
Preceded by
Problem 22 		Followed by
Problem 24
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2020_AMC_10A_Problems/Problem_23&oldid=116080"