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 sum of the four-digit even numbers that can be formed with the digits $0, 3, 5, 4$ without repetition is:

$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

$A$ person forgets his $4-$digit $ATM$ pin code. But he remembers that in the code all the digits are different,the greatest digit is $7$ and the sum of the first two digits is equal to the sum of the last two digits. Then the maximum number of trials necessary to obtain the correct code is $...........$.

Let $S$ denote the set of $4$-digit numbers $abcd$ such that $a > b > c > d$ and $P$ denote the set of $5$-digit numbers having the product of its digits equal to $20$. Then $n(S) + n(P)$ is equal to:

The sum of all possible numbers that can be formed by using the digits $2, 3, 5, 7$ without repetition of digits 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