MathDB

Let

n

numbers all equal to

1

be written on a blackboard. A move consists of replacing two numbers on the board with two copies of their sum. It happens that after

h

moves all

n

numbers on the blackboard are equal to

m.

Prove that

h \leq \frac{1}{2}n \log_2 m.

13