On the board are written n natural numbers, n∈N. In one move it is possible to choose two
equal written numbers and increase one by 1 and decrease the other by 1. Prove that in this
the game cannot be played more than 6n3 moves. combinatoricsSerbian competitiongameCombinatorics processes