摘要
从n个硬币的集合中搜索d(d≥2)个坏硬币是一个相当困难且至今尚未完全解决的问题.本文研究了d=4的一装置分组测试模型.令tk为用测试(搜索)过程t经k次测试所能鉴别的最大硬币数.nk=maxttk,我们给出了一个相当好的测试过程使tk/nk0.85.
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