Baron Münchhausen's sequence
Journal of integer sequences, Tome 13 (2010) no. 8
We investigate a coin-weighing puzzle that appeared in the all-Russian Mathematics Olympiad in 2000. The methods of analysis differ from classical coin-weighing puzzles. We generalize the puzzle by varying the number of participating coins, and deduce a complete solution. Perhaps surprisingly, the objective can be achieved in no more than two weighings regardless of the number of coins involved.
@article{JIS_2010__13_8_a3,
author = {Khovanova, Tanya and Knop, Konstantin and Radul, Alexey},
title = {Baron {M\"unchhausen's} sequence},
journal = {Journal of integer sequences},
year = {2010},
volume = {13},
number = {8},
zbl = {1263.11040},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2010__13_8_a3/}
}
Khovanova, Tanya; Knop, Konstantin; Radul, Alexey. Baron Münchhausen's sequence. Journal of integer sequences, Tome 13 (2010) no. 8. http://geodesic.mathdoc.fr/item/JIS_2010__13_8_a3/