FEDERAL UNIVERSITY OF TECHNOLOGY, OWERRI

SCHOOL OF PHYSICAL SCIENCES

DEPARTMENT OF MATHEMATICS
LESSON NOTE
COURSE: ELEMENTARY MATHEMATICS I (MTH 101)
TOPIC: PERMUTATION AND COMBINATION

Factorial Representation
Before we go into permutation and commination fully, let us look as an important concept called
“factorial.”
The factorial is denoted by the symbol "! "
Where, 𝑛! = 𝑛 × (𝑛 − 1) × (𝑛 − 2) … .3 × 2 × 1

Example 1:
5! = 5 × 4 × 3 × 2 × 1
8! = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1
4! = 4 × 3 × 2 × 1
Note also that 0! = 1

The factorial 𝑛 denoted by 𝑛! is a shortened representation for product of 𝑛 consecutive integers.

Example 2: Evaluate
10!
7! × 2! × 3!
Solution:
10! 10 × 9 × 8 × 7!
=
7! × 2! × 3! 7! × (2 × 1) × (3 × 2 × 1)
10 × 9 × 8 720
= = = 60
(2 × 1) × (3 × 2 × 1) 12

Example 3: Evaluate
14!
12!
Solution:
14 × 13 × 12!
= 14 × 13 = 182
12!
Example 4: Evaluate
𝑥!
(𝑥 + 1)!
Solution:
𝑥! 𝑥 × (𝑥 − 1) × (𝑥 − 2) × (𝑥 − 3) × … … × 3 × 2 × 1
=
(𝑥 + 1)! (𝑥 + 1) × 𝑥 × (𝑥 − 1) × (𝑥 − 2) × (𝑥 − 3) × … … × 3 × 2 × 1
𝑥 1
= =
(𝑥 + 1) × (𝑥) (𝑥 + 1)

Page | 1
Example 5: Evaluate
(𝑚 − 1)! 4!
(𝑚 + 2)!
Solution:
(𝑚 − 1)! 4! (𝑚 − 1)! 4!
=
(𝑚 + 2)! (𝑚 + 2) × (𝑚 + 1) × (𝑚) × (𝑚 − 1)!
4! 24!
= =
(𝑚 + 2) × (𝑚 + 1) × (𝑚) (𝑚 + 2)(𝑚 + 1)(𝑚)
Example 6: Evaluate
(𝑛 + 1)!
(𝑛 − 4)!
Solution:
(𝑛 + 1)! (𝑛 + 1) × (𝑛) × (𝑛 − 1) × (𝑛 − 2) × (𝑛 − 3) × (𝑛 − 4)!
=
(𝑛 − 4)! (𝑛 − 4)!
= (𝑛 + 1) × (𝑛) × − 1) × (𝑛 − 2) × (𝑛 − 3)
(𝑛

Example 7: Evaluate
(2𝑛)!
(2𝑛 + 2)!
Solution:
(2𝑛)! (2𝑛)!
=
(2𝑛 + 2)! (2𝑛 + 2)(2𝑛 + 1)(2𝑛)!
1
=
(2𝑛 + 2)(2𝑛 + 1)

Multiplication Rule
If one event can occur in m ways, a second event in n ways and a third event in r, then the three events
can occur in m × n × r ways.
Example 8: Erin has 5 tops, 6 skirts and 4 capsfrom which to choose an outfit. In how many ways can she
select one top, one skirt and one cap?
Solution: 𝑊𝑎𝑦𝑠 = 5 × 6 × 4
Repetition of an Event

If one event with 𝑛 outcomes occur 𝑟 times with repetition allowed, then the number of ordered
arrangements is 𝑛𝑟

Example 9: What is the number of arrangements if a die is rolled

(a) 2 times? 6 × 6 = 62
(b) 3 times? 6 × 6 × 6 = 63
(c) 𝑟 times? 6 × 6 × 6 × 6 × … = 6𝑟

Example 10: (a) How many different car number plates are possible with 3 letters followed by 3 digits?
Solution: 26 × 26 × 26 × 10 × 10 × 10 = 263 × 103
(b) How many of these number plates begin with ABC?

Page | 2
Solution: 1 × 1 × 1 × 10 × 10 × 10 = 103

(c) If a plate is chosen at random, what is the probability that it begins with ABC?
Solution:
103 1
3 3
= 3
26 × 10 26

Permutation
Definition: Permutation can be said to be the number of ways an array of objects (n) can be arranged in a
certain order taken 𝑟 at a time.

That is to say, the arrangement a, b, c is different from b, c, a., since their order varies.
A listing of 𝑛 different objetcts in a certain order taken 𝑟 at a time is called permutation.

Permutation of 𝑛 object taken 𝑟 at a time is represented by

𝑛
𝑛!
𝑟𝑃 = 𝑤ℎ𝑒𝑟𝑒 𝑟 ≤ 𝑛, 𝑟 ≥ 1
(𝑛 − 𝑟)!
Example 11: Find the number of different arrangements consisting of 3 letters each which can be formed
from the 7 letters 𝐴, 𝐵, 𝐶, 𝐷, 𝐸, 𝐹, 𝐺.
Solution:
This implies 𝑛 = 7 and 𝑟 = 3. Thus 73𝑃. Therefore,
7
7! 7! 7 × 6 × 5 × 4!
3𝑃 = = = = 7 × 6 × 5 = 210
(7 − 3)! 4! 4!
There are 210 different ways to arrange 3 letters out of 7.

Example 12: A maths debating team consists of 4 speakers.

a) In how many ways can all 4 speakers be arranged in a row for a photo?
Solution: 𝑛 = 4, and 𝑟 = 4
4
4!
4𝑃 = = 4! = 24
(4 − 4)!
b) How many ways can the captain and vice-captain be chosen?
Solution: 𝑛 = 4, and 𝑟 = 2
4
4!
2𝑃 = = 4 × 3 = 12
(4 − 2)!

