Baron Münchhausen's sequence

zbMATH Open1263.11040arXiv1003.3406MaRDI QIDQ4933510FDOQ4933510

Authors: Tanya Khovanova, Konstantin Knop, Alexey Andreyevich Radul 

Publication date: 13 October 2010

Abstract: We investigate a coin-weighing puzzle that appeared in the all-Russian math Olympiad in 2000. We liked the puzzle because 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.

Full work available at URL: https://arxiv.org/abs/1003.3406

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
• Münchhausen matrices
• Lower bounds on the Münchhausen problem
• scientific article; zbMATH DE number 3987282
• Tightening the bounds on the Baron's omni-sequence

zbMATH Keywords

puzzletriangular decompositionweighing

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Recreational mathematics (00A08)

Cited In (4)

• The Mondshein Sequence
• Tightening the bounds on the Baron's omni-sequence
• Münchhausen matrices
• Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle

Uses Software

• OEIS

This page was built for publication: Baron Münchhausen's sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933510)