Chapter 10 – Counting Methods

Solutions to Exercise 10A

1 a 8 + 3 = 11 S 2: 2 × H, 3 × G, 2 × A = 7 choices
Total choices = 9 × 7 = 63 choices
b 3 + 2 + 7 = 12

c 22 + 14 + 1 = 37 6 M to B : 3 airlines or 3 buses
M to S : 4 airlines × 5 buses.
d 10 + 3 + 12 + 4 = 29 Total choices = 3 + 3 + 4 × 5 = 26

2 a 3 × 4 × 5 = 60 meals 7 5(C) × 3(T ) × 4(I) × 2(E) × 2(A) = 240

choices
b 10 × 10 × 5 = 500 meals

c 5 × 7 × 10 = 350 meals 8 Possible codes = (26)(104 ) = 260000

d 83 = 512 meals
9 No. of plates = (263 )(103 ) = 17 576 000

3 Four choices of entrée, eight of main

course and four of dessert. 10 2 (dot or dash) + 4 (2 digits) +
8 (3 digits) + 16 (4 digits) = 30
a 4 × 8 × 4 = 128 meals
m
b 128 + no entrée:128 + 8 × 4 = 11 m × × (m + 1) > 1000
2
160 meals
m3 + m2 − 2000 > 0
m > 12.27 . . .
4 3 + 7 + 10 = 20 choices m
Since there are choices for the main
2
course, then m must be an even number.
5 S 1: 2 × M, 3 × L, 4 × S = 9 choices Therefore m ≥ 14

362
Solutions to Exercise 10B
1 a 3! =3×2×1=6 8!
8 = 336 ways
5!
b 5! = 5 × 4 × 3 × 2 × 1 = 120
9 TROUBLE:
c 7! = 7 × 6 × 5 × 4 × 3 × 2 × 1 = 5040
a All letters used = 7! = 5040 ways
d 2! = 2 × 1 = 2
7!
b Three letters only = = 210 ways
e 0! = 1 4!

f 1! = 1
10 PANIC:

5! 5 × 4 × 3 × 2 × 1 a All letters used = 5! = 120 ways

2 a = = (5)(4) = 20
3! 3×2×1
5!
9! b Four letters only = = 120 ways
b = (9)(8) = 72 1!
7!
3! 6 11 COMPLEX:
c != =6
0! 1 7!
a No re-use: = 840 ways
8! 3!
d = (8)(7) = 56
6!
b Re-use: 74 = 2401 ways
5! 120
e != = 120
0! 1
12 NUMBER:
10!
f = (10)(9)(8) = 720 6! 6!
7! a No re-use: (3-letter) + (4-letter)
3! 2!
= 120 + 360 = 480 codes
3 5! = 120 ways
b Re-use: 63 + 64 = 1512 codes

4 7! = 5040 ways
13 ϵ = {3, 4, 5, 6, 7}, no re-use:

5 4! = 24 ways 5!
a = 60 3-digit numbers
2!

6 6! = 720 ways b Even 3-digit numbers: must end in 4

or 6, so 2 possibilities only for last
digit. 4 possibilities then for lst digit
10!
7 = 720 ways and 3 for 2nd digit.
7!
∴ 4 × 3 × 2 = 24 possible even
numbers.

363
 c Numbers > 700: 15 4 boys, 2 girls:
3-digit numbers must begin with 7
∴ 4 × 3 = 12 a No restrictions: 6! = 720 ways
5!
4-digit numbers: = 120
1! b 2 ways for girls at end × 4! for boys
5-digit numbers: 5! = 120 = 48 ways
Total = 252 numbers

n!
16 a = n(n − 1)(n − 2)
14 ϵ = {3, 4, 5, 6, 7, 8}, no re-use: (n − 3)!
6! 6! n(n − 1)(n − 2) > 1000
a 2-digit + 3-digit: + = 150
4! 3! n > 11.03 . . .
b 6-digit even: 3 × 5! = 360 ∴ n ≥ 12

c >7000: 4-digit numbers must begin b

5! n! n!
with 7 or 8: 2 × ! = 120 + = n(n − 1)(n − 2) + n(n − 1)
2! (n − 3)! (n − 2)!
6!
5-digit numbers: = 720 = n(n − 1)(n − 1)
1!
6-digit numbers: 6! = 720 n(n − 1)(n − 1) > 2000
Total = 1560 numbers
n > 13.27 . . .
∴ n ≥ 14

