Of the vertices of a cube, 7 of them have assigned the value 0, and the eighth the value 1. A move is selecting an edge and increasing the numbers at its ends by an integer value k>0. Prove that after any finite number of moves, the g.c.d. of the 8 numbers at vertices is equal to 1.Russian M.O. geometrycombinatoricscombinatorial geometrygreatest common divisornumber theory