Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle
We investigate a coin-weighing puzzle that appeared in the 1991 Moscow Math Olympiad. We generalize the puzzle by varying the number of participating coins, and deduce an upper bound on the number of weighings needed to solve the puzzle that is noticeably better than the trivial upper bound. In part...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Electronic Journal of Combinatorics,
2014-09-18T16:24:22Z.
|
| Subjects: | |
| Online Access: | Get fulltext |