Little Johnny is going to attend a party and he needs to choose a pair of shoes that will suit him. In his shoe rack, he has a total of 8 pairs of distinct shoes. To help him decide, he asked his dad to choose 5 pairs of shoes at random. However, he was still unsure of what to wear, so he asked his mum to choose another 3 pairs out of the 5 chosen pairs at random. Suppose, we do not know which 5 pairs were chosen by his dad and which 3 pairs were chosen in the end, how many possible ways could there be for the 3 pairs of shoes to be chosen at random in the end?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The C(8, 5) = 56 combinations can have 3 or 4 shoes common. Say, for e.g., ABCDE and ABCDF and so. all the 10 combinations for each of those 56 are NOT mutually exclusive. I say the answer can not be more than C(8,3) = 56. What's your opinion?
Log in to reply
Whilst what you say is correct, the question asks how many ways we can get to the resulting 3 pairs of shoes, not necessarily how many unique combinations of 3 pairs of shoes we could end up with. If we were simply looking for how many unique combinations of 3 pairs of shoes there were, it would just be as simple as 8C3.
A SMALL MISTAKE SPOILT MY SOLUTION I TOOK 8C3 AS 112
We'll take 5 pairs from the 8 pairs of shoes. This is 5 ! ⋅ 3 ! 8 ! = 5 6 . For each of these 5 6 combinations, we can take 3 pairs, and this is 3 ! ⋅ 2 ! 5 ! = 1 0 . Finally, there are 5 6 0 possible ways for the 3 pairs of shoes to be chosen at random in the end.
The C(8, 5) = 56 combinations can have 3 or 4 shoes common. Say, for e.g., ABCDE and ABCDF and so. all the 10 combinations for each of those 56 are NOT mutually exclusive. I say the answer can not be more than C(8,3) = 56. What's your opinion?
Log in to reply
But although they're not mutually exclusive, they come from a different combination. Doesn't that means that is a different way of having the final 3 pairs? I understand your point, it's true and interesting.
Totally agree mate.
Very good observation.
Totally agree wid u Shamik banerjee. The question itself is wrong
Agree with @Shamik Banerjee
slightly different method: 3 different pairs from 8=8c3(Mom's final choice) and the 2 which mom did not select but dad selected=5c2(dad chose 5 out of which 2 were not selected)
Log in to reply
I think the question only wants to know the no of ways we get the last 3 shoes irrespective of the 2 shoes left out, so we should not worry about the 2 shoes that dad selected and mom did not. In that case answer is 56
No. of possible ways = ( 8C3 ) * ( 5C3 ) = 560 ways
Out of 8 pair he asked his father to choose 5 pairs, therefore, no.of ways of selecting 5 pairs = 8C5 = 56
Now, he asked his mom to select another 3 pair, therefore, no. of ways = 5C3 = 10
Total no. of ways = 56 * 10 = 560
Selection of 5 objects from 8 dinstinct objects is possible in 56 ways while selection of 3 from those 5 is only possible in 10 ways. Thus giving us 56x10 possible ways for the two events happening together.
answer is 8C5 * 5C3
cause, dad can choose 5 pair of shoes in 8C5 ways
and for each combinat of ion of 5 pairs , his mother can choose 3pairs of shoes in 5C3 ways
so, ans= 8C5*5C3=560
Problem Loading...
Note Loading...
Set Loading...
"he asked his dad to choose 5 pairs (from 8 pairs) of shoes at random." so, we get
= 8 C 5
= ( 5 ! ) ( 8 − 5 ) ! 8 !
= ( 5 × 4 × 3 × 2 × 1 ) ( 3 × 2 × 1 ) 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1
= 5 6
"he asked his mum to choose another 3 pairs out of the 5 chosen pairs at random. " So, we get
= 5 C 3
= ( 3 ! ) ( 5 − 3 ) ! 5 !
= ( 3 × 2 × 1 ) ( 2 × 1 ) ! 5 × 4 × 3 × 2 × 1
= 1 0
Finally, we get
= 5 6 × 1 0
= 5 6 0