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

10 Permutation and From the table above, there are 9 possible outcomes.
Combination

Review Exercise 10 (p. 10.3)

1.

Winner of Winner of Winner of Possible

1st match 2nd match 3rd match outcomes
X XXX
X
Y XXY
X
X XYX
Y
Y XYY

X YXX
X
Y YXY
Y
X YYX
Y
Y YYY

From the tree diagram, there are 8 possible outcomes.

2.

Flavours Sizes Possible choices

L B, L

B M B, M

S B, S

L C, L

C M C, M

S C, S

From the tree diagram, there are 6 possible choices.

3. Multiple-choice question

A B C D

True-false T T, A T, B T, C T, D
question F F, A F, B F, C F, D

From the table above, there are 8 possible outcomes.

4. 2nd digit

1 2 3

1 11 12 13

1st digit 2 21 22 23

3 31 32 33

100
 10 Permutation and Combination

Activity 4 ! P 53  1440 .

Activity 10.1 (p. 10.17)

1. (b) 10  9  8  720
(c) 10  9  8  7  5040
Classwork
2. (a) n  ( n  1)
Classwork (p. 10.14)
(b) n  ( n  1)  ( n  2)
1. (a) 3 ! 4 ! 3  2  1  4  3  2  1  30
(c) n  ( n  1)  ( n  2)  ( n  3)
(d) n  ( n  1)  ( n  2)  ...  ( n  r  1) (b) 6 ! 0 ! 6  5  4  3  2  1  1  719

3. From the results of questions 1 and 2, we can see that the (c)
number of permutations of n distinct objects taken r at a 7 !  2 ! 7  6  5  4  3  2  1 2  1  10 080
time is a product of r consecutive terms.
10 ! 10  9  8  7  6  5  4  3  2  1

Activity 10.2 (p. 10.29) (d) 5! 5  4  3  2 1
1. (a) The number of permutations of 4 coloured cups taken  10  9  8  7  6
2 at a time is P24  12 .  30 240

(b) Permutation Combination 2. (a)  (b)  (c)  (d) 

RB BR RB
RG GR RG Classwork (p. 10.17)
RO OR RO (a) 5
BG GB BG
BO OB BO (b) 5  4  20
GO OG GO (c) 5  4  3  60
(d) 5  4  3  2  120
From the table above, we can see that each
(e) 5  4  3  2  1  120
combination of 2 colours can be permuted in
2! = 2 ways.
Therefore, the number of combinations of 2 coloured Classwork (p. 10.36)
4 (a) combination (b) permutation
P (c) combination (d) permutation
cups selected from 4 is 
2
6 .
(e) permutation
(2!)
Quick Practice
2. (a) The number of permutations of 4 coloured cups taken
3 at a time is P3
4
 24 . Quick Practice 10.1 (p. 10.5)
By the addition rule of counting,
(b) Permutation Combination the number of choices  4  6  3  13
RBG RGB BRG BGR GRB GBR RBG
RBO ROB BRO BOR ORB OBR RBO Quick Practice 10.2 (p. 10.6)
RGO ROG GRO GOR ORG OGR RGO By the addition rule of counting,
BGO BOG GBO GOB OBG OGB BGO the total number of students  20  12  8  24
From the table above, we can see that each combination
Quick Practice 10.3 (p. 10.7)
of 3 colours can be permuted in 3! = 6 ways.
By the multiplication rule of counting,
Therefore, the number of combinations of 3 coloured
the number of different choices  4  2  3  24
P34
cups selected from 4 is  4.
(3!) Quick Practice 10.4 (p. 10.8)
(a) By the multiplication rule of counting,
the number of possible PINs
P2n P3n Prn  26  26  10  10  10  676 000
3. (a) (b) (c)
2! 3! r!
(b) By the multiplication rule of counting,
the number of possible PINs
 1  26  10  10  5  13 000
Maths Dialogue
Quick Practice 10.5 (p. 10.9)
Maths Dialogue (p. 10.25) By the multiplication rule of counting,
Ken forgot to remove the arrangements that ‘exactly 2 birds are the number of ways to travel from Quarry Bay to Tuen Mun via
placed next to each other’ from 7!. Angel forgot to consider that Central  4  2  8
the birds could be placed in the front or at the back of the The number of ways to travel directly from Quarry Bay to Tuen
mammals. The correct number of arrangements is Mun  3
By the addition rule of counting,

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

the total number of ways to travel from Quarry Bay to Tuen By the multiplication rule of counting,
Mun  8  3  11 the number of 3-digit numbers formed in (a) are greater
than 500 =3 ´ 6 =18

Quick Practice 10.6 (p. 10.10)

