MathDB

M2568

Part of Kvant 2019

Problems(1)

Equal sums of powers of 2

Source: IV Caucasus Mathematic Olympiad}

4/7/2019
15 boxes are given. They all are initially empty. By one move it is allowed to choose some boxes and to put in them numbers of apricots which are pairwise distinct powers of 2. Find the least positive integer kk such that it is possible to have equal numbers of apricots in all the boxes after kk moves.
power of 2combinatorics