\((n+k-1)C_{k-1}\)
\((n)C_{k-1}\)
\((n-1)C_{k-1}\)
\((n+k-1)C_{k}\)
\(nC_{k}\)
From the give data we can write,
The number of ways to distribute n identical balls into k distinct boxes is
The solution can be formed by using the concept of combination.(Note -Where only selection is important aspect.)
So, the number of ways to distribute n identical balls into k distinct boxes is
\((n+k-1)C_{k-1}\) (_Ans)
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.