On two counterfeit coins conjecture (Q2763579)

This short survey contains a lot of informations on combinatorial search problems of the following type:NEWLINENEWLINENEWLINEGiven a set of coins with a prescribed number \(m\) of counterfeit coins, one should detect them by using a minimal possibility number of weighings. Three sections of the paper are devoted to the cases \(m = 1\), \(m = 2\) and \(m > 2\). An extensive bibliography (91 titles) is included. Special assertion is paid to the case \(m = 2\), which can be suitably treated by a graph-theoretical approach. It is conjectured that the information-theoretical lower bound for the number of weighings can be reached with this case (as it can with \(m = 1\)).NEWLINENEWLINEFor the entire collection see [Zbl 0977.00022].