2002 AIME I Problems/Problem 11
Problem
Let and be two faces of a cube with . A beam of light emanates from vertex and reflects off face at point , which is 7 units from and 5 units from . The beam continues to be reflected off the faces of the cube. The length of the light path from the time it leaves point until it next reaches a vertex of the cube is given by , where and are integers and is not divisible by the square of any prime. Find .
Solution 1(Easy one)
When a light beam reflects off a surface, the path is like that of a ball bouncing. Picture that, and also imagine X, Y, and Z coordinates for the cube vertices. The coordinates will all involve 0's and 12's only, so that means that the X, Y, and Z distance traveled by the light must all be divisible by 12. Since the light's Y changes by 5 and the X changes by 7 (the Z changes by 12, don't worry about that), and 5 and 7 are relatively prime to 12, the light must make 12 reflections onto the XY plane or the face parallel to the XY plane.
In each reflection, the distance traveled by the light is = . This happens 12 times, so the total distance is . and , so therefore, the answer is .
Solution 2(2D and photons)
We can use a similar trick as with reflections in 2D: Imagine that the entire space is divided into cubes identical to the one we have. Now let's follow two photons of light that start in at the same time: one of them will reflect as given in the problem statement, the second will simply fly straight through all cubes. It can easily be seen that at any moment in time the photons are in exactly the same position relative to the cubes they are inside at the moment. In other words, we can take the cube with the first photon, translate it and flip if necessary, to get the cube with the other photon.
It follows that both photons will hit a vertex at the same time, and at this moment they will have travelled the same distance.
Now, the path of the second photon is simply a half-line given by the vector . That is, the points visited by the photon are of the form for . We are looking for the smallest such that all three coordinates are integer multiples of (which is the length of the side of the cube).
Clearly must be an integer. As and are relatively prime, the smallest solution is . At this moment the second photon will be at the coordinates .
Then the distance it travelled is . And as the factorization of is , we have and , hence .
See also
2002 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 10 |
Followed by Problem 12 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.