Answers

CHAPTER 4 PERMUTATION AND COMBINATION

Discovery Activity 1 (Page 120)
2.
Curry gravy {Roti canai, Curry gravy}
Roti canai
Dal gravy {Roti canai, Dal gravy}

Curry gravy {Roti nan, Curry gravy}

Roti nan
Dal gravy {Roti nan, Dal gravy}

Curry gravy {Roti jala, Curry gravy}

Roti jala
Dal gravy {Roti jala, Dal gravy}

3. 3 types of bread × 2 types of gravy = 6 ways to choose a set
4. 3 types of bread × 2 types of gravy × 4 types of drinks = 24 ways to choose a set
Discussion (Page 121)
The number of digits from 0 to 9 is 10. Each digit of the code has 10 digits to choose from. Thus, the number of
ways a 4-digit code can be formed = 10 × 10 × 10 × 10 = 10 000.
Self-Exercise 4.1
1. Number of ways to match a shirt with a pair of pants:
3 × 5 = 15
2. Number of ways to obtain a set of answers:
15 × 2 = 30
3. (a) Number of ways to use the same road:
4 × 5 × 1 × 1 = 20
(b) Number of ways not to use the same road:
4 × 5 × 4 × 3 = 240
Discovery Activity 2 (Page 121)
3. There are two methods that can be used.
Method 1: List all possible arrangements.
TUAH TUHA TAUH TAHU THUA THAU
UT A H UTHA UATH UAHT UHAT UHTA
ATUH ATHU AUTH AUHT AHTU AHUT
HTUA HTAU HUTA HUAT HATU HAUT
There are 24 ways to arrange the letters without repetition.
Method 2:
Fill in the blanks below.

4 options 3 options 2 options 1 option

1
 For the first box, there are four ways to fill the letters: it can be either T, U, A or H.
For the second box, there are three ways to fill the letters.
For the third box, there are two ways to fill the letters.
For the fourth box, there is one way to fill the letter.
Using multiplication rule, the number of possible arrangements is 4 × 3 × 2 × 1 = 24.
Discussion (Page 122)
It is known that n! = n × (n – 1) × (n – 2) × … × 3 × 2 × 1
Can also be written as n! = n × (n – 1)!
Next, (n – 1)! = n!
n
Substitute the value of n = 1
(1 – 1)! = 1!
1
0! = 1
Discussion (Page 122)
n! n! × (n – 1)! × (n – 2)! × (n – 3)!… × 3 × 2 × 1
(a) =
(n – 2)! (n – 2)! × (n – 3)! × … × 3 × 2 × 1
= n(n – 1)!
(n – 1)! (n – 1)!
(b) =
n! n(n – 1)!
1
=
n
Discovery Activity 3 (Page 123)
Types of Number of
Arrangement
arrangement arrangements
Linear API IAP PIA AIP PAI IPA 6

A I P A P I
Circular I P = P A = A I P I = I A = A P 2

5. If the word API is linearly arranged, the number of possible ways is 3! = 6. If the word API is arranged in a
circle, it is found that 3 linear permutations is equal to 1 permutation when it is arranged in a circle.
Self-Exercise 4.2
1. (a) 8! = 8 × 7 × 6 × 5!
5! 5!
= 336
(b) 8! – 6! = 8 × 7 × 6! – 6!
6! 6!
6!(8 × 7 – 1)
=
6!
= 55
(c) 4! = 4 × 3 × 2 × 1
2!2! 2 × 1 × 2 × 1
=6
(d) 7!5! = 7 × 6 × 5 × 4! × 5 × 4 × 3!
4!3! 4! 3!
= 4 200
2. (a) Given n = 4.
Thus, the number of permutations is 4! = 24.
(b) Given n = 5.
Thus, the number of permutations is 5! = 120.

2
 (c) Given n = 6.
