Cards - Iran NMO 2009 - Problem 6
Source:
September 20, 2010
topologygeometrycircumcirclecalculusintegrationinvariantcombinatorics proposed
Problem Statement
people are sitting around a circle table, orderly (means that the distance between two adjacent persons is equal to others) and cards with numbers to are given to them. Some may have no card and some may have more than card. In each round, one [and only one] can give one of his cards with number to his adjacent person if after and before the round, the locations of the cards with numbers don’t make an acute-angled triangle.
(Card with number means the card with number and card with number means the card with number !)
Suppose that the cards are given to the persons regularly clockwise. (Mean that the number of the cards in the clockwise direction is increasing.)
Prove that the cards can’t be gathered at one person.