Dear all,

I have a problem of combinatorial/permutation in the context of computer networks. To easy of explanation, suppose that you have vector with n=3 elements, say [1,3,4].

The summation of the n elements yields a total T = 8.

Now consider these constraints:

a) Each element in the vector may vary from 0 to 4.

b) The summation of the n elements MUST be equal to the total T = 8.

The question is, how many combination do we can do with that vector, considering the constraints?

Valid results include:

1, 3, 4

1, 4, 3

3, 1, 4

3, 4, 1

4, 1, 3

4, 3, 1

2, 2, 4

2, 3, 3

0, 4, 4

…

Many thanks in advance for your help