Splitting piles
Source: Turkey EGMO TST 2019 #6
July 15, 2020
combinatoricscombinatorics proposed
Problem Statement
There are piles and there are stones totally. In every move we split a pile into two or remove one pile. Using finite moves we can reach conclusion that there are piles left and all of them contain different number of stonws. Find the maximum of .