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(2n ,n)` must be equal to a. `^2n C_n` b. `^2n-1C_(n+1)` c. `^2n-1C_n` d. none of these

Promotional Banner

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

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(2n,n) must be equal to a.^(2n)C_(n) b.^(2n-1)C_(n+1) c.^(2n-1)C_(n) d.none of these

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

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

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

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 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

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

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

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