The Candy-Passing Game for c\geq3n-2
arXiv:0709.2156
Abstract
We determine the behavior of Tanton's candy-passing game for all distributions of at least 3n-2 candies, where n is the number of students. Specifically, we show that the configuration of candy in such a game eventually becomes fixed.
3 pages; edited in response to referee's comments