Thus, the number of permutations is 6! = 720.
(b) Given n = 9.
Thus, the number of permutations is 9! = 362 880.
3. There are 7 customers who need to be arranged to sit at a round table.
Thus, the number of ways to arrange the 7 customers is (7 – 1)! = 6! = 720.
4. Given n = 8. It is found that, clockwise and anticlockwise arrangements do not make any difference. Thus, the
(8 – 1)! 7!
number of ways to arrange 8 gemstones of different colours to form a chain is = = 2 520.
2 2
Discussion (Page 125)
(a) n
P2 = 20
n!
= 20
(n – 2)!
n(n – 1)(n – 2)!
= 20
(n – 2)!
n(n – 1) = 20
n2 – n – 20 = 0
(n + 4)(n – 5) = 0
n=5
(b) n+2
P3 = 30n
(n + 2)!
= 30n
(n + 2 – 3)!
(n + 2)(n + 1)n(n – 1)!
= 30n
(n – 1)!
(n + 2)(n + 1) = 30
n2 + n + 2 – 30 = 0
n2 – 3n – 28 = 0
(n – 4)(n + 7) = 0
n=4
(c) n+1
P4 = 10nP2
(n + 1)! n!
= 10
(n – 3)! (n – 2)!
(n + 1)! (n – 3)!
= 10
n! (n – 2)!
(n + 1)n! (n – 3)!
= 10
n! (n – 2)(n – 3)!
(n + 1)(n – 2) = 10
n2 – n – 2 – 10 = 0
n2 – n – 12 = 0
(n – 4)(n + 3) = 12
n=4
Self-Exercise 4.3
1. (a) 5P3 = 5! = 5! = 5 × 4 × 3 × 2 × 1 = 60
(5 – 3)! 2! 2×1
(b) 8P7 = 8! = 8! = 40 320
(8 – 7)! 1!
(c) 9P5 = 9! = 9 × 8 × 7 × 6 × 5 × 4! = 15 120
4! 4!
(d) 7P7 = 7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5 040
2. There are 9 participants competing for the first three places
9
P3 = 9! = 504
(9 – 3)!

3
 3. There are 5 gates that can be entered by 3 people.
5
P3 = 5! = 60
(5 – 3)!
4. There are 8 digits to choose from to form a four-digit numbers
8
P4 = 8! = 1 680
(8 – 4)!
5. There are 6 out of 10 plates that need to be arranged in a circle. Clockwise and anticlockwise arrangements do
not make any difference.
10
P6
= 25 200
6
Discovery Activity 4 (Page 126)
2.
P A2 A1PA2
A1
A2 P A1A2P

A1 A2 PA1A2
P
A2 A1 PA2A1

A1 P A2A1P
A2
P A1 A2PA1

3. Number of arrangements = 3 2 1
= 3×2×1
= 6
= 3
P3
= 3!
4. When A1 = A = A2 where two identical arrangements is considered as one arrangement, then there are 3
arrangements obtained, namely APA, AAP and PAA. The way to get these 3 arrangements is to divide the total
number of letters in A1PA2 by 2 identical letters in A, which is 3! = 3.
Discussion (Page 127)
There are 9 letters with 3 identical letters S and 3 identical letters I.
Only 7 letters need to be arranged. They are three S, three I and one from M, B or O
Two methods to find the number of ways to arrange the letter:
Method 1: 3 × 8! = 3 360
3!3!
Method 2 = S = 1 × 8! = 3 360
2!3!
8!
2!3!

Self-Exercise 4.4
1. (a) Given n = 6. There are two O as identical object.
The number of permutations = 6! = 360.
2!
(b) Given n = 7. There are three A as identical object.
Number of permutations = 7! = 840
3!
(c) Given n = 9. There are two T and two I as identical object.
Number of permutations = 9! = 90 720
2!2!

4
 (d) Given n = 14. There are five S, three I and two O as identical object.