364
Solutions to Exercise 10C
1 a (V, C), (V, S ), (C, S ) = 3
!
8 8×7×6×5×4×3×2×1
c =
2 2×1×6×5×4×3×2×1
b (J, G), (J, W), (G, W) = 3 = 28
!
c (T, W), (T, J), (T, P), (W, J), (W, P), 50 50 × 49
d = = 1225
(J, P) = 6 48 2

d (B, G, R), (B, G, W), (B, R, W), !

(G, R, W) = 4 13 13 × 12 × 11 × 10 × 9 × 8
5 = =
7 6×5×4×3×2×1
1716
5×4×3×2×1
2 a 5 C3 = = 10
3×2×1×2×1 !
25 25 × 24 × 23
5×4×3×2×1 6 = = 2300
b 5 C2 = = 10 3 3×2×1
2×1×3×2×1
7×6×5×4×3×2×1
c 7 C4 = = 35
!
52
4×3×2×1×3×2×1 7 =
7
7×6×5×4×3×2×1 52 × 51 × 50 × 49 × 48 × 47 × 46
d 7 C3 = = 35
3×2×1×4×3×2×1 7×6×5×4×3×2×1
a = b, c = d = 133 784 560

!
20 × 19 45 45 × 44 × 43 × 42 × 41 × 40
3 a C3 =
7
= 190 8 =
2 6 6×5×4×3×2×1
= 8 145 060
b 100
C99 = 100
100 × 99 ! ! !
3×2×1 4×3×2×1
!
c 100
C2 = = 4950 9
3 4
=
2 4 2 1×2×1 2×1×2×1
250 × 249 = 18
d 250
C248 = = 31 125
2
!
30
10 a =
8
!
6 6×5×4×3×2×1
4 a = = 20 30 × 29 × 28 × 27 × 26 × 25 × 24 × 23
3 3×2×1×3×2×1
8×7×6×5×4×3×2×1
= 5 852 925
!
7 7×6×5×4×3×2×1
b = =7
1 1×6×5×4×3×2×1

365
 !
b Choose
! 2 men first: 6
10 10 × 9 c 5F: =6
= = 45 5
2 2
! !
20 11
6 women : d 5 any: =
6 5
11 × 10 × 9 × 8 × 7 × 6
20 × 19 × 18 × 17 × 16 × 15 = 462
= 6×5×4×3×2×1
720
= 38 760 e ≥ 4F = n(4F + 1M) + n(5F)
Total = 45 × 38 760 = 1 744 200
= 75 + 6 = 81
!
13 13 × 12
11 2♥ : = = 78 14 15T, 12F, 10 selections:
2 2
!
27
!
13 13 × 12 × 11 × 10 × 9 = 8 436 285
5 : = a Unrestricted:
10
5 120
= 1287 15
!
7-card hands of 5 , 2♥ = 1287 × 78 b 10T only: = 3003
10
= 100 386 !
12
c 10F only: = 66
10
12 a Without
! restriction:
12 12 × 11 × 10 × 9 × 8 ! !
= = 792 d 5T +5F:
12 15
= 2 378 376
5 120 5 5
! !
8 4
b 3W + 2M: = (56)(6) = 336
3 2 15 6F, 4M, 5 positions:
! !
6 4
3F + 2M = (20)(6) = 120
3 2
13 6F, 5M, 5 positions: ! !
6 4
4F + 1M = (15)(4) = 60
4 1
! !
6 5
a 2F + 3M: = (15)(10) = 150 !
2 3 6
5F only: =6
5
Total = 186
! !
6 5
b 4F + 1M: = (15)(5) = 75
4 1
16 Each of the five times she can choose or
refuse
∴ Total choices = 25 = 32

366
17 Total !choices
! ! ! ! ≥ 2:
19 6 fruits, must! choose !
8 8 8 8 6 6 6
= + + + ··· + choices = + + ··· +
0 1 2 8 2 3 6
= 28 = 256 = 26 − 7 = 57

18 Total !colours
! (cannot choose
! no colours) 20 6 people, 2 groups:
5 5 5
= + + ··· + !
1 2 5 6
a n (two equal groups) = ÷ 2 = 10
3
= 2 − 1 = 31
5
! !
6 6
b n (2 unequal groups) = + = 21
1 2

