NSS Mathematics in Action (2nd Edition) 5B Full Solutions

10 Permutation and Activity

Combination Activity 10.1 (p. 10.17)

1. (b) 10  9  8  720
(c) 10  9  8  7  5040
Review Exercise 10 (p. 10.3)
2. (a) n  (n  1)
1. Winner of Winner of Winner of Possible (b) n  (n  1)  (n  2)
1st match 2nd match 3rd match outcomes
(c) n  (n  1)  (n  2)  (n  3)
X XXX
X (d) n  (n  1)  (n  2)  ...  (n  r  1)
Y XXY
X 3. From the results of questions 1 and 2, we can see that the
number of permutations of n distinct objects taken r at a
X XYX
time is a product of r consecutive terms.
Y
Y XYY Activity 10.2 (p. 10.29)
1. (a) The number of permutations of 4 coloured cups taken
X YXX
2 at a time is P24  12 .
X
Y YXY
Y (b) Permutation Combination
RB BR RB
X YYX
RG GR RG
Y RO OR RO
Y YYY BG GB BG
BO OB BO
From the tree diagram, there are 8 possible outcomes.
GO OG GO

2. Flavours Sizes Possible choices From the table above, we can see that each
combination of 2 colours can be permuted in
L B, L 2! = 2 ways.
Therefore, the number of combinations of 2 coloured
B M B, M P4
cups selected from 4 is 2  6 .
(2!)
S B, S
2. (a) The number of permutations of 4 coloured cups taken
L C, L 3 at a time is P34  24 .

C M C, M
(b) Permutation Combination
RBG RGB BRG BGR GRB GBR RBG
S C, S RBO ROB BRO BOR ORB OBR RBO
From the tree diagram, there are 6 possible choices. RGO ROG GRO GOR ORG OGR RGO
BGO BOG GBO GOB OBG OGB BGO
3. Multiple-choice question From the table above, we can see that each combination
A B C D of 3 colours can be permuted in 3! = 6 ways.
Therefore, the number of combinations of 3 coloured
True-false T T, A T, B T, C T, D P4
cups selected from 4 is 3  4 .
question F F, A F, B F, C F, D (3!)

From the table above, there are 8 possible outcomes. P2n P3n Prn
3. (a) (b) (c)
2! 3! r!
4. 2nd digit
Maths Dialogue
1 2 3

1 11 12 13 Maths Dialogue (p. 10.25)

Ken forgot to remove the arrangements that ‘exactly 2 birds are
1st digit 2 21 22 23 placed next to each other’ from 7!. Angel forgot to consider that
the birds could be placed in the front or at the back of the
3 31 32 33
mammals. The correct number of arrangements is 4 !P 53  1440 .

From the table above, there are 9 possible outcomes.

100
 10 Permutation and Combination

Classwork Quick Practice 10.6 (p. 10.10)

(a) By the addition rule of counting,
Classwork (p. 10.14) the number of choices  2  3  5  10
1. (a) 3 ! 4 ! 3  2 1  4  3  2 1  30
(b) By the multiplication rule of counting,
(b) 6 ! 0 ! 6  5  4  3  2 1  1  719 the number of choices  2  3  5  30

(c) 7!  2 ! 7  6  5  4  3  2 1 2 1  10 080 (c) By the multiplication rule of counting,

the number of ways to take a tennis course and a volleyball
10! 10  9  8  7  6  5  4  3  2 1 course  2  3  6
(d) 
5! 5  4  3  2 1 the number of ways to take a volleyball course and a
 10  9  8  7  6 squash course  3  5  15
 30 240 the number of ways to take a tennis course and a squash
course  2  5  10
By the addition rule of counting,
2. (a)  (b)  (c)  (d) 
the number of choices  6  15  10  31
Classwork (p. 10.17)
(a) 5 Quick Practice 10.7 (p. 10.15)
(b) 5  4  20 10 ! 10  9  8 !
(a) 
(c) 5  4  3  60 58! 58!
(d) 5  4  3  2  120 10  9

(e) 5  4  3  2 1  120 5
 18
Classwork (p. 10.36)
(a) combination (b) permutation
(c) combination (d) permutation 5!19! 5! 19!
(b) 
(e) permutation 20! 20  19!
5  4  3  2 1
Quick Practice 
20
6
Quick Practice 10.1 (p. 10.5)
By the addition rule of counting,
the number of choices  4  6  3  13 Quick Practice 10.8 (p. 10.19)
(a) P210 P22  (10  9)  (2 1)
Quick Practice 10.2 (p. 10.6)  180
By the addition rule of counting,
the total number of students  20  12  8  24 P312 12 1110
(b) 
P26 65
Quick Practice 10.3 (p. 10.7)
By the multiplication rule of counting,  44
the number of different choices  4  2  3  24
Quick Practice 10.9 (p. 10.20)
(a) The number of permutations  7!  5040
Quick Practice 10.4 (p. 10.8)
(a) By the multiplication rule of counting,
the number of possible PINs (b) The number of permutations  P47  840
 26 26101010  676 000
Quick Practice 10.10 (p. 10.21)
(b) By the multiplication rule of counting, (a) The number of 3-digit numbers formed = P34 = 24
the number of possible PINs
 1 261010 5  13 000
(b) The first digit must be 5, 6 or 8.
The number of ways of filling in the first digit is P13  3.
Quick Practice 10.5 (p. 10.9)
By the multiplication rule of counting, After choosing 5, 6 or 8 as the first digit, we have
the number of ways to travel from Quarry Bay to Tuen Mun via 3 numbers left.
Central  4  2  8 The number of ways of filling in the remaining 2 digits
The number of ways to travel directly from Quarry Bay to Tuen is P23  6.
Mun  3 By the multiplication rule of counting,
By the addition rule of counting, the number of 3-digit numbers formed in (a) are greater
the total number of ways to travel from Quarry Bay to Tuen than 500 = 3´ 6 =18
Mun  8  3  11

101
NSS Mathematics in Action (2nd Edition) 5B Full Solutions

Quick Practice 10.11 (p. 10.22) Quick Practice 10.16 (p. 10.34)
(a) The number of ways to choose the 2 letters  P226 (a) The number of ways of selecting 3 girls and 2 boys
 C312  C 210
The number of ways to choose the 4 digits  P410
 9900
By the multiplication rule of counting,
the number of possible passwords = P226  P410  3 276 000
(b) Since 2 particular girls must be included and 4 particular
boys must be excluded, there are (12 – 2) = 10 girls and
Quick Practice 10.12 (p. 10.23) (10 – 4) = 6 boys remained for selection.
(a) The number of ways of arranging face cards on the right The required number of ways
= 3!  C110  C 26
The number of ways of arranging number cards on the left
= 3!  150
By the multiplication rule of counting,
the number of possible arrangements  3 ! 3 ! 36 Quick Practice 10.17 (p. 10.35)
(a) The total number of mathematicians and physicists
(b) We can treat all the face cards as a unit.  5  7  12
The number of ways of arranging the number cards and the The required number of committees formed
unit = (3 + 1)! = 4!
 C812
