Let be the transformation of the coordinate plane that first rotates the plane degrees counterclockwise around the origin and then reflects the plane across the -axis. What is the least positive integer such that performing the sequence of transformations returns the point back to itself?
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
Track the angle theta of the point: T_k sends theta to 180 - theta - k, so each consecutive pair T_{2j-1}, T_{2j} nets -1 degree; check odd n too.
Solution
Every transformation preserves distance from the origin, so track the point by its angle measured from the positive -axis; the starting point has .
A rotation by degrees sends . Reflecting across the -axis sends to , which is the point at angle . Therefore
Apply two consecutive transformations then :
So each pair of steps is simply a rotation by degree.
Even : the angle is , which is a multiple of first when , i.e. .
Odd : after steps the angle is ; then gives . This is when , i.e. (and no smaller odd works, since is between and for ).
The least is . The answer is .
Why this works
Rotations and reflections of the unit circle act on a single number, the angle, by and . Writing each as such a formula turns a geometric composition into arithmetic, and pairing steps reveals the hidden slow rotation. Always test both parities when the composition alternates between orientation-reversing and orientation-preserving maps.
The trap
Checking only even n (which first works at n = 720) and missing that an odd number of transformations, ending on a reflection, already returns the point at n = 359.
Common mistakes
- Checking only even n (which first works at n = 720) and missing that an odd number of transformations, ending on a reflection, already returns the point at n = 359.
- Using the wrong reflection formula ( is the reflection across the -axis), which changes the net effect of each pair of steps.
Techniques
Compute small cases, spot the pattern, generalize · Exploit symmetry to reduce work or pair up objects