There are (n + 1) white and (n + 1) black bal | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) Since the balls are to be arranged in a row such that adjacent balls are of different colours,we can start the arrangement with either a white bal

Vedclass · Accepted Answer

$2\{(n + 1)!\}^2$

Vedclass · Answer

(D) Since the balls are to be arranged in a row such that adjacent balls are of different colours,we can start the arrangement with either a white ball or a black ball.Case $1$: If we start with a white ball,the $(n + 1)$ white balls can be arranged in $(n + 1)!$ ways. This creates $(n + 2)$ possible positions (including ends) for the black balls. However,to ensure alternating colours,the $(n + 1)$ black balls must occupy the $(n + 1)$ specific gaps between the white balls. These $(n + 1)$ black balls can be arranged in these gaps in $(n + 1)!$ ways.Thus,the total arrangements starting with a white ball is $(n + 1)! 	imes (n + 1)! = \{(n + 1)!\}^2$.Case $2$: Similarly,if we start with a black ball,the total arrangements will be $(n + 1)! 	imes (n + 1)! = \{(n + 1)!\}^2$.Total arrangements = $\{(n + 1)!\}^2 + \{(n + 1)!\}^2 = 2\{(n + 1)!\}^2$.

There are $(n + 1)$ white and $(n + 1)$ black balls,each set numbered $1$ to $(n + 1)$. The number of ways in which the balls can be arranged in a row so that the adjacent balls are of different colours is

Similar Questions

The number of ways in which four letters of the word '$MATHEMATICS$' can be arranged is given by

Find the number of triangles formed by $12$ points (out of which $4$ are collinear) in a plane.

$A$ committee of $12$ is to be formed from $9$ women and $8$ men in which at least $5$ women have to be included in a committee. Then the number of committees in which the women are in majority and men are in majority are respectively

$A$ box contains $2$ white balls,$3$ black balls and $4$ red balls. In how many ways can $3$ balls be drawn from the box,if at least one black ball is to be included in the draw?

In how many ways can $n$ books be arranged in a row so that two specified books are not together?

Vedclass Test Series

Exam Paper Generator

Online Exam Module