The Counterfeit Coin Problem Revisited

N Linial; M Tarsi

doi:10.1137/0211032

The Counterfeit Coin Problem Revisited

N Linial, M Tarsi

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We find the optimal algorithm in the sense of average run time for the counterfeit coin problem: Given n coins, one of which is heavier or lighter than the rest. Using a balance scale, find the counterfeit coin and whether it is heavy or light. An interesting feature of the solution is that our algorithm is a straight line algorithm. We also find the optimal algorithm if a standard coin is available for the first weighing.

Original language	American English
Pages (from-to)	409-415
Number of pages	7
Journal	SIAM Journal on Computing
Volume	11
Issue number	3
DOIs	https://doi.org/10.1137/0211032
State	Published - 1982

Keywords

Algorithms

Access to Document

10.1137/0211032

Cite this

@article{4462ef98478049fab8168254e0b036ef,

title = "The Counterfeit Coin Problem Revisited",

abstract = "We find the optimal algorithm in the sense of average run time for the counterfeit coin problem: Given n coins, one of which is heavier or lighter than the rest. Using a balance scale, find the counterfeit coin and whether it is heavy or light. An interesting feature of the solution is that our algorithm is a straight line algorithm. We also find the optimal algorithm if a standard coin is available for the first weighing.",

keywords = "Algorithms",

author = "N Linial and M Tarsi",

year = "1982",

doi = "10.1137/0211032",

language = "American English",

volume = "11",

pages = "409--415",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "3",

}

TY - JOUR

T1 - The Counterfeit Coin Problem Revisited

AU - Linial, N

AU - Tarsi, M

PY - 1982

Y1 - 1982

N2 - We find the optimal algorithm in the sense of average run time for the counterfeit coin problem: Given n coins, one of which is heavier or lighter than the rest. Using a balance scale, find the counterfeit coin and whether it is heavy or light. An interesting feature of the solution is that our algorithm is a straight line algorithm. We also find the optimal algorithm if a standard coin is available for the first weighing.

AB - We find the optimal algorithm in the sense of average run time for the counterfeit coin problem: Given n coins, one of which is heavier or lighter than the rest. Using a balance scale, find the counterfeit coin and whether it is heavy or light. An interesting feature of the solution is that our algorithm is a straight line algorithm. We also find the optimal algorithm if a standard coin is available for the first weighing.

KW - Algorithms

UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=starter5-25&SrcAuth=WosAPI&KeyUT=WOS:A1982PA03500001&DestLinkType=FullRecord&DestApp=WOS

U2 - 10.1137/0211032

DO - 10.1137/0211032

M3 - Article

SN - 0097-5397

VL - 11

SP - 409

EP - 415

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 3

ER -

The Counterfeit Coin Problem Revisited

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this