Example 13: A flutter on the horses. There are 7 horses in a race.

a) In how many different orders can the horses finish?
Solution: 𝑛 = 7, and 𝑟 = 7
7
7!
7𝑃 = = 7! = 5040
(7 − 7)!
b) How many trifectas (1st, 2nd and 3rd) are possible?
Solution: 𝑛 = 7, and 𝑟 = 3
7
7!
3𝑃 = = 7 × 6 × 5 = 210
(7 − 3)!

Page | 3
 Permutations with Restrictions

Example 14: In how many ways can 5 boys and 4 girls be arranged on a bench if
a) there are no restrictions?
Solution: 𝑛 = 9, and 𝑟 = 9
9
9!
9𝑃 = = 9!
(9 − 9)!
b) boys and girls alternate?
Solution: for boys, we have 𝑛 = 5, and 𝑟 = 5, and for girls, we have 𝑛 = 4, and 𝑟 = 4
5 4
5! 4!
5𝑃 × 4𝑃 = × = 5! × 4!
(5 − 5)! (4 − 4)!

𝐵𝐺𝐵𝐺𝐵𝐺𝐵𝐺𝐵 = 5 × 4 × 4 × 3 × 3 × 2 × 2 × 1 × 1
c) boys and girls are in separate groups?
Solution: for boys, we have 𝑛 = 5, and 𝑟 = 5, and for girls, we have 𝑛 = 4, and 𝑟 = 4. But Boys and Girls
or Girls and Boys. Note, we multiply by 2 because it’s either boy first or girl in the arrangement.
5 4
5! 4!
5𝑃 × 4𝑃 × 2 = × × 2 = 5! × 4! × 2
(5 − 5)! (4 − 4)!
d) Anne and Jim wish to stay together?
Solution: 𝑛 = 8, and 𝑟 = 8. Note, we multiply by 2 because it’s either Anne first or Jim in the arrangement.
8
8𝑃 × 2

