摘要
从ｎ个硬币的集合中搜索ｄ（ｄ≥２）个坏硬币是一个相当困难且至今尚未完全解决的问题．本文研究了ｄ＝４的一装置分组测试模型．令ｔｋ为用测试（搜索）过程ｔ经ｋ次测试所能鉴别的最大硬币数．ｎｋ＝ｍａｘｔｔｋ，我们给出了一个相当好的测试过程使ｔｋ／ｎｋ０．８５．
Searching d(d≥2) counterfeit coins among n coins is surprisingly hard and remains open. This paper studies group testing model on four counterfeit coins. Let t k be the maximum number of coins identifiable in k tests using procedure t and n k= max t t k. We give a test procedure on four counterfeit problem which achieves the ratio t k/n k0 85.
出处
《纯粹数学与应用数学》
CSCD
1999年第2期88-92,共5页
Pure and Applied Mathematics
