二装置搜索两个坏硬币之分解数为2的平衡模型的统一测试过程

An Unifed Search Procedure with Two Divices for Equilibrium Models of Two-Counterfeit Coin Problem

给出了用两台装置搜索两个坏硬币问题中分解为 2的 6个平衡模型的统一测试过程 t,使得当 k为奇数时 ,tk/nk=1 ,当 k为偶数时 ,tk/nk>0 .93 .这里 tk表示测试过程 t在 k次测试中所能鉴别的最大硬币数目 ,nk=maxt tk.从而全部解决了分解为 2之平衡模型的测试问题 .

This paper deals with two-couterfeit coin problem by using two devices. An unified search procedure t on equibrium models M i,i=1,2,...,6 with resolution number two is given such that t k/n k=1 for k odd and t k/n k>0.93 for k even, where t k be the maximum number of coins identifiable in k tests using procedure t and n k=maxt t k. We thus solved the testing problem of all the equilibrium models with resolution number 2.