Browse · MATH
Printjmc
number theory senior
Problem
Each face of a cube is assigned a different integer. Then each vertex is assigned the sum of the integer values on the faces that meet at the vertex. Finally, the vertex numbers are added. What is the largest number that must divide the final sum for every possible numbering of the faces?
Solution
Let the total sum be . The number on each face is added to four separate times, since each face borders on vertices. There are vertices, and each is the sum of face numbers since each vertex borders faces. Thus is the sum of face numbers. Since each face is added times, and there are faces, we know none of the faces are repeated or left out and each is added exactly times, so . Thus no matter what the sum of the numbers on the faces is, the total sum is always divisible by .
Final answer
4