Daily Math Puzzle 2026/11/22

Original Post on X

English

There are \(n\geq 1\) distinct positive integers written in increasing order from left to right. In each round, go through the numbers from left to right, replacing each with the smallest integer that is larger than its current value and different from all the other numbers at that moment. Prove that, after sufficiently many rounds, the maximal runs of consecutive integers are arranged from left to right in nondecreasing order of length.

日本語

\(n\geq 1\) 個の互いに異なる正整数が左から小さい順に書かれている. 1回の操作では左から順に,各数を「今よりも大きく,その時点で他の数と異なる最小の整数」に書き換える. この操作を十分に繰り返すと,連続する数のかたまりが,左から短い順に並ぶことを示せ.

Try it