The Counterfeit Coin Problem Revisited | Zendy

Nathan Linial | Zendy; Michael Tarsi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Counterfeit Coin Problem Revisited

Author(s) -

Nathan Linial,

Michael Tarsi

Publication year - 1982

Publication title -

siam journal on computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.533

H-Index - 122

eISSN - 1095-7111

pISSN - 0097-5397

DOI - 10.1137/0211032

Subject(s) - counterfeit , rest (music) , feature (linguistics) , computer science , algorithm , scale (ratio) , running time , balance (ability) , mathematics , physics , linguistics , philosophy , quantum mechanics , political science , acoustics , law , medicine , physical medicine and rehabilitation

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research