Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle (Q625410)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle |
scientific article |
Statements
Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle (English)
0 references
17 February 2011
0 references
Summary: 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.
0 references
