Number of Integer solutions for this optimization problem

74 Views Asked by At

What is the number of integer solutions to the problem $$\sum_{i=1}^{i=k}x_i = n$$ subject to $\forall_i\ \ x_i \ge 0 $

note This should hold for both cases $k < n$ and $k \ge n$

1

There are 1 best solutions below

2
On BEST ANSWER

This is given by the formula $$CC_k^n = {n+k-1 \choose n}$$