Guest

Find the number of ways in which n distinct objects can be put into two indentical boxes so that no box remains empty a.AP b.GP c.HP d..none of these

Find the number of ways in which n distinct objects can be put into two indentical boxes so that no box remains empty
 
 

a.AP

 

b.GP

 

c.HP

 

d..none of these

Grade:12

1 Answers

Arun
25757 Points
5 years ago
Dear student
 

The only change needed if the two boxes are identical is to divide the number of ways by two, since swapping boxes produces two different cases when the boxes (as well as the objects) are distinct.

So

2n-1 - 1 ways to fill the two identical boxes subjected to having neither empty.
 
 
Regards
Arun (askIITians forum expert)
 

Think You Can Provide A Better Answer ?