Arrangements with Repetitions

If we have 𝑛 elements of which 𝑥 are alike of one kind, 𝑦 are alike of another kind, 𝑧 are alike of another
kind, then the number of ordered selections or permutations is given by:
𝑛!
𝑥! 𝑦! 𝑧!

Example 15: How many different arrangements of the word PARRAMATTA are possible?
Solution:
10 letters but note repetition
(4 𝐴’𝑠, 2 𝑅’𝑠, 2 𝑇’𝑠)
Consider
𝑛!
𝑥! 𝑦! 𝑧!
𝑛 = 10, 𝑥 = 4, 𝑦 = 2, 𝑧=2
But 𝑃 and 𝑀 are 1 each, so we will not bother about them in the denominator.
10!
= 37,800
4! 2! 2!

Arrangements with Restrictions

Example 16: How many arrangements of the letters of the word REMAND are possible if:
a) there are no restrictions?
Solution: 𝑛 = 6, and 𝑟 = 6
6
6𝑃 = 720
b) they begin with RE?
Page | 4
Solution: if RE is taken out, we are left with 4 unrestricted letters, hence 𝑛 = 4, and 𝑟 = 4
𝑅𝐸 … … … = 44𝑃 = 24
c) they do not begin with RE?
6 4
6𝑃 − 4𝑃 = 6! − 4! = 720 − 24 = 696
d) they have RE together in order?
Solution:
(𝑅𝐸) … … … = 55𝑃 = 120
e) they have REM together in any order?
(𝑅𝐸𝑀) … … … = 33𝑃 × 44𝑃 = 3! × 4! = 144

f) R, E and M are not to be together?

Solution:
𝑇𝑜𝑡𝑎𝑙 − 144(𝑠𝑜𝑙𝑢𝑡𝑖𝑜𝑛 𝑎𝑏𝑜𝑣𝑒) = 6! − 144 = 576

Example 17: There are 6 boys who enter a boat with 8 seats, 4 on each side. In how many ways can
a) they sit anywhere?
Solution:
8
6𝑃 = 20,160
b) two boys 𝐴 and 𝐵 sit on the port side and another boy 𝑊 sit on the starboard side?
Solution:
𝐴 𝑎𝑛𝑑 𝐵 = 42𝑃, 𝑊 = 41𝑃 = 4, 𝑂𝑡ℎ𝑒𝑟𝑠 = 53𝑃 = 60
𝑇𝑜𝑡𝑎𝑙: 42𝑃 × 41𝑃 × 53𝑃
Example 18: From the digits 2, 3, 4, 5, 6
a) how many numbers greater than 4 000 can be formed?
Solution:
5 digits (any) = 53𝑃
4 digits (must start with digit ≥ 4)= 31𝑃 × 43𝑃
𝑇𝑜𝑡𝑎𝑙: 55𝑃 × 31𝑃 × 43𝑃
b) how many 4-digit numbers would be even?
Solution:
Even (ends with 2, 4 or 6) = 43𝑃 × 31𝑃

Circular Arrangements
Circular arrangements are permutations in which objects are arranged in a circle.
Consider arranging 5 objects (a, b, c, d, e) around a circular table.

To calculate the number of ways in which n objects can be arranged in a circle, we arbitrarily fix the position
of one object, so the remaining (𝑛 − 1) objects can be arranged as if they were on a straight line in (𝑛 −
1)! ways.

i.e., the number of arrangements = (𝑛 − 1)! in a circle

Example 19: At a dinner party 6 men and 6 women sit at a round table. In how many ways can they sit if:

Page | 5
a) there are no restrictions
Solution:
(12– 1)! = 11!

b) men and women alternate

