| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636057 | Applied Mathematics and Computation | 2006 | 10 Pages |
Abstract
In this paper, given a balance scale and the information that there are exactly two different defective coins present, the authors consider the problem of ascertaining the minimum number of testing which suffice to determine the two different defective coins in a set of λ coins in same appearance, and here λ ⩾ 3. A testing algorithm for all the possible values of λ is constructed, and the testing algorithm needs at most one testing step more than the optimal testing algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Mingnan Qi, Sanyang Liu,