MathDB
Operation on a 31-gon

Source: Argentina TST Iberoamerican 2009 Problem 1

August 25, 2009
combinatorics unsolvedcombinatorics

Problem Statement

In the vertexes of a regular 31 31-gon there are written the numbers from 1 1 to 31 31, ordered increasingly, clockwise oriented. We are allowed to perform an operation which consists in taking any three vertexes, namely the ones who have written a a,b b, and c c and change them into c c, a\minus{}\frac{1}{10} and b\plus{}\frac{1}{10} respectively ( a a becomes c c, b b becomes a\minus{}\frac{1}{10} and c c turns into b\plus{}\frac{1}{10} Prove that after applying several operations we can reach the state in which the numbers in the vertexes are the numbers from 1 1 to 31 31, ordered increasingly,anti-clockwise oriented.