Question
Question: The number of ways in which n distinct objects can be put in two different boxes so that neither of ...
The number of ways in which n distinct objects can be put in two different boxes so that neither of the boxes is empty is
A
2n
B
2n – 1
C
2n + 1
D
2n – 2
Answer
2n – 2
Explanation
Solution
Each object can be dealt in two ways; it may be put in the first box or in the second box. Hence, the total number of ways = 2 x 2 x 2 x ... n times = 2n.