Two counterfeit coins

Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/9949

DC Field	Value	Language
dc.contributor.author	Tošić, Ratko	en_US
dc.date.accessioned	2020-03-03T14:36:06Z	-
dc.date.available	2020-03-03T14:36:06Z	-
dc.date.issued	1983-01-01	-
dc.identifier.issn	0012365X	en_US
dc.identifier.uri	https://open.uns.ac.rs/handle/123456789/9949	-
dc.description.abstract	We consider the problem of ascertaining the minimum number of weighings which suffice to determine the counterfeit (heavier) coins in 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 constructed for infinitely many n's, and for all other n's a lower bound and an upper bound for the maximum number of steps of an optimal precedure are determined which differ by just one unit. Some results of Cairns are improved, and his conjecture at the end of [3] is proved in a slightly modified form. © 1983.	en
dc.relation.ispartof	Discrete Mathematics	en
dc.title	Two counterfeit coins	en_US
dc.type	Journal/Magazine Article	en_US
dc.identifier.doi	10.1016/0012-365X(83)90123-1	-
dc.identifier.scopus	2-s2.0-0042208415	-
dc.identifier.url	https://api.elsevier.com/content/abstract/scopus_id/0042208415	-
dc.description.version	Unknown	en_US
dc.relation.lastpage	298	en
dc.relation.firstpage	295	en
dc.relation.issue	3	en
dc.relation.volume	46	en
item.fulltext	No Fulltext	-
item.grantfulltext	none	-
Appears in Collections:	Naučne i umetničke publikacije

22

checked on Sep 9, 2023

19

Last Week
10

Last month
0

checked on May 3, 2024

Check