2 replies to this topic

[phil1882]

so plasmids problem got me to thinking; given a set of integers, smallest being 1, can you always find the optimal change (fewest number of coins)?
consider the following set.
1 4 9 25 49 121 169...
where you have every prime number squared.
try finding the optimal change for...
288 and
1368 and
9408

[superprismatic]

Spoiler for My answers

Here's a couple of answers for each one. They each use the optimal change of 7 coins.

288:
121 121 25 9 4 4 4
169 49 49 9 4 4 4

1368:
961 361 25 9 4 4 4
529 529 289 9 4 4 4

9408:
6889 2209 289 9 4 4 4
5329 2209 1849 9 4 4 4

[phil1882]

nicely done super, somehow i had a feeling you would be the one to solve this :-)