Daily Math Puzzle 2026/11/15
English
Let \(n\geq 3\) be an odd integer. There are \(n\) boxes arranged in a circle, and initially all \(n\) stones are in one box. Repeat the following move until no further move is possible.
Move: Choose a box containing at least \(2\) stones. Take \(2\) stones from it and put \(1\) in each neighboring box.
Prove that the process ends after finitely many moves, no matter which eligible box is chosen at each step.
日本語
\(n\) を \(3\) 以上の奇数とする. 円周上に \(n\) 個の箱が並んでおり,初めは \(n\) 個の石がすべて一つの箱に入っている. 次の操作を,操作できなくなるまで繰り返す.
操作:石が \(2\) 個以上入っている箱を一つ選び,その箱から石を \(2\) 個取り出して,両隣の箱に \(1\) 個ずつ入れる.
操作する箱をどのように選んでも,必ず有限回で終了することを示せ.
Try it
- Moves
- 0