There are k piles and there are 2019 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 k piles left and all of them contain different number of stonws. Find the maximum of k. combinatoricscombinatorics proposed