Searching for counterfeit coins

DOI10.1007/BF01202233zbMath0869.05001OpenAlexW1992361966MaRDI QIDQ675884

Anping Li, Martin Aigner

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

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

Related Items (2)

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

Cites Work

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

This page was built for publication: Searching for counterfeit coins