(a) By the addition rule of counting,
the number of choices  2  3  5  10
Quick Practice 10.11 (p. 10.22)
(b) By the multiplication rule of counting, (a) The number of ways to choose the 2 letters  P226
the number of choices  2  3  5  30
The number of ways to choose the 4 digits  P410
(c) By the multiplication rule of counting, By the multiplication rule of counting,
the number of ways to take a tennis course and a volleyball the number of possible passwords =
course  2  3  6 P226  P410  3 276 000
the number of ways to take a volleyball course and a
squash course  3  5  15 Quick Practice 10.12 (p. 10.23)
the number of ways to take a tennis course and a squash (a) The number of ways of arranging face cards on the right
course  2  5  10 = 3!
By the addition rule of counting, The number of ways of arranging number cards on the left
= 3!
the number of choices  6  15  10  31 By the multiplication rule of counting,
the number of possible arrangements  3 !  3 ! 36
Quick Practice 10.7 (p. 10.15)
10 ! 10  9  8 ! (b) We can treat all the face cards as a unit.
 The number of ways of arranging the number cards and the
58! 58!
(a) unit = (3 + 1)! = 4!
10  9 The number of ways of arranging the number cards = 3!

5 By the multiplication rule of counting,
 18 the number of possible arrangements  4 !  3 !  144

Quick Practice 10.13 (p. 10.24)

5!19! 5! 19! Arrange the consonants B, C, D and F in a row.

20! 20  19! The number of ways to arrange the 4 consonants is 4!.
(b) Since vowels A and E must be separated by consonants, they can
5  4  3  2 1
 be arranged into the 5 positions between or next to the
20 consonants as shown below.
6
Consonants:
Vowels:     
Quick Practice 10.8 (p. 10.19)
The number of ways to arrange the vowels  P 5

(a) P210 P22  (10  9)  ( 2  1) 2

The required number of permutations = 4 !  P2  480

5
 180 ∴

Alternative Solution
P312 12  11  10 The total number of permutations without restrictions
(b)
 = 6! = 720
P26 65
The number of permutations with the vowels next to each other
 44 = 5! × 2! = 240
∴ The required number of permutations
 720  240  480
Quick Practice 10.9 (p. 10.20)
(a) The number of permutations  7!  5040
Quick Practice 10.14 (p. 10.31)
12  11  10  9 2  1
(b) The number of permutations  P4  840
7
(a)
C 412 C 22  
4  3  2 1 2 1
 495
Quick Practice 10.10 (p. 10.21)
(a) The number of 3-digit numbers formed = P34 =24

(b) The first digit must be 5, 6 or 8.

The number of ways of filling in the first digit is P13  3.
After choosing 5, 6 or 8 as the first digit, we have
3 numbers left.
The number of ways of filling in the remaining 2 digits
is P23  6.

102
 10 Permutation and Combination

C 216 16 ! 5! The required number of committees formed

   495  460
C4 5
(16  2)! 2 ! (5  4)! 4 !  35
16 ! 1! 4 !
(b)  
14 ! 2 ! 5! Quick Practice 10.18 (p. 10.37)
16  15  14 ! 4! Number of ways of selecting 9 boys from 15 boys  C915
  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 = C 5
20
 15 504

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

20

Quick Practice 10.16 (p. 10.34) Quick Practice 10.19 (p. 10.38)
(a) The number of ways of selecting 3 girls and 2 boys (a) The number of ways to arrange 4 girls in the front row = 4!
 C 312  C 210 The number of ways to arrange 6 boys in the back row = 6!
∴ The number of possible arrangements
 9900  4 ! 6 !
 17 280
(b) Since 2 particular girls must be included and 4 particular
boys must be excluded, there are (12 – 2) = 10 girls and (10
– 4) = 6 boys remained for selection. (b) (i) The number of possible arrangements
The required number of ways  10 !
 C110  C 26  3 628 000

 150 (ii) Consider the girls stand in the first row.

Quick Practice 10.17 (p. 10.35)
(a) The total number of mathematicians and physicists
 5  7  12
The required number of committees formed
 C812
 495
(b) Exactly 4 mathematicians must be included.
The required number of committees formed
 C 45  C 47
 175
(c) The committee can have 1 mathematician and 7 physicists,
or 2 mathematicians and 6 physicists, or 3 mathematicians
and 5 physicists.
The number of committees with exactly 1 mathematician
 C15  C 77
The number of committees with exactly 2 mathematicians
 C 25  C 67
The number of committees with exactly 3 mathematicians
 C 35  C 57
By the addition rule of counting,
the required number of committees formed
 C15  C 77  C 25  C 67  C35  C57
 285
(d) The number of committees with more than 3 physicists
 175  285
 460
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
 69 120
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

