The Candy-Passing Game for c\geq3n-2

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
3 pages; edited in response to referee's comments

Keywords

Combinatorics, 37B15, 05C38 (Primary); 05C35 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/160149

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0709.2156
 http://arxiv.org/abs/0709.2156
 Pi Mu Epsilon Journal, 12(8):459-460 (2008).

Collections

arXiv