The number of ways of arranging the number cards = 3!
By the multiplication rule of counting,  495
the number of possible arrangements  4 ! 3 ! 144
(b) Exactly 4 mathematicians must be included.
Quick Practice 10.13 (p. 10.24) The required number of committees formed
Arrange the consonants B, C, D and F in a row.  C 45  C 47
The number of ways to arrange the 4 consonants is 4!.  175
Since vowels A and E must be separated by consonants, they can
be arranged into the 5 positions between or next to the
consonants as shown below. (c) The committee can have 1 mathematician and 7 physicists,
or 2 mathematicians and 6 physicists, or 3 mathematicians
Consonants: and 5 physicists.
The number of committees with exactly 1 mathematician
Vowels:     
 C15  C77
The number of ways to arrange the vowels  P25
The number of committees with exactly 2 mathematicians
∴ The required number of permutations = 4 ! P25  480
 C25  C67
The number of committees with exactly 3 mathematicians
Alternative Solution
The total number of permutations without restrictions  C35  C57
= 6! = 720 By the addition rule of counting,
The number of permutations with the vowels next to each other the required number of committees formed
= 5! × 2! = 240  C15  C77  C25  C67  C35  C57
∴ The required number of permutations  720  240  480
 285

Quick Practice 10.14 (p. 10.31) (d) The number of committees with more than 3 physicists
12  11 10  9 2  1  175  285
(a) C 412C 22  
4  3  2 1 2 1  460
 495 The required number of committees formed
 495  460
C 216 16 ! 5!  35
(b)  
C 45 (16  2)! 2 ! (5  4)! 4 !
16 ! 1! 4 ! Quick Practice 10.18 (p. 10.37)
 
14 ! 2 ! 5 ! Number of ways of selecting 9 boys from 15 boys  C915
16  15  14 ! 4! Number of ways of selecting a prince and a princess role from
 
14 ! 2 ! 5 4! the 9 selected children  P29
 24 ∴ The required number of ways
 C915  P29
Quick Practice 10.15 (p. 10.32)  360 360
(a) The required number of ways = C520  15 504

(b) The required number of ways = C1520  15 504

102

Quick Practice 10.19 (p. 10.38)
(a) The number of ways to arrange 4 girls in the front row = 4!
The number of ways to arrange 6 boys in the back row = 6!
∴ The number of possible arrangements
 4 ! 6 !
 17 280
(b) (i) The number of possible arrangements
 10 !
 3 628 000
(ii) Consider the girls stand in the first row.
The number of ways of selecting a boy to stand in the
first row  C16
The number of ways to arrange 4 girls and 1 boy in the
first row  2 ! 4 !
The number of ways to arrange the remaining 5 boys
in the second row  5 !
The number of ways to arrange the boys and girls if
the 4 girls stand in the first row  C16  2 ! 4 ! 5 !
The situation is similar if the girls stand in the back
row.
The number of ways of arranging the boys and girls if
the 4 girls stand in the back row  C16  2 ! 4 ! 5 !
∴ The total number of arrangements
 C16  2 ! 4 ! 5 ! 2
 69120
Further Practice
Further Practice (p. 10.6)
1. By the addition rule of counting,
the number of possible ways  12  3  9
2. Number of ways of selecting an even number = 10
Number of ways of selecting a multiple of 3
(i.e. 3, 6, 9, 12, 15, 18) = 6
Number of ways of selecting an even multiple of 3
(i.e. 6, 12, 18) = 3
By the addition rule of counting,
the required number of ways  10  6  3  13
3. (a) Number of ways of choosing an adult = 4
Number of ways of choosing a female = 1 + 1 + 2 = 4
Number of ways of choosing a female adult = 2
∴ The required number of ways  4  4  2  6
(b) Number of ways of choosing a child = 3 + 2 = 5
Number of ways of choosing a male = 1 + 1 + 3 = 5
Number of ways of choosing a male child = 3
∴ The required number of ways  5  5  3  7
Further Practice (p. 10.10)
1. By the multiplication rule of counting,
the number of choices with 2 models having both 3G and
4G versions = 2 × 4 × 2 = 16
The number of choices with the model having a 3G version
only = 4
By the addition rule of counting,
the required number of choices  16  4  20
103
10 Permutation and Combination
2. (a) By the multiplication rule of counting,
the required number of ways  4  5  4  80
(b) By the addition rule of counting,
the required number of ways  4  5  9
(c) By the multiplication rule of counting,
the required number of ways  9  4  36
3. (a) The number of choices of □ (i.e. 0, 5) = 2
The number of choices of  = 10
By the multiplication rule of counting,
the number of ways of forming the 3-digit number
 2 10  20
(b) The number of choices of □ (i.e. 0, 5) = 2
The number of choices of (i.e. except 4 and □)
= 10 – 1 – 1 = 8
By the multiplication rule of counting,
the number of ways of forming the 3-digit number
 2  8  16
Further Practice (p. 10.26)
1. (a) The number of 4-letter strings formed = P45  120
(b) The string must begin with A and end with O, or vice
versa.
The number of arrangements for the first and the last
letters is 2!.
Then 3 letters remain for the 2nd and 3rd letters.
The number of ways of arranging the 2nd and the 3rd
letters is P23 .
∴ The required number of the 4-letter strings
 2 ! P23
 12
2. (a) (i) The total number of singers = 4 + 5 = 9
The required number of performing sequences
 9!
 362 880
(ii) The number of ways to select the first and the last
male singers is P24 .
The number of ways to arrange the remaining
7 singers = 7!
The required number of performing sequences
 7! P24
 60 480
(b) The total number of singers = 3 + 3 = 6
If the first singer is a male, the number of ways to
arrange the male singers is 3!.
The number of ways to arrange the female singers is
also 3! .
By the multiplication rule of counting,
the number of ways to arrange the singers if the first
singer is a male  3 ! 3 !
The situation is similar if the first singer is a female.
The number of ways to arrange the singers if the first
singer is a female  3 ! 3 !
Thus, the required number of ways  3 ! 3 ! 2  72
NSS Mathematics in Action (2nd Edition) 5B Full Solutions
3. (a) The number of ways to arrange phones D and E = 2!
The number of ways to arrange phones A, B, C, F, G
and H = 6!
By the multiplication rule of counting,
the required number of ways  2 ! 6 ! 1440
(b) We can treat phones of the same brand as one unit.
The number of ways to arrange the 3 units = 3!
The number of ways to arrange the brand I phones
= 3!
The number of ways to arrange the brand II phones
= 2!
The number of ways to arrange the brand III phones
= 3!
By the multiplication rule of counting,
the required number of ways  3 ! 3 ! 2 ! 3 ! 432
(c) Phone D can be inserted into the 6 positions between
or next to the 6 phones as shown such that phone E
can then be placed and separated by exactly 4 phones
from phone D.
     
