Home
Class 11
MATHS
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

Answer

Step by step text solution for 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 by MATHS experts to help you in doubts & scoring excellent marks in Class 11 exams.

Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • LOGARITHM

    CENGAGE PUBLICATION|Exercise All Questions|177 Videos

  • PROBABILITY

    CENGAGE PUBLICATION|Exercise All Questions|1 Videos

Similar Questions

Explore conceptually related problems

Let f(n ,k) denote the number of ways in which k identical balls can be colored with n colors so that there is at least one ball of each color. Then f(n ,2n) must be equal to a. ""^(2n) C_n b. ""^(2n-1)C_(n+1) c. ""^(2n-1)C_n d. none of these

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

Knowledge Check

  • .^(n-1)C_(r)+^(n-1)C_(r-1)=

    A
    `.^(n)C_(r+1)`
    B
    `.^(n)C_(r+1)`
    C
    `.^(n+1)C_(r)`
    D
    `.^(n)C_(r)`

    • Similar Questions

    Explore conceptually related problems

    If n objects are arrange in a row, then the number of ways of selecting three of these objects so that no two of them are next to each other is a. "^(n-2)C_3 b. "^(n-3)C_2 c. "^(n-3)C_3 d. none of these

    Statement 1: When number of ways of arranging 21 objects of which r objects are identical of one type and remaining are identical of second type is maximum, then maximum value of ^13 C_ri s78. Statement 2: ^2n+1C_r is maximum when r=ndot

    show that ^nC_r+ ^(n-1)C_(r-1)+ ^(n-1)C_(r-2)= ^(n+1)C_r

    Find the sum sum_(i=0)^r.^(n_1)C_(r-i) .^(n_2)C_i .

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

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

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

    Home
    Profile