Daily Math Puzzle 2026/11/17
English
Let \(n\geq 1\) be an integer. Place \(n\) red balls and \(n\) white balls in a row of \(2n\) boxes, one ball per box. You may replace two adjacent boxes with a single box holding all their balls if the fraction of red balls in the left box is at most that in the right box.
How many initial arrangements allow you to gather all the balls in one box by repeating this move?
日本語
赤玉と白玉が \(n\) 個ずつある(\(n\geq 1\)). 横一列に並んだ \(2n\) 個の箱に,これらの玉を1個ずつ入れる. 隣り合う二つの箱で赤玉の割合を比べ,左の割合が右の割合以下なら,二つの箱をその場で一つにまとめてよい.
最初の玉の並べ方のうち,この操作を繰り返してすべての玉を一つの箱にまとめられるものは何通りあるか.
Try it
Red balls (%)