For each position of phone D, there is only one
corresponding position for phone E.
The number of ways to arrange phones D and E = 6
The number of ways to arrange the other 6 phones = 6!
∴ The required number of ways  6  6!  4320
Further Practice (p. 10.38)
1. (a) The required number of choices  C310  120
(b) The required number of choices  P310  720
2. The total number of animals in the shop = 5 + 6 = 11
(a) (i) The required number of ways = C611  462
(ii) The required number of ways = C35 C36  200
(iii) Since 2 particular dogs must be selected, we only
need to select (6 – 2) = 4 more animals from a
total of (11 – 2) = 9 animals.
The required number of ways = C49  126
(iv) The number of ways of choosing 2 dogs only
 C25  C46
The number of ways of choosing 1 dog only
 C15  C56
The number of ways of choosing no dogs  C66
∴ The required number of ways
 462  C25  C46  C15  C56  C66
 281
(b) The number of ways of selecting 4 dogs and 2 cats
 C45  C26
The number of ways of arranging the chosen animals
 (4 + 2)!= 6 !
By the multiplication rule of counting,
the required number of ways  C45  C26  6 ! 54 000
104
3. (a) The number of ways to form the first group from the 9
students  C39
The number of ways to form the second and third
group from the remaining 6 students  C36
The required number of arrangements
 C39  C36  1680
(b) The situation is the same as that in (a), except the 3
groups of students perform the same task (i.e. playing
a game).
For each arrangement that can be made, it corresponds
to 3! arrangements in (a).
∴ The required number of arrangements
1680

3!
 280
Exercise
Exercise 10A (p. 10.11)
Level 1
1. By the addition rule of counting,
the number of possible ways  12  7  19
2. By the addition rule of counting,
the number of possible outcomes  23  28  51
3. By the multiplication rule of counting,
the number of possible choices  5  7  35
4. By the multiplication rule of counting,
the number of possible ways  5  6  30
5. (a) By the addition rule of counting,
the number of possible outcomes  6  4  10
(b) By the multiplication rule of counting,
the number of possible outcomes  6  4  24
6. (a) By the addition rule of counting,
the number of possible ways  12  20  15  47
(b) By the multiplication rule of counting,
the number of possible ways  12 2015  3600
7. By the multiplication rule of counting,
the number of choices  2  3  6
8. Throwing a dice can end up with 1, 2, 3, 4, 5 or 6.
By the multiplication rule of counting,
the number of possible outcomes  6  6  6  216
9. By the multiplication rule of counting,
the number of possible ways  48  65 536
10. By the addition rule of counting,
(a) the number of choices  12  22  34
(b) the number of choices  12  22  2  32

11. By the addition rule of counting,
the required number of students  32  27  18  41
12. By the addition rule of counting,
the total number of students = 30 + 35 – n > 60
65 - n > 60
n<5
∴ n can be 1, 2, 3 or 4.
Level 2
13. (a) (i) Number of multiple of 2  50
(ii) Number of multiple of 3  33
(iii) Number of multiple of 6  16
(b) By the addition rule of counting,
the required number of ways  50  33  16  67
14. By the addition rule of counting,
(a) the required number of ways  4  4  8
(b) the required number of ways  36  26  18  44
(c) the required number of ways  20  13  5  28
(d) the required number of ways  13  13  12  6  32
15. (a) By the multiplication rule of counting,
the required number of ways  5  3  15
(b) By the multiplication rule of counting,
the number of ways  5  5  3  4  300
16. (a) By the multiplication rule of counting,
the number of possible zip codes  105  100 000
(b) By the multiplication rule of counting,
the number of possible zip codes  9 104  90 000
(c) There are 9 choices for the first number. The last
number must be 2, 3, 5 or 7. The other numbers have
no restrictions.
By the multiplication rule of counting,
the number of possible zip codes
 9 103  4
 36 000
17. By the multiplication rule of counting,
the number of possible passwords of deposit box A
 2  2 101010  4000
the number of possible passwords of deposit box B
 9  9  9  9  6561
Since 4000 < 6561, the password of deposit box A is easier
to be cracked.
18. (a) By the addition rule of counting,
the number of choices  16  23  39
(b) The number of Chinese books left = 16 – 1 = 15
By the multiplication rule of counting,
the number of choices  15 23  345
(c) The number of English books left = 23 – 1 = 22
105
10 Permutation and Combination
By the multiplication rule of counting,
the number of choices  16 22  352
19. (a) The number of grammar schools = 4 + 8 + 5 = 17
The number of technical schools = 2 + 1 + 1 = 4
By the multiplication rule of counting,
the number of choices  17  4  68
(b) The number of boys’ schools = 4 + 2 = 6
The number of girls’ schools = 8 + 1 = 9
The number of co-educational schools = 5 + 1 = 6
By the multiplication rule of counting,
the required number of choices  6  9  6  324
20. (a) By the addition rule of counting,
the required number of choices  8  3  11
(b) By the multiplication rule of counting,
the required number of choices  11 5  55
21. (a) By the multiplication rule of counting,
the required number of ways  2  3  6
(b) Number of ways for a car to travel from town P to
town Q via Y  2  1  2
By the addition rule of counting,
the required number of ways  6  2  8
22. (a) By the multiplication rule of counting,
the number of ways  4  3  12
(b) By the multiplication rule of counting,
the number of ways  4  3  6  72
(c) The number of ways for taking one finance course and
one language course = 3 × 6 = 18
The number of ways for taking one accounting course
and one language course
= 4 × 6 = 24
By the addition rule of counting,
the number of ways  12  18  24  54
23. If Ivan buys fish ball, he can buy any of the 3 drinks.
If Ivan buys chicken wing, he can buy any of the 3 drinks.
If Ivan buys French fries, he can only buy mineral water or
orange juice.
If Ivan buys hamburger, he can only buy mineral water.
By the addition rule of counting,
the number of choices  3  3  2  1  9
24. (a) The first digit cannot be 0. Thus, there are 6 choices
for it.
After the first digit has been selected, there are 7
choices for each of the second digit and the last digit.
By the multiplication rule of counting,
the number of 3-digit numbers formed
 6  7  7  294
NSS Mathematics in Action (2nd Edition) 5B Full Solutions

(b) Since the number formed is even, the last digit must be
0, 2 or 4.
By the multiplication rule of counting,
the number of 3-digit numbers formed
 6  7  3  126
15. The required number of ways  8! 40 320
16. There are 5 different choices for digits.
The number of 3-digit numbers formed  P35  60

(c) The first digit can only be 2, 3 or 4.

17. The required number of ways  P432  863 040
By the multiplication rule of counting,
the number of 3-digit numbers formed
 3  7  7  147 18. (a) The required number of ways  7!  5040

(d) Since the number formed is odd, the last digit must be
3, 5, 7 or 9. (b) The required number of ways  P47  840
Since the number formed is greater than 400, the first
digit must be 4, 5, 7 or 9.
19. (a) The required number of ways  P48  1680
By the multiplication rule of counting,
the number of 3-digit numbers formed
 4  7  4  112 (b) The required number of ways = 84  4096

Exercise 10B (p. 10.26)

