Home
Class 11
MATHS
Let f(n ,k) denote the number of ways ...

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

Promotional Banner

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

The total number of ways in which n^2 number of identical balls can be put in n numbered boxes (1,2,3,.......... n) such that ith box contains at least i number of balls is a. .^(n^2)C_(n-1) b. .^(n^2-1)C_(n-1) c. .^((n^2+n-2)/2)C_(n-1) d. none of these

If ""^n C_3+ ""^n C_4 > ""^(n+1)C_3 , then a. n >6 b. n >7 c. n 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

The value of (""^(n) C_(1)+2. ""^(n) C_(2)+3. ""^(n)C_(3)+…+ n""^(n)C_(n)) is-

Prove that ^nC_0 "^(2n)C_n-^nC_1 ^(2n-2)C_n +^nC_2 ^(2n-4)C_n =2^n

There are (n+1) white and (n+1) black balls, each set numbered 1ton+1. The number of ways in which the balls can be arranged in a row so that the adjacent balls are of different colors is a. (2n+2)! b. (2n+2)!xx2 c. (n+1)!xx2 d. 2{(n+1)!}^2

Prove that sum_(k=0)^(n) (-1)^(k).""^(3n)C_(k) = (-1)^(n). ""^(3n-1)C_(n)

2n boys are randomly divided into two subgroups containint n boys each. The probability that the two tallest boys are in different groups is a. n//(2n-1) b. (n-1)//(2n-1) c. (n-1)//4n^2 d. none of these

The total number of ways in which 2n persons can be divided into n couples is a. (2n !)/(n ! n !) b. (2n !)/((2!)^3) c. (2n !)/(n !(2!)^n) d. none of these

Let A be an nth-order square matrix and B be its adjoint, then |A B+K I_n| is (where K is a scalar quantity) a. (|A|+K)^(n-2) b. (|A|+K)^n c. (|A|+K)^(n-1) d. none of these

CENGAGE PUBLICATION-PERMUTATIONS AND COMBINATIONS-All Questions
  1. In how many ways can 17 persons depart from railway station in 2 ca...

    Text Solution

    |

  2. The number of ways in which three distinct numbered in an increasing A...

    Text Solution

    |

  3. Let f(n ,k) denote the number of ways in which k identical balls c...

    Text Solution

    |

  4. In a polygon, no three diagonals are concurrent. If the total number...

    Text Solution

    |

  5. Straight lines are drawn by joining m points on a straight line of ...

    Text Solution

    |

  6. A man has three friends. The number of ways he can invite one frien...

    Text Solution

    |

  7. The sum of all the numbers of four different digits that can be mad...

    Text Solution

    |

  8. The sum of digits in the unit's place of all numbers formed with th...

    Text Solution

    |

  9. A person has n friends. The minimum value of n so that a person can in...

    Text Solution

    |

  10. There are n distinct white and n distinct black ball. If the number ...

    Text Solution

    |

  11. Numbers from 1 to 1000 are divisible by 60 but not by 24 is .

    Text Solution

    |

  12. If the number of ways in which the letters of the word ABBCABBC can...

    Text Solution

    |

  13. A class has three teachers, Mr. P , Ms. Q, and Mrs. R and six stude...

    Text Solution

    |

  14. Column I, Column II The number of five-digit numbers having the ...

    Text Solution

    |

  15. The number of words of four letters containing equal number of vowe...

    Text Solution

    |

  16. The number of ways in which we can select four numbers from 1 to 30...

    Text Solution

    |

  17. The total number of three-letter words that can be formed from the ...

    Text Solution

    |

  18. The number of different seven digit numbers that can be written using ...

    Text Solution

    |

  19. The number of ways of arranging m positive and n(lt m+1) negative si...

    Text Solution

    |

  20. The number of ways to fill each of the four cells of the table with a ...

    Text Solution

    |