!
n
21 > 25
2
n(n − 1)
> 25
2
n2 − n > 50
n >7.58 . . .
∴n≥8

n+m 1
!
22 a = (n + m)(n + m − 1)(n + m −
3 6
2)

mn(m + n − 2)
! ! ! !
n m n m
b + =
1 2 2 1 2

n2 (2n − 2)
c < 720
2
⇔ n2 (n − 1) < 720 ⇒ n ≤ 9 (since n
is an integer).

367
Solutions to Exercise 10D
1 ϵ = {1, 2, 3, 4, 5, 6}
! !
7 6
3W + 4M : = (35)(15) = 525
4 digits, no repetitions; number being 3 4
! !
even or odd depends only on the last 7 6
2W + 5M : = (21)(6) = 126
digit. 2 5
! !
There are 3 odd and 3 even numbers, so: 7 6
1W + 6M : =7
1 6
a Pr(even) = 0.5 658 arrangements with more men than
women
b Pr(odd) = 0.5 658 329
∴ Pr = =
1716 858
2 COMPUTER:
3 6 8 possible combinations, so there
Pr (lst letter vowel) = = 0.375
8 are a total of 28 − 1 = 255 possible
sandwiches.
3 HEART; 31etters chosen:
a 27 = 128 including H
1 128
a Pr(H1st) = = 0.2 ∴ Pr(H) = = 0.502
5 255

b Pr(H) = 1 − Pr(H r )
!
8
b = 56 have 3 ingredients
! ! !!
4 3 2 3
= 1− 56
5 4 3 ∴ Pr =
255
2
= 1 − = 0.6 ! ! ! !
5 8 8 8 8
c + + + ... +
! ! 3 4 5 8
2 1
c Pr (both vowels) = 3 = 0.3 = 219 contain ≥ 3 ingredients
5 4 219 73
(Multiply by 3 because the consonant ∴ Pr = =
255 85
could be in any of the 3 positions.)

7 5W, 6R, 7B, no replacement:

4 There are 6! = 720!ways of filling the 6
6 5 4 5
3 a Pr(R, R, R) = × × =
seats, but only 2 4! = 144 have end 18 17 16 204
2
places with women. 18
!
144 b There are exactly = 816
∴ Pr = = 0.2 15
720
selections.
! ! !
5 6 7
= 210 have all 3 colours.
5 7W,!6M, team of 7: 1 1 1
13 ∴ Pr (all different colours)
= 1716 possible teams 210 35
7 = =
816 136

368
8 5R,!2B, 3G, 4 picks, 6 numbers. Then there are 6 choices
10 for the second digit and 5 choices for
= 210 selections:
4 the first.
Total choices = 6 × 6 × 5 × 4 = 720.
a Pr(G!′ , G!′ , G!′ , G!′ ) = 720 24
7 6 5 4 1 So Pr(odd) = =
= 1170 49
10 9 8 7 6 24 25
Then Pr(even) = 1 − =
49 49
5
b Pr(≥ 1G) = 1 − Pr(No G) = c Pr(< 4000): must begin with 1, 2 or
6
3.
c Pr(≥ 1G ∩ ≥ 1R): ! ! ! Since there are no other restrictions,
3 5 2 3
N(G + R + B + B) = = 15 Pr(< 4000) =
1 1 2 7
! ! !
3 5 2 d Pr(< 4000| > 3000) =
N(G + R + R + B) = = 60
1 2 1 Pr(3000 < N < 4000)
Pr(N > 3000)
! ! !
3 5 2
N(G + G + R + B) = = 30 For N > 3000 it cannot begin with 1
2 1 1
! ! or 2: ∴ 6 possibilities
3 5
N(G + G + R + R) = = 30 3 other numbers are unrestricted
2 2
! ! ∴ total (N > 3000) = 1050
3 5
N(G + G + G + R) = =5 For 3000 < N < 4000 it must begin
3 1 7!
3
!
5
! with 3, so = 210 satisfy this
N(G + R + R + R) = = 30 4!
1 3 restriction.
Pr(3000 < N < 4000) 210
Total = 170 ∴ =
17 Pr(N > 3000) 1050
∴ Pr(≥ 1G ∩ ≥ 1R) =
21 1
=
Pr(≥ 1R| ≥ 1G)) 17 5 34 5
d = ÷ =
Pr(≥ 1G) 21 6 35
10 Number of ways
 that committee may be