20. (a) The required number of ways  P46  360
Level 1
1. 2!  4! 2 1  4  3  2 1  26
(b) The required number of ways  64  1296
2. 5!  0! 5  4  3  2 1  1  119
21. (a) The letter ‘L’ in the word ‘MULTIPLY’ is repeated.
3. 5  6! 5  6  5  4  3  2 1  3600 ∴ The number of permutation of all the letters must
be less than 8!.
4. (3!) 2  (3  2  1) 2  62  36 (b) All dogs are distinct.
∴ The number of ways of arranging 8 dogs in a row
10! 10  9  8! is 8!.
5.   10  9  90
8! 8!
Level 2
3! 6! 3! 6! 3  2 1 1 22. (a) The number of 3-digit numbers formed = P36  120
6.   
9! 9  8  7  6! 9  8  7 84
(b) The last digit can be 2, 4, 6 or 8.
After the last digit is chosen, the first 2 digits can be
7. P37  7  6  5  210 chosen from the remaining (6 – 1) = 5 numbers and
the number of such ways is P25  20 .
8. P55  5  4  3  2 1  120 By the multiplication rule of counting,
the number of even 3-digit numbers in (a)
 20  4  80
9. P25  P34  5  4  4  3  2  44

10. P45 P15  (5  4  3  2)  5  600 23. Kelly can be the champion, the first runner-up or the second
runner-up. After the position of Kelly is fixed, the
remaining 7 athletes can be ranked in 7! = 5040 ways.
P310 10  9  8 6
11.   By the multiplication rule of counting,
P47 7  65 4 7 the required number of ways  3  7! 15 120

P22 P48 (2  1)  (8  7  6  5) 28 24. (a) The total number of participants = 5

12.  
P46 65 43 3 The required number of ways = P35  60

13. The required number of possible outcomes  4! 24

(b) Winnie is not the champion and the first runner-up.
The possible outcomes are listed as follows: The number of ways of awarding the champion and
CART, CATR, CRAT, CRTA, CTAR, CTRA,
the first runner-up = P24
ACRT, ACTR, ARCT, ARTC, ATCR, ATRC,
RCAT, RCTA, RACT, RATC, RTCA, RTAC, After that, there are (5 – 2) = 3 ways for awarding the
TCAR, TCRA, TACR, TARC, TRCA, TRAC second runner-up.
By the multiplication rule of counting,
14. The required number of ways  6! 720 the required number of ways  P24  3  36

106
 10 Permutation and Combination

25. (a) The required number of ways  8! 40 320 The number of ways of arranging the remaining
3 persons = 3! = 6
By addition rule and multiplication rule of counting,
(b) The number of ways of arranging the girls = 3! = 6
the required number of ways  (4  3  2  1)  6  60
The number of ways of arranging the boys = 5! = 120
By the multiplication rule of counting,
the required number of ways  6  120  720 (d) We can treat Jelly, Leo and Mandy as a unit.
The number of ways of arranging the remaining 2
people and the unit = 3! = 6
(c) Alvin can be the 4th, 5th, 6th, 7th or 8th pupil leaving
The number of ways of arranging Jelly, Leo and
the classroom.
Mandy = 3! = 6
The number of ways of arranging the remaining
By the multiplication rule of counting,
7 students = 7! = 5040
the required number of ways  6  6  36
By the multiplication rule of counting,
the required number of ways  5040 5  25 200
29. (a) The pattern must be BRBRBRBRB, where R and B
represent a red ball and a blue ball respectively.
26. Suppose all sports magazines are placed on the right.
The number of ways of arranging the red balls
The number of ways of arranging the sports magazines
= 4! = 24
 P35
The number of ways of arranging the blue balls
The number of ways of arranging the computer magazines = 5! = 120
 P46 By the multiplication rule of counting,
The situation is similar when all sports magazines are the required number of ways  24 120  2880
placed on the left.
By the multiplication rule of counting, (b) Arrange the 5 blue balls in a row and there are
the required number of ways  P35  P46  2  43 200 5! = 120 ways of arranging the blue balls.

27. (a) The total number of arrangements without restrictions B B B B B

 6! 720      
The 4 red balls can be inserted into the 6 positions
between or next to the blue balls as shown above.
(b) We can treat Carmen and Elle as a unit.
The number of ways of arranging the 4 friends and the The number of ways of arranging the red balls
unit = 5! = 120  P46  360
The number of ways of arranging Carmen and Elle By the multiplication rule of counting,
= 2! = 2
the required number of ways  120 360  43 200
By the multiplication rule of counting,
the number of arrangements for Carmen and Elle
sitting next to each other  120 2  240 30. The situation can be restructured as follows:
Arrange 5 women and 5 men, M1, M2, M3, M4 and M5, in a
row as shown below:
(c) The number of arrangements for Carmen and Elle not (F) (F) (F) (F) (F)
sitting next to each other  720  240  480     
There are 5 places for the 5 men to stand.
28. (a) The total number of arrangements without restrictions ∴ The number of ways of pairing up  5 !  120
 5! 120
31. (a) The total number of arrangements without restrictions
(b) We can treat Jelly and Ken as a unit. = 7 ! = 5040
The required number of ways  (5  1)! 4! 24
(b) The number of ways of arrangements for no parents
sitting at one end of the row  5! P25  2400
(c) When there are no restrictions, either Jelly stands
The number of ways of arrangements for at least one
behind Ken or Ken stands behind Jelly. The numbers
of the parents sitting at one end of the row
of ways of arranging the queue in each of these two
 5040 2400  2640
situations are the same.
120
∴ The required number of ways   60 (c) First, we arrange the children in a row.
2
The number of ways of arranging the 5 children
= 5! = 120
Alternative Solution
Ken can be the 1st, 2nd, 3rd or 4th person in the
queue. If Ken is the ith person, the number of possible    
positions for Jelly is 5 – i. 1 2 3 4

107
NSS Mathematics in Action (2nd Edition) 5B Full Solutions

Since both Tom and Mary must be seated between two 6. C 26 C 47  C36 C37  C 26 C774  C36 C37
children, there are 6 possible pairs of positions (i.e.
(1, 2), (1, 3), (1, 4), (2, 3), (2, 4) and (3, 4)) for them.  C37 (C 26  C36 )
The number of ways of arranging Tom and Mary P37  P26 P36 
   
3!  2! 3! 
= 2! = 2
∴ The required number of ways  6  2 120  1440
7  6 5  6 5 6 5 4 
   
(d) The number of ways of arranging Tom and Mary 3  2 1  2 1 3  2 1 
= 2! = 2  35 (15  20)
(i) The number of ways of arranging the 5 children  1225
= 5! = 120
By the multiplication rule of counting,
the required number of ways  2  120  240 7. (a) The possible combinations are listed as follows:
RBG, RBY, RBV, RGY, RGV,
(ii) If no sons can sit next to each other, then the boys RYV, BGY, BGV, BYV, GYV
and girls must sit alternatively.
The number of ways of arranging the 3 boys (b) The number of possible combinations  C35  10
= 3! = 6
The number of ways or arranging the 2 girls
= 2! = 2 8. The required number of ways  C518  8568
By the multiplication rule of counting,
the required number of ways  2  6  2  24
9. There are 30 days in June.
∴ The number of possible choices  C530  142 506
Exercise 10C (p. 10.39)
Level 1
P4 4  3 10. There are 9 multiples of 5 from 10 to 50 inclusive (i.e. 10,
1. C24  2  6 15, 20, 25, 30, 35, 40, 45 and 50).
2! 2  1
∴ The required number of ways  C49  126
P25 5 4
2. C25  C77  1   1  11
2! 2 11. (a) The number of possible outcomes  C212  66

