Cookie Monster devours naccis

DOI10.4169/COLLEGE.MATH.J.45.2.129MaRDI QIDQ3195398zbMATH OpenOpenAlexWikidataFDO

Authors Leigh Marie Braswell, Tanya Khovanova

Publication date 19 October 2015

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.4305

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Number theory (educational aspects) (97F60)

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.

Recommendations

• Cookie Monster plays games
• On the cookie game
• scientific article; zbMATH DE number 3943024
• Chocolate Numbers
• Moving into the Desert with Fibonacci

Cited in

(2)

• scientific article; zbMATH DE number 3943024 (Why is no real title available?)
• Cookie Monster plays games

This page was built for publication: Cookie Monster devours naccis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195398)