How to find many counterfeit coins?

DOI10.1007/BF01788090zbMath0593.05002MaRDI QIDQ1076020

László Pyber

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

sorting; searching; weighings; balance scale; counterfeit coins

Mathematics Subject Classification ID

68P10: Searching and sorting

05A05: Permutations, words, matrices

Related Items

Minimum average-case queries of \(q+1\)-ary search game with small sets, Searching for counterfeit coins, Finding defective coins, A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance, Coins and cones, Optimal detection of a counterfeit coin with multi-arms balances, Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem, Minimal average cost of searching for a counterfeit coin: restricted model, Optimal search procedure on coin-weighing problem, Searching for a counterfeit coin with two unreliable weighings, Searching for two counterfeit coins with two-arms balance

Cites Work

• Unnamed Item
• Unnamed Item
• Two counterfeit coins
• The average number of weighings to locate a counterfeit coin (Corresp.)
• On various versions of the defective coin problem
• An improved strategy for a counterfeit coin problem (Corresp.)
• Counterfeit Coin Problems
• Balance Scale Sorting