P36 6  5  4 (b) The number of possible outcomes  P212  132

3. C04C36  1    20
3! 3  2 1
12. There are (20 – 2) = 18 students eligible for selection.
C 28 8! 8!
4.   ∴ The required number of ways  C618  18 564
C 48 6! 2! 4! 4!
4! 4!
 13. (a) The required number of ways  C48  70
6! 2!
4  3  2!  4!

6  5  4!  2! (b) Only 7 letters can be selected.
2 ∴ The required number of ways  C47  35

5
(c) Only 2 more letters can be selected from the remaining
6 letters.
3
C C 1 C
6 6
6 4
5. 3
5
 4
∴ The required number of ways  C26  15
C3 C553
C 26
 14. (a) Since the fastest typist is included, 2 more typists are
C 25 chosen from the remaining 19 typists.
P26 P25 ∴ The required number of choices  C219  171
 
2! 2!
65 (b) Since the slowest typist is not included, all 3 typists
 are chosen from the remaining 19 typists.
5 4
3 ∴ The required number of choices  C319  969

2
15. The number of possible combinations  C645  8 145 060
The amount the player has to pay
 $2  8 145 060
 $16 290120

108
 10 Permutation and Combination

Level 2 ∴ The required number of ways

16. The number of lines between any two distinct vertices  C 28  C 25
= The number of combinations of 12 vertices taken 2 at a  280
time without repetition
= C 212 (c) The number of ways of forming a team with no S4
= 66 players = C45  5
∴ The number of diagonals ∴ The required number of ways
 66  the number of sides  715  5
 66  12  710
 54
23. (a) The required number of ways  C59  126
17. The number of ways of selecting a captain = C110
The number of ways of selecting 4 members from the (b) There are (9 – 2) = 7 friends eligible for selection.
remaining 9 people = C49 ∴ The required number of ways  C57  21
∴ The required number of ways = C110 ´C49 =1260
(c) If Emma and Frankie are invited together, 3 more
18. (a) The required number of ways  C210  C26  675 friends will be invited from the remaining 7 friends.
The number of ways of selection if Emma and Frankie
(b) The required number of ways  C410  C16  1260 are invited together  C37  35
∴ The required number of ways  126 35  91
19. The number of ways to select a goalkeeper  C 3
1
24. (a) There are (5 + 6) = 11 members.
The number of ways to select 10 more starters from the
The required number of ways  C411  330
19 remaining players  C10
19

∴ The required number of ways  C10

19
 C13  277134 (b) The number of ways with exactly 3 S5 members
selected  C35  C16  60
20. (a) The number of different committees  C37  C28  980
The number of ways with exactly 4 S5 members
selected  C45  5
(b) 7 economists are eligible to be selected.
∴ The number of different committees ∴ The required number of ways
 330  60  5
 C C
7 7

 265
3 2

 735

(c) The number of ways with exactly 2 S5 members

(c) 2 more accountants are selected from the remaining
6 accountants and 1 more economist is selected from selected  C25  C26  150
the remaining 7 economists. ∴ The required number ways  265 150  115
∴ The number of different committees
 C 26  C17 (d) The number of ways with no S5 members selected
 105 = C46  15
The number of ways with no S6 members selected
21. (a) 2 more participants are selected from the remaining = C45  5
30 scouts.
∴ The required number of ways
∴ The required number of ways  C230  435
 330  15  5
 310
(b) All 4 participants are selected from the remaining
30 scouts.
25. (a) 6 buses are selected from the 12 buses into the first
∴ The required number of ways  C430  27 405 group. The remaining 6 buses are automatically
assigned to the second group.
(c) 3 more participants are selected from the remaining ∴ The required number of ways = C612  924
30 scouts.
∴ The required number of ways  C330  4060 (b) First, 4 buses are selected from the 12 buses into the
first group.
22. (a) There are (8 + 5) = 13 players in total. Then another 4 buses are selected from the remaining
The required number of ways  C413  715 8 buses into the second group.
Finally, the remaining 4 buses are automatically
assigned to the third group.
(b) 2 S4 players are selected from 8 S4 players and
∴ The required number of ways  C412  C48  34 650
2 S5 players are selected from 5 S5 players.
109
NSS Mathematics in Action (2nd Edition) 5B Full Solutions
26. (a) There are (2 + 5) = 7 people.
The required number of arrangements  C47  35
(b) If Simon is in the taxi carrying 4 passengers, 3 more
people will be selected from the remaining 6 people
for that taxi.
∴ The required number of arrangements  C36  20
(c) Case I: Suppose Simon and Nick are in the taxi
carrying 3 passengers. Then, 1 more person
needs to be selected from the remaining 5
people for that taxi.
The number of arrangements in this case
 C15  5
Case II: Suppose Simon and Nick are in the taxi
carrying 4 passengers. Then, 2 more people
need to be selected from the remaining 5
people for that taxi.
The number of arrangements in this case
 C25  10
By addition rule of counting,
the required number of arrangements  5  10  15
(d) Suppose Simon is in the taxi carrying 3 passengers.
As Nick is not in this taxi, 2 more people can be
selected from the remaining 5 people for that taxi.
The number of such arrangements  C25  10
The situation is similar if Simon is in the taxi carrying
4 passengers, i.e. Nick is in the taxi carrying 3
passengers.
∴ The required number of arrangements
 C 25  2
 20
27. The number of combinations of 20 points taken 3 at a time
without repetition  C320  1140
The number of combinations of joining 3 collinear points
 C34  4
∴ The number of triangles formed  1140 4  1136
28. (a) The required number of ways  C45  C46  75
(b) There are 8! = 40 320 ways to assign the chosen
people on the sports ground.
By the multiplication rule of counting,
the required number of ways
 75 40 320
 3 0240000
