Saved Bookmarks
| 1. |
Consideer the following statements : I . Number of ways of placing 'n' objects in k bins (k le n) such that no bin is empty is ""^(n-1)C_(k-1). II. Number of ways of writing a positive integer 'n' into a sum of k positive integers is ""^(n-1)C_(k-1). III. Number of ways of placing 'n' objects in k bins such that atleast one bin is non- empty is ""^(n-1)C_(k-1). IV. ""^nC_k - ""^(n-1)C_k = ""^(n-1)C_(k-1) then which of the above statements are true ? |
|
Answer» All the FOUR STATEMENTS |
|