Number of permutations = 14! = 60 540 480
5!3!2!
2. Given the number of pens, n = 8. There are 5 identical blue pens and 3 identical red pens.
Number of permutations, 8! = 56
5!3!
3. Given the number of flags, n = 10. The identical objects are 4 white flags and 6 yellow flags.
Number of permutations = 10! = 210
6!4!
4. Given 4, 6 and 8 are repeated twice and 3 only once, thus n = 7.
Number of permutations = 7! = 630
2!2!2!
Self-Exercise 4.5
1. (a) There are 3! = 6 ways to arrange the consonant letters.
There are 2! = 2 ways to arrange the vowel letters.
The number of ways is 3! × 2! = 12.
(b) There are 2! = 2 ways to arrange the vowel letters at the beginning and end of the arrangement.
There are 3! = 6 ways to arrange the rest of the letters.
The number of ways is 3! × 2! = 12.
(c) If the vowels and consonants are in their respective groups,
KKK VV
There are 3! × 2! = 12 ways to arrange the consonants in its group at the front and the vowels in its group at
the back.
VV KKK
There are 2! × 3! = 12 ways to arrange the vowels in its group at the front and the consonants
in its group at the back.
Thus, the number of possible permutations is 12 + 12 = 24.
2. There are 6 digits to choose from.
There are 5 digits that qualify to form 4-digit numbers that are more than 2 000, namely 2, 4, 5, 6 and 7.
Permutating the first digit is 5P1.
For the next 3 remaining digits, the number of permutations = 5P3.
Thus, the number of ways a 4 digit number greater than 2 000 to be formed is 5P1 × 5P3 = 300.
3. There are 12 letters in the word TRIGONOMETRI with two T, two R, two I and two O. Since the first letter is
G and the last letter is E, then the number of arrangements = 10! = 22 680.
2!2!2!2!
4. (a) The number of ways to arrange 6 family members at a round table is (6 – 1)! = 120.
(b) Assuming the mother and father make one unit, the number of ways to arrange a mother and a father with
4 children is (5 – 1)! = 24
The positions of the mother and father can be changed by 2! = 2 ways.
Thus, 24 × 2 = 42 ways.
Formative Exercise 4.1
1. (5 × 2) × (5 × 4) = 200
2. (a) 10 × 10 × 10 = 1 000
(b) 10 × 9 × 8 = 720 or 10P3 = 720
3. Number of numbers that is between 5 000 and 6 000 is 1P1 × 4P3 = 24.
The number of even numbers between 5 000 and 6 000 is given by 1P1 × 3P1 × 3P2 = 18.
4. (a) 2P2 × 9P9 = 725 760 or 2! × 9! = 725 760
(b) 2P2 × 8P8 = 80 640 or 2! × 8! = 80 640
(c) 10P10 – (2P2 × 9P9) = 2 903 040 or 10! – (2! × 9!) = 2 903 040
5. BAKU: 4! = 24
BAKA: 4! = 12
2!
Not the same because the word BAKA contains identical object, which is A.

5
 6. 8! = 56
5!3!
7
P6
7. = 840
6
Self-Exercise 4.6
Combination because there is no condition of the position to choose the channel.

Flash Quiz (Page 133)

n!
It is known that nCr =
r!(n – r)!
n
C0 = n!   ,  nC1 = n!
0!n! 1!(n – 1)!
n(n – 1)!
=1 =
(n – 1)!
= n
Discussion (Page 134)
In Example 7, the seating positions are important, namely the President, Vice President and Secretary. Therefore, the
concept of permutations is used.
In Example 15, the seating positions is not taken into account. Any three candidates can be chosen as committee
members.
Self-Exercise 4.7
1. (a) P3 × 9P2 = 95 040
12

(b) 12C5 = 12! = 12! = 792

5!(12 – 5)! 5!7!
2. C3 =
25 25! = 25! = 2 300
3!(25 – 3)! 3!22!
3. 6C4 = 6! = 6! = 15
4!(6 – 4)! 4!2!
4. Number of lines that can be formed with the vertices, 8C2 = 8! = 8! = 28
2!(8 – 2)! 2!6!
Thus, the number of diagonals is 28 – 8 = 20.
Discussion (Page 135)
The same answer will be obtained whether five or three people are choosen first.
10
C2 × 8C3 × 5C5 = 2 520
10
C5 × 5C3 × 2C2 = 2 520
10
C3 × 7C5 × 2C2 = 2 520

Self-Exercise 4.8
1. 5C2 × 3C1 = 30
2. 3C2 × 6C4 = 45
3. (a) 5C5 × 6C2 = 15
(b) When selecting at least five female graduates, there are two possible cases, namely
6 female graduates are selected, 5C1 × 6C6 = 5
5 female graduates are selected, 5C2 × 6C5 = 60
Thus, the number of ways is (5C1 × 6C6) + (5C2 × 6C5) = 65

