Problem 2
Source: Macedonian National Olympiad 2013
April 6, 2013
inductioncombinatorics proposedcombinatorics
Problem Statement
coins are given to a couple of kids. Interchange of the coins occurs when some of the kids has at least half of all the coins. Then from the coins of one of those kids to the all other kids are given that much coins as the kid already had. In case when all the coins are at one kid there is no possibility for interchange. What is the greatest possible number of consecutive interchanges? ( is natural number)