Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-09T14:11:43.315Z Has data issue: false hasContentIssue false

The Counterfeit Coin Problem

Published online by Cambridge University Press:  03 November 2016

Extract

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.

Type
Research Article
Copyright
Copyright © Mathematical Association 1947

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)