Tightening the bounds on the Baron's omni-sequence

DOI10.1016/j.disc.2011.12.026zbMath1241.05146OpenAlexW2022425558MaRDI QIDQ764901

Michael Brand

Publication date: 16 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.026

zbMATH Keywords

verificationBaron's omni-sequencecoin weighingMünchhausen

Mathematics Subject Classification ID

Searching and sorting (68P10) Partitions of sets (05A18) Search theory (90B40) Other combinatorial number theory (11B75) Extremal combinatorics (05D99)

Cites Work

• Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
• The general counterfeit coin problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tightening the bounds on the Baron's omni-sequence