search
Log In
1 vote
507 views
The number of ways in which n distinct objects can be put into two identical boxes so that no box remains empty, is

a) 2^n - 1

b) 2^n - 2

c) 2^(n-1) - 1

d) None of these

Please explain your answer.
in Combinatory
retagged by
507 views
0
is it c? i just try with example
0
yes the ans is c.

1 Answer

2 votes




S(n,2) =  2^(n-1) - 1

http://www.careerbless.com/aptitude/qa/permutations_combinations_imp7.php
Follow this link, to know it in detail.


edited by
0
Got it.2^n - 2 ways if the boxes are not identical. But why did you subtract one for identical boxes case.Shouldn't we divide by two for identical boxes case to counter case which now will be similar due to identical boxes.
0
I have edited the answer. See.
0

Doubt in a similar question.

How many ways are there to distribute five distinguishable objects into three indistinguishable boxes?


Can we solve it like following?

First, we calculate the no of ways of distributing 5 distinct objects in 3 distinct boxes which are = $3^{5}$ and then we divide it with 3! as we can label the boxes in 3! ways.

Final answer=$3^{5}$ /3!


I know that using the formula of Stirling numbers of the second kind, it can be solved as S(5,1)+S(5,2)+S(5,3). But can the method stated above be used? 

0
In S(k,n) what is S.How do we calculate such expression?
1
In S(k,n), S is the Stirling number of the second kind

Stirling numbers of the second kind obey the recurrence relation

S(k,n)= 1, if k>0 and n=1

            1, if k=n

            n*S(k-1,n)+S(k-1,n-1), 0<=n<=k

Related questions

0 votes
2 answers
1
130 views
#COMB There are $4$ boys and $6$ prizes are to be distributed among them such that each has at least $1$ prize. How many ways that can be done? My solution: $\text{Case 1 : 3 1 1 1}$ $\text{Case 2 : 2 2 1 11}$ ... My doubt is in the second case, am I not considering the prizes to be indistinguishable? I am confused in this regard. Please help me clear this doubt.
asked May 25, 2018 in Combinatory Abhisek Das 130 views
0 votes
1 answer
2
2 votes
1 answer
3
118 views
In how many different ways can a set A of 3n elements be partitioned into 3 subsets of equal number of elements? My approach : The number of permutations of n objects with n1 identical objects of type 1, n2 identical objects of type 2, , and n3 identical objects of type is n!/n1!n2!n3! Here ... is 3n)!/6* (n!)^3 How did again 6 come in denominator , why is he arranging again in 6 i..e., 3! ways ??
asked Jan 25, 2018 in Mathematical Logic Anjan 118 views
0 votes
1 answer
4
89 views
How many ways the letters of the word “AABCCD” can be arranged such that, these neither begin with ‘A’ nor end with D ?
asked Jan 15, 2019 in Combinatory Satbir 89 views
...