There are k heaps of beads containing 2019 beads in total. In each move we choose a heap: either remove it or divide it into two not necessarily equal parts. Find the maximal possible value of k such that for any initial distribution of beads after finite number of moves one can get k heaps with pairwise distinct number of beads.
Correct Solutions by,
- Toshihiro Shimizu Kawasaki, Japan
- Susanne Tegler Lund, Sweden
- Steffen Webber Ismaning, Germany
- Vedat Deveci İstanbul
- Magnus Jakobsson Lund, Sweden
- Dovran Nurgeldiyev Magtumguly Turkmen State University, Turkmenistan
- Serdar Hojayev Dashoguz, Turkmenistan
- Berkay Unlu Dokuz Eylül University, İzmir
- Hasan Zübeyr Demir Özel Ankara Çağlayan Fen Lisesi
- Asude Ebrar Kızıloğlu Özel Kadıköy Eğitmen Fen ve Anadolu Lisesi, İstanbul
- İrem Nur Çevikcan Buca Fen Lisesi, İzmir
- Henrik Aberg Gothenburg, Sweden