At the beginning there are 111 distinguishable balls on the red table and the white table
is empty. Starting with a red table we alternatively apply moves to the tables. In a move
applied to a given table we choose some collection of balls from this table and transfer them
to the other table. Find the maximal possible number of moves if each ball collection can
be chosen at most once.
Correct Solutions by,
- Toshihiro Shimizu Kawasaki, Japan
- Ramazan Karaşahin Ankara
- Mustafa Kaynak Gaziantep
- Magnus Jakobsson Lund, Sweden
- Mahri Asgarova Ashgabat Turkmenistan
- Roger Bengtsson Lund, Sweden
- Arda Karahan Trabzon Fen Lisesi
- Hamza Allaberdiyev 135th Specialized High School, Askgabat
- Alper Çay Ankara University, MTA
Solution: 2502c.pdf (bilkent.edu.tr)