1. Tardigrade
  2. Question
  3. Mathematics
  4. There are two girls Rina and Tina having n1 and n2 distinct numbers of toys respectively. The number of ways in which they can exchange their toys so that after exchanging they have the same number of toys with them but not the same toys, is

Question Error Report

Thank you for reporting, we will resolve it shortly

Back to Question

Q. There are two girls Rina and Tina having $n_1$ and $n_2$ distinct numbers of toys respectively. The number of ways in which they can exchange their toys so that after exchanging they have the same number of toys with them but not the same toys, is

Permutations and Combinations

Solution:

Let us mix the toys making $(n_1 + n_2)$ number of distinct toys in all. Now, Rina can pick up $n _1$ toys out of these $(n_1+ n_2)$ toys in $^{n_{1}+n_{2}}C_{n_1} $ ways which includes one way in which she can pick up her own original toys.
$\therefore $ Required number of ways $^{n_{1}+n_{2}}C_{n_1} - 1$.