arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.4305math.HO
收藏

饼干怪物吞噬纳奇斯

Cookie Monster Devours Naccis

Leigh Marie Braswell, Tanya Khovanova

摘要:

2002年,饼干怪物出现在《好奇的问题解决者》中。饥饿的怪物想清空一组装满不同数量饼干的罐子。在他的每一步棋中,他可以选择任何罐子的子集,并从每个罐子中拿走相同数量的饼干。饼干怪物数字是饼干怪物必须使用的最低移动次数,以清空所有的罐子。这个数字取决于罐子里饼干的初始分布。讨论了Cookie Monster数的界,并明确地找到了Fibonacci、Tribonacci和其他nacci序列的Cookie Monster数。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