MathDB

The leader of the Gnome country wants to print banknotes in

12

different denominations (each with an integer number) in such a way that it is possible to pay an arbitrary amount from

1

6543

with these banknotes without a balance, using a maximum of

8

banknotes. (Several bills with the same denomination can be used during payment.) Can the leader of the land of Gnomes do it?

Problem Statement