Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle

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...

Full description

Bibliographic Details
Main Authors: Khovanova, Tanya (Contributor), Lewis, Joel Brewster (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Electronic Journal of Combinatorics, 2014-09-18T16:24:22Z.
Subjects:
Article
Online Access:Get fulltext
LEADER 01054 am a22001933u 4500
001 89805
042 |a dc 
100 1 0 |a Khovanova, Tanya  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Mathematics  |e contributor 
100 1 0 |a Khovanova, Tanya  |e contributor 
100 1 0 |a Lewis, Joel Brewster  |e contributor 
700 1 0 |a Lewis, Joel Brewster  |e author 
245 0 0 |a Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle 
260 |b Electronic Journal of Combinatorics,   |c 2014-09-18T16:24:22Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/89805 
520 |a 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 particular, we show that logarithmically-many weighings on a balance suffice. 
546 |a en_US 
655 7 |a Article 
773 |t Electronic Journal of Combinatorics 

Similar Items