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

一个新的硬币称重问题--假币计数

Counting Counterfeit Coins: A New Coin Weighing Problem

Nicholas Diaco

摘要:

2007年,在第六届国际柯尔莫哥洛夫数学锦标赛上引入了一种新的使用天平识别假币的著名问题。本文提供了一个全面的概述,这个新的问题,提出了它在传统的硬币称重难题的背景下,然后解释是什么使新的问题在数学上是独一无二的。前面描述的两个加权策略用于导出给定参数的最优容许情况数的下界。另外,描述了一种新的加权过程,其可以适于通过将假币的数量表示为正整数的线性组合来提供针对宽范围的初始参数的解决方案。最后,我们提供了一种新的形式的传统的假币问题,并提供了一个下界的重量必须解决它。

英文摘要:

In 2007, a new variety of the well-known problem of identifying a counterfeit coin using a balance scale was introduced in the sixth International Kolmogorov Math Tournament. This paper offers a comprehensive overview of this new problem by presenting it in the context of the traditional coin weighing puzzle and then explaining what makes the new problem mathematically unique. Two weighing strategies described previously are used to derive lower bounds for the optimal number of admissible situations for given parameters. Additionally, a new weighing procedure is described that can be adapted to provide a solution for a broad spectrum of initial parameters by representing the number of counterfeit coins as a linear combination of positive integers. In closing, we offer a new form of the traditional counterfeit coin problem and provide a lower bound for the number of weighings necessary to solve it.

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

↑