2006 numbers around a circle
Source: Swiss Imo Selection 2006
May 25, 2006
combinatorics proposedcombinatorics
Problem Statement
We place randomly the numbers around a circle. A move consists of changing two neighbouring numbers. After a limited numbers of moves all the numbers are diametrically opposite to their starting position. Show that we changed at least once two numbers which had the sum .