Searching for counterfeit coins

DOI10.1007/BF01202233MaRDI QIDQ675884zbMATH OpenOpenAlexFDO

Authors Martin Aigner, Anping Li

Publication date 20 August 1997

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

Full work available at URL https://doi.org/10.1007/bf01202233

zbMATH Keywords

coinscounterfeit problemweighings

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Search theory (90B40)

Recommendations

• Searching for two counterfeit coins
• scientific article; zbMATH DE number 895369
• Three counterfeit coins problem
• Five counterfeit coins

Cites work

• A new competitive algorithm for the counterfeit coin problem
• Four counterfeit coins problem
• How to find many counterfeit coins?
• On the conjecture at two counterfeit coins
• Three counterfeit coins problem
• Two counterfeit coins

Cited in

(6)

• How to find many counterfeit coins?
• 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
• scientific article; zbMATH DE number 3896639 (Why is no real title available?)
• Privacy and counterfeit coins
• Non-adaptive solutions to the general counterfeit coin problem

This page was built for publication: Searching for counterfeit coins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675884)