Solution:
(6– 1)! × 6! = 5! × 6!
c) Ted and Carol must sit together
Solution:
(TC) and other 10 = 2! × 10!
d) Bob, Ted and Carol must sit together
Solution:
(BTC) and other 9 = 3! × 9!
d) Neither Bob nor Carol can sit next to Ted.
Solution: Seat 2 of the other 9 people next to
Ted in (9 × 8) ways or 29𝑃
Then sit the remaining 9 people (including Bob and Carol) in 9! ways
Ways = (9 × 8) × 9! or 29𝑃 × 9!

Combinations
Definition: A combination is a grouping or selection of all or part of a number of tings without reference
to the arrangement of the things selected.

A selection of 𝑟 things from 𝑛 is called combination of the 𝑛 things 𝑟 at a time.

Unordered Selections
The number of different combinations (i.e., unordered sets) of 𝑟 objects from 𝑛 distinct objects is
represented by:

Page | 6
 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑝𝑒𝑟𝑚𝑢𝑡𝑎𝑡𝑖𝑜𝑛𝑠
𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐𝑜𝑚𝑏𝑖𝑛𝑎𝑡𝑖𝑜𝑛𝑠 =
𝑎𝑟𝑟𝑎𝑛𝑔𝑒𝑚𝑒𝑛𝑡𝑠 𝑜𝑓 𝑟 𝑜𝑏𝑗𝑒𝑐𝑡𝑠
and is denoted by
𝑛
𝑛 𝑟𝑃 𝑛!
𝑟𝐶 = =
𝑟! 𝑟! (𝑛 − 𝑟)!

Example 20: How many ways can a basketball team of 5 players be chosen from 8 players?
Solution: 𝑛 = 8, and 𝑟 = 5
8
8!
5𝐶 = = 56
5! (8 − 5)!
Example 21: A committee of 5 people is to be chosen from a group of 6 men and 4 women. How many
committees are possible if
a) there are no restrictions?

Solution: 𝑛 = 10, and 𝑟 = 5

10
10!
5𝐶 =
5! (10 − 5)!

b) one particular person must be chosen on the committee?

Solution: 𝑛 = 9, and 𝑟 = 4
9!
1 × 49𝐶 =
4! (9 − 4)!
c) one particular woman must be excluded from the committee?
Solution: 𝑛 = 9, and 𝑟 = 5
9
9!
5𝐶 =
5! (9 − 5)!
d) there are to be 3 men and 2 women?
Solution:
6! 4!
𝑀𝑒𝑛 𝑎𝑛𝑑 𝑊𝑜𝑚𝑒𝑛 = 63𝐶 × 42𝐶 = ×
3! (6 − 3)! 2! (4 − 2)!
d) there are to be men only?
Solution: 𝑛 = 6, and 𝑟 = 5
6
6!
5𝐶 =
5! (6 − 5)!
f) there is to be a majority of women?

Page | 7
Solution:
3 𝑊𝑜𝑚𝑒𝑛 𝑎𝑛𝑑 2 𝑚𝑒𝑛 𝑂𝑟 4 𝑊𝑜𝑚𝑒𝑛 𝑎𝑛𝑑 1 𝑚𝑎𝑛
4! 6! 4! 6!
= 43𝐶 × 62𝐶 × 44𝐶 × 61𝐶 = × × ×
3! (4 − 3)! 2! (6 − 2)! 4! (4 − 4)! 1! (6 − 1)!
Example 22: In a hand of poker, 5 cards are dealt from a regular pack of 52 cards.
a) What is the total possible number of hands if there are no restrictions?
Solution:
52
52!
5𝐶 =
5! (52 − 5)!
b) In how many of these hands are there:
a. 4 Kings?
Solution:
4 48
4! 48!
4𝐶 × 1𝐶 = ×
4! (4 − 4)! 1! (48 − 1)!
b. 2 Clubs and 3 Hearts?
Solution:
13 13
2𝐶 × 3 𝐶
c. all Hearts?
Solution:
13
5𝐶

Algebra of Permutation and Combination

