Unit 5: Permutation and Combination Grade 11 Math

Dear students; this short note covers contents presented on pages 189-194. Go through the
examples and exercises. As usual bring a copy of this note to class.

Permutations and Combinations

Factorial Notation:
Def. 1: For any positive integer 𝑛, (𝑛 ≥ 2) 𝑛 factorial denoted by 𝑛! is defined as
𝑛! = 𝑛 × (𝑛 − 1) × (𝑛 − 2) × (𝑛 − 3) × … .× 3 × 2 × 1
Also 0! = 1! = 1.

 Exercise 1:
9!
1) Evaluate a) 8! = b) 5! =
𝑛! (𝑛+1)!
2) Find 𝑛 a) (𝑛−1)! b) (𝑛−1)!
Permutation:
Def. 2: Permutation is an arrangement/selection of objects with attention given to the
order of arrangement/selection.

Example: How many 3-letter ‘words’ can be formed using the letters:
a) A, B, and C? b) A, B, C, D, and E?
5! 5!
Solution: a) 3 × 2 × 1 = 3! = 6 b) 5 × 4 × 3 = 2! = (5−3)! = 60

 Note that, the permutation of n objects taken:

1) altogether denoted by 𝑃(𝑛, 𝑛) = 𝑛𝑃𝑛 = (𝑛 𝑛) = 𝑛!.
𝑛!
2) r at a time denoted by 𝑃 (𝑛, 𝑟) = 𝑛𝑃𝑟 = (𝑛 𝑟) =
(𝑛−𝑟)!
where0 < 𝑟 ≤ 𝑛.
 Exercise 2:
1. Find n if: a) 𝑛𝑃2 = 20. b) 𝑛𝑃5 = 6(𝑛𝑃4 ).

2a. How many 3-digit numerals can be formed using the numbers 2 up to 6?

b. How many of these numbers are: i) divisible by 9? ii) greater than 400?

3. How many permutations are there of the letters of the word COVID?

4. How many 4-letter ‘words’ can be formed using the letters of the name CAMBRIDGE
if it must have: a) the letter R? b) at least one vowel?

Permutation of Duplicate Items:

Of 𝑛 objects 𝑛1 are alike, 𝑛2 are alike, … and 𝑛𝑘 are also alike; where ∑𝑘𝑖=1 𝑛𝑖 = 𝑛, then
𝑛!
there are permutations of the 𝑛 objects.
𝑛1 !𝑛2 !...𝑛𝑘 !

1
Unit 5: Permutation and Combination Grade 11 Math
Example: 1) How many permutations are there of the letters of the word RENAISSANCE?

Solution: There are 2 E’s, 2 N’s, 2 A’s, 2 S’s, 1R, 1I and 1C making a total of 11 letters.
11! 39916800
⇒ 2!2!2!2! = = 2,494,800 different permutations.
16
Exercise 3:
2) How many of these words:
a) start with an N? b) end with a C? c) start and end with an A?

Circular Permutation:
If n objects are to be arranged around a circle, then the number of circular
permutations is (𝑛 − 1)!.

Example: 1) How many different arrangements are there to sit 3 boys and 3 girls around a
round table?

Solution: 3 + 3 = 6, then (6 − 1)! = 5! = 120 different ways.

Exercise 4:
2) How many different ways are there if no two girls are to sit together?

Combination:
Def 3: Combination is an arrangement/selection of objects with no attention given to the
order. The number of combinations of 𝑛 objects taken 𝑟 at a time denoted by:
𝑛 𝑛!
𝐶 (𝑛, 𝑟) = 𝑛𝐶𝑟 = ( ) = 𝑟!(𝑛−𝑟)! where (0 < 𝑟 ≤ 𝑛)
𝑟
𝑛𝑃 𝑛 𝑛
Note that: 1) 𝑛𝐶𝑟 = 𝑟 2) ( ) = (
𝑟 𝑛−𝑟
)
𝑟!
Exercise 5:
5 𝑛 𝑛 𝑛
1) Compute. a) ( ) b) ( ) c) ( ) d) ( )
2 0 1 𝑛
𝑛 𝑛 𝑛
2) Find n. a) ( ) = 15 b) ( ) = ( )
2 3 5
3) How many elbow-bumps are exchanged when 6 people meet?

4) Suppose there are 9 identical balls except in color, of which 2 are green, 3 yellow and 4
red. How many different ways are there to draw:
a) any three balls? d) three balls of which none are green?
b) three balls of different color? e) 3 balls of which 2 have the same color?
c) three balls of the same color?

5) From a well-shuffled deck of playing cards; how many ways are there to select:
a) two cards? d) two aces?
b) two cards of different color? e) two face cards?
c) two cards of the same suit?