I have a combinatoric problem still unsolved:
$2n$ ($n$ is a positive integer) stones are divided into $3$ piles. In each step, we pick half of a pile which has even number of stones and move those stones to another pile. Prove that despite the number of stones each pile contains at the beginning, after finitely many steps, we can have a $n$-stone pile.
I tried to prove that after finitely many steps, there are 2 piles with the same number of stones by showing that $\min \{ |a-b|, |b-c|,|c-a|\} \to 0$ after finite steps, but it's too hard.
Thanks for your helps.