Let’s continue our discussion on combinations today. From the previous posts, we understand that combination is nothing but “selection.” Today we will discuss a concept that confuses a lot of people. It is similar to making committees (that we saw last week), but with a difference. Read the two questions given below:

Question 1: In how many ways can one divide 12 different chocolate bars equally among four boys?

Question 2: In how many ways can one divide 12 different chocolate bars into four stacks of 3 bars each?

Do you think the 2 questions are the same and the answer would be the same in both cases? After all, once you divide the chocolates into four stacks, it doesn’t matter who you give them to! Actually, it does! The two questions are different. Since the chocolates are different, the four stacks will be different. So how you distribute the stacks among the 4 boys is material.

Let us take a simple case first.

Say, there are just 4 chocolate bars: A, B, C, D

We want to split them in 2 groups containing 2 chocolate bars each. There are two ways of doing this:

Method I

In group 1, we can put any 2 chocolate bars and we will put the remaining 2 chocolate bars in group 2.

We could put them in two distinct groups in the following 6 ways:

1. Group1: A and B, Group2: C and D

2. Group1: C and D, Group2: A and B (If you notice, this is the same as above. The only difference is that A and B is group 2 and C and D is group 1 here)

3. Group1: A and C, Group2: B and D

4. Group1: B and D, Group2: A and C (This is the same as above. The only difference is that A and C is group 2 and B and D is group 1 here)

5. Group1: A and D, Group2: B and C

6. Group1: B and C, Group2: A and D (Again, this is the same as above. Here, B and C is group 2 and A and D is group 1)

We have to put the four chocolates in two different groups, group 1 and group 2. It is similar to distributing 4 chocolates between 2 boys equally. Boy 1 could get (A and B) or (C and D) or (A and C) or (B and D) or (A and D) or (B and C). Boy 2 gets the other 2 chocolates in each case.

Method II

The two groups can be made in the following three ways:

A and B, C and D

A and C, B and D

A and D, B and C

In this case, the groups are not named/distinct. You have 4 chocolates in front of you and you just split them in 2 groups. (A and B, C and D) is the same as (C and D, A and B). There are a total of 3 ways of doing this i.e. half of the number of ways we saw in method 1. It is logical, isn’t it? You divide the answer you get above by 2! because the two groups are not distinct in this case.

Let’s look at the original two questions now:

Question 1: In how many ways can one divide twelve different chocolate bars equally among four boys?

You need to divide 12 chocolate bars among four boys i.e. you have to make four *distinct* groups. To boy 1, you can give the first chocolate in 12 ways, the second chocolate in 11 ways and the third chocolate in 10 ways. But we don’t want to arrange the chocolates so you can select 3 chocolates for boy 1 in 12*11*10/3! ways (this is equivalent to ^{12}C_{3} if you follow the formula). Similarly, you can select 3 chocolates for the second boy in 9*8*7/3! ways (i.e. ^{9}C_{3}), for the third boy in 6*5*4/3! ways (i.e. ^{6}C_{3}) and for the fourth boy in 3*2*1/3! ways (i.e. ^{3}C_{3})

Therefore, you can distribute 12 chocolates among 4 boys equally in (12*11*10/3!) * (9*8*7/3!) * (6*5*4/3!) * (3*2*1/3!) = 12!/(3!*3!*3!*3!) ways

Alternatively, you can visualize putting the 12 chocolates in a row in 12! ways and drawing a line after every three chocolates to demarcate the groups.

OOO l OOO l OOO l OOO

Since the chocolates within the groups are not arranged, we divide 12! by 3! for every group. Since there are 4 groups, number of ways of making 4 distinct groups = 12!/(3!*3!*3!*3!)

Question 2: In how many ways can one divide 12 different chocolate bars into four stacks of 3 bars each?

What do you think will the answer be here? Will it be the same as above? No. Here the 4 stacks are not distinct. You need to divide the answer you obtained above by 4! (similar to the simple example with just 4 chocolates we saw above).

