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

- Published in 2010
- Added on

In the collections

We investigate a coin-weighing puzzle that appeared in the Moscow Math Olympiad in 1991. 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.

## Links

## Other information

- arxivId
- arXiv:1006.4135v1
- pages
- 1--19

### BibTeX entry

@article{Khovanova2010, title = {Baron Munchhausen Redeems Himself : Bounds for a Coin-Weighing Puzzle Background}, author = {Khovanova, Tanya and Lewis, Joel Brewster}, url = {http://arxiv.org/abs/1006.4135v1 http://arxiv.org/pdf/1006.4135v1}, archivePrefix = {arXiv}, arxivId = {arXiv:1006.4135v1}, eprint = {arXiv:1006.4135v1}, pages = {1--19}, year = 2010, urldate = {2011-10-14}, abstract = {We investigate a coin-weighing puzzle that appeared in the Moscow Math Olympiad in 1991. 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.}, collections = {Attention-grabbing titles,Puzzles} }