摘要
We consider the problem of ascertaining the minimum unmber of weighings which suffice to determine three counterfeit coins in a set of n coins given a bal-ance scale, where three counterfeit coins are heavier than good ones and are of different weight. Denote by g3(n) the least unmber of weighings to find three ir-regulars among n coins. In this paper we construct an algorithm and proved that |log3(n3)|≤g3(n)≤|log3(n3)|+2.
We consider the problem of ascertaining the minimum unmber of weighings which suffice to determine three counterfeit coins in a set of n coins given a balance scale, where three counterfeit coins are heavier than good ones and are of different weight. Denote by g3(n) the least unmber of weighings to find three irregulars among n coins. In this paper we construct an algorithm and proved that
出处
《数值计算与计算机应用》
CSCD
北大核心
2003年第2期129-132,共4页
Journal on Numerical Methods and Computer Applications
关键词
坏硬币问题
测试次数
优化算法
信息论
Counterfeit coin problem, Test, Information-theoretic bound, Optimal procedure, robustness