29. First, 6 students are selected from the 20 students.
Then 3 students out of the 6 chosen students are assigned to
the posts of chairman, secretary and treasurer respectively.
Finally, the remaining 3 students are automatically assigned
to the post of coordinator.
∴ The required number of ways  C620  P36  4 651200
110
30. (a) There (9 + 7) = 16 different articles.
∴ The required number of ways  C616  8008
(b) (i) The required number of ways  C47  C29  1260
(ii) The number of ways of arranging the Chinese
articles  P47  840
The number of ways of arranging the English
articles  P29  72
By the multiplication rule of counting,
the required number of ways  840 70  60 480
Check Yourself (p. 10.44)
1. Addition rule Multiplication
of counting rule of counting
(a)  
(b)  
(c)  
(d)  
2. An arrangement of a certain number of objects in a definite
order is called a permutation .
For example, the number of ways to arrange 5 different toy
cars in a row is 5! = 120 .
3. A selection of r objects from n distinct objects regardless of
their order is called a combination .
For example, the number of ways to choose 4 colour pens
from 10 different colour pens is C410  210 .
4. (a) The number of ways of buying an electrical
appliance  5  3  4  12
(b) The number of ways of buying 3 electrical
appliances of different types  5  3  4  60
5. (a) The 4-digit number starts with 2.
The number of ways of forming a 4-digit number from
the remaining 6 numbers  P36  120
(b) The 4-digit number starts with 2 and ends with 9.
The number of ways of forming a 4-digit number from
the remaining 5 numbers  P25  20
6. (a) The letter ‘E’ must be selected.
The number of ways of selecting 2 letters from
the remaining 5 letters  C25  10
(b) The letters ‘A’ and ‘R’ must not be selected.
The number of ways of selecting 3 letters from
the remaining 4 letters  C34  4

7. (a) The number of ways of arranging the
teachers  8 !  40 320
(b) The number of ways of arranging 4 teachers to give a
speech  P48  1680
(c) The number of ways of selecting 2 male teachers and
2 female teachers  C25  C23  30
Revision Exercise 10 (p. 10.45)
Level 1
1. By the addition rule of counting,
the number of choices  8  5  6  19
2. By the addition rule of counting,
the number of choices  10  6  8  24
3. By the addition rule of counting,
(a) the required number of ways  4  4  8
(b) the required number of ways  13  26  13  26
(c) the required number of ways  13  12  3  22
(d) the required number of ways  13  16  4  25
4. By the multiplication rule of counting,
(a) the number of possible choices  3  2  4  24
(b) the number of possible choices  3  2  2  4  48
5. (a) By the addition rule of counting,
the required number of ways  2  3  2  4  11
(b) The number of males = 2 + 2 = 4
The number of females = 3 + 4 = 7
By the multiplication rule of counting,
the required number of ways  4  7  28
(c) The number of adults = 2 + 3 = 5
The number of children = 2 + 4 = 6
By the multiplication rule of counting,
the required number of ways  5  6  30
(d) By the multiplication rule of counting,
the required number of ways  2  3  6  36
6. (a) The required number of passwords
 26 261010  67 600
(b) There are 5 vowels.
∴ The required number of passwords
 5  26 10 10  13 000
(c) The last digit must be 0, 2, 4, 6 or 8.
∴ The required number of passwords
 26 26 10  5  33 800
(d) There are 24 choices of the first character and last digit
must be 7, 8 or 9.
∴ The required number of passwords
 24 2610 3  18 720
111
10 Permutation and Combination
7. (a) By the addition rule of counting,
the number of choices  8  6  5  19
(b) By the multiplication rule of counting,
the number of choices  8  6  48
(c) The number of ways to read 1 novel and 1 history
books = 8 × 5 = 40
The number of ways to read 1 science and 1 history
books = 6 × 5 = 30
By the addition rule of counting,
the number of choices  48  40  30  118
(d) By the multiplication rule of counting,
the number of choices  8  6  5  240
8. (a) The required number of ways  P210  90
(b) The required number of ways  P510  30 240
9. (a) The required number of ways  6! 720
(b) The required number of ways  P46  360
(c) The required number of ways  C46  15
10. (a) For each letter, there are 8 choices.
∴ The required number of ways  85  32 768
(b) The required number of ways  P58  6720
11. (a) The required number of combinations  C225  300
(b) The number of combinations with the same flavour
= 25
By the addition rule of counting,
the required number of combinations  300 25  325
12. Since 2 particular violinists must be included, 4 more
violinists are chosen from the remaining 8 violinists.
∴ The number of possible ways  C48  70
13. Since 3 particular students must be excluded and 1
particular student must be included, 4 more students are
chosen from the remaining (15 – 3 – 1) = 11 students.
∴ The required number of ways  C411  330
14. The number of ways of arranging Jack and Queenie at the
two ends of the row = 2! = 2
The number of ways of arranging the remaining 3 students
= 3! = 6
By the multiplication rule of counting,
the required number of ways  6  2  12
15. (a) The required number of ways  7! 5040
(b) The required number of ways  6! 720
NSS Mathematics in Action (2nd Edition) 5B Full Solutions
16. First, 3 athletes are selected from the 12 athletes into the
first group.
Then another 4 athletes are selected from the remaining
(12  3) = 9 athletes into the second group.
Finally, the remaining 5 athletes are automatically assigned
to the third group.
∴ The required number of ways  C312  C49  27 720
17. First, 3 books are selected from the 12 books and
distributed to the 1st child.
Then 3 books are selected from the remaining (12  3) = 9
books and distributed to the 2nd child.
After that, 3 books are selected from the remaining
(9  3) = 6 and distributed to the 3rd child.
Finally, the remaining 3 books are automatically distributed
to the 4th child.
∴ The required number of ways
 C312  C39  C36  369 600
Level 2
18. We can treat the triplets as a unit.
The number of ways of arranging the remaining 5 children
and the unit = 6! = 720
The number of ways of arranging the triplets = 3! = 6
By the multiplication rule of counting,
the number of possible arrangements  720 6  4320
19. The number of ways of arranging C, D, E and F = 4! = 24
      C46  C39  1260
A and B can be arranged in any 2 of the 5 positions as
shown above.
The number of ways of arranging A and B = P25  20
By the multiplication rule of counting,
the required number of ways  24 20  480
20. (a) The number of possible outcomes  P38  336
(b) 2 participants can be chosen from the remaining
7 participants for the first runner-up and the second
runner-up.
∴ The number of possible outcomes  P27  42
21. (a) The number of ways of assigning 4 out of 7 people to
live in 4 single rooms  P47  840
(b) The number of ways of assigning 4 people to live in 7
single rooms  P47  840
(c) The results in (a) and (b) are the same. We can
consider the people in (a) as rooms and the rooms as
people. The problem in (a) then becomes exactly the
same as that in (b).
22. (a) The required number of ways  P412  11880
(b) The problem is equivalent to arranging 12 icons in a
row.
∴ The required number of ways
 12! 479 001600
112
23. (a) We can treat the scouts as a unit.
The number of ways of arranging the girl guides and
the unit = 6! = 720
The number of ways of arranging the scouts = 4! = 24
By the multiplication rule of counting,
the required number of arrangements
 720 24  17 280
(b) The number of ways of arranging the girl guides
= 5! = 120
     
The scouts can stand in any 4 of the 6 positions as
shown above.
The number of ways of arranging the scouts
 P46  360
By the multiplication rule of counting,
the required number of arrangements
 120 360  43 200
24. (a) The required number of ways  C312  C19  1980
(b) The number of ways of selecting 4 students from
class A  C412
∴ The required number of ways  1980 C412  2475
25. The number of ways for forming the jury with 4 men
The number of ways for forming the jury with 5 men
 C56  C29  216
The number of ways for forming the jury with 6 men
 C66  C19  9
