There are $m$ books in black cover and $n$ books in blue cover, and all books are different. The number of ways these $(m+n)$ books can be arranged on a shelf so that all the books in black cover are put side by side is

  • [KVPY 2020]
  • A

    $m ! n !$

  • B

    $m !(n+1) !$

  • C

    $(n+1) !$

  • D

    $(m+n) !$

Similar Questions

How many words can be made from the letters of the word $BHARAT$ in which $ B $ and $H$ never come together

  • [IIT 1977]

Let $S=\{1,2,3, \ldots ., 9\}$. For $k=1,2, \ldots \ldots, 5$, let $N_K$ be the number of subsets of $S$, each containing five elements out of which exactly $k$ are odd. Then $N_1+N_2+N_3+N_4+N_5=$

  • [IIT 2017]

Total number of $6-$digit numbers in which only and all the five digits $1,3,5,7$ and $9$ appear, is 

  • [JEE MAIN 2020]

Find the number of ways in which two Americans, two British, One Chinese, One Dutch and one Egyptian can sit on a round table so that person of the same nationality are separated?

$^n{C_r}{ + ^{n - 1}}{C_r} + ......{ + ^r}{C_r}$ =