chosen = 39
9 ϵ = {0, 1, 2, 3, 4, 5, 6, 7}
4 four-digit number (with no repetitions) 5 4
8 3 × 0 5
= ! = 1680 possible numbers, but any a Pr(all women) = n =
4 42
1
beginning with zero must be taken out,
7
and there are ! = 210 of these. b Pr(at
9 least
5 one4women)
4

∴ 1470 numbers 3 − 0 × 3 20
= 9 =
21
3
a,b It is easier to find the probability of
an odd number first. Begin with the c
last digit: 4 odd numbers. Then look Pr(exactly two men|at least one man)
at the first digit: cannot have zero, so Pr(exactly two men)
=
Pr(at least one man)

369
 4 5 g = 2 or g = 3
2 × 1
= 9 4 5
− ×
6n−6
3 0 3
2 1
15 12 a Pr(1 year 11) = n
= 3
37
90(n − 6)
=
n(n − 2)(n − 1)
11 a Pr(exactly
g 8−gone)

× 90(n − 6)
=
1 2
=
g(g − 8)(g − 7) b > 0.5
8
112 n(n − 2)(n − 1)
3 7.46 · · · < n < 10
∴ n = 8 or n = 9
g(g − 8)(g − 7) 15
b =
112 28

370
Solutions to Technology-free questions
1000 × 999 n
!
1 a 1000
C998 = = 499 500 b = 55
2 2
n(n − 1)
b 1000000
C99999 = 1 000 000 ∴ = 55
2
∴ n2 − n − 110 = 0
c 100000
C1 = 1 000 000
∴ (n − 11)(n + 10) = 0
∴ n = 11
2 nC2 = 36
n(n − 1)
∴ = 36
2 8 7 people to be arranged, always with
∴ n − n − 72 = 0
2
A and B with exactly one of the others
∴ (n − 9)(n + 8) = 0 between them:
∴n=9 Arrange (A, X, B) in a block of 3. This
can be either (A, X, B) or (B, X, A), and X
3 1, 2, 3, 4, 5, 6, 3 digits, no replacement could be any one of 5 other people.
6! ∴ 10 possibilities for this block.
= = 120
3! There are 4 other people, plus this block,
who can be arranged in 5! ways.
4 n brands, 4 sizes, 2 scents = 8n types ∴ Total N = 10 × 5!
= 1200 arrangements
1
5 a a+b
C3 = (a + b)(a + b − 1)(a + b − 2)
6 9 OLYMPICS: 31etters chosen:
1
b aC2 × bC1 = ab(a − 1) a All letters equally likely
2
1
∴ Pr(O, X, X) =
8
6 5 vowels, 21 consonants !
7 6 5 5
b Pr(Y ) =
′
=
a Choose 2 letters 8 7 6 8
26 × 25
26
C2 = = 325 ∴ Pr(Y) =
3
2 8
b One vowel = 5C1 × 21C1 = 105 c N(O ∩ I) has 3! arrangements of
Two vowels = 5C2 × 21C0 = 10 O, I, X
115 26 !
Pr(at least one vowel)= = Pr(O, I, X) =
1 1 6
=
1
325 35 8 7 6 56
6 3
∴ Pr (both chosen) = =
7 a 2 toppings
! from 5, no replacement 56 28
5
= = 10
2

371
Solutions to multiple-choice questions
! ! !
8 3 4 7 C 12 books, 3 chosen, no replays:
1 E = 96
1 1 1 12
c3 = 220
! ! !
3 5 3 8 A 10G, 14B, 2 of each:
2 D M×( L+ S ) = 24 10
1 1 1 C2 × 14 c2

3 A 10 people, so possible arrangements 9 E METHODS:

= 10! 2
Pr(vowel 1st) =
7
4 D 2 letters, 4 digits, no replacement: 10 E 4M,
26! 10! ! 4F, choose 4:
=( )( ) = 3276000 8
24! 6! = 70 teams
4
21!
! !
21
c3 = 4 4
5 C N(3W, 1M) = = 16
3!18! 3 1
16 8
6 B 52 cards, 6 chosen, no replacement: ∴ Pr(3W, 1M) = =
52
c6 70 35

