Geodesic
Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/524
Classification : 05D99, 11B75, 05A99, 00A08 
@article{10_37236_524,
     author = {Tanya Khovanova and Joel Brewster Lewis},
     title = {Baron {M\"unchhausen} redeems himself: bounds for a coin-weighing puzzle},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/524},
     zbl = {1229.05266},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/524/}
}
TY  - JOUR
AU  - Tanya Khovanova
AU  - Joel Brewster Lewis
TI  - Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/524/
DO  - 10.37236/524
ID  - 10_37236_524
ER  - 
%0 Journal Article
%A Tanya Khovanova
%A Joel Brewster Lewis
%T Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/524/
%R 10.37236/524
%F 10_37236_524
Tanya Khovanova; Joel Brewster Lewis. Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/524

Cité par Sources :