We consider the problem of ascertaining the minimum number of weighings which sufike to determine the counterfeit (heavier) coins ia a set of n coins of the same appearance, given a balance scale and the information that there are exactly two heavier coins present. An optimal procedure is constructe
Five counterfeit coins
✍ Scribed by Ratko Tošić
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 307 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Given c nickels among which there may be a counterfeit coin, which can only be told apart by its weight being different from the others, and moreover b balances, what is the minimal number of weighings to decide whether there is a counterfeit nickel, if so which one it is and whether it is heavier o
Suppose among the given n coins there are two counterfeit coins, which are heavier (or lighter) than the normals. Denote by g,(n) the minimum number of weighings that suffice to search the two false coins by a balance. It is guessed that g&)=rlog,(;)l . This paper affirms the conjecture.