Hi,

Though it shouldn't be really difficult, I've been kind of stuck with this. I need to make a function, that computes and shows all the possible combinations (without repetition) of given number, where the digits (that only range from 1 to 9) of every combination give a specified sum when added.

I guess it's not the clearest explanation, so here is an example: Calculate all sets of 5 numbers (from 1 to 9) that add up to 28.

I would be really grateful, if someone could explain this.