in Combinatory edited by
613 views
4 votes
4 votes

How many ways can the letters $\{a,b,c,d,e\}$ be placed into $3$ identical boxes such that no box is empty?

in Combinatory edited by
613 views

3 Comments

150?
0
0
what is the right answer?
0
0

25 @arch

0
0

2 Answers

7 votes
7 votes
Best answer

There are 5 letters {a,b,c,d,e} are given.The boxes are identical.

Given that no box is empty.There are 2 possible cases for putting letter into boxes

a. 2, 2, 1

b. 3, 1, 1

Case A.  2, 2, 1

first Two letters out of the 5 can be selected in $5_{{C}_{2}}$ ways. Another 2 out of the remaining 3 can be selected in   $3_{{C}_{2}}$ways and for the last latter, there is only one choice.

So.total Number of ways =$\frac{5_{{C}_{2}} \times 3_{{C}_{2}} \times 1}{2}$

                                        =$15$

Case B.  3,1,1

Three letters out of the 5 can be selected in  $5_{{C}_{3}}$ ways. For remaining boxes, there is one choice for each.

So,total number of ways = $5_{{C}_{3}} \times 1 \times 1 =10$

Total ways in which the 5 letters can be placed in 3 identical boxes =15+10 =25

selected by

4 Comments

Sir, why have you divided by 2 in case 1 ?

0
0
the boxes are identical, the two different ways of selecting which box holds the first two letters and which one holds the second set of two letters will look the same. Hence, we need to divide the result by 2.
0
0
Sir , So its 2! or just 2 ?
0
0
Thank you so much for explaining.
1
1
1 vote
1 vote
you can also solve by assuming that these boxes are different ......and way of distributing these 5 balls in 3 different boxes is 150......since the boxes are same divide it by 3!.......ans is 25

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true