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

  • A
    $(2n + 2)!$
  • B
    $(2n + 2)! \times 2$
  • C
    $(n + 1)! \times 2$
  • D
    $2\{(n + 1)!\}^2$

Explore More

Similar Questions

If $n$ is even and the value of $^nC_r$ is maximum,then $r = $

An eight-digit number divisible by $9$ is to be formed using digits from $0$ to $9$ without repeating the digits. The number of ways in which this can be done is: (in $(7!)$)

Difficult
View Solution

The solution set of $^{10}C_{x-1} > 2 \cdot ^{10}C_x$ is

Difficult
View Solution

In how many ways can $10$ true-false questions be replied?

If $^{43}C_{r-6} = ^{43}C_{3r+1}$,then the value of $r$ is

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo