Need Explanation of a combinatorics formulae

Правка en2, от Abinash, 2015-07-13 12:42:47

Suppose we want to fill one array A (which has M elements) such that the sum of the numbers is X.

X=A[1]+A[2]+A[3]....A[m] where A[i] is a non-negative numbers. The number of ways to fill this row can be obtained using a combinatorics formulae: (X+M-1) C (X-1).

Can anyone explain ? Thanks in advance.


  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Abinash 2015-07-13 12:42:47 59
en1 Английский Abinash 2015-07-13 12:40:08 318 Initial revision (published)