In this case, the required number of ways = 12!/(3!*3!*3!*3!*4!)

Since the groups are not distinct here, your answer changes. When the question says that you need to make *n* groups/bundles/teams that are not distinct, you need to divide by (n!). If the groups/bundles/teams are distinct then you do not divide by (n!).

Let’s look at another question that uses the same concept.

Question 3: 8 friends want to play doubles tennis. In how many different ways can the group be divided to make 4 teams of 2 people each?

(A) 420

(B) 2520

(C) 168

(D) 90

(E) 105

Solution: It is quite clear here that the teams are not distinct i.e. we don’t have team 1, team 2 etc. But let’s solve this question by first making team 1, team 2, team 3 and team 4. Later we will adjust the answer.

Out of 8 people, in how many ways can we make team 1? In 8*7/2! ways (i.e. ^{8}C_{2}).

Out of 6 people, in how many ways can we make team 2? In 6*5/2! ways (i.e. ^{6}C_{2}).

Out of 4 people, in how many ways can we make team 3? In 4*3/2! ways (i.e. ^{4}C_{2}).

Out of 2 people, in how many ways can we make team 4? In 2*1/2! ways (i.e. ^{2}C_{2}).

In how many ways can we make the 4 teams? In 8*7*6*5*4*3*2*1/(2!*2!*2!*2!) = 8!/(2!*2!*2!*2!) ways. But here, we have considered the 4 teams to be distinct. Since the teams are not distinct, we will just divide by 4!

We get 8!/(2!*2!*2!*2!*4!) = 105

Answer (E)

I hope the explanation makes sense. We will continue with Combinatorics next week. I told you that once we get into it, it takes a long time to get out of it!

*Karishma, a Computer Engineer with a keen interest in alternative Mathematical approaches, has mentored students in the continents of Asia, Europe and North America. She teaches **GMAT prep** for Veritas Prep and regularly participates in content development projects such as this blog!*

## 6 thoughts on “Quarter Wit, Quarter Wisdom: Using Combinations to Make Groups”

Comments are closed.

Hi Karishma,

I understand that it is very important to know whether the groups are distinct or identical. Hence, posting this question to clarify the concept.

In question 3, I couldn’t understand the first line of the solution i.e.

“It is quite clear here that the teams are not distinct i.e. we don’t have team 1, team 2 etc.”

What framework do you employ in order to understand whether the groups/teams are distinct or identical.

Also, what would the wording of question be if the same question asks for distinct teams?

Please provide your insights.

Thanks

H

Hi Karishma,

In all of the above examples, even I couldnt comprehend how did you term the groups as distinct and not distinct.

Please explain

When you need to divide something among 4 people, we are clear that the 4 people are distinct. Boy A and Boy B are different.

If you have different chocolates (say a Mars bar, a snicker, a lindt’s, a toblerone, a galaxy, a flake, a milkybar etc) and you divide them into 4 groups, the distribution will be different in case the first stack (say which has a Mars bar, a snicker, a lindt’s and a toblerone) goes to Boy A or the first stack goes to Boy B.

In case you have to split some people among teams, say when the class teacher splits students in 4 teams for a game, the groups are not distinct. But if the teacher splits the students in 4 teams for 4 different sports say, this team is selected for basketball, this team for tennis etc then the teams are distinct. If boys A, B, C and D make a team, whether they are selected for basketball or for tennis – the selection is distinct.

Similarly, if you select 6 teams to participate in a quiz, the teams are not distinct. But if you have to allot people to red, green, blue, yellow, pink and red teams, the selection will be different depending on which team gets which group.

Karishma, your explanation is very helpful. Thank you so much.

Hi Karishma,

In the sack example, how do we know that the sacks are not distinct?

I

Stacks are just groups. You don’t have 4 containers of different colors in which you need to put the chocolates. We cannot distinguish them as stack1, stack 2 etc. Any stack can be stack 1, any can be stack 2. This is similar to the case in which we choose 2 teams to play tennis. One team plays against the other – there is no team 1 and team 2.