摘要
设n个外观相同的硬币的集合X中含有两个坏硬币，这两个坏硬币的重量彼此不同，但都比好硬币重，而假定好硬币有相同的重量．以g2（n）表示用天平从X中找出两个坏硬币的最少测试次数．本文证明了对任意的n成立［log3（n2）］≤g2（n）≤［log3（n2）］＋1．且对无穷多个n，文中所给的测试过程是最优的．
Consider the problem of ascertaining the minimum number of weighings which suffice to determine two counterfeit coins in a set of n coins of the same apperance, where two counterfeit coins are heavier than good ones and are of different weight. Denote by g2(n) the least number of weighings by a balance to find two irregulars among n coins. We prove in this paper that timal for infinitely many n's.
出处
《应用数学》
CSCD
1998年第3期45-47,共3页
Mathematica Applicata
关键词
坏硬币问题
最优过程
最优化法
Counterfeit coin problem
Test
Information-theoretic bound
Optimal procedure
