Abstract
There is a problem which is much in favour at present of which one version is this : a man has 12 pennies among which there may be a counterfeit coin, which can only be told apart by its weight being different from the others. How can one tell in not more than three weighings whether there is a counterfeit penny, if so which one it is, and whether it is heavier or lighter than a normal penny? (Math. Gaz., XXIX (1945), pp. 227–229; XXX (1946), pp. 231–234.) This puzzle seems to have originated in America. The purpose of the present note is to make clear what is the best possible solution in the most general case of any version of the problem. No originality is claimed for these solutions, as no doubt many of them have been obtained independently many times before : but I am not aware that any complete and systematic account has yet been published.
Publisher
Cambridge University Press (CUP)
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deduction Game Framework and Information Set Entropy Search;2024 IEEE Conference on Games (CoG);2024-08-05
2. Population identification strategies for counterfeit coin detection;Journal of Forensic Sciences;2022-09
3. Symbolic Execution + Model Counting + Entropy Maximization = Automatic Search Synthesis;Electronic Proceedings in Theoretical Computer Science;2020-09-20
4. Detecting a Fake Coin of a Known Type;Statistics and its Applications;2018
5. Twenty (simple) questions;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19