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?
