Maths Olympiad Prep

Library / /29 of 86

Algebra Difficulty 6.3 National Olympiad Prove it United States

Problem:

Consider the 8×8×88 \times 8 \times 8 Rubik's cube below. Each face is painted with a different color, and it is possible to turn any layer, as you can with smaller Rubik's cubes. Let XX denote the move that turns the shaded layer shown (indicated by arrows going from the top to the right of the cube) clockwise by 9090 degrees, about the axis labeled XX. When move XX is performed, the only layer that moves is the shaded layer. Likewise, define move YY to be a clockwise 9090-degree turn about the axis labeled YY, of just the shaded layer shown (indicated by the arrows going from the front to the top, where the front is the side pierced by the XX rotation axis). Let MM denote the move "perform XX, then perform YY."

Figure 1

Imagine that the cube starts out in "solved" form (so each face has just one color), and we start doing move MM repeatedly. What is the least number of repeats of MM in order for the cube to be restored to its original colors?

Solution

Solution:

There are two "bands" of individual unit cubes (called cubies) that are moved by MM. Of those, only the cubies exactly three units from an edge of the cube, such as the cubie originally at the intersection of the shaded bands, can ever move out of a single plane of rotation. All the other cubes either remain fixed or return to their original position every four repetitions of MM as they travel once around the cube with four 9090 degree turns.

Each of these cubies that move in both the planes of rotation will return to its original position every seven repetitions of MM. It must be moved by a total of four 9090 degree turns around each of XX and YY to return to its starting point; to do so, it moves once with both XX and YY, three times with XX, and three times with YY, in some order depending on the cubie's initial position. For example, the cubie that is initially at the top intersection of the two shaded bands will move first to the right face (where the YY arrow emerges) and then to the bottom and then the left. On the fourth move MM it will be affected by first XX and then YY, ending up on the back. Then it is affected only by YY for three moves, shifting to the bottom, front, and finally returning to its original location on top after seven moves.

Thus, for all the cubies to return to their starting points, the number of moves MM must be a multiple of both 44 and 77, and therefore 2828 is the smallest possible number of repeats of MM in order for the cube to be restored.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.