0

I found this interesting problem: http://mathfactor.uark.edu/2012/07/yoak-denominations-of-money/#comments

Devise an alternate set of denominations for coins and bank notes requiring a minimum number of denominations and such that any amount from \$0.01 to \$100 could be paid with four units of currency.

I found a smaller upper bound of the one proposed, however I am not sure it is right and I would like someone to check it.

There are 10.000 (from 10000 cent to 1 cent) possible combination of change that we need to express with 4 symbols.

If it was a positional system we would only need $log_4(10.000) <= 7$ symbols.

However we are talking about coins which is not a positional system.

At this point we could just expand the 7 symbols on the 4 bases to get $7 \times 4 = 28$ bank notes.

Which is still an upper bound since $4 ^ 7 = 16384 > 10000$

To make things clearer let me enumerate all the coin I think I need expressed in cent: $$ {0, 1, 2, 3, 4, 5, 6} \\ {7, 14, 21, 28, 35, 42, 49 } \\ {98, 147, 196, 245, 294, 343, 392} \\ {1029, 1372, 1715, 2058, 2401, 2744, 3087} \\ $$

I am missing something?

Cheers

Siscia
  • 177

0 Answers0