The Candy-Passing Game for c\geq3n-2
Combinatorics
2008-05-04 v3
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.
Keywords
Cite
@article{arxiv.0709.2156,
title = {The Candy-Passing Game for c\geq3n-2},
author = {Paul M. Kominers},
journal= {arXiv preprint arXiv:0709.2156},
year = {2008}
}
Comments
3 pages; edited in response to referee's comments