arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.4135math.CO
收藏

男爵Munchhausen赎回自己:硬币称重难题的界限

Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle

Tanya Khovanova, Joel Brewster Lewis

摘要:

我们研究了1991年莫斯科数学奥林匹克竞赛中出现的一个硬币称重难题。我们通过改变参与硬币的数量来推广这个谜题,并推导出一个明显优于平凡上界的谜题所需加权数量的上界。特别是,我们表明,在平衡上的许多重量就足够了。

英文摘要:

We investigate a coin-weighing puzzle that appeared in the Moscow Math Olympiad in 1991. We generalize the puzzle by varying the number of participating coins, and deduce an upper bound on the number of weighings needed to solve the puzzle that is noticeably better than the trivial upper bound. In particular, we show that logarithmically-many weighings on a balance suffice.

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

↑