The Candy-Passing Game for c\geq3n-2
From MaRDI portal
Publication:6206787
arXiv0709.2156MaRDI QIDQ6206787FDOQ6206787
Authors: Paul Myer Kominers 
Publication date: 13 September 2007
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.
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Dynamical aspects of cellular automata (37B15)
This page was built for publication: The Candy-Passing Game for c\geq3n-2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206787)
