Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2022-part-05 — 197 problems (EN–VI) Question 158

Math Olympiad Vault · MathNet 2022-part-05 — 197 problems (EN–VI)

Question 158

There are two boxes: one contains $29$ distinguishable balls and the other one is empty. In a move applied to a picked box we choose some collection of balls from this box and transfer them to the other box. Starting with the non-empty box we repeatedly apply these moves, picking boxes alternatively. What is the maximal possible number of moves if each ball collection can be selected at most once?