Let be the triangle in the coordinate plane with vertices and Consider the following five isometries (rigid transformations) of the plane: rotations of and counterclockwise around the origin, reflection across the -axis, and reflection across the -axis. How many of the sequences of three of these transformations (not necessarily distinct) will return to its original position? (For example, a rotation, followed by a reflection across the -axis, followed by a reflection across the -axis will return to its original position, but a rotation, followed by a reflection across the -axis, followed by another reflection across the -axis will not return to its original position.)
- A)
- B)
- C)
- D)
- E)
Answer
A
Key insight
T has no symmetry, so every point must return home. A reflection makes a mirror image, so there must be 0 or 2 reflections. Each case gives 6.
Solution
The legs of have different lengths ( along the -axis, along the -axis), so no rotation or reflection can move onto itself except by putting every point back where it was. So we need the three moves together to do nothing at all.
It helps to know what each move does to a point :
| move | goes to |
|---|---|
| turn | |
| turn | |
| turn | |
| flip over -axis | |
| flip over -axis |
1. Count the flips. A flip turns the triangle into its mirror image, and a turn does not. Two flips undo the mirror effect; one or three leave a mirror image, which can never be the original. So the sequence has or flips.
2. No flips: three turns. The angles must add to a full number of turns ( or ; three turns add to at most , so is out of reach).
- Total : , in orders.
- Total : , in orders.
That is sequences.
3. Two flips and one turn. Use the table to see how flips combine.
- The same flip twice in a row undoes itself, leaving just a turn of , or . That never works.
- The same flip with a turn between, like -flip, turn, -flip, is the turn seen in a mirror: a turn the other way by the same angle. That never works either.
- Two different flips in a row: . That is the same as a turn (in either order). So with the turn first or last, the turn must also be . Sequences: turn , -flip, -flip; turn , -flip, -flip; -flip, -flip, turn ; -flip, -flip, turn . That is .
- Two different flips with the turn between. Track through -flip, turn, -flip. With : . Back home. With : , which is a turn, not home. With you get a turn. So only works, and the flips can come in either order: sequences.
That is sequences.
4. Total: .
The answer is .
Why this works
Thinking about mirror images removes most sequences at once: you need an even number of flips. After that, a few facts do the rest: two different axis flips equal a turn, and a turn viewed through a mirror goes the other way. Tracking a single point through the moves is a reliable way to check any of these facts.
The trap
Allowing one or three reflections, or forgetting that a turn done between two different mirror flips must be exactly 180 degrees.
Concise solution
The triangle has no symmetries, so it returns to its position only if the net transformation is the identity. Write for the rotations and , for the reflections.
Reflections reverse orientation and rotations preserve it, so an identity composite needs an even number of reflections: or .
No reflections. Three rotation angles from must sum to a multiple of . Sum : in orders. Sum : in orders. Sum is impossible. That is sequences.
Two reflections and one rotation. Key facts: , , and commutes with everything, while for any reflection .
- Same reflection twice: if adjacent, they cancel and a lone rotation remains; if the rotation sits between them, the result is . Never the identity.
- Different reflections, rotation first or last: the reflections combine to , so the rotation must be . Sequences: , , , : .
- Different reflections with the rotation between: , identity only for . Sequences and : .
That is more. Total .
The answer is .
Review in the AoPS books
- Introduction to Geometry, Chapter 16: The More Things Change. . . (§16.1, §16.2, §16.3, §16.4)
- Introduction to Counting & Probability, Chapter 1: Counting Is Arithmetic
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.2)
- Prealgebra, Chapter 14: Counting (§14.3)
Techniques
Split into exhaustive cases and handle each · Use an invariant, parity, or coloring argument