Mathematics – Combinatorics
Scientific paper
2010-06-21
Mathematics
Combinatorics
19 pages
Scientific paper
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.
Khovanova Tanya
Lewis Joel Brewster
No associations
LandOfFree
Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Baron Munchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-602026