If N denotes the number of ways of s...

If `N` denotes the number of ways of selecting `r` objects of out of `n` distinct objects `(rgeqn)` with unlimited repetition but with each object included at least once in selection, then `N` is equal is a. `.^(r-1)C_(r-n)` b. `.^(r-1)C_n` c. `.^(r-1)C_(n-1)` d. none of these

Similar Questions

Explore conceptually related problems

If n denotes the number of ways of selecting r objects of out of n distinct objects (rgeqn) with unlimited repetition but with each objet included at least once in selection, then n is equal is

If n denotes the number of ways of selecting r objects of out of n distinct objects (rgeqn) with unlimited repetition but with each objet included at least once in selection, then n m is equal is a. ^r-1C_(r-n) b. ^r-1C_n c. ^r-1C_(n-1) d. none of these

Prove that .^(n)C_(r )+.^(n-1)C_(r )+..+.^(r )C_(r )=.^(n+1)C_(r+1)

Show that .^(n)C_(r)+.^(n-1)C_(r-1)+.^(n-1)C_(r-2)=.^(n+1)C_(r) .

Find sum of sum_(r=1)^n r . C (2n,r) (a) n*2^(2n-1) (b) 2^(2n-1) (c) 2^(n-1)+1 (d) None of these

If `N` denotes the number of ways of selecting `r` objects of out of `n` distinct objects `(rgeqn)` with unlimited repetition but with each object included at least once in selection, then `N` is equal is a. `.^(r-1)C_(r-n)` b. `.^(r-1)C_n` c. `.^(r-1)C_(n-1)` d. none of these

Similar Questions

Recommended Questions