Page 1 of 1

Partial Generalization of ISL '94 C5

Posted: Tue Jan 20, 2015 1:34 pm
by Nirjhor
Suppose $2n$ girls are seated around a circle $(n\in\mathbb N).$ One of the girls is given $2n$ coins initially. In a move, each girl with at least $2$ coins passes one coin to each of her two neighbors. The game terminates if, in a move, no girl is able to pass any coins. Prove that the game can't terminate.

Re: Partial Generalization of ISL '94 C5

Posted: Wed Jan 21, 2015 2:13 pm
by *Mahi*
Are you sure about it? ISL 1994 C5 says that the game must terminate with coins $ <2n$ and cannot terminate with exactly $2n$ coins.

Re: Partial Generalization of ISL '94 C5

Posted: Wed Jan 21, 2015 3:03 pm
by Nirjhor
That's why I said *partial*.

Re: Partial Generalization of ISL '94 C5

Posted: Wed Jan 21, 2015 6:30 pm
by *Mahi*
And what I said is that your statement directly contradicts the statement of the ISL problem.

Re: Partial Generalization of ISL '94 C5

Posted: Wed Jan 21, 2015 10:42 pm
by Nirjhor
Sorry, typo, fixed. :|

Re: Partial Generalization of ISL '94 C5

Posted: Sat Feb 28, 2015 8:00 pm
by Nirjhor
Hint
This is a number theory problem. ;)