Searching for counterfeit coins

DOI10.1007/BF01202233zbMATH Open0869.05001OpenAlexW1992361966MaRDI QIDQ675884FDOQ675884

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

Recommendations

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

zbMATH Keywords

coinscounterfeit problemweighings

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• How to find many counterfeit coins?
• Non-adaptive solutions to the general counterfeit coin problem
• Minimal average cost of searching for a counterfeit coin: restricted model
• Title not available (Why is that?)
• Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing 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)