0

Guest

Courses New

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
25750 Points
6 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 ?

Other Related Questions on Analytical Geometry

View all Questions »

ASK QUESTION

Get your questions answered by the expert for free

Answer and earn gift vouchers

Win Gift vouchers upto Rs 500/-

View courses by askIITians

Design classes One-on-One in your own way with Top IITians/Medical Professionals

Click Here Know More

Complete Self Study Package designed by Industry Leading Experts

Click Here Know More

Live 1-1 coding classes to unleash the Creator in your Child

Click Here Know More

a Complete All-in-One Study package Fully Loaded inside a Tablet!

Click Here Know More