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

prove that total number of ways of selection of r points out of n points in a row such that no two of them are consecutive C(n-r+1,r)

If .^(n)C_(r-1) = 36, .^(n)C_(r) = 84 and .^(n)C_(r+1) = 126

If .^(n+1)C_(r+1): .^(n)C_(r)=11:6 and .^(n)C_(r): .^(n-1)C_(r-1)=6:3 , find n and r.

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

If ^(n)C_(r)=^(n)C_(r), then ^(n)C_(r) is equal to a.4896 b.816c.1632d .none of these

If .^(n)C_(r-1)=.^(n)C_(3r) , find r.

The value of sum_(r=0)^(n)C_(r)/(^(n)C_(r)+^(n)C_(r+1)) equals a.n+1 b.n/2 c.n+2 d.none of these

If 1<=r<=n, then n^(n-1)C_(r)=(n-r+1)^(n)C_(r-1)

If .^(n)P_(r)=.^(n)P_(r+1) and .^(n)C_(r)=.^(n)C_(r-1) , find n and r.