Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/16282
Title: | Five counterfeit coins | Authors: | Tošić, Ratko | Issue Date: | 1-Jan-1989 | Journal: | Journal of Statistical Planning and Inference | Abstract: | We consider the problem of ascertaining the minimum number of weighings which suffice to determine all counterfeit (heavier) coins in a set of n coins of the same appearance, given a balance scale and the information that there are exactly five heavier coins present. For an infinite set of n's we determine an upper bound for the maximum number of steps of an optimal procedure which differs by just two from the information-theoretical lower bound. We also consider a slightly modified problem, i.e. the case when we are given a certain number (not greater than 2n-3) of additional coins for which we know that they are all good (not counterfeit). For that case, and arbitrary n, we determine an upper bound for the maximum number of steps of an optimal procedure which differs by just seven from the information-theoretical lower bound. © 1989. | URI: | https://open.uns.ac.rs/handle/123456789/16282 | ISSN: | 03783758 | DOI: | 10.1016/0378-3758(89)90110-9 |
Appears in Collections: | Naučne i umetničke publikacije |
Show full item record
SCOPUSTM
Citations
6
checked on May 10, 2024
Page view(s)
22
Last Week
3
3
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.