MathDB
2013 China IMO Team Selection Test 3 Day 1 Q3

Source: 24 Mar 2013

April 1, 2013
combinatorics proposedcombinatorics

Problem Statement

101101 people, sitting at a round table in any order, had 1,2,...,1011,2,... , 101 cards, respectively. A transfer is someone give one card to one of the two people adjacent to him. Find the smallest positive integer kk such that there always can through no more than k k times transfer, each person hold cards of the same number, regardless of the sitting order.