olymmath

AMC 12 2020b Problem 19

  • Paper

Square ABCDABCD in the coordinate plane has vertices at the points A(1,1),B(−1,1),C(−1,−1),A(1,1), B(-1,1), C(-1,-1), and D(1,−1).D(1,-1). Consider the following four transformations:

∙\bullet L,L, a rotation of 90∘90^{\circ} counterclockwise around the origin;

∙\bullet R,R, a rotation of 90∘90^{\circ} clockwise around the origin;

∙\bullet H,H, a reflection across the xx-axis; and

∙\bullet V,V, a reflection across the yy-axis.

Each of these transformations maps the squares onto itself, but the positions of the labeled vertices will change. For example, applying RR and then VV would send the vertex AA at (1,1)(1,1) to (−1,−1)(-1,-1) and would send the vertex BB at (−1,1)(-1,1) to itself. How many sequences of 2020 transformations chosen from {L,R,H,V}\{L, R, H, V\} will send all of the labeled vertices back to their original positions? (For example, R,R,V,HR, R, V, H is one sequence of 44 transformations that will send the vertices back to their original positions.)

\textbf{(A)}\ 2^{37} \textbf{(B)}\ 3\cdot 2^{36} \textbf{(C)}\ 2^{38} \textbf{(D)}\ 3\cdot 2^{37} \textbf{(E)}\ 2^{39}

Dataset text AMC 12 2000 to 2025. Quoted with source.

Show the answer

C

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc12/2020b/p19 · Tag S7QN61MHA7 · Edit this page on GitHub · Keys: j next, k previous