Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:dspace.mit.edu:1721.1/89805

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

Authors
Publication date
1 June 2010
Publisher
'The Electronic Journal of Combinatorics'

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

Similar works

Full text

thumbnail-image

This paper was published in DSpace@MIT.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.