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

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

Explore More

Similar Questions

The value of ${}^{47}C_4 + \sum_{j=1}^5 {}^{(52-j)}C_3$ is

The number of different words that can be formed using all the letters of the word $APPLICATION$ such that no two vowels come together is -

$A$ linguistic club consists of $6$ girls and $4$ boys. $A$ team of $4$ members is to be selected from this group including the selection of a leader (from among these $4$ members) for the team. If the team has to include at most one boy,the number of ways of selecting the team is

If $^nC_r = ^nC_{r-1}$ and $^nP_r = ^nP_{r+1}$,then the value of $n$ is

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?

Difficult
View Solution

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