摘要
In this paper we study further on a group testing problem of identifying the defective from a n-coin set containing one defective coin with a balance without weight. The defective coin is not of the same weight as each of the normal ones. We derive a new testing algorithm which can tell out the defective from the n-coin set with the worst-case minimum number of tests.
基金
This research is supported partially by Natural Science Foundation of Beijing （1052007,1042007）
