Home
Class 12
MATHS
There are two bosy B(1) and B(2). B(1) a...

There are two bosy `B_(1)` and `B_(2)`. `B_(1)` and `n_(1)` different toys and `B_(2)` and `n_(2)` different toys. Find the number of ways in which `B_(1)` and `B_(2)` can exchange their toys in such a way that after exchanging they still have same number of toys but not the same set.

A

`""^(m+n)C_(m)`

B

`""^(m+1)C_(m-1)`

C

`""^(m+n)P_(n)`

D

none of these

Text Solution

Verified by Experts

The correct Answer is:
B
Promotional Banner

Topper's Solved these Questions

  • MODEL TEST PAPER 2

    MTG-WBJEE|Exercise CATEGORY 2 : SINGLE OPTION CORRECT TYPE|15 Videos

  • MODEL TEST PAPER 2

    MTG-WBJEE|Exercise CATEGORY 3 : One or More than One Option Correct Type|10 Videos

  • MODEL TEST PAPER 1

    MTG-WBJEE|Exercise CATEGORY 3 : One or More than One Option Correct Type|10 Videos

  • MODEL TEST PAPER 3

    MTG-WBJEE|Exercise CATEGORY 3 : One or More than One Option Correct Type|10 Videos

Similar Questions

Explore conceptually related problems

Find the number of ways in which 8 distinct toys can be distributed among 5 children.

n different toys have to be distributed among n children.Find the number of ways in which these toys can be distributed so that exactly one child gets no toy.

n different toys have to be distributed among n children.Find the number of ways in which these toys can be distributed so that exactly one child gets no toy.

The number of ways in which 6 different toys can be distributed in two children if each child gets none one or more number of toys is also equal to

Given A and B (n(A) gt n(B)) are two non-empty sets. Find the number of elements in A such that 2^(n(A)- n(B)) = 96 .

The number of ways in which 15 identical toys can be distributed among 3 children so that each of them gets at least two toys is equal to

Number of ways in which 6 different toys can be evenly divided between Ram and Shyam

7 distinct toys are distributed among 4 boys in such a way that any three get each 2 toys and forth gets 3 toys. Find No of ways.