Re^3: How to generate restricted partitions of an integer

in reply to Re^2: How to generate restricted partitions of an integer
in thread How to generate restricted partitions of an integer

Well, you did say "how often", which is probably a pretty stupid way of phrasing the problem. It certainly led me to think that the problem involved repeated changings, e.g. once I've broken it into two 50s, what can I do with the two 50s. It now seems that you meant to say "How many ways", rather than "How often". I mean, how often? Once per day? Twice per second?

Comment on Re^3: How to generate restricted partitions of an integer

Replies are listed 'Best First'.
Re^4: How to generate restricted partitions of an integer by Anonymous Monk on Nov 11, 2004 at 14:34 UTC
And how would you phrase the question in Russian?	[reply]
Re^4: How to generate restricted partitions of an integer by borisz (Canon) on Nov 11, 2004 at 14:36 UTC
Sorry, I can not express it any better. Look at the example please. The answer, 50 is correct. I think 'How many ways' is good. Just search for any combination of 100, 50, 20 , 10 and 5 euro notes where the sum is 100 without repeating a combination. I hope it is clearer to you now. Boris	[reply]
Re^5: How to generate restricted partitions of an integer by thor (Priest) on Nov 11, 2004 at 17:27 UTC
Okay...now I understand the problem. If I dust of my math degree...I think this could be solved with generating functions. Basically, calculate (x+ x5+ x10 + x20 + x50 + x100)100 and find the coeffieient of x**100 in the resulting polynomial. Easy...;) thor `Feel the white light, the light within Be your own disciple, fan the sparks of will For all of us waiting, your kingdom will come`	[reply]
Re^6: How to generate restricted partitions of an integer by borisz (Canon) on Nov 11, 2004 at 18:17 UTC
Whow, that is pretty close. SubsetSumProblem. Boris	[reply]

In Section Seekers of Perl Wisdom