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

$^n{P_r} \div ^n{C_r} = $

The difference between an integer $n$ and its cube $n^3$ is always divisible by which of the following?

$9$ balls are to be placed in $9$ boxes. $3$ boxes are so small that they cannot hold $5$ balls. In how many ways can one ball be placed in each box?

Difficult
View Solution

The number of integers between $1$ and $10^{10}$ (inclusive) that contain the digit $1$ is:

If $x$ and $y$ represent the number of arrangements of the letters of the word $ATRAPATRAM$ such that $(i)$ all $A$'s are together and $(ii)$ no two $A$'s are together respectively,then $x+y$ is equal to:

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