Two counterfeit coins

DOI10.1016/0012-365X(83)90123-1zbMath0518.05004OpenAlexW2064260892MaRDI QIDQ1053688

Ratko Tošić

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90123-1

zbMATH Keywords

weighing problemoptimal search strategy

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

How to find many counterfeit coins? ⋮ On the conjecture at two counterfeit coins ⋮ Optimal detection of a counterfeit coin with multi-arms balances ⋮ Group testing to identify one defective and one mediocre item ⋮ Selecting two different defective coins ⋮ Five counterfeit coins ⋮ Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ Optimal detection of two counterfeit coins with two-arms balance. ⋮ Searching for counterfeit coins ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching for a counterfeit coin with \(b\)-balance ⋮ 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 ⋮ Some new results concerning three counterfeit coins problem ⋮ Three counterfeit coins problem

Cites Work

• Unnamed Item
• Unnamed Item
• On various versions of the defective coin problem
• Balance Scale Sorting

This page was built for publication: Two counterfeit coins