No, I search for distinct combinations only. So I can exchange 100e only one into another 100e.
| [reply] |

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?
| [reply] |

| [reply] |

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.
| [reply] |

Comment onRe: How to generate restricted partitions of an integer