∴ The required number of ways
 1260 216  9
 1485
26. If ‘6’ is the second largest number drawn, the largest
number drawn must be ‘7’, ‘8’, ‘9’or ‘10’. The remaining
2 cards must be from ‘1’, ‘2’, ‘3’, ‘4’ and ‘5’.
∴ The required number of ways  4  C25  40
27. (a) (i) The total number of courses = 4 + 5 = 9
The number of different choices  C49  126
(ii) If the student had selected M1 and F2, 2 more
courses would have been selected from the
remaining 7 courses.
The number of choices with both M1 and F2
taken  C27  21
The required number of different choices
 126  21
 105
(b) The number of choices with no Finance courses
 C44  1
The number of choices with no Mathematics courses
 C45  5

The required number of different choices
 126  1  5
 120
28. (a) The number of ways of choosing 3 classes from
the 5 classes  C35
The required number of ways  C35  3  3  3  270
(b) The number of ways of selecting 3 members without
restrictions  C315  455
The required number of ways  455 270  185
29. (a) The boy can buy a $16 book, a $20 book or
a $28 book.
By the addition rule of counting,
the required number of ways  6  8  4  18
(b) The boy can buy a $16 book and a $34 book.
By the multiplication rule of counting,
the required number of ways  6  6  36
(c) If the boy buys a $16 book, the other book can be any
of the available books.
If the boy does not buy any $16 books, he can either
buy two $20 books or one $20 book plus one $28
book.
By addition and multiplication rule of counting,
the required number of ways
 6  (5  8  4  6)  8  (7  4)
 226
(d) If one story book is bought, the book can be any book
available.
If three story books are bought, the three books must
be $16 books.
It is impossible to buy more than 3 books using not
more than $50.
∴ The required number of ways
 (6  8  4  6)  226  6  5  4
 370
30. (a) (i) If the sum of the numbers on the cards drawn is
even, then the two numbers are either both odd or
both even.
∴ The number of required selections
 C25  C25  20
(ii) We consider the case when the product is odd.
The two numbers drawn must be odd in this case.
∴ The number of selections in which the
product is odd  C25  10
The number of selections without restrictions
 C210  45
∴ The required number of selections
 45  10  35
(b) (i) Either all the three numbers drawn are odd or
exactly one number drawn is odd.
The number of ways of selecting 3 odd numbers
 C35  10
113
10 Permutation and Combination
The number of ways of selecting exactly 1 odd
number  C25  C15  50
By the addition rule of counting,
the required number of selections  10  50  60
(ii) We consider the case when the product is odd.
All the three numbers drawn must be odd in this
case.
∴ The number of selections in which the
product is odd  C35  10
The number of selections without restrictions
 C310  120
∴ The required number of selections
 120  10  110
31. (a) There are 6 classmates in total.
The required number of ways  6 ! 720
(b) We can treat Sandy, Lisa and Eunice as a unit.
The required number of ways  4 ! 24
(c) If Sandy is the last one to present, the number of
arrangements is 5! = 120.
∴ The required number of ways
 720  120  600
(d) We treat Sandy and Lisa as a unit.
The number of ways to arrange the remaining
4 students and the unit = 5!
Either both Sandy and Lisa present before Eunice or
vice versa. In both cases, the numbers of ways to
arrange the students are the same.
5!
∴ The required number of ways =  60
2
32. (a) The required number of ways = P420  116 280
(b) The number of ways for boys to leave the lift
 P220  380
The number of ways for girls to leave the lift = 20
∴ The required number of ways
 380 20
 7600
33. (a) First, 2 of the 10 people are arranged to take the 2-seat
cable car.
Then, 4 of the remaining 8 people are arranged to take
the first 4-seat cable car.
Finally, the remaining 4 people are automatically
arranged to take the second 4-seat cable car.
∴ The required number of ways  C210  C48  3150
(b) The case can be considered as assigning 10 people to
10 seats in a row.
∴ The required number of ways  10! 3 628 800
34. (a) The number of ways of choosing one King = 4
The number of ways of choosing the other cards
 C448  194 580
NSS Mathematics in Action (2nd Edition) 5B Full Solutions
∴ The required number of different poker hands
 4 194 580
 778320
(b) The number of possible poker hands without
restrictions  C552  2 598 960
The number of hands without a King
 C548  1 712 304
∴ The required number of poker hands
 2 598 960  1 712 304
 886 656
(c) The number of possible ranks for the pair = 13
The number of possible suit combination for the pair
 C24  6
Since there should be exactly one pair, there are now
only 48 cards left for selection. Afterwards, every card
picked removes 3 other cards of the same rank from
the pool. This ensures that there will be no more than
one pair.
The number of ways of choosing the other three cards
48  44  40
  14 080
3!
∴ The required number of poker hands
 13 6 14 080
 1 098 240
35. (a) (i) The number of arrangements without restrictions
 8 ! 40 320
(ii) We treat Alan, Mr Cheung and Mrs Cheung as a
unit.
The number of ways of arranging the 5 friends
and the unit = 6! = 720
The number of ways of arranging Alan,
Mr Cheung and Mrs Cheung = 2! = 2
∴ The required number of arrangements
 720 2  1440
(b) (i) The number of arrangements without restrictions
 8 ! 40 320
(ii) We treat Alan, Mr Cheung and Mrs Cheung as a
unit.
The number of ways of arranging the unit in the
first row = 2! = 2
The number of ways of arranging the remaining 5
friends = 5! = 120
The number of ways of arranging Alan,
Mr Cheung and Mrs Cheung = 2! = 2
∴ The required number of arrangements
 2  120 2  480
36. (a) The number of ways of selecting 4 men from the
5 men  C45  5
The number of ways of selecting 3 women from the
5 women  C35  10
If the 3 selected women sit together, we can treat them
as a unit.
The number of ways of arranging the 4 men and the
unit = 5! = 120
The number of ways of arranging the 3 women = 3! = 6
114
By the multiplication rule of counting,
the required number of arrangements
 5 10120 6  36 000
(b) We treat the 3 selected women as a unit. There are
3 positions for the unit: 1 in the front row and 2 in the
back row.
The number of ways of arranging the 4 men = 4! = 24
The number of ways of arranging the 3 women = 3! = 6
By the multiplication rule of counting,
the required number of arrangements
 5 10 24 6  3  21600
