本文给定一台比较型测试装置和确切的四个相同伪硬币出现的信息,作者研究最小测试数的探求问题,这个最小测试数能从A个有同样外观的硬币组成的集合中鉴别出四个相同的伪硬币,这里λ≥5.作者构造了一个鉴别四个相同伪硬币的测试算法,这个测试算法改进了Togic的一个测试算法,还修正了另外一个测试算法.
In this paper authors consider the problem of ascertaining the ber of testings suffice to identify the four uniform defective coins in a set of λ coins of the same appearance,given a comparison-type device and the information that there are exactly the four defective coins of uniform test present,where λ≥5. A group testing algorithm is constructed. The group testing algorithm has improved the testing algorithm of Tosic,and another group tasting algorithm is modified by the algorithm.