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

关于饼干怪兽问题

On the Cookie Monster Problem

Leigh Marie Braswell, Tanya Khovanova

摘要:

饼干怪物问题假设饼干怪物想清空一组装满不同数量饼干的罐子。在他的每一步棋中,他可以选择任何罐子的子集,并从每个罐子中拿走相同数量的饼干。一组饼干怪物的数量是饼干怪物必须使用的最小移动次数来清空所有罐子。这个数字取决于罐子里饼干的初始分布。我们讨论的饼干怪物数的界限,并明确找到饼干怪物数的罐子含有饼干的斐波那契,Tribonacci,n-nacci,和超级n-nacci序列。我们还构造了k个罐子的序列,使得它们的Cookie Monster数渐近为rk,其中r是0和1之间的任何实数。

英文摘要:

The Cookie Monster Problem supposes that the Cookie 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 of a set is the minimum number of moves the 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 jars containing cookies in the Fibonacci, Tribonacci, n-nacci, and Super-n-nacci sequences. We also construct sequences of k jars such that their Cookie Monster numbers are asymptotically rk, where r is any real number between 0 and 1 inclusive.

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

↑