All Questions
1
question
1
vote
0
answers
76
views
Counting number of integer solutions to $a_1 + a_2 + a_3 + \ldots = n$ where all $a$'s must be in certain range
For a given $(n,m,k)$..
Using values in the range $(0..k)$, how many different $m$-combos exist which sum to n?
ex. for $(n,m,k)$ = $(3,3,2)$, there are 7 possible combinations. For $(5,4,2)$ ...
- 11