Optimal Detection of Two Complementary Defectives
Author:
- C. ChristenCCC. Christen
- 1 March 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 4 (1) , 101-110
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.
Keywords
This publication has 10 references indexed in Scilit:
- Determination of a Subset from Certain Combinatorial PropertiesCanadian Journal of Mathematics, 1966
- On a Combinatorial Problem in Number TheoryCanadian Mathematical Bulletin, 1965
- A Combinatory Detection ProblemThe American Mathematical Monthly, 1963
- A Combinatory Detection ProblemThe American Mathematical Monthly, 1963
- Balance Scale SortingThe American Mathematical Monthly, 1963
- On various versions of the defective coin problemInformation and Control, 1961
- 4203The American Mathematical Monthly, 1947
- The Counterfeit Coin ProblemThe Mathematical Gazette, 1947
- E712The American Mathematical Monthly, 1947
- E651The American Mathematical Monthly, 1945