Jump to content

Welcome to BrainDen.com - Brain Teasers Forum

Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account.
As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends.

Of course, you can also enjoy our collection of amazing optical illusions and cool math games.

If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top.
If you have a website, we would appreciate a little link to BrainDen.

Thanks and enjoy the Den :-)
Guest Message by DevFuse

- - - - -

coin change problem

  • Please log in to reply
2 replies to this topic

#1 phil1882


    Senior Member

  • Members
  • PipPipPipPip
  • 564 posts

Posted 13 May 2012 - 06:00 PM

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
  • 0

#2 superprismatic


    Not just Prismatic

  • Moderator
  • PipPipPipPip
  • 1281 posts
  • Gender:Male

Posted 14 May 2012 - 09:01 PM

Spoiler for My answers

  • 1

#3 phil1882


    Senior Member

  • Members
  • PipPipPipPip
  • 564 posts

Posted 15 May 2012 - 05:50 PM

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

0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users