|
|
| (3 intermediate revisions by 2 users not shown) |
| Line 1: |
Line 1: |
| − | Square <math>ABCD</math> in the coordinate plane has vertices at the points <math>A(1,1), B(-1,1), C(-1,-1),</math> and <math>D(1,-1).</math> Consider the following four transformations: <math>L,</math> a rotation of <math>90^{\circ}</math> counterclockwise around the origin; <math>R,</math> a rotation of <math>90^{\circ}</math> clockwise around the origin; <math>H,</math> a reflection across the <math>x</math>-axis; and <math>V,</math> a reflection across the <math>y</math>-axis.
| + | #REDIRECT [[2020 AMC 10B Problems/Problem 23]] |
| − | | |
| − | Each of these transformations maps the squares onto itself, but the positions of the labeled vertices will change. For example, applying <math>R</math> and then <math>V</math> would send the vertex <math>A</math> at <math>(1,1)</math> to <math>(-1,-1)</math> and would send the vertex <math>B</math> at <math>(-1,1)</math> to itself. How many sequences of <math>20</math> transformations chosen from <math>\{L, R, H, V\}</math> will send all of the labeled vertices back to their original positions? (For example, <math>R, R, V, H</math> is one sequence of <math>4</math> transformations that will send the vertices back to their original positions.)
| |
| − | | |
| − | <math>\textbf{(A)}\ 2^{37} \qquad\textbf{(B)}\ 3\cdot 2^{36} \qquad\textbf{(C)}\ 2^{38} \qquad\textbf{(D)}\ 3\cdot 2^{37} \qquad\textbf{(E)}\ 2^{39}</math>
| |
| − | | |
| − | ==Solution==
| |
| − | | |
| − | Hopefully, someone will think of a better one, but here is an indirect answer, use only if you are really desperate.
| |
| − | <math>20</math> moves can be made, and each move have <math>4</math> choices, so a total of <math>4^{20}=2^{40}</math> moves. First, after the <math>20</math> moves, Point A can only be in first quadrant <math>(1,1)</math> or third quadrant <math>(-1,-1)</math>. Only the one in the first quadrant works, so divide by <math>2</math>. Now, C must be in the opposite quadrant as A. B can be either in the second (<math>(-1, 1)</math>) or fourth quadrant (<math>(1, -1)</math>) , but we want it to be in the second quadrant, so divide by <math>2</math> again. Now as A and B satisfy the conditions, C and D will also be at their original spot. <math>\frac{2^{40}}{2\cdot2}=2^{38}</math>. The answer is <math>\boxed{C}</math>
| |
| − | ~Kinglogic
| |
| − | | |
| − | ==Solution 2==
| |
| − | | |
| − | The total number of sequence is <math>4^{20}=2^{40}</math>.
| |
| − | | |
| − | Note that there can only be even number of reflections since they result in the same anti-clockwise orientation of the verices <math>A,B,C,D</math>. Therefore, the probability of having the same anti-clockwise orientation with the original arrangement after the transformation is <math>\frac{1}{2}</math>.
| |
| − | | |
| − | Next, even number of reflections mean that there must be even number of rotations since their sum is even. Even rotations result only in the original position or <math>180^{\circ}</math> rotation of it.
| |
| − | | |
| − | Since rotation <math>R</math> and rotation <math>L</math> cancels each other out, the difference between the numbers of them define the final position. The probability of the transformation returning the vertices to the orginal position given that there are even number of rotations is equal to the probability that
| |
| − | | |
| − | <center><math>|n(R)-n(L)|\equiv0\pmod{4}</math> when <math>|n(H)-n(V)|\equiv0\pmod{4}</math></center>
| |
| − | or
| |
| − | <center><math>|n(R)-n(L)|\equiv2\pmod{4}</math> when <math>|n(H)-n(V)|\equiv2\pmod{4}</math></center>
| |
| − | | |
| − | which is again, <math>\frac{1}{2}</math>.
| |
| − | | |
| − | Therefore, <math>2^{40}\cdot\frac{1}{2}\cdot\frac{1}{2}=\boxed{\mathbf(C) 2^{38}}</math>
| |
| − | ~joshuamh111
| |
| − | | |
| − | {{AMC12 box|year=2020|ab=B|num-b=18|num-a=20}}
| |
| − | {{MAA Notice}}
| |