37. (a) John has to make 7 moves in total: 3 moves
northwards and 4 moves eastwards. In any one of the
paths, he can make any 3 of the 7 moves to be
northwards moves, and the rest to be eastwards moves.
∴ The number of possible paths  C37  35
(b) John has to make n of (m + n) moves to be northwards
moves.
∴ The number of possible paths  C nm  n
Alternative Solution
John has to make m of (m + n) moves to be eastwards
moves.
∴ The number of possible paths  C mm  n
Multiple Choice Questions (p. 10.50)
1. Answer: B
There are 2 choices for the rice and 3 choices for the
noodle.
By addition rule of counting,
there are (2 + 3) = 5 choices for the main dish.
There are 5 choices for the drink.
By multiplication rule of counting,
the number of choices for a customer  5  5  25
2. Answer: C
By the multiplication rule of counting,
the required number of ways = 2 ´ 2 ´ 2 ´ 4´ 4 ´ 4 = 512
3. Answer: B
3 of the 6 sportsmen are awarded the gold, silver and
bronze medals.
∴ The required number of ways = P36 =120
4. Answer: A
We have to select 3 more students from
(15 – 1 – 1) = 13 students.
∴ The required number of ways  C313
5. Answer: C
The number of ways of arranging the black and the purple
marbles = 2! = 2
The number of ways of arranging the other 4 marbles in the
middle of the row = 4! = 24
∴ The required number of ways  2  24  48
6. Answer: C
We can treat books of the same type as a unit.
The number of ways of arranging the 3 units = 3! = 6
The number of ways of arranging the novels = 3! = 6
 10 Permutation and Combination

The number of ways of arranging the science books 3. The number of ways of choosing 2 English books  C24
= 4! = 24
The number of ways of arranging the dictionaries = 2! = 2 The number of ways of choosing 2 Chinese books  C 26
∴ The required number of ways  6  6  24 2  1728 The number of ways of choosing 2 Japanese books  C 29
By the addition rule of counting,
7. Answer: B X  C24  C26  C29
The number of ways to arrange C and D  2 ! 2
 57

   4. Refer to the figure.

Since A and B cannot stand together, there are 3 places, as
shown above, for A and B.
The number of ways to arrange A and B  P23  6
∴ The required number of ways  2  6  12

8. Answer: C The ant moves from A to B in 4 moves:

Suppose the first person in the row is a boy. 1 move: along the x-direction
The number of ways to arrange the 4 boys  4 ! 24 1 move: along the z-direction
The number of ways to arrange the 4 girls  4 ! 24 2 moves: along the y-direction
The situation is similar when the first person in the row is a ∴ S = The number of permutations of these 4 moves
girl. 4!

∴ The required number of ways  4 ! 4 ! 2  1152 2!
 12
9. Answer: B
The number of outcomes without restrictions
= 6 × 6 × 6 = 216 Exam Focus
The number of outcomes with no ‘6’
= 5 × 5 × 5 = 125 Exam-type Questions (p. 10.53)
∴ The required number of outcomes = 216 – 125 = 91
1. (a) The required number of ways  C48  70
10. Answer: B
Case I: Car A carries 5 people and car B carries 3 people.
The number of ways of arrangements  C58 (b) The required number of ways  C28  C26  420
Case II: Car A carries 4 people and car B carries 4 people.
The number of ways of arrangements  C 48 (c) The number of ways of selecting 4 balls without
∴ The required number of ways  C58  C48  126 restrictions  C414
∴ The required number of ways  C414  420  581
HKMO (p. 10.51)
1. The case can be considered as as putting two bars on a row
2. (a) 2 more students are selected from the remaining
of eight balls:
7 students.
  |    |    ∴ The required number of ways  C27  21

The 3 regions partitioned by the bars represent the 3 distinct (b) The tallest student among the 8 students should be
boxes. excluded. After the second tallest one among the 8
students is selected, 2 more students are selected from
        the remaining 6 students.
      
∴ The required number of ways  C26  15
Since every box contains at least one ball, the required
number of ways is just the number of ways of selecting 2 of
the 7 positions for the 2 bars. (c) Consider the 2 tallest students are selected at the same
∴ The required number of ways  C27  21 time. 1 more student is selected from the remaining
6 students.
The number of ways of selections in this case
2. We first considered the selection with order.
There are 5 × 5 = 25 choices for the 1st square.  C16  6
Since the 2nd square does not lies in the same row as the 1st The number of ways of selections without restrictions
square, the number of possible choices for the 2nd square is  C38  56
(25 – 9) = 16.
∴ The required number of ways  56  6  50
The number of selection with order considered
= 25 × 16 = 400
400
∴ The required number of ways   200
2

115
NSS Mathematics in Action (2nd Edition) 5B Full Solutions

3. (a) The number of ways of arranging Nick and Cathy = 2! 8. Answer: A

The case can be considered as selecting any 3 non-collinear
The number of ways of arranging the 5 friends = 5! vertices from the 12 vertices of the 6 squares.
∴ The required number of ways  2! 5! 240    

(b) We can treat Nick and Cathy as a unit.    

The number of ways of arranging Nick and Cathy = 2!
The number of ways of arranging the 5 friends and the    
unit = 6!
∴ The required number of ways  2 ! 6 ! 1440 The number of ways of selection without restriction
 C312  220
(c) We can consider the two particular participants as Nick The number of ways of selecting 3 collinear vertices
and Cathy. From (b), the number of ways of arranging  C34  3  4  4  20
them sitting together is 1440. ∴ The required number of ways  220 20  200
The number of ways of arrangements without
restrictions = 7!
∴ The required number of ways  7 !  1440 3600 Investigation Corner (p. 10.55)

4. (a) There are 13 members younger than 40. (a) (i) Step 1: 5 ways
Step 2: 4 ways
∴ The required number of ways  C513  1287 Step 3: 3 ways
(ii) Case 1:
(b) There are 7 members older than 40. Step 4: 1 ways
The number of ways of assigning the chairperson and Step 5: 3 ways
Case 2:
the vice-chairperson  P27
Step 4: 2 ways
There are 6 members younger than 30. Step 5: 2 ways
The number of ways of assigning the secretary = 6 (iii) The required number of ways
There are 17 members left for the selections of the  5  4  3  (1 3  2  2)
treasurer and the coordinator.
The number of ways of assigning the treasurer and the
 420
coordinator  P217
(b) (i) The required number of ways
∴ The required number of ways
 10  9  8  (1 8  7  7)
 P27  6  P217  68 544
 41040
(ii) Colouring figures (2) and (3) is the same as colouring
5. Answer: C
Case 1: If a red card is drawn from Box A, the other card figure (1).
drawn from Box B can only be blue. ∴ The required number of ways  41040
The number of ways of selection in this case
 3  5  15 (c) (i) The required number of ways
Case 2: If a yellow card is drawn from Box A, the other  n(n  1)(n  2)[1 (n  2)  (n  3)  (n  3)]
card drawn from Box B can be red or blue.
 n(n  1)(n  2)(n  2  n 2  6n  9)
The number of ways of selection in this case
 2  (2  5)  14  n(n  1)(n  2)(n 2  5n  7)
Case 3: If a blue card is drawn from Box A, the other card (ii) Colouring figures (2) and (3) is the same as colouring
drawn from Box B can only be red. figure (1).
The number of ways of selection in this case ∴ The required number of ways
 4 2  8
 n(n  1)(n  2)(n 2  5n  7)
∴ The required number of ways  15  14  8  37

6. Answer: B
We can treat Winnie and Yanny as a unit.
∴ The required number of ways  5! 120

7. Answer: B
The number of ways of selection without restriction
 C310  120
The number of ways of selection with no boys
 C36  20
∴ The required number of ways  120 20  100

116