The Candy-Passing Game for c\geq3n-2
PM Kominers - arXiv preprint arXiv:0709.2156, 2007 - arxiv.org
PM Kominers
arXiv preprint arXiv:0709.2156, 2007•arxiv.orgarXiv:0709.2156v3 [math.CO] 25 Nov 2007 The Candy-Passing Game for c ≥ 3n − 2 Page 1
arXiv:0709.2156v3 [math.CO] 25 Nov 2007 The Candy-Passing Game for c ≥ 3n − 2 Paul M.
Kominers∗ November 21, 2018 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.
The candy-passing game, as introduced by Tanton [1], is played according to the following …
arXiv:0709.2156v3 [math.CO] 25 Nov 2007 The Candy-Passing Game for c ≥ 3n − 2 Paul M.
Kominers∗ November 21, 2018 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.
The candy-passing game, as introduced by Tanton [1], is played according to the following …
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.
arxiv.org