372
Solutions to extended-response questions
1 a 4 × 6 × 4 = 96 ways.

b 4 × 6 + 96 = 120 ways

c 4 × 6 + 6 × 4 + 4 × 4 + 96 = 160 ways
m
d m× × (25 − m) > 1000
2
⇔ m2 (25 − m) > 2000
Number of choices of each type must be a non-negative even integer. Therefore
m = 14, 16, 18

2 a Three people can be seated in 10 × 9 × 8 = 720 ways in 10 chairs.

b Two end chairs can be occupied in 3 × 2 = 6 ways. This leaves 8 chairs for the
remaining person to choose from, i.e. 6 × 8 = 48 ways of choosing a seat.

c If two end seats are empty it leaves 8 chairs to occupy: 8 × 7 × 6 = 336 ways
336 7
d Pr(two end chairs are empty= =
720 15
e 1000 < n(n − 1)(n − 2) < 1500 ⇒ 11.033 · · · < n < 12.476 . . .
Therefore n = 12

3 a There are 15C4 = 1365 ways of selecting the batteries.

b There are 10C4 = 210 ways of selecting 10 charged batteries.

c Having at least one flat battery = total number−none flat

= 1365 − 210
= 1155

1155 11
d Pr(at least one battery flat) = =
1365 13
5  
1 × 10
3 11 40
e Pr(exactly one flat batter|at least one battery flat) = 15 ÷ =
13 77
4

373
 10
4 a i There are 4 = 210 ways of choosing a committee of 4 from 10 people.
5 5
ii There are 2 × 2 = 100 ways of choosing a committee with two men and two
women.
100 10
iii Pr(committee consists of two men and two women) = =
210 21
iv Pr(committee consists of only men or only women) =
n+m (m + n)(m + n − 3)(m + n − 2)(m + n − 1)
b i 4 =
24
nn mn(m − 1)(n − 1)
ii 2 2 =
4
iii n = 2m
m2 (m − 1)(2m − 1)
< 720 Solving for m
4
−4.821 · · · < m < 5.572 . . .
Therefore, −9.642 · · · < n < 1.144 Therefore 4, 6, 8, 10

5 Division 1
The number of ways of choosing 6 winning numbers from 45

= 45C6
= 8 145 060
1
∴ probability of winning Division 1 =
8 145 060
= 1.2277 . . . × 10−7
≈ 1.228 × 10−7
Division 2
There are 6 winning numbers, 2 supplementary numbers, and 37 other numbers
∴ number of ways of obtaining 5 winning numbers and a supplementary

= 6C5 × 2C1 × 37C0

=6×2
= 12
12
∴ probability of winning Division 2 =
8 145 060
= 1.4732 . . . × 10−6
≈ 1.473 × 10−6
Division 3

374
 Number of ways of obtaining 5 winning numbers and no supplementary

= 6C5 × 2C0 × 37C1

= 6 × 37
= 222
222
∴ probability of winning Division 3 =
8 145 060
= 2.7255 . . . × 10−5
≈ 2.726 × 10−5
Division 4
Number of ways of obtaining 4 winning numbers

= 6C4 × 39C2
= 15 × 741
= 11 115
11115
∴ probability of winning Division 4 =
8 145 060
= 0.001 364 6 . . .
≈ 1.365 × 10−3
Division 5
Number of ways of obtaining 3 winning numbers and at least one supplementary
= 6C3 × 2C1 × 37C2 + 6C3 × 2C2 × 37C1
= 20 × 2 × 666 + 20 × 37
= 27 380
27 380
∴ probability of winning Division 5 =
8 145 060
= 0.003 3615 . . .
≈ 3.362 × 10−3

6 a Spot 6
The number of ways of selecting 6 numbers from 80
= 80C6
= 300 500 200
20 numbers are winning numbers

375
 The number of ways of selecting 6 numbers from 20
= 20C6
= 38760
38 760
∴ probability of winning with Spot 6 =
300 500 200
= 1.2898 . . . × 10−4
≈ 1.290 × 10−4

b Spot5
20
5C5
The probability of winning with Spot = 80C
5

15504
=
24 040 016
= 6.4492 . . . × 10−4
≈ 6.449 × 10−4

376