248 Mathematics HL (3rd edn), Chapter 8 - COUNTING AND THE BINOMIAL EXPANSION

a i ( 8) 8! ii (8) 8!
2 - 2!(8 - 2)! 6 - 6!(8-6) !
8! 8!
2! x 6! 6! x 2!
8x 7 x6x 5x4x3x2xl 8x 7 x 6x5x4x3x2xl
2 x lx6x5x4x3x2xl 6x5x4x3x2xl x 2xl
56 56
2 2
= 28 = 28
b ( n)
r
- n!
r!(n - r) !
for all n E Z + , r = 0, 1, 2, .... , n.

(
n ) - n! for all n E Z + , r = 0, 1, 2, ...., n .
n-r (n - r)!(n - (n - r))!
n!
(n - r)!(n - n + r)!
n!
(n - r)!r!
n!
r!(n - r) !
( ~) = ( nn r) for all n E z+, r = 0, 1, 2, .... , n.

3 ( ~ ) = 4 (k~1 )
9! 7!
- - - =4
k!(9 - k)! (k - 1)!(7 - [k - 1)) !
9! 4 x 7!
k!(9 - k) ! (k - 1) !(8 - k)!
9! k !(9 - k)!
4 x 7! (k - 1) ! (8 - k) !

9 x8x ;lf k~x(9-k)~

4 x ;lf ~~1
9 8
.. . : = k(9 - k)

18 = 9k - k 2
... k 2 - 9k + 18 = 0
.'. (k - 3)(k - 6) = 0
k = 3 or 6

EXERCISE SD
1 a W, X, Y, Z
b WX, WY, WZ, XW, XY, XZ, YW, YX, YZ, ZW, ZX, ZY
c WXY, WXZ, WYX, WYZ, WZX, WZY, XWY, XWZ, XYW, XYZ, XZW, XZY, YWX, YWZ, YXW,
YXZ, YZW, YZX, ZWX, ZWY, ZXW, ZXY, ZYW, ZYX
aAB, AC, AD,AE, BA, BC, BD, BE,CA,CB,CD,CE,DA, DB,DC,DE,EA,EB,EC,ED
b ABC, ABD, ABE, ACB, ACD, ACE, ADB, ADC, ADE, AEB, AEC, AED, BAC, BAD, BAE, BCA,
BCD, BCE, BDA, BDC, BDE, BEA,BEC, BED,CAB,CAD,CAE,CBA,CBD,CBE,CDA, CDB,
CDE, CEA, CEB, CED,DAB, DAC, DAE, DBA, DBC, DBE, DCA, DCB, DCE, DEA, DEB, DEC,
EAB, EAC, EAD, EBA, EBC, EBD, ECA, ECB, BCD, .EDA, EDB, EDC
(2 at a time: 20 3 at a time: 60)
 Mathematics HL (3rd edn), Chapter 8 - COUNTING AND THE BINO'MIAL EXPANSION 249

3 a There are 5 ! = 120 different orderings.

b There are 8 x 7 x 6 = 336 different orderings.
c There are 10 x 9 x 8 x 7 = 5040 different signals.

4 a I4 3 there are 4 x 3 = 12 different signals

b 4 3 I 2 I .·. there are 4 x 3 x 2 = 24 different signals

c 12 + 24 = 36 different signals {using a and b}

5 There are 6 different letters 6! = 720 pennutations.

a
I 4 3 2 1 1 I I
1 ... there are 4 x 3 x 2 x 1 x 1 x 1 = 24 permutations
t t
E D
b 1 4 3 2 1 1 there are 1 x 4 x 3 x 2 x 1 x 1 = 24 permutations
t t
F A
c I2 4 3 2 1 I1 I there are 2 x 4 x 3 x 2 x 1 x 1 = 48 permutations
t t
A orE the other one

6 a I 7 7 7 So, there are 7 3 = 34 3 different numbers.

b 7 6 5 So, there are 7 x 6 x 5 = 210 different n·urnbers.

c I6 5 4 So, there are 6 x 5 x 4 = 120 different numbers.

t t
6 remain fi ll 1st with any of 4 odds

7 a
I9 9 8
So, there are
b 8 8 1
t t t
cannot use 0 9 x 9 x 8 = 648 numbers. cannot use a5 So, there are
0 or 5 8 x 8 x 1 = 64 numbers.
c I9 8 1 So, there are
9 x 8 x 1 = 72
d 64 + 72 = 136 different numbers.
{using b and c}
t different numbers.
0

8 a As there are no restrictions, the number of ways is 5! = 120.

