Searching for two counterfeit coins with two-arms balance
The paper deals with a variant of the classical problem of locating \(d\) counterfeit coins out of a set of \(n\) coins, \(n-d\) of which are good coins having the same weight. In particular, the model with two counterfeit coins is considered, one of them being heavier and the other one lighter then the good ones, such that the two counterfeit coins together have the same weight as two good coins. It is proven that the information-theoretic lower bound \(U(k)= \max\{ n\mid n(n-1)\leq 3^k\}\) for the number of coins for which the \(k\) weighings suffice is achievable for even integers greater than 2. For odd integers greater than 1, it is shown that the bound \(U(k)\) can be approximated arbitrarily well. Finally, the authors mention how methods used here can be applied on some similar models.
- A new competitive algorithm for the counterfeit coin problem
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- An improved algorithm for quantitative group testing
- Coin-Weighing Problems
- Detection of a Defective Coin with Partial Weight Information
- Five counterfeit coins
- How to find many counterfeit coins?
- scientific article; zbMATH DE number 4057247 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 65702 (Why is no real title available?)
- Modifications of Competitive Group Testing
- On the conjecture at two counterfeit coins
- On various versions of the defective coin problem
- Optimal detection of a counterfeit coin with multi-arms balances
- Optimal Detection of Two Complementary Defectives
- Optimal detection of two counterfeit coins with two-arms balance.
- Optimal Detection of Two Defectives with a Parity Check Device
- Randomized group testing for mutually obscuring defectives
- Search problems for two irregular coins with incomplete feedback: The underweight model
- Searching for Two Objects by Underweight Feedback
- The complexity of parallel search
- The Counterfeit Coin Problem Revisited
- Two counterfeit coins
- How to find many counterfeit coins?
- Optimal detection of two counterfeit coins with two-arms balance.
- Minimal average cost of searching for a counterfeit coin: restricted model
- Searching for a counterfeit coin with \(b\)-balance
- On two counterfeit coins conjecture
- Searching for two counterfeit coins
- Quantum counterfeit coin problems
- Selecting two different defective coins
This page was built for publication: Searching for two counterfeit coins with two-arms balance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576348)