103
NSS Mathematics in Action (2nd Edition) 5B Full Solutions
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
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)
(a) The number of 4-letter strings formed = P4  120
5
1.
(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!
104
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
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)
(a) The required number of choices  C 3  120
10
1.
(b) The required number of choices  P3  720
10
2. The total number of animals in the shop = 5 + 6 = 11
(a) (i) The required number of ways = C6  462
11
(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 = C4  126
9
(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
3. (a) The number of ways to form the first group from the 9
students  C 39
The number of ways to form the second and third
group from the remaining 6 students  C 36
The required number of arrangements
 C 39  C 36  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
105
10 Permutation and Combination
(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  4  65 536
8
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  10  100 000
5
(b) By the multiplication rule of counting,
the number of possible zip codes
 9  10 4  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
NSS Mathematics in Action (2nd Edition) 5B Full Solutions

 9  103  4 If Ivan buys hamburger, he can only buy mineral water.

 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.
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

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
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
(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
(c) The first digit can only be 2, 3 or 4.
By the multiplication rule of counting,
the number of 3-digit numbers formed
 3  7  7  147
(d) Since the number formed is odd, the last digit must be
3, 5, 7 or 9.
Since the number formed is greater than 400, the first
digit must be 4, 5, 7 or 9.
By the multiplication rule of counting,
the number of 3-digit numbers formed
 4  7  4  112

20. (a) By the addition rule of counting,

the required number of choices  8  3  11 Exercise 10B (p. 10.26)
Level 1
1. 2!  4!  2  1  4  3  2  1  26
(b) By the multiplication rule of counting,
the required number of choices  11  5  55
2. 5!  0!  5  4  3  2  1  1  119
21. (a) By the multiplication rule of counting,
the required number of ways  2  3  6 3. 5  6! 5  6  5  4  3  2  1  3600

(b) Number of ways for a car to travel from town P to 4. (3! ) 2  (3  2  1) 2  6 2  36

town Q via Y  2  1  2
By the addition rule of counting,
10! 10  9  8!
the required number of ways  6  2  8 5.   10  9  90
8! 8!
22. (a) By the multiplication rule of counting,
the number of ways  4  3  12 3! 6! 3! 6! 3  2 1 1
6.   
9! 9  8  7  6! 98 7 84
(b) By the multiplication rule of counting,
the number of ways  4  3  6  72 7. P37  7  6  5  210

(c) The number of ways for taking one finance course and
one language course = 3 × 6 = 18 8. P55  5  4  3  2  1  120
The number of ways for taking one accounting course
and one language course
= 4 × 6 = 24 9. P25  P34  5  4  4  3  2  44
By the addition rule of counting,
the number of ways  12  18  24  54 10. P45 P15  (5  4  3  2)  5  600

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. P310 10  9  8 6
If Ivan buys French fries, he can only buy mineral water or 11.  
orange juice. P4 7
7 65 4 7

106
 10 Permutation and Combination

The required number of ways = P3  60

5

P P 2
( 2  1)  (8  7  6  5) 28
8

12.
2
 4

P46
65 43 3 (b) Winnie is not the champion and the first runner-up.
The number of ways of awarding the champion and
13. The required number of possible outcomes  4!  24 the first runner-up = P24
The possible outcomes are listed as follows: After that, there are (5 – 2) = 3 ways for awarding the
CART, CATR, CRAT, CRTA, CTAR, CTRA,
second runner-up.
ACRT, ACTR, ARCT, ARTC, ATCR, ATRC,
RCAT, RCTA, RACT, RATC, RTCA, RTAC, By the multiplication rule of counting,
the required number of ways  P2  3  36
4
TCAR, TCRA, TACR, TARC, TRCA, TRAC
25. (a) The required number of ways  8!  40 320
14. The required number of ways  6!  720
15. The required number of ways
 8!  40 320 (b) The number of ways of arranging the girls = 3! = 6
The number of ways of arranging the boys = 5! = 120
By the multiplication rule of counting,
16. There are 5 different choices for digits.
the required number of ways  6  120  720
The number of 3-digit numbers formed  P3  60
5

(c) Alvin can be the 4th, 5th, 6th, 7th or 8th pupil leaving
17. The required number of ways  P4  863 040
32
the classroom.
The number of ways of arranging the remaining
18. (a) The required number of ways  7!  5040 7 students = 7! = 5040
By the multiplication rule of counting,
(b) The required number of ways  P4  840
7
the required number of ways
 5040  5  25 200

19. (a) The required number of ways  P  1680

8
4
26. Suppose all sports magazines are placed on the right.
The number of ways of arranging the sports magazines
(b) The required number of ways = 8  4096
4

 P35
The number of ways of arranging the computer magazines
20. (a) The required number of ways  P4  360
6

 P46
The situation is similar when all sports magazines are
(b) The required number of ways  6  1296
4

placed on the left.

By the multiplication rule of counting,
21. (a) The letter ‘L’ in the word ‘MULTIPLY’ is repeated.
the required number of ways  P3  P4  2  43 200
5 6
∴ The number of permutation of all the letters must
be less than 8!.
27. (a) The total number of arrangements without restrictions
(b) All dogs are distinct.  6!  720
∴ The number of ways of arranging 8 dogs in a row
is 8!.
(b) We can treat Carmen and Elle as a unit.
The number of ways of arranging the 4 friends and the
Level 2 unit = 5! = 120
22. (a) The number of 3-digit numbers formed = P3  120
6
The number of ways of arranging Carmen and Elle
= 2! = 2
(b) The last digit can be 2, 4, 6 or 8. By the multiplication rule of counting,
After the last digit is chosen, the first 2 digits can be the number of arrangements for Carmen and Elle
chosen from the remaining (6 – 1) = 5 numbers and sitting next to each other  120  2  240
the number of such ways is P25  20 .
(c) The number of arrangements for Carmen and Elle not
By the multiplication rule of counting, sitting next to each other  720  240  480
the number of even 3-digit numbers in (a)
 20  4  80
28. (a) The total number of arrangements without restrictions
 5!  120
23. Kelly can be the champion, the first runner-up or the second
runner-up. After the position of Kelly is fixed, the (b) We can treat Jelly and Ken as a unit.
remaining 7 athletes can be ranked in 7! = 5040 ways. The required number of ways
By the multiplication rule of counting,  (5  1)!  4!  24
the required number of ways  3  7!  15 120

(c) When there are no restrictions, either Jelly stands

24. (a) The total number of participants = 5
behind Ken or Ken stands behind Jelly. The numbers
107
NSS Mathematics in Action (2nd Edition) 5B Full Solutions

of ways of arranging the queue in each of these two of the parents sitting at one end of the row
 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

Since both Tom and Mary must be seated between two

The number of ways of arranging the remaining children, there are 6 possible pairs of positions (i.e.
3 persons = 3! = 6 (1, 2), (1, 3), (1, 4), (2, 3), (2, 4) and (3, 4)) for them.
By addition rule and multiplication rule of counting, The number of ways of arranging Tom and Mary
the required number of ways = 2! = 2
 ( 4  3  2  1)  6  60 ∴ The required number of ways
 6  2  120  1440

(d) We can treat Jelly, Leo and Mandy as a unit. (d) The number of ways of arranging Tom and Mary
The number of ways of arranging the remaining 2 = 2! = 2
people and the unit = 3! = 6 (i) The number of ways of arranging the 5 children
The number of ways of arranging Jelly, Leo and = 5! = 120
By the multiplication rule of counting,
Mandy = 3! = 6 the required number of ways
By the multiplication rule of counting,  2  120  240
the required number of ways  6  6  36 (ii) If no sons can sit next to each other, then the boys
and girls must sit alternatively.
29. (a) The pattern must be BRBRBRBRB, where R and B The number of ways of arranging the 3 boys
represent a red ball and a blue ball respectively. = 3! = 6
The number of ways or arranging the 2 girls
The number of ways of arranging the red balls = 2! = 2
= 4! = 24 By the multiplication rule of counting,
The number of ways of arranging the blue balls the required number of ways
= 5! = 120  2  6  2  24
By the multiplication rule of counting,
the required number of ways  24  120  2880 Exercise 10C (p. 10.39)
Level 1
(b) Arrange the 5 blue balls in a row and there are P24 4  3
5! = 120 ways of arranging the blue balls. 1. C24   6
2! 2 1
B B B B B
      P25 5 4
The 4 red balls can be inserted into the 6 positions 2. C25  C77  1   1  11
between or next to the blue balls as shown above. 2! 2
The number of ways of arranging the red balls
 P46  360 P36 6  5  4
3. C C  1
4
0
6
3   20
By the multiplication rule of counting, 3! 3  2 1
the required number of ways
 120  360  43 200
C 28 8! 8!
 
30. The situation can be restructured as follows: C 48 6! 2! 4! 4!
Arrange 5 women and 5 men, M1, M2, M3, M4 and M5, in a 4! 4!
row as shown below: 
(F) (F) (F) (F) (F) 4. 6! 2!
     4  3  2!  4!
There are 5 places for the 5 men to stand. 
6  5  4!  2!
∴ The number of ways of pairing up  5 !  120
2

31. (a) The total number of arrangements without restrictions 5
=7 ! =5040

(b) The number of ways of arrangements for no parents

sitting at one end of the row  5!  P25  2400
The number of ways of arrangements for at least one
108
 10 Permutation and Combination

The required number of ways  C 2  15

6
C33C 46 1 C 664 ∴

C35 C553 14. (a) Since the fastest typist is included, 2 more typists are
C 6 chosen from the remaining 19 typists.
 2
5 ∴ The required number of choices  C 2  171
19
C 2
5. P26 P25 (b) Since the slowest typist is not included, all 3 typists
  are chosen from the remaining 19 typists.
2! 2!
∴ The required number of choices  C3  969
19
65

5 4 15. The number of possible combinations
3  C 645  8 145 060

2 The amount the player has to pay
 $2  8 145 060
C C C C  C C
6 7 6 7 6 7
C C
6 7  $16 290 120
2 4 3 3 2 7 4 3 3

 C (C  C36 )
7
3
6
2

P37  P26 P36  Level 2

   
6. 3!  2! 3!  16. The number of lines between any two distinct vertices
= The number of combinations of 12 vertices taken 2 at a
7  65  6 5 65 4 
    time without repetition
3  2 1  2  1 3  2  1  = C 212
 35  (15  20) = 66
 1225 ∴ The number of diagonals
 66  the number of sides
7. (a) The possible combinations are listed as follows:  66  12
RBG, RBY, RBV, RGY, RGV,  54
RYV, BGY, BGV, BYV, GYV

(b) The number of possible combinations  C3  10

5 17. The number of ways of selecting a captain =C110
The number of ways of selecting 4 members from the
8. The required number of ways  C
18
5  8568 remaining 9 people =C49
10
∴ The required number of ways =C1 ´ C49 =1260
9. There are 30 days in June.
The number of possible choices  C5  142 506
30
∴ 18. (a) The required number of ways  C 2  C 2  675
10 6

10. There are 9 multiples of 5 from 10 to 50 inclusive (i.e. 10, (b) The required number of ways  C 4  C1  1260
10 6

15, 20, 25, 30, 35, 40, 45 and 50).

∴ The required number of ways  C 4  126
9
19. The number of ways to select a goalkeeper  C13
The number of ways to select 10 more starters from the
11. (a) The number of possible outcomes  C 2  66
12
19 remaining players  C10
19

∴ The required number of ways

(b) The number of possible outcomes  P2  132
12
 C1019
 C13  277 134

12. There are (20 – 2) = 18 students eligible for selection. 20. (a) The number of different committees
The required number of ways  C 6  18 564
18
∴  C37  C 28  980

13. (a) The required number of ways  C 4  70

8 (b) 7 economists are eligible to be selected.
∴ The number of different committees
 C37  C 27
(b) Only 7 letters can be selected.
 735
The required number of ways  C 4  35
7
∴

(c) 2 more accountants are selected from the remaining

(c) Only 2 more letters can be selected from the remaining
6 accountants and 1 more economist is selected from
6 letters.
the remaining 7 economists.

109
NSS Mathematics in Action (2nd Edition) 5B Full Solutions
∴ The number of different committees
 C C
6
2
7
1
 105
21. (a) 2 more participants are selected from the remaining
30 scouts.
∴ The required number of ways  C 2  435
30
(b) All 4 participants are selected from the remaining
30 scouts.
∴ The required number of ways
 C 430  27 405
(c) 3 more participants are selected from the remaining
30 scouts.
∴ The required number of ways  C3  4060
30
22. (a) There are (8 + 5) = 13 players in total.
The required number of ways  C 4  715
13
(b) 2 S4 players are selected from 8 S4 players and
2 S5 players are selected from 5 S5 players.
∴ The required number of ways
 C 28  C 25
 280
(c) The number of ways of forming a team with no S4
players = C  5
5
4
∴ The required number of ways
 715  5
 710
23. (a) The required number of ways  C 5  126
9
(b) There are (9 – 2) = 7 friends eligible for selection.
∴ The required number of ways  C5  21
7
(c) If Emma and Frankie are invited together, 3 more
friends will be invited from the remaining 7 friends.
The number of ways of selection if Emma and Frankie
are invited together  C37  35
∴ The required number of ways
 126  35  91
24. (a) There are (5 + 6) = 11 members.
The required number of ways  C 4  330
11
(b) The number of ways with exactly 3 S5 members
selected  C35  C16  60
The number of ways with exactly 4 S5 members
selected  C 45  5
∴ The required number of ways
 330  60  5
 265
(c) The number of ways with exactly 2 S5 members
110
selected  C 25  C 26  150
∴ The required number ways
 265  150  115
(d) The number of ways with no S5 members selected
= C 46  15
The number of ways with no S6 members selected
= C 45  5
∴ The required number of ways
 330  15  5
 310
25. (a) 6 buses are selected from the 12 buses into the first
group. The remaining 6 buses are automatically
assigned to the second group.
The required number of ways = C6  924
12
∴
(b) First, 4 buses are selected from the 12 buses into the
first group.
Then another 4 buses are selected from the remaining
8 buses into the second group.
Finally, the remaining 4 buses are automatically
assigned to the third group.
∴ The required number of ways
 C 412  C 48  34 650
26. (a) There are (2 + 5) = 7 people.
The required number of arrangements  C 4  35
7
(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
 C 25  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  C 25  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
 10 Permutation and Combination

 C 25  2 10
from 10 different colour pens is C 4  210 .
 20
4. (a) The number of ways of buying an electrical
27. The number of combinations of 20 points taken 3 at a time appliance  5  3  4  12
without repetition  C320  1140
(b) The number of ways of buying 3 electrical
The number of combinations of joining 3 collinear points
appliances of different types  5  3  4  60
 C34  4
∴ The number of triangles formed 5. (a) The 4-digit number starts with 2.
 1140  4  1136 The number of ways of forming a 4-digit number from
the remaining 6 numbers  P3  120
6

28. (a) The required number of ways  C 4  C 4  75

5 6

(b) The 4-digit number starts with 2 and ends with 9.

(b) There are 8! = 40 320 ways to assign the chosen The number of ways of forming a 4-digit number from
the remaining 5 numbers  P2  20
5
people on the sports ground.
By the multiplication rule of counting,
the required number of ways
6. (a) The letter ‘E’ must be selected.
 75  40 320
The number of ways of selecting 2 letters from
 3 0240 000
the remaining 5 letters  C 2  10
5

29. First, 6 students are selected from the 20 students.

Then 3 students out of the 6 chosen students are assigned to (b) The letters ‘A’ and ‘R’ must not be selected.
the posts of chairman, secretary and treasurer respectively. The number of ways of selecting 3 letters from
the remaining 4 letters  C3  4
4
Finally, the remaining 3 students are automatically assigned
to the post of coordinator.
∴ The required number of ways
 C 620  P36  4 651 200

30. (a) There (9 + 7) = 16 different articles.

∴ The required number of ways  C 6  8008
16

(b) (i) The required number of ways

 C 47  C 29  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

111
NSS Mathematics in Action (2nd Edition) 5B Full Solutions
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  P4  1680
8
(c) The number of ways of selecting 2 male teachers and
2 female teachers  C 2  C 2  30
5 3
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
7. (a) By the addition rule of counting,
the number of choices  8  6  5  19
112
(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
(a) The required number of ways  P2  90
10
8.
(b) The required number of ways  P5  30 240
10
9. (a) The required number of ways  6! 720
(b) The required number of ways  P4  360
6
(c) The required number of ways  C 4  15
6
10. (a) For each letter, there are 8 choices.
∴ The required number of ways  85  32 768
(b) The required number of ways  P5  6720
8
11. (a) The required number of combinations  C 2  300
25
(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  C 4  70
8
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  C 4  330
11
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
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
 10 Permutation and Combination

to the third group. the required number of arrangements

∴ The required number of ways  720  24  17 280
 C312  C 49  27 720
(b) The number of ways of arranging the girl guides
17. First, 3 books are selected from the 12 books and = 5! = 120
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 The scouts can stand in any 4 of the 6 positions as
(9  3) = 6 and distributed to the 3rd child. shown above.
Finally, the remaining 3 books are automatically distributed The number of ways of arranging the scouts
to the 4th child.  P46  360
∴ The required number of ways By the multiplication rule of counting,
 C312  C39  C36  369 600 the required number of arrangements
 120  360  43 200

Level 2
18. We can treat the triplets as a unit. 24. (a) The required number of ways  C 3  C1  1980
12 9
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 (b) The number of ways of selecting 4 students from
By the multiplication rule of counting, class A  C 412
the number of possible arrangements
∴ The required number of ways
 720  6  4320
 1980  C 412  2475
19. The number of ways of arranging C, D, E and F = 4! = 24
25. The number of ways for forming the jury with 4 men
 C 46  C39  1260
     The number of ways for forming the jury with 5 men
A and B can be arranged in any 2 of the 5 positions as
shown above.  C56  C 29  216
The number of ways of arranging A and B = P25  20 The number of ways for forming the jury with 6 men

By the multiplication rule of counting,  C 66  C19  9

the required number of ways  24  20  480 ∴ The required number of ways
 1260  216  9
 1485
20. (a) The number of possible outcomes  P3  336
8

(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  P2  42
7
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  C 2  40
5

21. (a) The number of ways of assigning 4 out of 7 people to 27. (a) (i) The total number of courses = 4 + 5 = 9
The number of different choices  C 4  126
9
live in 4 single rooms  P4  840
7

(ii) If the student had selected M1 and F2, 2 more

(b) The number of ways of assigning 4 people to live in 7 courses would have been selected from the
remaining 7 courses.
single rooms  P4  840
7
The number of choices with both M1 and F2
taken  C 27  21
(c) The results in (a) and (b) are the same. We can The required number of different choices
consider the people in (a) as rooms and the rooms as  126  21
people. The problem in (a) then becomes exactly the
same as that in (b).  105

22. (a) The required number of ways  P4  11 880

12 (b) The number of choices with no Finance courses
 C 44  1
(b) The problem is equivalent to arranging 12 icons in a The number of choices with no Mathematics courses
row.  C 45  5
∴ The required number of ways
 12 !  479 001 600
23. (a) We can treat the scouts as a unit.
The number of ways of arranging the girl guides and The required number of different choices
the unit = 6! = 720  126  1  5
The number of ways of arranging the scouts = 4! = 24  120
By the multiplication rule of counting,

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

28. (a) The number of ways of choosing 3 classes from  10  50  60

the 5 classes  C 5
3 (ii) We consider the case when the product is odd.
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. (refer to Amendment List in 2016)
(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
 C26  6  (8  4  6)  C28  8  4
 183
(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)  183  C36
 227
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
 C 25  C 25  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  C 25  10
The number of selections without restrictions
 C 210  45
∴ The required number of selections
 45  10  35
All the three numbers drawn must be odd in this
case.
∴ The number of selections in which the
product is odd  C 35  10
The number of selections without restrictions
 C 310  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 = P4  116 280
20
(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
 C 210  C 48  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

(b) (i) Either all the three numbers drawn are odd or 34. (a) The number of ways of choosing one King = 4
exactly one number drawn is odd. The number of ways of choosing the other cards
The number of ways of selecting 3 odd numbers
 C 448  194 580
 C  10
5
3
The number of ways of selecting exactly 1 odd ∴ The required number of different poker hands
number  C 25  C15  50  4  194 580
By the addition rule of counting,  778 320
the required number of selections

114
 10 Permutation and Combination

(b) The number of possible poker hands without The number of ways of arranging the 4 men = 4! = 24
restrictions  C 52
 2 598 960 The number of ways of arranging the 3 women = 3! = 6
5
By the multiplication rule of counting,
The number of hands without a King the required number of arrangements
 C548  1 712 304  5  10  24  6  3  21 600

∴ The required number of poker hands

 2 598 960  1 712 304 37. (a) John has to make 7 moves in total: 3 moves
northwards and 4 moves eastwards. In any one of the
 886 656
paths, he can make any 3 of the 7 moves to be
northwards moves, and the rest to be eastwards moves.
(c) The number of possible ranks for the pair = 13 ∴ The number of possible paths  C3  35
7
The number of possible suit combination for the pair
 C 24  6 (b) John has to make n of (m + n) moves to be northwards
Since there should be exactly one pair, there are now moves.
only 48 cards left for selection. Afterwards, every card mn
∴ The number of possible paths  C n
picked removes 3 other cards of the same rank from
the pool. This ensures that there will be no more than
one pair. Alternative Solution
The number of ways of choosing the other three cards John has to make m of (m + n) moves to be eastwards
48  44  40 moves.
  14 080 mn
3! ∴ The number of possible paths  C m
∴ The required number of poker hands
 13  6  14 080 Multiple Choice Questions (p. 10.50)
 1 098 240 1. Answer: B
There are 2 choices for the rice and 3 choices for the
noodle.
35. (a) (i) The number of arrangements without restrictions By addition rule of counting,
 8 !  40 320 there are (2 + 3) = 5 choices for the main dish.
(ii) We treat Alan, Mr Cheung and Mrs Cheung as a There are 5 choices for the drink.
unit. By multiplication rule of counting,
The number of ways of arranging the 5 friends  5  5  25
the number of choices for a customer
and the unit = 6! = 720
The number of ways of arranging Alan,
Mr Cheung and Mrs Cheung = 2! = 2 2. Answer: C
∴ The required number of arrangements By the multiplication rule of counting,
 720  2  1440 the required number of ways
=2 ´ 2 ´ 2 ´ 4 ´ 4 ´ 4 =512
(b) (i) The number of arrangements without restrictions
 8 !  40 320 3. Answer: B
3 of the 6 sportsmen are awarded the gold, silver and
(ii) We treat Alan, Mr Cheung and Mrs Cheung as a bronze medals.
unit. 6
The number of ways of arranging the unit in the ∴ The required number of ways =P3 =120
first row = 2! = 2
The number of ways of arranging the remaining 5 4. Answer: A
friends = 5! = 120 We have to select 3 more students from
The number of ways of arranging Alan, (15 – 1 – 1) = 13 students.
Mr Cheung and Mrs Cheung = 2! = 2
∴ The required number of ways  C3
13
∴ The required number of arrangements
 2  120  2  480
5. Answer: C
36. (a) The number of ways of selecting 4 men from the The number of ways of arranging the black and the purple
marbles = 2! = 2
5 men  C 45  5 The number of ways of arranging the other 4 marbles in the
The number of ways of selecting 3 women from the middle of the row = 4! = 24
 2  24  48
5 women  C35  10 ∴ The required number of ways
If the 3 selected women sit together, we can treat them
as a unit. 6. Answer: C
The number of ways of arranging the 4 men and the We can treat books of the same type as a unit.
unit = 5! = 120 The number of ways of arranging the 3 units = 3! = 6
The number of ways of arranging the 3 women = 3! = 6 The number of ways of arranging the novels = 3! = 6
The number of ways of arranging the science books
By the multiplication rule of counting, = 4! = 24
the required number of arrangements The number of ways of arranging the dictionaries = 2! = 2
 5  10  120  6  36 000 ∴ The required number of ways
 6  6  24  2  1728
(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 7. Answer: B
back row.
115
NSS Mathematics in Action (2nd Edition) 5B Full Solutions

The number of ways to arrange C and D  2 !  2 X  C 24  C 26  C 29

 57
  
Since A and B cannot stand together, there are 3 places, as 4. Refer to the figure.
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
Suppose the first person in the row is a boy. The ant moves from A to B in 4 moves:
The number of ways to arrange the 4 boys  4 !  24 1 move: along the x-direction
The number of ways to arrange the 4 girls  4 !  24 1 move: along the z-direction
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.
∴ The required number of ways 4!

 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
(a) The required number of ways  C 4  70
8
10. Answer: B 1.
Case I: Car A carries 5 people and car B carries 3 people.
(b) The required number of ways  C 2  C 2  420
8 6
The number of ways of arrangements  C 58
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
restrictions  C414
 C58  C 48  126
∴ The required number of ways ∴ 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
of eight balls: 2. (a) 2 more students are selected from the remaining
7 students.
The required number of ways  C 2  21
7
  |    |    ∴

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  C 2  15
6
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  C 2  21
7
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
(25 – 9) = 16.  C38  56
The number of selection with order considered ∴ The required number of ways  56  6  50
= 25 × 16 = 400
400
∴ The required number of ways   200
2
3. (a) The number of ways of arranging Nick and Cathy = 2!
3. The number of ways of choosing 2 English books  C24
The number of ways of arranging the 5 friends = 5!
The number of ways of choosing 2 Chinese books  C 26
The number of ways of choosing 2 Japanese books  C 29 ∴ The required number of ways

By the addition rule of counting,  2!  5! 240

116
 10 Permutation and Combination

(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 The number of ways of selection without restriction
 2 !  6 !  1440
 C312  220
The number of ways of selecting 3 collinear vertices
(c) We can consider the two particular participants as Nick
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 Investigation Corner (p. 10.55)
 7 !  1440  3600
(a) (i) Step 1: 5 ways
4. (a) There are 13 members younger than 40. Step 2: 4 ways
Step 3: 3 ways
The required number of ways  C5  1287
13
∴
(ii) Case 1:
Step 4: 1 ways
(b) There are 7 members older than 40. Step 5: 3 ways
The number of ways of assigning the chairperson and Case 2:
the vice-chairperson  P27 Step 4: 2 ways
Step 5: 2 ways
There are 6 members younger than 30. (iii) The required number of ways
The number of ways of assigning the secretary = 6  5  4  3  (1  3  2  2)
There are 17 members left for the selections of the
treasurer and the coordinator.  420
The number of ways of assigning the treasurer and the
coordinator  P217 (b) (i) The required number of ways
 10  9  8  (1  8  7  7)
∴ The required number of ways
 41 040
 P27  6  P217  68 544
(ii) Colouring figures (2) and (3) is the same as colouring
figure (1).
5. Answer: C
Case 1: If a red card is drawn from Box A, the other card ∴ The required number of ways  41 040
drawn from Box B can only be blue.
The number of ways of selection in this case (c) (i) The required number of ways
 3  5  15
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

8. Answer: A
The case can be considered as selecting any 3 non-collinear
vertices from the 12 vertices of the 6 squares.

   

117