When you have combinations where digits are 0,1,2...,m, meaning we have n=m+1 and k, is there a way to see how much of them sum up to a given number? For the sake of simplicity I have the digits 0,1,2...,7 (so n=8), and k=3. I need to find how much of these combinations WITH repetition sum up to 7. Is there a formula for this?(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Fixed sum of combinations

**Physics Forums | Science Articles, Homework Help, Discussion**