Year: 2007
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Kominers, Paul M.
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1589333776