Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle
Name
Khovanova-2011-Baron Munchhausen.pdf
Size
145.73 KB
Format
Adobe PDF
Checksum (MD5)
a2513d310064709e86c765b11697783f
Author(s)
Khovanova, Tanya
Lewis, Joel Brewster
Date Issued
February 2011
Journal
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Citation
Khovanova, Tanya, and Joel Brewster Lewis. "Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle." Electronic Journal of Combinatorics, Volume 18, Issue 1 (2011).
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.37236/524