b X and Y are together in 2! ways {XY or YX}
They, together with the other three books can be permutated iI1 4! ways.
: . total number = 2! x 4 ! = 48 ways.
c 120 - 48 = 72 ways {using a and b}

9 a As there are no restrictions, the number of ways is 10! = 3 628 800.

b A, B and C are together in 3! ways {ABC, ACB, BAC, BCA, CAB, CBA}
They, together with the other 7 can be permutated in 8! ways .
. ·. total number is 3 ! x 8! = 241 920 ways.
250 Mathematics HL (3rd edn), Chapter 8 - COUNTING AND THE BINOMIAL EXPANSION

10 a 14 14 13 So, there are b 12141 3 So, there are

4 x 4 x 3 = 48 2 x 4 x 3 = 24
t different numbers.
t different numbers.
not 0 1 or 3

c The last digit nlust be a 0 or 8.

If it is 0: I3 I3 I1 I 3 x 3 x 1 = 9 different numbers
t t
3, 5, or 8 0

if it is s: I2 I3 I1 2 x 3 x 1 = 6 different nun1bers
t t
3 or 5 8 in total there are 9 +6= 15 different numbers.

11 So, there are 6 x 5 x 4 x 3 = 360 different arrangernents.

b If no vowels are used, there are 4 letters to choose from .
.-. I 4 I 3 I 2 I 1 I So, there are 4! = 24 different arrangements.

if at least one vowel must be used, there are 360 - 24 {from a}

= 336 different a1Tangements
c We first count the nwnber of ways two vowels are adjacent.
A and 0 can be put together in 2! ways {AO or OA}
These vowels can be placed in any one of 3 positions {1st and 2nd, 2nd and 3rd, or 3rd and 4th}
The remaining 2 places can be filled from the other 4 letters in 4 x 3 different ways.
two vowels are adjacent in 2! x 3 x 4 x 3 = 72 ways
.·. no two vowels are adjacent in 360 - 72 = 288 ways

12 a I9 8 7 6 5 So, there are 9 x 8 x 7 x 6 x 5 = 15 120 different ways.

b I4 3 2 6 5 So, there are 4 x 3 x 2 x 6 x 5 = 720 different ways.

t
2, 4, 6, or 8

13 a I 10 I 9 I s I 1 6 s 4 3 2 1 10! = 3 628 800 different ways.

b i I 10 I 9 I 8 I 1 I 6 I s I 10 x 9 x 8 x 7 x 6 x 5 = 151200 different ways

t l-:---:----
Alice can sit in any - Her friend can sit
of the 10 seats in any of the
remaining 9 seats
ii Alice can sit in any of the 8 middle seats.
She can choose the two friends to sit next to her in 5 x 4 different ways.
The remaining 3 friends can occupy the other 7 seats in 7 x 6 x 5 different ways .
.·. there are 8 x 5 x 4 x 7 x 6 x 5 = 33 600 different ways.

EXERCISE BE
1 ABCD, ABCE, ABCF, ABDE, ABDF, ABEF, ACDE, ACDF, ACEF, ADEF, BCDE, BCDF, BCEF, BDEF,
CDEF, and (~) = 15 ./

There are ( ~~) = 12 376 different tea111s.

 Mathematics HL (3rd edn), Chapter 8 - COUNTING AND THE BINO'MIAL EXPANSION 251

3 a There are (;) = 126 different possible b If question 1 is compulsory there are
selections. ( ~) (:) = 1 x 70 = 70 possible selections.

(~) (
12
a If no restrictions, there are ( 133 ) = 286 b 2 ) = 66 of them consist of the
different committees. president and two others.

5 a If no restrictions, there are ( 152 ) = 792 different teams.

b i Those containing the captain and vice-captain number ( ~) ( 1

3
°) = 1 x 120 = 120.
ii Those containing exactly one of the captain and vice captain number
(~) (14°) = 2 x 210 = 420.

N11mber of different tean1s = ( ~) ( ~) (

11
6 6
) = 1 x 1 x 462 = 462.

7 a If 1 person must be selected, nwnber of ways = ( i) ( ~) = 84

b If 2 are always excluded, the number of ways = ( ~) ( ~) = 70

c If 1 is always 'in' and 2 are always 'out', the number of ways is ( ~) ( ~) ( ~) = 35

