The average number of weighings to locate a counterfeit coin (Corresp.)
Donna Mead · IEEE Transactions on Information Theory · 1979
A solution is obtained to the problem of finding the minimum of the average number of weighings, using a balance, needed to locate one light coin from amongncoins of whichn - 1are genuine and of the same weight. Optimal strategies are determined, and the anomaly that it may be better to work withn + 1coins rather thannis examined and explained.