

InterviewSolution
Saved Bookmarks
1. |
If `n`denotes thenumber of ways of selecting `r`objects ofout of `n`distinctobjects `(rgeqn)`withunlimited repetition but with each objet included at least once in selection,then `n`m is equal isa. `^r-1C_(r-n)`b. `^r-1C_n`c.`^r-1C_(n-1)`d. none of theseA. `.^(r-1)C_(r-n)`B. `.^(r-1)C_(n)`C. `.^(r-1)C_(n-1)`D. `.^(r-1)C_(r-n-1)` |
Answer» Correct Answer - A::C `becausex_(1)+x_(2)+x_(3)+ . . .+x_(n)=r, Aa x_(i)ge1,(1 le I le )` Total number of such solutions `=.^(r-1)C_(n-1)=.^(r-1)C_(r-n)` |
|