8 a [f there are no resttictions the number of ways = ( 156 ) = 4368

b The three men can be chosen in ( 13 °) ways and the 2 women in ( ~) ways .
. ·. total number of ways = ( 13°) x ( ~) = 120 x 15 = 1800 ways.

c If it contains all men, the number of ways = ( 15°) x ( ~) = 252

d If it contains at least 3 men it would contain
3 rnen and 2 women or 4 men and 1 woman or 5 men and 0 women
and this can be done in ( ;o) ( ~) + ( 14°) (~) + ( 15°) (~) ways = 3312 ways.
e If it contains at least one of each sex, the total number of ways
= ( 110 ) (~ ) + ( 120 ) ( ~ ) + ( 130 ) ( ~ ) + ( 11 ) ( ~ ) = 4110

or (156) - (100 ) (~) - (150) (~) = 4110

9 a The 2 doctors can be chosen in ( ~) ways
The 1 dentist can be chosen in ( i ) ways
The 2 others can be chosen in ( ~) ways

. ·. the total nu1nber of ways = ( ~) x ( i ) x ( ~) = 945

b If it contains 2 doctors, 3 must be chosen from the other 10,
there are ( ~) ( °)
1
:. 3
= 1800 ways.
c If it contains at least one person from each of the two professions this can be done in
(i ) (:) + ( ~ ) ( ~) + ( ~ ) ( ~) + (~) ( ~) = 434 7 or (
16
5 ) - ( ~) ( ~) = 4347
10 There are 20 points (for vertices) to choose from and any 2 form a line.
This can be done in ( 22 °) ways. But this count includes the 20 lines joining the vertices .
.·. the number of diagonals = (
2
2
°) - 20 = 190 - 20 = 1 70

11 a •
I (
12
2
) = 66 lines can be determined .

(~) (
11
ii Of the lines in a i 1 ) = 11 pass through B.

b i ( 132 ) = 220 triangles can be determined.

ii Of the u;anglcs in b i ( ~) ( 121 ) = 55 have one vertex B.
252 Mathematics HL (3rd edn), Chapter 8 - COUNTING AND THE BINOMIAL EXPANSION

12 The digits must be from. 1 to 9. So, there are 9 of them, and we want any 4.
This can be done in ( ~) = 126 ways.
Once they have been selected they can be put in one ascending order
: . total number = 126 x 1 = 126.

13 a The different committees of 4, consisting of selections from 5 men and 6 women in all possible ways
are
(4 men, 0 women) or (3 men, 1 woman) or (2 1nen, 2 women) or (1 man, 3 women)
or (0 men, 4 women)
( ~ ) ( ~ ) + ( ~ ) ( ~ ) + ( ~ ) ( ~ ) + ( ~ ) ( ~ ) + ( b) (~ ) = ( ~ 1
) total number unrestricted
b The generalisation is:
(7;) ( ~ ) + ( 7 ) (r n 1 ) + ( r; ) (r n 2 ) + ·.. ·+ (rm 2 ) ( ~ ) + ( rm 1 ) ( ~ ) + ( 7; ) ( ~ ) = ( m:n )

14 a Consider a simpler case of 4 people (A, B, C, and D) going into two equal groups.
AB CD (1) (1) and (6) are the same division.
AC BD (2) (2) and (5) are the sa1ne division.
AD BC (3) (3) and (4) are the sa1ne division.
BC AD (4)
BD AC (5) So, the number of ways is ~ of ( ~ ).
CD AB (6)
So, for 2 equal groups of 6, the nurnber of ways ~ of ( i62) ( ~)
= ~ x 924
= 462
1
b For 3 equal grou.p s of 4, the number of ways =
3
! x ( 1} ) x ( ~) x ( !)
= 5775

15 There is one point of intersection for every combination of

4 points (2 fro1n A, 2 from B) as shown.
There are (
1
°)
2
x ( ~) ways to choose these points.
the maximum number of points of intersection (when none
of the intersection points coincide) is (
1
°)
2
x ( ~ ) = 945

16 There is one point of intersection for every combination of Q

4 points (no more than 2 from any one line) as shown.
the maximum number of points of intersection (when
none of the intersection points coincide) is
( 1~) (;) ( ~) + ( 120) ( ~) ( ~) + ( 100) ( ~) ( ~)
+ ( 120 ) ( i ) (~ ) + ( 110 ) ( ; ) ( ~) + ( 110 ) ( i ) (~ )
= 12 528

17 a Each handshake occurs between 2 people. So we need the number of ways 2 people can be selected
fron1 10 .
. ·. the number of handshakes between committee members is (
1
°) =
2
45.
A 10-sided polygon can be used to solve this problem by counting the total number of lines (including
edges) between each pair of vertices. Each line represents a handshake between 2 of the 10 committee
members.
b The number of handshakes between 273 delegates is ( ~ 3 )
2
= 37 128.
c The number of different orders in which the committee members can line up on stage is
10! = 3 628 800.