Abstract
This paper is concerned with the problem of detecting two defective coins of respective weight $w + e$ and $w - e$, mixed with $n - 2$ coins of standard weight w, in the minimum number of weighings on a single-dish spring scale. The exact solution of the problem for the worst case is obtained. In particular, it is shown that asymptotically $( ( 1 + \log _2 3 ) /\log _2 3 )\log _2 n$ weighings are required, an improvement of almost 30% over the information-theoretic lower bound.

This publication has 10 references indexed in Scilit: