# Cookie Monster Devours Naccis

- Published in 2013
- Added on

In the collections

In 2002, Cookie Monster appeared in The Inquisitive Problem Solver. The hungry monster wants to empty a set of jars filled with various numbers of cookies. On each of his moves, he may choose any subset of jars and take the same number of cookies from each of those jars. The Cookie Monster number is the minimum number of moves Cookie Monster must use to empty all of the jars. This number depends on the initial distribution of cookies in the jars. We discuss bounds of the Cookie Monster number and explicitly find the Cookie Monster number for Fibonacci, Tribonacci and other nacci sequences.

## Links

## Other information

- pages
- 8

### BibTeX entry

@article{Braswell2013a, abstract = {In 2002, Cookie Monster appeared in The Inquisitive Problem Solver. The hungry monster wants to empty a set of jars filled with various numbers of cookies. On each of his moves, he may choose any subset of jars and take the same number of cookies from each of those jars. The Cookie Monster number is the minimum number of moves Cookie Monster must use to empty all of the jars. This number depends on the initial distribution of cookies in the jars. We discuss bounds of the Cookie Monster number and explicitly find the Cookie Monster number for Fibonacci, Tribonacci and other nacci sequences.}, author = {Braswell, Leigh Marie and Khovanova, Tanya}, month = {may}, pages = 8, title = {Cookie Monster Devours Naccis}, url = {http://arxiv.org/abs/1305.4305 http://arxiv.org/pdf/1305.4305v1}, year = 2013, archivePrefix = {arXiv}, eprint = {1305.4305}, primaryClass = {math.HO}, urldate = {2013-10-09}, collections = {Attention-grabbing titles,Puzzles,Animals} }