Skip to main content
OlympiadHQ

Browse · MathNet

Print

Local Mathematical Competitions

Romania counting and probability

Problem

Of the vertices of a cube, 7 of them have assigned the value , and the eighth the value . A move is selecting an edge and increasing the numbers at its ends by an integer value . Prove that after any finite number of moves, the g.c.d. of the numbers at vertices is equal to .
Solution
Let us alternately colour the vertices in black and white. After any move, the difference between the sums of the numbers at the black and the white vertices remains , therefore the g.c.d. of the numbers is equal to (as it is dividing the difference of the sums mentioned above).

Techniques

Invariants / monovariantsColoring schemes, extremal argumentsGreatest common divisors (gcd)