There are $(n + 1)$ white balls and $(n + 1)$ black balls. Each ball is numbered from $1$ to $(n + 1)$. In how many ways can these balls be arranged in a row such that no two balls of the same color are adjacent?

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

Explore More

Similar Questions

The sum of all possible numbers that can be formed by using the digits $2, 3, 5, 7$ without repetition of digits is

$^{80}C_{40}$ is not divisible by -

For a natural number $n$,$(n!)^2 > n^n$ is true if:

The total number of $3$-digit numbers,whose greatest common divisor with $36$ is $2$,is

If all the letters of the word $ACADEMICIAN$ are permuted in all possible ways,then the number of permutations in which no two $A$'s are together and all the consonants are together 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