MathDB

In a certain magical country, there are banknotes in denominations of

2^0, 2^1, 2^2, \ldots

UAH. Businessman Victor has to make cash payments to

44

different companies totaling

44000

UAH, but he does not remember how much he has to pay to each company. What is the smallest number of banknotes Victor should withdraw from an ATM (totaling exactly

44000

UAH) to guarantee that he would be able to pay all the companies without leaving any change?
Proposed by Oleksii Masalitin

Problem Statement