Problem

Source: Kyiv mathematical festival 2012

Tags: combinatorics



Finite number of dwarfs excavates ore in the mine with infinite number of levels. Each day at the same time one dwarf from each level, inhabited with exactly $n = 2, 3, ... $ dwarfs, move $n-1$ levels down. Prove that after some moment there will be no more then one dwarf on each level.