Home
Class 12
MATHS
The total number of ways in which n^2...

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

A

`""^(n^(2))C_(n - 1)`

B

`""^(n^(2)-1) C_(n-1)`

C

`(n^(2) + n -2)/(2)C_(n-1)`

D

`n !`

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

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

The number of ways in which n distinct balls can be put into three boxes, is

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-1C_(n+1) c. ^2n-1C_n d. none of these

The total number of ways of distributing n identical balls among k diferent boxes if each box can hold ny number of balls is (A) k^n (B) n^k (C) |__(k+n-1)/(|__(k-1)|__n) (D) |__(k+n-1)\(|__k|__(n-1))

The middle term in the expansion of ((2x)/3-3/(2x^2))^(2n) is a. \ ^(2n)C_n b. (-1)^n\ ^(2n)C_(n\ )x^(-n) c. \ ^(2n)C_n x^(-n) 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

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

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

The number of possible outcomes in a throw of n ordinary dice in which at least one of the die shows and odd number is a. 6^n-1 b. 3^n-1 c. 6^n-3^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