Show simple item record

dc.contributor.authorKhovanova, Tanya
dc.contributor.authorLewis, Joel Brewster
dc.date.accessioned2014-09-18T16:24:22Z
dc.date.available2014-09-18T16:24:22Z
dc.date.issued2011-02
dc.date.submitted2010-06
dc.identifier.issn1077-8926
dc.identifier.urihttp://hdl.handle.net/1721.1/89805
dc.description.abstractWe 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.en_US
dc.language.isoen_US
dc.publisherElectronic Journal of Combinatoricsen_US
dc.relation.isversionofhttp://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p37en_US
dc.rightsArticle 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.en_US
dc.sourceElectronic Journal of Combinatoricsen_US
dc.titleBaron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzleen_US
dc.typeArticleen_US
dc.identifier.citationKhovanova, Tanya, and Joel Brewster Lewis. "Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle." Electronic Journal of Combinatorics, Volume 18, Issue 1 (2011).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.mitauthorKhovanova, Tanyaen_US
dc.contributor.mitauthorLewis, Joel Brewsteren_US
dc.relation.journalElectronic Journal of Combinatoricsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsKhovanova, Tanya; Lewis, Joel Brewsteren_US
dc.identifier.orcidhttps://orcid.org/0000-0003-0868-8981
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record