Discrete Mathematics

LECTURE 28, 29
COMBINATORICS:
The DIVISION Rule
Course Instructor:
1 Rida Memon
Basic Counting Principles

There are FOUR basic counting principles:

1. The SUM Rule

2. The PRODUCT Rule

3. The SUBTRACTION Rule

4. The DIVISION Rule

2
The DIVISION Rule

 There are n/d ways to do a task, if it can be done using a

procedure that can be carried out in n ways, and for
every way m, exactly d of the n ways correspond to way
m.

 If n ways are feasible to do a task, but each of the n ways

is the same as any of d ways based on a counting
criterion, then there are only n/d ways to do the task.

 In other words, if a set A has n elements and is

partitioned by the collection {A1, A2,…,Ad}, where each
partition set has m elements, then m=n/d.
3
Example

How many different ways are there to seat four people

around a circular table, where two seatings are
considered the same when each person has the same left
neighbor and the same right neighbor?

Solution:
Four people to be seated around a round table in
4.3.2.1=4!=24 ways. However, ignoring the repeated same
arrangements, there are a total of 24/4=6 ways.

4
Explanation

A
1
A B C D

D 4 2
B
3

C
5
Explanation

A
1
A B C D
A B D C

C 4 2
B
3

D
6
Explanation

A
1
A B C D
A B D C

D C
A C B D
4 2

B
7
Explanation

A
1
A B C D
A B D C

B C
A C B D
4 2 A C D B

D
8
Explanation

A
1
A B C D
A B D C

C D
A C B D
4 2 A C D B
A D B C

B
9
Explanation

A
1
A B C D
A B D C

B D
A C B D
4 2 A C D B
A D B C
A D C B

C
10
 Explanation

B A
A
B
B
C
D
D
C
B
B
A
A
C
D
B
C
1 A C B D B C A B
A C D B B C D A
A D B C B D A C

- 4 2
- A D C B B D C A

- Similarly, if B is at position 1,
There are 6 more arrangements
11
 Explanation

C or D A
A
B
B
C
D
D
C
B
B
A
A
C
D
B
C
1 A C B D B C A B
A C D B B C D A
A D B C B D A C

- 4 2
- A

C
D

A
C

B
B

D
B

D
D

A
C

B
A

C
C A D B D A C B
C B A D D B A C
3
C B D A D B C A

- C
C
D
D
A
B
B
A
D
D
C
C
A
B
B
A

Same is the case for C and D.

12
 Explanation

We can explain this example in another way.

1 2 3 4
4 options 3 options 2 options 1 option

So, we have 4 x 3 x 2 x 1 = 4! Or 24 combinations.

13
Explanation

1 2 3 4
4 options 3 options 2 options 1 option

A B C D

B C D

C D

D
14
 C D

Explanation B

A
D C

B D
C C

A B C D D B
A B D C D
A C B D
A C D B
A D B C B C
A D C B
D
15

C B
 Explanation

 Similarly, the complete list can be generated.

- A
A
B
B
C
D
D
C
B
B
A
A
C
D
B
C
1 A C B D B C A B
A C D B B C D A
A D B C B D A C

- -
A D C B B D C A
4 2
C A B D D A B C
C A D B D A C B
C B A D D B A C
3 C B D A D B C A

-
C D A B D C A B
C D B A D C B A
16
 Explanation
Ignoring same arrangements:

A B
1 1 A B C D B A C B
A B D C B A D C
D4 2 B A4 2 C A
A
C
C
B
D
D
B
B
B
C
C
A
D
B
A
A D B C B D A C
3 3
A D C B B D C A
C D
C D C
C
A
A
B
D
D
B
D
D
A
A
B
C
C
B
C B A D D B A C
1 1 C B D A D B C A

B4 2 D C4 2 A C
C
D
D
A
B
B
A
D
D
C
C
A
B
B
A
17
3 3
 Explanation

At the end, we are left with only first 6

arrangements. A B C D B A C B
A B D C B A D C
A C B D B C A B
A C D B B C D A
A D B C B D A C
A D C B B D C A
Now, we will try to relate this result with
our definitions. C A B D D A B C
C A D B D A C B
Here, C B A D D B A C
C B D A D B C A
n=24 C D A B D C A B
d=4 C D B A D C B A
m=6 18
 Explanation

 There are m=n/d ways to do a task,

if it can be done using a procedure A B C D B A C B
that can be carried out in n ways, A B D C B A D C
A C B D B C A B
and for every way m, exactly d of
A C D B B C D A
the n ways correspond to way m. A D B C B D A C
A D C B B D C A

Here, C A B D D A B C
C A D B D A C B
n=24
C B A D D B A C
d=4 C B D A D B C A
C D A B D C A B
m=n/d=6 C D B A D C B A
19
 Explanation

 If n ways are feasible to do a task,

but each of the n ways is the same A B C D B A C B
as any of d ways based on a counting A B D C B A D C
A C B D B C A B
criterion, then there are only m=n/d
A C D B B C D A
ways to do the task. A D B C B D A C
A D C B B D C A

Here, C A B D D A B C
C A D B D A C B
n=24
C B A D D B A C
d=4 C B D A D B C A
C D A B D C A B
m=n/d=6 C D B A D C B A
20
 Explanation

 In other words, if a set A has n

elements and is partitioned by the A B C D B A C B
collection {A1, A2,…,Ad}, where each A B D C B A D C
A C B D B C A B
partition set has m elements, then A C D B B C D A
m=n/d. A D B C B D A C
A D C B B D C A

Here, C A B D D A B C
C A D B D A C B
n=24 C B A D D B A C
d=4 C B D A D B C A
C D A B D C A B
m=n/d=6 C D B A D C B A
21
Practice Questions

1. How many different ways are there to seat five people around a
circular table, where two seatings are considered the same when
each person has the same left neighbor and the same right
neighbor?

2. What is the answer if these five persons are arranged in a straight

line where:
a) Left-to-right order is important
b) Only the placements that result in distinct adjacencies are considered
like ABCDE=EDCBA

3. There are 15 different sandwich and drink combinations for a

lunch. If the choice of a drink does not matter, and there are
three drink choices, what is the number of ways to pick a lunch?
22
Reading Assignment

 Chapter 6
 Section 6.1
 Page 394 - 395

23
Thanks

 End of Lecture
 Q/As

24