Example 23: Find 𝑛 given that
(3)𝑛 (𝑛−1)
4𝑃 = 5𝑃
Solution: we can rewrite
(3)𝑛 (3)𝑛!
4𝑃 = (𝑛
− 4)!
and
(𝑛−1) (𝑛 − 1)! (𝑛 − 1)!
5𝑃 = ((𝑛 − 1) − 5)! = (𝑛 − 6)!
(3)𝑛 (𝑛−1)
Thus, 4𝑃 = 5𝑃, becomes
(3)𝑛! (𝑛 − 1)!
=
(𝑛 − 4)! (𝑛 − 6)!
(3)𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4)! (𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4)(𝑛 − 5)(𝑛 − 6)!
= =
(𝑛 − 4)! (𝑛 − 6)!
(3)𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3) = (𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4)(𝑛 − 5)
3𝑛 = (𝑛 − 4)(𝑛 − 5)
3𝑛 = 𝑛2 − 9𝑛 + 20
𝑛2 − 12𝑛 + 20 = 0
(𝑛 − 10)(𝑛 − 2) = 0
Therefore, 𝑛 = 10 and 𝑛 = 2

Example 24: Find 𝑛 given that

(10)𝑛 (𝑛+1)
2𝑃 = 3𝑃

Page | 8
Solution:
(10)𝑛! (𝑛 + 1)! (10)𝑛! (𝑛 + 1)!
= ⟹ =
(𝑛 − 2)! (𝑛 + 1 − 3)! (𝑛 − 2)! (𝑛 − 2)!
(10)𝑛(𝑛 − 1)(𝑛 − 2)! (𝑛 + 1)𝑛(𝑛 − 1)(𝑛 − 2)!
⟹ = ⟹ 10 = 𝑛 + 1
(𝑛 − 2)! (𝑛 − 2)!
𝑛=9
Example 25: Find 𝑛 given that
3(2𝑛+4) 2(𝑛+4)
3𝑃 = 4𝑃
Solution:
3(2𝑛 + 4)! 2(𝑛 + 4)! 3(2𝑛 + 4)! 2(𝑛 + 4)!
= ⟹ =
(2𝑛 + 4 − 3)! (𝑛 + 4 − 4)! (2𝑛 + 1)! (𝑛)!
3(2𝑛 + 4)(2𝑛 + 3)(2𝑛 + 2)(2𝑛 + 1)! 2(𝑛 + 4)(𝑛 + 3)(𝑛 + 2)(𝑛 + 1)𝑛!
= =
(2𝑛 + 1)! (𝑛)!
3(2𝑛 + 4)(2𝑛 + 3)(2𝑛 + 2) = 2(𝑛 + 4)(𝑛 + 3)(𝑛 + 2)(𝑛 + 1)
3[2(𝑛 + 2)][2(𝑛 + 1)](2𝑛 + 3) = 2(𝑛 + 4)(𝑛 + 3)(𝑛 + 2)(𝑛 + 1)
3[2](2𝑛 + 3) = (𝑛 + 4)(𝑛 + 3)
6(2𝑛 + 3) = (𝑛 + 4)(𝑛 + 3)
12𝑛 + 18 = 𝑛2 + 7𝑛 + 12
𝑛2 − 5𝑛 − 6 = 0
(𝑛 − 6)(𝑛 + 1) = 0
𝑛 = 6 𝑎𝑛𝑑 𝑛 = −1
Hence, 𝑛 = 6, as 𝑛 cannot be negative

Example 26: Find 𝑛 given that

(30)𝑛
5𝐶 = 𝑛4𝑃
Solution:
30(𝑛)! 𝑛!
=
(𝑛 − 5)! 5! (𝑛 − 4)!
30(𝑛)(𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4)(𝑛 − 5)! 𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3)(𝑛 − 4)!
=
(𝑛 − 5)! 5! (𝑛 − 4)!
30(𝑛 − 4)
= = 1 ⟹ 30𝑛 − 120 = 5! ⟹ 30𝑛 − 120 = 120
5
30𝑛 240
=
30 30
𝑛=8

Page | 9