Jump to content
BrainDen.com - Brain Teasers
  • 0

coin change problem


phil1882
 Share

Question

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

Link to comment
Share on other sites

2 answers to this question

Recommended Posts

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
 Share

  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...