| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655162 | Discrete Applied Mathematics | 2005 | 22 Pages |
Abstract
We provide a worst-case optimal procedure to identify one unknown heavy coin among N identically looking coins when a balance scale is used and at most two weighing results can be erroneous. The exact minimal number of weighings is determined. This solves completely the weighing problem of the case of two unreliable weighings.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wen-An Liu, Qi-Min Zhang, Zan-Kan Nie,