The Candy-Passing Game for c\geq3n-2
| dc.creator | Kominers, Paul M. | |
| dc.date | 2007-09-13 | |
| dc.date | 2007-11-25 | |
| dc.date.accessioned | 2026-07-07T09:36:31Z | |
| dc.date.available | 2026-07-07T09:36:31Z | |
| dc.description | 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. | |
| dc.description | 3 pages; edited in response to referee's comments | |
| dc.identifier | https://arxiv.org/abs/0709.2156 | |
| dc.identifier | http://arxiv.org/abs/0709.2156 | |
| dc.identifier | Pi Mu Epsilon Journal, 12(8):459-460 (2008). | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160149 | |
| dc.subject | Combinatorics | |
| dc.subject | 37B15, 05C38 (Primary); 05C35 (Secondary) | |
| dc.title | The Candy-Passing Game for c\geq3n-2 | |
| dc.type | text |