6
Formative Exercise 4.2
1. It is known that nCr = n!
r!(n – r)!
n
Cn – r = n!
(n – r)!(n – (n – r))!
n
Cn – r = n!
(n – r)!(n – n + r)!
n
Cn – r = n!
(n – r)! r!
n
Cn – r = nCr
2. (a) C5 = 56
8

(b) 5C3 × 3C2 = 30

(c) (5C4 × 3C1) + (5C5 × 3C0) = 15 + 1 = 16
3. (4C4 × 3C1) + (4C3 × 3C2) = 15
4. (4C4 × 6C4) + (4C3 × 6C5) + (4C2 × 6C6) = 45
5. (a) 12
C4 × 8C4 × 4C4 = 34 650
(b) 12C6 × 6C6 = 924

Summative Exercise
1. Number of four-letter code that can be formed without repetition, 8P4 = 1 680
Number of four-letter code beginning with a consonant, 5P1 × 7P3 = 1 050
2. 10 digits and 26 letters, 36P6 = 1 402 410 240
3. (a) Number of arrangements that do not begin with the letter S,
5
P5 – (1P1 × 4P4) = 96 or 5! – (1 × 4!) = 96
(b) Number of arrangements that do not end with the letter S or P,
5
P5 – (2P1 × 3P3 × 1P1) = 108
4. 5 matches with 3 outcomes, 3 × 3 × 3 × 3 × 3 = 243
5. There are 7 letters, n = 7 in the word JANJANG. There are two J, two A and two N.
The number of possible arrangements, 2!6! = 180
2!2!2!
6. There are 15 shirts, n = 15. There are 2 size-S, 3 size-M, 6 size-L and 2 size-XL.
Number of ways, 13! = 360 360
2!3!6!2!
7
P5
7. There are 7 saplings, n = 7, = 504
5
8. (a) The arrangements of Emma and Fakhrul together with the others is (5 – 1)!.
Emma and Fakhrul's positions can be exchanged.
Thus, (5 – 1)! × 2 = 24 × 2 = 48 ways.
(b) The number of arrangements of all people in the circle is (6 – 1)! = 120.
It is known from (a), the number of ways Emma and Fakhrul are next to each other is 48.
Thus, 120 – 48 = 72 ways .
9. There are 3 red flowers, 4 blue flowers and 5 white flowers.
(12 – 1)!
= 1 155
2 × 3!4!5!
10. If the candidate answers 4 questions in part A, 6C4 × 7C6 = 105
If the candidate answers 5 questions in part A, 6C5 × 7C5 = 126
If the candidate answers 6 questions in part A, 6C6 × 7C4 = 35
Thus, 105 + 126 + 35 = 266 ways.

7
11. (a) Number of ways a committee can be formed without any conditions, 8C3 = 56
(b) Number of ways a committee can be formed from 4 husbands, 4C3 = 4
(c) From (a), 8C3 = 56 ways
Number of ways a committee can be formed if married couple are selected, 4C1 = 4
The remaining one committee member can be selected from the other 6 people, 6C1 = 6 ways.
Therefore, the number of ways a committee is formed if there is a married couple selected,
C1 × 6C1 = 24
4

Thus, the number of ways a committee is selected if no married couple can hold the position is 56 – 24 = 32.
12. (a) Number of ways 4 people choose a seat, 4C1 × 3C3 = 4
(b) Number of ways to choose a seat if Zara sits in the front, 1C1 × 3C3 = 1
(c) Number of ways to choose a seat if Zara sits at the back, 3C1 × 2C2 × 1C1 = 3
13. (a) Number of ways to shake hands with each other, 15C2 = 105
(b) Number of ways 3 people who know each other shake hands is given by 3C2.
Thus, 15C2 – 3C2 = 102
14. (a) Number of straight lines that can be formed, 9C2 = 36
(b) Number of triangles that can be formed, 9C3 = 84
(c) Number of rectangles that can be formed, 9C4 = 126