Question 66
A positive integer $n$ is written on the board once, then $n-1$ is written on the board twice, etc.; on every step the number smaller by $1$ from the previous number is written twice as many times as the previous number. When reaching zeros this process stops. Prove that in the end the sum of the numbers on the board is less than $2^{n+1}$.