2016 AMC 10A Problem 18
Problem 18 of 25IntermediateGeometry
Each vertex of a cube is to be labeled with an integer through with each integer being used once, in such a way that the sum of the four numbers on the vertices of a face is the same for each face. Arrangements that can be obtained from each other through rotations of the cube are considered to be the same. How many different arrangements are possible?
Answer choices
Show solution
Solution
Opposite faces together use all eight labels, whose sum is , so every face must have sum .
Put label at one vertex, and let the three adjacent labels be . The three vertices adjacent to those across faces are then forced to be and the opposite vertex is .
Assume the three neighbor labels are listed in increasing order. Substituting triples from into the four forced expressions above gives exactly For each neighbor set, the six orders around the vertex fall into two groups of three under the rotations about the diagonal through that vertex. Thus each set gives two non-rotationally equivalent arrangements, for arrangements in all.
Thus, the correct answer is C.