关于两个伪硬币问题的一些新结果(英文)  

Some New Results Concerning Two Defective Coins Problem

作　　者：綦明男[1] 刘三阳[1] 

机构地区：[1]西安电子科技大学应用数学系

出　　处：《应用数学》2005年第3期345-351,共7页Mathematica Applicata

基　　金：ShanxiProvinceNaturalScienceFoundationofChina(2001SL03)

摘　　要：下面的问题被称为n个外观不可区分硬币的分组测试问题,每个硬币可以是伪硬币或是标准硬币.本文所涉及的问题是:已知一个由n个硬币组成的集合中有两个伪(较重的)硬币,用一台天平以最小的称重次数,从这n个硬币组成的集合中探测出两个伪(较重的)硬币. 我们构造了找出两个伪(较重的)硬币的两个算法,并且这两个算法是最优的.The following problem is known as group testing problem for n coins of the same appearance.Each coin can be defective or standard.We consider the problem of ascertaining the minimum number of weighing which suffice to determine the two defective (heavier) coins in a set of n coins given a balance scale and the information that there are exactly two heavier coins present.The two algorithm are constructed to find out the two heavier coins,and the two corresponding algorithm are optimal.

关 键 词：伪硬币 最优分组测试过程 信息论界 分组测试 标准硬币 

分 类 号：O236[理学—运筹学与控制论]