MathDB
Maximum value of the number of Turn

Source: 2008 Japan Mathematical Olympiad Finals Problem 2

May 24, 2008
combinatorics proposedcombinatorics

Problem Statement

There are 2008 red cards and 2008 white cards. 2008 players sit down in circular toward the inside of the circle in situation that 2 red cards and 2 white cards from each card are delivered to each person. Each person conducts the following procedure in one turn as follows. (āˆ—) (*) If you have more than one red card, then you will pass one red card to the left-neighbouring player. If you have no red card, then you will pass one white card to the left -neighbouring player. Find the maximum value of the number of turn required for the state such that all person will have one red card and one white card first.