Chapter 11 – Revision of chapters 6-10

Solutions to technology-free questions

1 a = 2i + 6 j 3 a
√ √
a |2i + 6 j| = 4 + 36 = 2 10 −−→ −−→
mOA + n BC = 2i + 10 j

b â =
1
√ (2i + 6 j) m(4i + 2 j) + n(9i − j) = 2i + 10 j
2 10 (4mi + 2m j) + (9ni − n j) = 2i + 10 j
4 (4m + 9n)i + (2m − n) j = 2i + 10 j
c 8 â = √ (2i + 6 j)
10
1
d −2 â = − √ (2i + 6 j)
10 Therefore

2 a a · a = (2)(2) + (−3)(−3) = 4 + 9 = 13 4m + 9n = 2 and 2m − n = 10.

b b · b = (−2)(−2) + (3)(3) = 4 + 9 = 13 These simultaneous equations have

solution
c a · a = (−3)(−3) + (−2)(−2) = 4 + 9 =
13. 46 18
m= and n = − .
11 11
d a · b = (2)(−2) + (−3)(3) = −4 − 9 =
−13. b Since
−−→
e a · (b + c) = (2i − 3 j) · (−5i + j) OB = −i + 7 j,

= (2)(−5) + (−3)(1)
−−→
= −13 CD = (p − 8)i − 8 j,

f (a + b) · (a + c) = 0 · (−i − 5 j) We have,
=0
−−→ −−→
OB · CD = 0
g
(a + 2b) · (3c − b) = (−2i + 3 j) · (−7i − 9 j) (−i + 7 j) · ((p − 8)i − 8 j) = 0
= (−2)(−7) + (3)(−9) (−1)(p − 8) + (7)(−8) = 0
= −13 −p + 8 − 56 = 0
p = −48.

c Since

−−→
AD = (p − 4)i − 4 j,

383
 we have, 36 = 2F 2 − 2F 2 cos θ . . . (1)
In the ‘large triangle’
−−→ √
|AD| = 17 121 = 5F 2 − 4F 2 cos θ . . . (2)
q √ Multiply (1) by 2 and subtract from (2)
(p − 4)2 + (−4)2 = 17 49 = F 2
(p − 4)2 + 16 = 17 F=7
Substitute in (1)
(p − 4)2 = 1
36 = 98 − 98 cos θ
p − 4 = ±1 31
cos θ = −
49
p = 3, 5.
6 6
7 F1 = √ i + √ j
4 a v1 =√4 cos 30 i + 4 sin 30 j
◦ ◦
2 2
= 2 3i + 2 j F2 = −8 j
6 6
v2 = 6 cos(−60)
√
◦
i + 6 sin(−60)◦ j F1 + F2 = √ i + (8 − √ ) j
= 3i − 3 3 j 2 2
36 √
|F1 + F2 | =
2
+ 82 − 48 2 =
−−→ √ 2
b AB = 2v1 + 3v2
√ √ 100 − 48 2
= 4 3i + 4 j + 9i − 9 3 j
√ √
= (4 3 + 9)i + (4 − 9 3) j 8 a

√
5 a Speed= 162 + 92 ≈ 18.36 m/s
Angle to the! bank Bearing
16
= tan−1 ≈ 60.646◦
9

136 Resolve parallel to the plane.

b = 8.5 seconds T = 10 cos 60◦ = 5
16
The tension in the string
√ is 5 kg wt
c Distance down the N = 10 sin 60 = 5 3 kg wt
◦
river= 9 × 8.5 = 765 m
b
6

Resolve parallel to the plane.

T cos 30◦ = 10√cos 60◦ √
10 10 3 20 3
T= √ = N=
In the ‘top triangle’ 3 3 3

384
 9 multiplication principle, there are
5 × 5 × 5 = 125
possibilities.

b There are 5 choices for the first digit,

4 for the second and 3 for the third.
Therefore, using the multiplication
principle, there are
5 × 4 × 3 = 60
possibilities.

The triangle has sides 5 cm, 12 cm and

13 a 1 + 2 × 4 = 9.
13cm and is therefore a right-angled
triangle. b 1 + (1 × 3 × 2 × 2) + (3 × 2 × 2 × 1)
5 12
cos α = and cos β = =1 + 12 + 12
13 13
Resolving vertically
=25
T 2 cos α + T 1 cos β = 10 . . . (1)
Resolving horizontally
T 2 cos β = T 1 cos α . . . (2) 14 a 4! = 4 × 3 × 2 × 1 = 24
∴ 12T 1 + 5T 2 = 130 and 5T 1 − 12T 2 = 0 6! 6 × 5 × 4!
120 50 b =
∴ T1 = kg wt and T 2 = kg wt 4! 4!
13 13
=6×5
10 Four different objects can be arranged in = 30
4! = 24 different ways.
8! 8 × 7 × 6!
c =
6!2! 6! × 2!
11 A teacher must occupy the first position. 8×7
=
There are 3 choices for this position. 2
There are five more people to be = 28
arranged in 5! ways. Therefore, using
10!
the multiplication principle there are a d 10
C2 =
total of 8!2!
10 × 9 × 8!
3 × 5! = 360 =
8! × 2!
arrangements. 10 × 9
=
2
12 a There are five digits to choose from, = 45
and each can be used as many times
as you like. Therefore, using the 15 a There are fives choices for the first

385
 position, four for the second, three for
the third and two for the fourth. This
gives a total of
5 × 4 × 3 × 2 = 120
arrangements.
b Five children can be arranged in five
spaces in 5! = 120 ways.
16 a There are a total of 5 items and these
can be arranged in 5! = 120 different
ways.
b We group the three mathematics
books together so that we now have
just three items: {M1 , M2 , M3 }, P1 , P2 .
These three items can be arranged
in 3! = 6 different ways. However,
the three mathematics books can be
arranged within the group in 3! = 6
different ways. This gives a total of
6 × 6 = 36 different arrangements.
17 a Although the question states that
there are no restrictions, we still can’t
have the zero in the first position
or else the number wouldn’t be a
five-digit number. Therefore there
are on 4 possibilities for the first
digit. The remaining four digits can
be arranged in 4! ways. This gives a
total of 4 × 4! = 96 numbers.
b If the number is divisible by 10
then the last digit must be zero.
The remaining four digits can be
arranged without restriction in
4! = 24 different ways.
c If the number is greater than 20000
then the first digit can one of three
options: 2, 3 or 4. The remaining four
digits can be arranged in 4! ways.
This gives a total of 3 × 4! = 72
different numbers.
d Obviously the last digit must be
either 0, 2 or 4. We need to consider
two cases. Case 1: If the last digit
is 0 then the remaining four digits
can be arranged without further
restriction in 4! = 24 ways. Case 2:
If the last digit is 2 or 4 then there
are two possibilities for the final
digit. As the first digit cannot be 0
there remains just 3 possibilities.
The remaining three digits can be
arranged in 3! = 6 different ways.
This gives a total of 3 × 3! × 2 = 36
numbers.
Using the addition principle, there
are a total of 24 + 36 = 60 different
numbers.
18 There are five items in total, of which a
group of three are alike and a group of
two are alike. These can be arranged in
5!
= 10
2! × 3!
different ways.
19 a Three children from six can be
selected in 6C3 ways. This gives,
6!
6
C3 =
3!3!
6 × 5 × 4 × 3!
=
3! × 3!
6×5×4
=
6
= 20.
386
 b Two letters from twenty-six can be 8. We are still to choose two more
selected in 26C2 ways. This gives, numbers from the set {1, 2, . . . , 7}.
26! These can be chosen in 7C2 ways.
26
C2 =
2!24! This gives,
26 × 25 × 24! 7!
= 7
C2 =
2! × 24! 2!5!
26 × 25 7 × 6 × 5!
= =
2 2! × 5!
= 325. =
7×6
2×1
c Four numbers out of ten can be = 21.
selected in 10C4 ways. This gives,
10! c A set with eight elements will have
10
C4 = 28 = 256 subsets (including the
4!6!
10 × 9 × 8 × 7 × 6! empty set, and the entire set).
=
4! × 6!
10 × 9 × 8 × 7
= 21 Three boys can be selected from five
4×3×2×1
in 5C3 ways. Two girls can be selected
= 210.
from four in 4C2 ways. Using the
d Three sides out of eight can be multiplication principle, we can make
selected in 8C3 ways. This gives, both selections in
8! C3 ×4 C2 = 60
5
8
C3 = 10
3!5! Probability = ways.
8 × 7 × 6 × 5! 21
=
3! × 5!
8×7×6 22 There are three cases to consider.
= Labor Liberal Selections
3×2×1
4
= 56. 1 3 C1 ×5 C3
4
2 2 C2 ×5 C2
4
3 1 C3 ×5 C1
20 a Two elements from eight can be This gives a total of 120 selections.
chosen in 8C2 ways. This gives,
8!
8
C2 = 23 Label three holes with the colours blue,
2!6!
green and red.
8 × 7 × 6!
=
2! × 6!
B G R
8×7
= Clearly, selecting six balls is not
2×1
= 28. sufficient as you might pick two balls of
each colour. Now select seven balls and
b Each set must contain the number place each sock in the hole whose label

387
 corresponds to the colour of the sock. is even.
As there are seven balls and three holes,
the Pigeonhole Principle guarantees that
27 Since m and n are consecutive integers,
some hole contains at least three balls.
we know that n − m = 1. Therefore,
Therefore the answer is seven.
n2 − m2 = (n − m)(n + m)
24 Label fifty boxes with the numbers = 1 × (n + m)
= n + m.
1 or 99 2 or 98 · · · 49 or 51 50
Selecting 50 different numbers is not 28 a Converse: If n is odd, then 5n + 3 is
sufficient as you might pick one number even.
belonging to each box. Now select
51 numbers, and place each one in b If n is odd, then n = 2k + 1 for some
its corresponding hole. As there are k ∈ Z. Therefore,
51 numbers and 50 holes, some hole 5n + 3 = 5(2k + 1) + 3
contains 2 numbers. The two numbers in
this hole are different, and so their sum = 10k + 5 + 3
is 100. = 10k + 8
= 2(5k + 4)
25 Let A and B be the sets comprising of
is even.
multiples 2 and 3 respectively. Clearly
A ∩ B consists of the multiples of 2 and c Contrapositive: If n is even, then
3, that is, multiples of 6. Therefore, 5n + 3 is odd.
|A| = 60, |B| = 40 and |A ∩ B| = 20.
We then use the Inclusion Exclusion d If n is even, then n = 2k for some
Principle to find that, k ∈ Z. Therefore,
|A ∪ B| = |A| + |B| − |A ∩ B| 5n + 3 = 5(2k) + 3
= 60 + 40 − 20 = 10k + 3
= 80. = 10k + 2 + 1
= 2(5k + 1) + 1
26 If n is odd, then n = 2k + 1 for some
is odd.
k ∈ Z. Then,
n2 + n = (2k + 1)2 + (2k + 1)
29 Method 1: Suppose that x + 1 were
= 4k2 + 4k + 1 + 2k + 1 rational. Then there would be p, q ∈ Z
= 4k2 + 6k + 2 such that
p
= 2(2k2 + 3k + 1) x+1= .
q

388
 It follows that, for some k ∈ Z. Therefore,

x=
p
−1 3n + 1 = 3(2k + 1) + 1
q
= 6k + 3 + 1
p q
= −
q q = 6k + 4
p−q = 2(3k + 2)
= .
q
is even.
Since p − q ∈ Z and q ∈ Z this implies (⇐) We will prove the equivalent
that x is rational. This is a contradiction. contrapositive statement.
Method 2: Suppose that x + 1 were Contrapositive: If n is even, then 3n + 1
rational. Then is odd.
rational rational Proof. Suppose n is even. Then n = 2k
z }| { z}|{
x = (x + 1) − 1. for some k ∈ Z. Therefore,
3n + 1 = 3(2k) + 1
Therefore, x is the difference of two
rational numbers, which is rational. This = 6k + 1
is a contradiction. = 2(3k) + 1

30 Suppose on the contrary that 6 can be is odd.

written as the difference of two perfect
squares m and n.Then
32 a This is false, for each of 2 and 5
6=n −m2 2
are prime numbers and so too is
6 = (n − m)(n + m) 2 + 5 = 7.

b Any number x ≤ 1 will provide a

The only factors of 6 are 1, 2, 3 and 6.
And since n + m > n − m we need only
consider two cases.
Case 1: If n − m = 2 and n + m = 3 then
we add these two equations together to
give 2n = 5. This means that n = 5/2,
which is not a whole number.
Case 2: If n − m = 1 and n + m = 6 then
we add these two equations together to
give 2n = 7. This means that n = 7/2,
which is not a whole number.
31 (⇒) Suppose n is odd. Then n = 2k + 1
counter-example. For example, let
x = 1/2. Then,
x3 = 1/8 < 1/4 = x2 .
Alternatively, you could let x = −1.
Then,
x3 = −1 < 1 = x2 .
33 We need to show that the opposite is
true. That is, for all n ∈ N, the number
25n2 − 9 is a composite number. To see
this, note that
25n2 − 9 = (5n − 3)(5n + 2)

389
 And since 5n − 3 ≥ 2 and 5n + 2 > 2, we P(k + 1)
have expressed 25n2 − 9 as the product 11k+1 − 6 = 11 × 11k − 6
of two natural numbers greater than 1.
= 11 × (5m + 6) − 6 (by (1))
= 55m + 66 − 6
34 a P(n)
= 55m + 60
2 + 4 + · · · + 2n = n(n + 1)
P(1) = 5(11m + 12)
is divisible by 5. Therefore P(k + 1)
If n = 1 then
is true.
LHS = 2
Therefore P(n) is true for all n ∈ N
and by the principle of mathematical
RHS = 1 × 2 = 2. induction.
Therefore P(1) is true.
P(k) 35 a 90◦ (angle subtended by a diameter
Assume that P(k) is true so that at the circumference)
2 + 4 + · · · + 2k = k(k + 1). (1)
b 54◦ (∠BAC = 90◦ , (angle subtended
P(k + 1)
by a diameter at the circumference)
LHS of P(k + 1) x = (180 − 36 − 90)◦ = 54◦ (angle
sum of triangle)
=2 + 4 + · · · + 2k + 2(k + 1)
=k(k + 1) + 2(k + 1) (by (1)) c x = 80◦ (angle subtended at the
=(k + 1)(k + 2) circumference is half the angle
subtended by the same arc at the
=(k + 1)((k + 1) + 1) centre)
Therefore P(k + 1) is true.
Therefore P(n) is true for all n ∈ N d x = 220◦ (angle subtended at the
by the principle of mathematical circumference is half the angle
induction. subtended by the same arc at the
centre)
b P(n)
11n − 6 is divisible by 5 e x = 96◦ (opposite angles in a cyclic
quadrilateral),
P(1)
y = 70◦ (opposite angles in a cyclic
If n = 1 then 111 − 6 = 5 is divisible quadrilateral)
by 5. Therefore P(1) is true.
P(k) f 46◦ (alternate segment theorem)
Assume that P(k) is true so that
11n − 6 = 5m (1) 36 a ∠DAB = (180 − 80)◦ = 100◦
for some m ∈ Z. ∠ABD = 40◦ (isosceles triangle)

390
 b ∠Y DA = 100◦ (alternate angles) 39
∠BDY = (100 + 40)◦ = 140◦

c ∠ABC = (40 + 90)◦ = 130◦

∴ ∠BCD = 50◦ (co-interior angles)

37 a ∠CBA = 90◦ , (angle subtended by a

diameter at the circumference)
∠CAB = (180 − 90 − 52)◦ = 38◦
(angle sum of triangle) AC 2 = 36 + 9 = 45 (Pythagoras’
theorem)
b ∠BDA = 52◦ (angles subtended by Consider,
the same arc) AC 2 + BC 2 = 45 + 36 = 81
∠PAD = 52◦ (alternate angles, ∴ AC 2 + BC 2 = AB2
PQ k DB) ∴ ∠ACB = 90◦ (converse of Pythagoras’
theorem)
c ∠ABD = 22◦ (alternate angles,
PQ k DB)
∴ ∠CBD = (90 − 22)◦ = 68◦ 40

38 a PA × PC = PB × PD (power of a
point)
6x = 24
x=4

b CA × CB = CP × CD (power of a a NR2 = 652 − 602 = 625 ∴ NR = 25

point) 4QNP ∼ 4PNR (AAA)
2x2 = 45
QP NP
r ∴ =
45 PR NR
x=
2 60
√ ∴ QP = × 65
3 10 25
=
2 ∴ QP = 156
c MJ × MK = ML × MN (power of a
point) b QN 2 = 1562 − 602
2x = 24 ∴ QN = 144

x = 12 c From part a NR = 25

391
41
∠XAC = (45 + 60)◦ = 105 (Equi-
lateral triangle and diagonal of a square
bisect angle)
4XBC is isosceles and
∠XBC = (60 + 90)◦ = 150◦
∴ in 4XBC, ∠CXB = ∠XCB = 15◦
∴ ∠ACX = (90 − 15 − 45)◦ = 30◦
44 The right angled-triangle with shorter
42 Angle sum of n-sided polygon
= (n − 2)180◦
For 11 sides : (11 − 2) × 180◦ = 9 × 180◦
For 5 sides: (5 − 2) × 180◦ = 3 × 180◦
43
∠DCQ = ∠QCA = 22.5◦
∠QCB = (45 + 22.5◦ = 67.5◦
∠CQB = (45 + 22.5◦ = 67.5◦ (exterior
angle of a triangle) ∴ 4BQC is isosceles
∴ BQ = CB = CD
sides 28 cm and 45 cm has hypotenuse
length 53 cm. Therefore the given
triangle is an obtuse-angled triangle.
392
Solutions to multiple-choice questions
√ √
1 A 25 + 4 = 29 9 C x = sa + tb
i + 5 j = 3si + 4s j + 2ti − t j
2 B Since
√ i + 5 j = (3s + 2t)i + (4s − t) j
|a| = 32 + 42 = 5,
Therefore, 3s + 2t = 1 and 4s − t = 5.
the unit vector will be Solving these simultaneous
a 1 equations gives,
= (3i + 4 j).
|a| 5
s = 1, t = −1.
3 D
−−→ −−→ −−→ 10 B
AB = OB − OA
−−→ −−→ −−→ −−→
AB = AO + OC + CB
= (3i + 4 j) − (2i − 4 j)
1
= i + 8j = −a + c + a
3
2
4 B = c− a
3
a − 2b = (2i + 4 j) − (6i − 4 j)
11 B
= −4i + 6 j −−→
c = OC
5 B −−→ −−→ −−→
= OB + BA + AC
−−→ −−→ −−→ −−→ −−→
AD = AB + BO + OC + CD
= b + (a − b) + 2(a − b)
= c + −b + c + −b
= b + 3(a − b)
= 2c − 2b
= 3a − 2b
= 2(c − b)
12
6 B
13 A Resolve perpendicular to F2 .
7 A The angle between F1
and F2 extended back is
8 B Vectors u and v are parallel if 100 + 120 − 180 = 40◦ .
u = cv F1 sin 40◦ − 8 sin 60◦ = 0
i + a j − 5k = cbi − 3c j + 6ck 8 sin 60◦
F1 =
sin 40◦
5
Equating coefficients gives c = − ≈ 10.78 kg wt
6
and
5 5 14 D Resolve perpendicular to F1 .
a = −3c = −3 × − = , The angle between F2
6 2
6 and F1 extended back is
b=1÷c=− . 100 + 120 − 180 = 40◦ .
5

393
 The angle between the 8 kg wt
force and F1 extended back is
120 − 40 = 80◦ .
F2 sin 40◦ − 8 sin 80◦ = 0
8 sin 80◦
F2 =
sin 40◦
≈ 12.26 kg wt
15 B Resolve perpendicular to the plane.
N − 10 cos 25◦ = 0
N = 10 cos 25◦
≈ 9.06 kg wt
16 A Resolve parallel to the plane.
F − 10 sin 25◦ = 0
F = 10 sin 25◦
≈ 4.23 kg wt
17 A Five people can be arranged in a line
in 5! ways.
18 C There are two vowels {O, A} and
four consonants {H, B, R, T }. If the
arrangement begins with a vowel
then there are two choices for the
first letter. The remaining five letters 25 A Create 3 holes for each of the
can be arranged in 5! ways. Using
the multiplication principle, there are
2 × 5! = 240 arrangements in total.
19 C There are five choices for the first
digit, four the second, three for the
third and two for the fourth. This
gives a total of 5 × 4 × 3 × 2 different
numbers.
20 B
21 B Sam has 2n coins in total, of which
a group of n are alike and a further
group of n are alike. Therefore, they
can be arranged in
(2n)! (2n)!
=
n! × n! (n!)2
different ways.
22 D Mark is still to select two more
flavours out of the nine remaining
options. This can be done in 9C2
different ways.
23 D One must choose two out of four
Labour members and two out of
five Liberal members. Using the
multiplication principle, this can be
done in
4
C2 ×5 C2
different ways
24 D A set with ten elements (friends!)
has 21 0 subsets (of friends). This
includes the empty set. However,
because we are inviting at least
one friend, the empty set must
be excluded. This leaves 21 0 − 1
subsets.
different utensils, (K,F,S). Clearly
selecting 9 items and placing them in
their corresponding hole may not be
sufficient, as you could get 3 of each
type. However, if 10 are selected
then, since 10 = 3 × 3 + 1, by the
generalised pigeonhole principle
there must be some hole with at least
4 utensils. Therefore the smallest
number of items is 10.
26 E There are three possible remainders
when a number is divided by 3.
Label three holes with each of these
remainders:
394
  Item C is true. Since m = 4 j
0 1 2 and n = 12k we know that
If 15 integers are written on the m + n = 4 j + 12k = 4( j + 3k),
board, then placed in their corre- which is divisible by 4.
sponding box, then this may not be
 Item D is true. Since m × n is
sufficient - you could get 5 of each
divisible by 48, it follows that m2 n
remainder. However, if 16 integers
will also be divisible by 48.
are written on the board then, since
16 = 5 × 3 + 1, by the generalised  Item E may be false. For example,
pigeonhole principle there must be n = 12 is divisible by 12 and
some hole with at least 6 integers. m = 16 is divisible by 4 and yet n
Therefore the smallest number of is not divisibly by m.
integers is 16.
30 D
27 B Let A and B be the sets comprising
of multiples of 2 and 5 respectively.  Item A is false. If m = 3 and
Clearly A ∩ B consists of the mul- n = 2 then mn = 6 is even, though
tiples of 2 and 5, that is, multiples m is not even.
of 10. Therefore, |A| = 30, |B| = 12
and |A ∩ B| = 6. We then use the  Item B is false. If m = 1 and
Inclusion Exclusion Principle to find n = 3 then m + n = 4 is even, even
that, though neither m nor n is even.
|A ∪ B| = |A| + |B| − |A ∩ B|  Item C is false. If m = 1 and
= 30 + 12 − 6 n = 2 then m + n = 3 is odd, while
mn = 2 is even.
= 36.
 Item D is true. If mn is odd then
28 E All are true except the last option.
both m and n are odd. Therefore
For if m and n are odd then so is mn.
m + n is even.
Therefore mn + 1 will be even.
 Item E is false. Note that m + n
29 E
and m − n will both be odd, or
 Item A is true. Since n is divisible both be even.
by 12, it will be divisible by 3.
31 C To form the converse, we switch
Therefore, m × n will be divisible
the hypothesis (If n is even) and the
by 3.
conclusion (then n + 3 is odd). This
 Item B is true. Since m = 4 j gives "If n + 3 is odd, then n is even".
and n = 12k we know that
32 E
m × n = 48 jk, which is divisible
by 48.

395
  Item A is true. If a > b, then  Item C is true. For any four
1
a − b > 0. Therefore > 0. consecutive numbers, one will be
a−b divisible by 3.
 Item B is true. If a > b then
a b a2 − b2  Item D is true. For any four
− = > 0.
b a ab consecutive numbers, one will be
 Item C is true. If a > b then divisible by 4, and another will
a + b > b + b = 2b. be divisible by 2. Therefore the
product will be divisible by 8.
 Item D is true. If a > b then
a + 3 > b + 2.  Item E is true. For any four
consecutive numbers, one will be
 Item E may be false. For example, divisible by 4, and another will
if a = 3 and b = 2 then a > b be divisible by 2. Furthermore,
while 2a = 6 = 2b. one number will be divisible by
3. Therefore the product will be
33 E Since, divisible by 24.
mn − n = 12
36 D
n(m − 1) = 12 From 4ADB
x2 + 36 = AC 2
From 4BCA
Clearly n = ±1, ±2, ±3, ±4, ±6, ±12. x2 + 36 + x2 = 100
And for each of these twelve 2x2 = √64
values of n we can easily find a x=4 2
corresponding value of m.
37 D From 4ABC
34 B Since 9n2 − 4 = (3n − 2)(3n + 2), the 9 + 36 = BC 2
number will always be composite, From 4DBC
unless 3n − 2 = 1. This implies that DB2 = 9√+ 45
n = 1, in which case 9n2 − 4 = 5. So DB = 3 6
there is only one such value of n.
38 A 4ADE ∼ 4ACB
35 B
DE AE
∴ =
 Item A is true. For any four 12 AB
consecutive numbers, two will be
DE = 6
even, two will be odd. So the sum
will be even. 39 E ∠S RQ = x◦ (isosceles triangle)
∠RS Q = (138 − y)◦ (co-interior
 Item B may be false. For example,
angle)
1 + 2 + 3 + 4 = 10 is not divisible
2x + 138 − y = 180 (angle sum of
by 4.

396
 triangle) DE 10
43 C = = 2.5
∴ 2x − y = 42 AB 4
DE = 2.5 × AB
AG 15
40 B = =3 Area = 2.52 × 24
DG 5
AG = 3DG = 18 = 150 cm2
∴ AE = 18 − 9 = 9 A + B 53 125
BG AG 44 C = 3 =
= A 3 27
FG EG A + 49 125
FG + 6 18 =
= =2 A 27
FG 9 27A + 49 × 27 = 125A
FG + 6 = 2FG
98 A = 49 × 27
∴ FG = 6 49 × 27
x 6 2 A=
= = 98
FG 9 3 27
2 = = 13.5 cm3
x = FG 2
3
2 3 1 2 2
2 45 E πR : π r = 27 : 4
= ×6=4 3 3
3
2R3 : r3 = 27 : 4
41 D
27
R3 : r3 = :4
42 A 2
= 27 : 8
√3 √3
R : r = 27 : 8
R:r=3:2

46 D KO : KN = 1 : 3
area KOP 1
=
area MLK 9
Use similar triangles.
x 1.6 area KOP 1 1
= = ×
2 5.6 area (MLK + MNK) 9 2
16 2 1
= = =
56 7 18
4 area KOP 1
x= =
7 area KLMN 18
≈ 0.57 m 47 B The angle subtended at the top of
150
the circle by QT = = 75◦ .
2
By the alternate segment theorem,
∠QT S = 75◦ .

397
48 C Join LN. 52 C Join AB.
Using the alternate segment theorem, Since T A = TB, ∠TBA = 45◦ .
∠MLN = 40◦ . Since AC is perpendicular to
In triangle LMN, ML = MN tangent T A, it must be a diameter.
∴ ∠MNL = ∠MLN = 40 ◦
∴ ∠CBA = 90◦
∠LMN = 180 − 40 − 40 ∠T BC = 90 + 45
= 100◦ = 135◦
TB is parallel to AC, since co-
49 B Using the alternate segment interior angles BT A and CAT are
theorem, ∠ZY X = ∠ZXT supplementary.
∠ZXT = ∠ZXY ∴ ∠BCA = 180 − 135
∴ ∠ZY X = ∠ZXY = 45◦
Triangle ZXY is isosceles, with
YZ = XZ. 53 B ∠RT P = 30◦ (alternate segments)
∠T RS = 40 + 30
50 D ∠QOS = 180 − 70
= 70◦ (exterior angle of RTP)
= 110 ◦

∠RT S = 180 − 70 − 30
Reflex ∠QOS = 360 − 110
= 80◦
= 250◦
250 54 D AB = AC
∠QRS =
2 ∴ ∠ADC = 60◦
= 125◦
∠ACD = 180 − 60 − 50
51 C Let the diameter be CE. = 70◦ (angle sum of RT S )
If AD = DB = 4 cm, then
∠ABD = 180 − 70
AD · DB = CD · DE
= 110◦
4 × 4 = 2(2r − 2)
2r − 2 = 8
2r = 10
r = 5 cm

398
Solutions to extended-response questions
−−→ −−→ −−→
1 a AE = AC + CE B
1
−−→ t b E
= 2AD + t
t+1
A C
t a D a
= 2a + (b − 2a)
t+1
2(t + 1) t 2t
= a+ b− a
t+1 t+1 t+1
1
= ((2t + 2 − 2t)a + tb)
t+1
1
= (2a + tb)
t+1

−−→ −−→ −−→

b AE = AD + DE F

1 −−→
= a + DF
8 7
1 −−→ −−→ B
= a + (AF − AD)
8 b E
t
1 −−→ 1 1
= a + AF − a A C
8 8 a D a
1 −−→
= (7a + AF)
8

−−→ 1 −−→
c AE = (7a + AF)
8
−−→ −−→
∴ 8AE = 7a + AF
−−→ −−→
∴ AF = 8AE − 7a
8
= (2a + tb) − 7a
t+1
1
= (16a + 8tb − 7(t + 1)a)
t+1
1
= (16a + 8tb − (7t + 7)a)
t+1
1
= ((9 − 7t)a + 8tb)
t+1
9 − 7t 8t
= a+ b, as required.
1+t 1+t

399
 −−→ −−→
d If A, B and F are collinear, then AF = k AB, k > 0
= kb
= 0a + kb
9 − 7t
∴ =0
1+t
∴ 9 − 7t = 0
9
∴ t=
7
2 a Assume P divides AB in the ratio x : y. B
−−→ −−→ −−→ y
OP = OA + AP P
x
x −−→ C
=a+ AB A
x+y b
a c
x −−→ −−→
=a+ (OB − OA)
x+y O
x+y x
= a+ (b − a)
x+y x+y
1
= ((x + y − x)a + xb)
x+y
y x
= a+ b
x+y x+y
y x
= ma + nb where m = , n= , m, n ≥ 0
x+y x+y
y x
and m + n = +
x+y x+y
= 1, as required.

−−→ −−→ −−→ −−→

b PC = −AP − OA + OC
= −n(b − a) − a + c
= −nb + na − a + c
= (n − 1)a − nb + c

400
 c Assume Q divides PC in the ratio v : w. B
−−→ −−→ −−→ −−→
OQ = OA + AP + PQ P v Q
v −−→ w
= a + n(b − a) + PC A C
v+w b
v a c
= a + nb − na + ((n − 1)a − nb + c)
v+w O
1
= ((v + w)a + n(v + w)b − n(v + w)a + v(n − 1)a − nvb + vc)
v+w
1
= ((v + w − nv − nw + vn − v)a + (nv + nw − nv)b + vc)
v+w
1
= ((w − nw)a + nwb + vc)
v+w
w(1 − n) nw v
= a+ b+ c
v+w v+w v+w
= λa + µb + γc
w(1 − n) nw v
where λ = ,µ = ,γ = , λ, µ, γ ≥ 0
v+w v+w v+w
w(1 − n) + nw + v
and λ + µ + γ =
v+w
w − nw + nw + v
=
v+w
v+w
= = 1, as required.
v+w
−−→ −−→ −−→
3 a AB = OB − OA Q B
A
=b−a
P
−−→ −−→ −−→ −−→
PQ = PO + OB + BQ
−−→ −−→ O
= −OP + b − QB
4 −−→ 1 −−→
= − OA + b − AB
5 2
4 1
= − a + b − (b − a)
5 2
! !
−4 1 1
= + a+ 1− b
5 2 2
−3 1
= a+ b
10 2

401
 −−→ −−→
b i QR = n PQ R
!
−3 1 Q
=n a+ b A B
10 2
P
−−→ −−→ −−→
ii QR = PR − PQ
−−→ −−→ −−→ O
= (OR − OP) − PQ
−−→ −−→ −−→ −−→
= (OB + BR) − OP − PQ
!
4 −3 1
= b + kb − a − a+ b
5 10 2
! !
3 4 1
= − a+ k+1− b
10 5 2
!
1 1
=− a+ k+ b
2 2

! !
−3 1 1 1
c n a+ b =− a+ k+ b
10 2 2 2
−3 1
∴ n=−
10 2
1 −10 5
∴ n=− × =
2 3 3
1 1
and n = k +
2 2
1 5 1 1
∴ k= × − =
2 3 2 3
4 a Let x be the (proper) velocity of the wind relative to a stationary object.
Let u be the man’s velocity, 4 km in a northerly direction.
Let w be the apparent velocity of the wind.
w

u
x=u+w
x

When the man doubles his speed the wind appears to come from the north west.

402
 Let w0 be the new apparent velocity of the wind. C
The new velocity is 2u = u + u.
The second vector diagram is superimposed on the first. w′
u
The vertices are labelled to describe the triangles.
The triangle BCD is isosceles as ∠CBD is a right angle and B D
∠BCD = 45◦ . w

|u| = 4 and therefore |w| = 4.

By Pythagoras’ theorem, u x
|x|2 = 42 + 42
√
and so, |x| = 4 2 A
and the direction that it blows from is south west.

b The northerly component of the swimmer’s velocity is 2000 m/h.

The river is 400 m wide.
400 1
It takes = hour to reach the north bank.
2000 5
The river is flowing from east to west at 1 km/h =
400 m
1000 m/h.
1
Hence in 1hour the swimmer has gone × 1000 =
5
200 m downstream.

c Let u be the true velocity of the wind.

The cosine rule can be used to determine the magnitude 45° 60 km/h

of the velocity.
50 km/h
|u|2 = 502 + 602 − 2 × 50 × 60 cos 45◦
= 2500 + 3600 − 6000 cos 45◦
√ u
= 6100 − 3000 2
So |u| = 43.1 km/h (correct to one decimal place).
For the direction to be determined the sine rule is used.
60 |u|
=
sin α sin 45◦
60 sin 45◦
∴ sin α =
|u|
Therefore, α = 79.88◦
The true velocity of the wind is 43.1 km/h blowing at a bearing of 080◦ (correct to
the nearest degree).

403
 d Let ∠DLD0 = α◦ . N
From the diagram and using the sine rule
5 35 L
= 230°
sin α sin 100◦
5 sin 100◦ 50°
∴ sin α =
35 D 100°
∴ α ≈ 8.1 ◦

This represents a bearing of 230◦ − 8.1◦ = 221.9◦ , or 222◦

D′
correct to the nearest degree.

5 a Even though there are no restrictions, the first digit cannot be 0. Therefore, there
are six choices for the first digit. There are then six choices for the second digit
(including 0), five for the third and so on. Using the multiplication principle, there
are
6 × 6 × 5 × 4 × 3 = 2160
different numbers.

b If the number is divisible by 10 then the last digit must be 0. Therefore, there is only
one choice for this digit. There are then six choices for the first digit, five for the
second and so on. Using the multiplication principle, there are
6 × 5 × 4 × 3 × 1 = 360
different numbers.

c If the number is odd, then the last digit must be one of three options: 1, 3 or 5. The
first digit cannot be 0, and obviously can’t be equal to the last digit. Therefore, there
are five choices for the first digit. There are then five choices for the second digit
(including 0), four for the third and so on. Using the multiplication principle, there
are
5 × 5 × 4 × 3 × 3 = 900
different numbers.

d There are a total 2160 numbers, of which 900 are odd. The remaining 2160 − 900 =
1260 will be even.

6 a There are eight workers in total, from which four are to be selected. This can be
done in
8
C4 = 70
different ways.

b We must select two of three men and two of five women. Using the multiplication

404
 principle this can be done in
3
C2 ×5 C2 = 30
different ways.

c If the group must contain Mike and Sonia then we need only select two more
workers from the six that remain. This can be done in
6
C2 = 15
different ways.

d If the group cannot contain both Mike and Sonia, then we need only evaluate the
total number of selections, then subtract those selections that contain both Mike and
Sonia. This gives
70 − 15 = 55
different selections.

7 a There are six items in total, of which a group of three are alike and another group of
three are alike. These can be arranged in
6!
= 20
3! × 3!
different ways.

b There must be at least one red flag between each black flag. Denote black and red
flags by the letters B and R respectively. Then consider the sequence BRBRB. This
arrangement isolates the black flags using two red flags. The third red flag can be
inserted anywhere, giving four different arrangements:
RBRBRB,BRRBRB,BRBRRB,BRBRBR.

c We list all of the possibilities in the table below. In the first two columns we write
down the numbers of red and black flags respectively.

405
 R B arrangements
1 0 1
0 1 1
0 2 1
2 0 1
1 1 2
3 0 1
0 3 1
1 2 3
2 1 3
1 3 4
3 1 4
2 2 6
2 3 10
3 2 10
3 3 20
This gives a total of 68 different arrangements.

8 a There are seven letters in total, of which a group of three Gs are alike and another
group of two As are alike. These can be arranged in
7!
= 420
3! × 2!
different ways.

b There are three cases to consider, each of which gives the same number of
arrangements.
Case 1: If the arrangement begins and ends with A then there are now just five
letters to arrange, of which a group of three Gs are alike. These can be arranged in
5!
= 20
3!
different ways.
Case 2: If the arrangement begins with A and ends with E then there are now just
five letters to arrange, of which a group of three Gs are alike. These can be arranged
in
5!
= 20
3!
different ways.
Case 3: If the arrangement begins with E and ends with A then there are now just
five letters to arrange, of which a group of three Gs are alike. These can be arranged
in
5!
= 20
3!
different ways

406
 Therefore the total number of arrangements will be 20 + 20 + 20 = 60.

c There are three cases to consider.

Case 1: If the arrangement begins and ends with a G then there are now just five
letters to arrange, of which a group of two As are alike. These can be arranged in
5!
= 60
2!
different ways.
Case 2: If the arrangement begins with B and ends with a G then there are now just
five letters to arrange, of which a group of two Gs are alike and a group of two As
are alike. These can be arranged in
5!
= 30
2!2!
different ways.
Case 3: If the arrangement begins with a G and ends with B then there are now just
five letters to arrange, of which a group of two Gs are alike and a group of two As
are alike. These can be arranged in
5!
= 30
2!2!
different ways.
Therefore the total number of arrangements will be 60 + 30 + 30 = 120.

d We group together all of the vowels {A,A,E} and all of the consonants {B,G,G,G}.
There are now two groups to arrange .This can be done in 2 ways. We then arrange
3!
within each group. The first group can be arranged in = 3 different ways, and the
2!
4!
second group can be arranged in = 4 different ways. Using the multiplication
3!
principle, the total number of different arrangements will be,
2 × 3 × 4 = 24.

9 a There are many ways to answer this question, each giving the same answer.
Method 1: There are
25
C2 = 300
ways of selecting two of twenty-five people to shake hands.
Method 2: The first person shakes hands with 24 others, the second with 23 and so
on. This gives the total number of handshakes as
24 + 23 + · · · + 1 = 300.
Method 3: Each of the 25 people shakes hands with 24 others, but this double
counts each handshake. Therefore the total number of handshakes is
25 × 24
= 300.
2

407
 b This question can be done by trial and error. Here’s an algebraic solution. Suppose
that there are n people in the first group and 25 − n people in the second group. Then,
n
C2 +25−n C2 = 150
n! (25 − n)!
+ = 150
2!(n − 2)! 2!(23 − n!
n(n − 1)(n − 2)! (25 − n)(24 − n)(23 − n)!
+ = 150
2!(n − 2)! 2!(23 − n!
n(n − 1) (25 − n)(24 − n)
+ = 150
2 2
n(n − 1) + (25 − n)(24 − n) = 300
n2 − 25n + 150 = 0
(n − 10)(n − 15) = 0
n = 10, 15.
Therefore, the number of people in each group is 10 and 15.

c If we tried to count the total number of handshakes then each of the 25 people
shakes hands with exactly 3 others. This double counts each handshake, so the total
number of handshakes is
25 × 3 75
= ,
2 2
which not a whole number.

10 a Four points can be selected from twelve in 12C4 = 495 ways.

b Two points can be selected from twelve in 12C2 = 66 ways. From this, subtract the 6
pairs that are diametrically opposite. This gives a total of 66 − 6 = 60.

c Pick any two vertices that are not diametrically opposite. These two points, and the
two points that are diametrically opposite, will lie on a rectangle.

d Selecting any two points that are not diametrically opposite will define the edge
of a rectangle as described in the previous question. This can be done in 60 ways.
However, there are four edges that give the same rectangle. Therefore, the total
number of rectangles will be 60 ÷ 4 = 15.

e There are a total of 495 choices of 4 points, and of these 15 are rectangles.
Therefore, the probability of selecting a rectangle is
15 1
=
495 33
.

408
11 a If a + b is even then either a and b are both odd or a and b are both even. If b + c
is odd then either b is odd and c is even or b is even and c is odd. Therefore, one of
these two statement must be true:
Statement 1: a is odd and b is odd and c is even.
Statement 2: a is even and b is even and c is odd.
Therefore, we can’t determine whether a, b or c are even or odd. For instance,
the numbers a = b = 1 and c = 2 satisfy the given conditions, as do the numbers
a = b = 2 and c = 1.

b If we additionally know that a + b + c is even then the second statement above

cannot be true, as a + b + c would be odd. Therefore, the first statement must be true.
Therefore, a is odd and b is odd and c is even.

12 a We first show that a = 2. If a = 1 then the left hand side is too large. If a ≥ 2 then
1 1 1 1 1 1
+ + < + + =1
a b c 3 3 3
Therefore, c = 2 and
1 1 1
+ = .
b c 2
We now show that b = 3. If b ≥ 4 then
1 1 1 1 1
+ < + = .
b c 4 4 2
Therefore, b = 3 and
1 1 1 1
= − = .
c 2 3 6
Therefore, c = 6. We have obtained just one set of values:
(a, b, c) = (2, 3, 6).

b We first show that a = 1. If a ≥ 2 then the left hand side is too small since,
1 1 1 1 1 1 1 1
+ + + < + + + =2
a b c d 2 2 2 2
Therefore, a = 1 so that we now require that
1 1 1
+ + > 1.
b c d
We now show that b = 2. If b ≥ 3 then
1 1 1 1 1 1
+ + < + + = 1.
b c d 3 3 3
Therefore, b = 2 so that we now require that
1 1 1
+ > .
c d 2
We now show that c = 3. If c ≥ 4 then
1 1 1 1 1
+ < + = .
c d 4 4 2

409
 Therefore, c = 3 so that we now require that
1 1 1 1
> − = .
d 2 3 6
Therefore, either d = 4 or d = 5. We have obtained just two sets of values:
(a, b, c, d) = (1, 2, 3, 4) or (a, b, c, d) = (1, 2, 3, 5).

13 Suppose that b > a. Then

a + c a b(a + c) a(b + c)
− = −
b+c b b(b + c b(b + c)
b(a + c) − a(b + c)
=
b(b + c)
ab + bc − ab − ac
=
b(b + c)
bc − ac
=
b(b + c)
c(b − a)
=
b(b + c)
>0
Note that the last line follows from the fact that each term in the fraction is positive.
Therefore,
a+c a
> ,
b+c b
as required.

14 a Since 29 = 512 < 103 and 210 = 1024 > 103 , the smallest such n will be 10.

b Since,
2100 = (210 )10
> (103 )10
= 1030 ,
we know that 2100 must have at least 31 digits.

c As there are at least 31 digits, and 10 different digits, there must be some digit that
occurs at least 4 times.

15 a If the first digit is n and the second digit is 5 then the last two digits of its square will
be 25 and the first two digits will be n × (n + 1).

b Since 7 × 8 = 56, from the observed pattern we expect that 752 = 5625. You can
easily check that this is true.

410
 c Each number is of the form 10n + 5. We square this number to obtain
(10n + 5)2 = 100n2 + 100n + 25
= 100n(n + 1) + 25
This shows that the first two digits will be n(n + 1) and the last two digits will be 25.

16 a Note that
10 × 11
1 + 2 + · · · + 10 = = 55.
2
If the blocks could somehow be used to build two towers of the same height, then
each would be 55 ÷ 2 = 27.5 cm tall. This is impossible, as each block has an integer
side length.

b If n = 4k + 1 or n = 4k + 2 then you cannot build two towers of the same height.

First suppose n = 4k + 1. Then note that
(4k + 1)(4k + 2)
1 + 2 + · · · + (4k + 1) =
2
= (4k + 1)(2k + 1).
Since this is odd, it is not divisible by 2. Similarly, if n = 4k + 2 then,
(4k + 2)(4k + 3)
1 + 2 + · · · + (4k + 2) =
2
= (2k + 1)(4k + 3).
Since this is odd, it is not divisible by 2.
We will prove n = 4k or n = 4k − 1 then we can build two towers of the same height.
When n = 4k, this is easy. We indicate how this can be done with an example that
is easily generalised. Let n = 8. By pairing 1 with 8, then 2 with 7, etc., we see that
each pair has the same sum.
9
9
9
9
1 2 3 4 5 6 7 8
If follows that we can make two towers whose heights are the same. For example,
1 + 3 + 6 + 8 = 2 + 4 + 5 + 7.
When n = 4k − 1, we do something similar. We indicate how this can be done with a
an example that is easily generalised. Let n = 7. By pairing 1 with 6, 2 with 5 etc.,
we see that each pair has the same sum, 7. Notice that 7 does not belong to a pair.

411
 7
7
7
1 2 3 4 5 6 7
Once again, using this diagram we can make two towers whose heights are the same.
For example,
1 + 3 + 4 + 6 = 2 + 5 + 7.

17 a Suppose that a is odd and b is odd. Then a = 2k + 1 and b = 2m + 1 where k, m ∈ Z.

Therefore,
ab = (2k + 1)(2m + 1)
= 4k2 + 2k + 2m + 1
= 2(2k2 + k + m) + 1
= 2n + 1, where n = 2k2 + k + m ∈ Z.
We see that ab is odd.

b P(n)
If n ∈ N and a is odd then an is odd
P(1)
If n = 1 then a1 = a is odd, by assumption. Therefore P(1) is true.
P(k)
Assume that P(k) is true so that ak is odd.
P(k + 1)
Since
ak+1 = ak × a
is the product of two odd numbers, ak+1 will be odd. Therefore P(k + 1) is true.
Therefore P(n) is true for all n ∈ N by the principle of mathematical induction.
n
c Assume, on the contrary, that 3 m = 2 where n, m ∈ N. Then raising both sides to the
power of m gives,
 n m
 
3 m  = 2m
 

3n = 2m
We have proved that the left hand side is odd. However, the right hand side is even.
This is a contradiction.

412
18 a Expanding the left hand side gives
n4 + 6n3 + 11n2 + 6n + 1 = a2 n4 + 2abn3 + (2ac + b2 )n2 + 2bcn + c2 .
We then equate coefficients. Since a is positive and a2 = 1, clearly a = 1. Likewise
c = 1. Finally, as 2bc = 6, we know that b = 3.

b Let the four consecutive numbers be n, n + 1, n + 2 and n + 4. Then when 1 is added

to their product, we obtain
n(n + 1)(n + 2)(n + 3) + 1.
If we expand this expression, we obtain
n4 + 6n3 + 11n2 + 6n + 1.
From the previous question, we know that this is equal to
n4 + 6n3 + 11n2 + 6n + 1 = (n2 + 3n + 1)2 .

c Let n = 5 in the previous question, so that

5 × 6 × 7 × 8 + 1 = (52 + 3 × 5 + 1)2
= 412

19 a We first note that,

QR = CB = a
PQ = AB = c
PR = AC = b
∠PBQ = ∠CBA (common)
∠P = ∠A (4ABC ≡ 4PQR)
∴ 4PBQ ∼ 4ABC

PB AB
b =
PQ AC
c2
∴ PB =
b
c 4QBR ∼ 4ABC (AAA)

d PB = PR + RB
a2
PB = b +
b
e Use the expressions for PB obtained above.
c2 a2
=b+
b b
∴ c2 = b2 + a2

413
20 a Since ∠TBO + ∠T AO = 180◦ , TBOA is a cyclic quadrilateral.

b ∠BPT = x◦ D

∠BCA = x◦ (corresponding)
C
P
∠BOA = (2x)◦ B
x°
x° O
(angle subtended at centre is twice the angle at the x° (2x)°
circumference)
∠T AB = ∠ACB(alternate segment)
x°
= x◦ A
T
∠T BA = ∠AC(alternate segment)
= x◦

21 a ∠GAF = ∠HAB common

AB AH
= construction
AF AG
∴ 4AFG ∼ 4ABH

b ∠GFA = ∠HBA (4AFG ∼ 4ABH)

∴ CG k BH (corresponding angles equal)

c Show 4AEG ∼ 4ACH (Exactly the same as

part a
∴ ∠AEG = ∠ACH
∴ GB k CH

d CG k BH and GB k CH
∴ GBHC is a parallelogram
Diagonals of a parallelogram bisect eachother.
Hence BD = DC

414
Solutions to Problem-solving and modelling
1 a Since the newspaper has 100 pages and each sheet includes 4 pages, the stack must
contain 100 ÷ 4 = 25 sheets. The 25th sheet includes pages 49, 50, 51 and 52.

b The least two numbers have increased by 6 from 1 and 2 to 7 and 8. The last two
pages will decrease by 6 from 99 and 100 to 93 and 94.

c Suppose the newspaper is make up of n sheets of paper. Then the kth sheet of paper
will include pages 2k − 1, 2k, 4n − 2k + 1, 4n − 2k + 2. The sum of these numbers is
2k − 1 + 2k + 4n − 2k + 1 + 4n − 2k + 2 = 8n + 2.
Therefore, the sum of page numbers on each sheet depends only on the total number
of sheets.

d From the previous question, we see that

8n + 2 = 11 + 12 + 33 + 34
8n + 2 = 90
8n = 88
n = 11.
There are 11 sheets of paper. Therefore, there are 11 × 4 = 44 pages.

2 a The smallest number of coins that Sam would need to do this is

0 + 1 + 2 + 3 + 4 + 5 + 6 = 21.
Sam has only 20 coins, so this is impossible.

b The calculation above shows that Sam would need 21 coins.

c Since
0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 45,
Sam could fill 10 pockets with 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 coins. His last five
coins could go in the pocket containing 9 coins. Each pocket would then have
a different number of coins. We now show that it is impossible for him to fill
more than 10 pockets with a different number of coins in each. Arrange these
numbers from smallest to largest. The smallest eleven numbers are no less than
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 respectively, and the sum of these numbers is
0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10 = 55 > 50.

415
3 a i ∠BDC = ∠ADQ (construction)
∠DAQ = ∠DBC (subtended by the same arc)
∴ 4ADQ ∼ 4BDC (AAA)

ii ∠QCD = ∠ABD (construction)

Let ∠BDC = ∠ADQ = θ
∠QDB = 180◦ − 2θ
∴ ∠QDC = 180◦ − 2θ + θ = 180◦ − θ
∠ADB = 180◦ − 2θ + θ = 180◦ − θ
∴ 4ADB ∼ 4QDC (AAA)

AQ AD
iii From i =
BC BD
BC · AD
∴ AQ =
BD
QC CD
From ii =
AB BD
AB · CD
∴ QC =
BD
iv AC = AQ + QC
BC · AD AB · CD
∴ AC = +
BD BD
∴ AC ḂD = BC · AD + AB · CD
The theorem is proved.

b In a rectangle BC = AD, CD = AB and since the diagonal are of equal length

AC = BD
∴ BC 2 + AB2 = AC 2

c Let AB = BC = CD = DE = EA = 1
Let x be tlength of a diagonal.
Apply Ptolemy’s theorem to quadrilateral ABCE.
x2 = x + 1
x2 − x − 1 = 0
√
1± 5
x=
2
√
1+ 5
∴x=
2

416
 d Let AB = BC = CA = 1
Apply Ptolemy’s theorem to quadrilateral ADBC.
CD × 1 = AD × 1 + DB × 1.
∴ CD = AB + DB

a Let ∠DPA = x◦
4PDA is isosceles (equal tangents from a point)
x
Then ∠PAD = (90 − )◦
2
Similarly Let ∠CRB = y ◦

4RCB is isosceles (equal tangents from a point)

y
Then ∠BCR = (90 − )◦
2
x
∠ABD = (90 − )◦ (alternate segment theorem)
2
y
∠CDB = (90 − )◦ (alternate segment theorem)
2
x
∠DCA = (90 − )◦ (angles subtended by the same arc)
2
x y
∴ ∠AXR = (90 − )◦ + (90 − )◦ (exterior angle of triangle)
2 2
x+y ◦
= (180 − )
2
Also x + y = 180◦ (opposite angles in cyclic quadrilateral)
∴ ∠AXR = 90◦

417
 b

Let M, N, P and W be the midpoints of DA, AB, BC and CD respectively.

4ABD ∼ 4AN M (SAS).
Therefore MN k DB. Similarly
WP k DB, NP k AC and MW k AC
It was shown in a that AC ⊥ DB.
Hence MNPW is a rectangle and thus cyclic.

5 The pattern is:

n + (n + 1) + (n + 2) + · · · + (3n − 2) = (2n − 1)2

The sequence is arithmetic.
2n − 1
∴ Sn = (2n + (2n − 2))
2
2n − 1
= × (4n − 2)
2
= (2n − 1)2

6 a We can write p = 6k + r where r = 1or5 since if r = 0, 2, 3, 4 it contradicts r being

prime.

b If p = 6k + 1, p2 = 36k2 + 12k + 1 = 12k(3k + 1) + 1.

12k(3k + 1) is divisible by 24 and therefore remainder is 1.
If p = 6k + 5, p2 = 36k2 + 60k + 25 = 12k(3k + 5) + 1 12k(3k + 5) is divisible by 24
and therefore remainder is 1.

c Again two cases can be considered.

When p = 6k + 1, p2 + 2 = 36k2 + 12k + 3 which is divisible by 3. When
p = 6k + 5, p2 + 2 = 36k2 + 60k + 27 which is divisible by 3.

418
 −−→ −−→ −−→
7 a OA = a, OB = b, OC = c A
B
Since A, B and C are collinear,
−−→ −−→
AC = k AB. C
a
−−→ b
c = OC c
−−→ −−→
= OA + AC
−−→ −−→
= OA + k AB
−−→ −−→ −−→
= OA + k(AO + OB)
= (1 − k)a + kb
So if c = αa + βb, and O does not lie on the line
ABC, then α = 1 − k and β = k and α + β = 1.

b i Let N be the midpoint of YZ. Z

As G lies on ZM,
−−→ −−→
ZG = kZM for some non-zero real number k.
Similarly,
−−→ −−→ N
XG = lXN for some non-zero real number l. H
−−→
ZG will be found in two different ways to obtain G K
simultaneous equations in k and l.
X M Y

−−→ −−→
ZG = kZM
−−→ −−→
= k(ZX + XM)
−−→ 1 −−→
= kZX + k XY
2
−−→ 1 −−→ −−→
= kZX + k(XZ + ZY)
2
1 −−→ 1 −−→
= kZX + kZY
2 2
−−→ −−→ −−→
Also ZG = ZX + XG
−−→ −−→
= ZX + lXN
−−→ −−→ −−→
= ZX + l(XZ + ZN)
!
−−→ −−→ 1 −−→
= ZX + l −ZX + ZY
2
−−→ 1 −−→
= (1 − l)ZX + lZY
2
−−→ 1 −−→ 1 −−→ −−→ 1 −−→
Thus ZG = kZX + kZY = (1 − l)ZX + lZY
2 2 2

419
 −−→
is not parallel, to ZY
Hence equating coefficients,
1 1 1
k = 1 − l and k = l
2 2 2
1
∴ l = k and k = 1 − k
2
2
∴ k=l=
3
−−→ 2 −−→
Thus ZG = ZM.
3
−−→ 2 −−→
ii ZG = ZM
3
2 −−→ −−→
= (ZX + XM)
3
2 −−→ 1 −−→
= ZX + XY
3 3
2 −−→ 1 −−→ −−→
= ZX + (XZ + ZY)
3 3
−−→ 2 −−→ 1 −−→ 1 −−→
∴ ZG = ZX − ZX + ZY
3 3 3
1 −−→ 1 −−→
= ZX + ZY
3 3
−−→ −−→ −−→ −−→
But ZH = hZX, ZK = kZY
−−→ 1 −−→ −−→ 1 −−→
So ZX = ZH and ZY = ZK
h k
−−→ 1 −−→ 1 −−→
So ZG = ZH + ZK
3h 3k
−−→ 1 −−→ 1 −−→
iii Since H, G and K are collinear and ZG = ZH + ZK, from part a
3h 3k
1 1
+ =1
3h 3k
1 1
and + = 3
h k
2
iv If h = k then =3
h
2
Hence h = k =
3
ZH ZK
This means = and so triangles ZHK and ZXY are similar triangles and
ZX ZY
HK is parallel to XY.
2
(Also HK is parallel to XY implies h = k = .)
3

420
 2
v If h = k then h = k = . Triangles ZHK and ZXY are similar.
3
4
∴ Area of4ZHK = (Area of4ZXY)
9
4
= cm 2
9
vi If k = 2h,
1 1
then + =3
h 2h
3
∴ =3
2h
1
and h =
2
1
Thus ZH = ZX and H is the midpoint of ZX. This means that HG is the
2
median and in this case K coincides Y.

421
vii If H lies on the line segment ZX and K lies on the line segment ZY, then
0 ≤ h ≤ 1 and 0 ≤ k ≤ 1.
1 1
Now + =3 ... 1
h k
1 1
so =3−
h k
1 3k − 1
∴ =
h k
k
∴ h= ... 2
3k − 1
1 1
From ,1 =3−
k h
3h − 1
=
h
h
∴ k= ... 3
3h − 1
Now 0<h≤1
k
∴ from ,
2 0< ≤1
3k − 1
∴ 0 < k ≤ 3k − 1
Consider 3k − 1 ≥ k h
( 12 , 1)
∴ 2k ≥ 1

∴ k≥
1
1
(1, 21 )
2 h=3
1
Hence ≤k≤1
2 0 k
Similarly 0<k≤1 1
k=3
h
∴ from ,
3 0< ≤1
3h − 1
1
∴ h≥
2
1
Hence ≤h≤1
2
The graph of h against k is part of a hyperbola as shown.

422
viii Let the area of 4XYZ be 1 cm 2 .
Then, as 4ZKX and 4XYZ have bases along ZY and have the same height,
area of 4ZKX ZK
=
area of 4ZY X ZY
ZK
∴ area of 4ZKX = × area of 4XYZ
ZY
kZY
= × 1, since ZK = kZY
ZY
=k
Also, as 4ZHK and 4ZKX have bases along ZX and have the same height,
area of 4ZHK ZH
=
area of 4ZKX ZX
hZX
= , since ZH = hZX
ZX
=h
∴ area of 4ZHK = h × area of 4ZKX
∴ A=hk
Using equation 2 in part vii,
k
A= ×k
3k − 1
k2
=
3k − 1
Now, using long division, or the propFrac command of a CAS calculator, A can
be expressed as
1 1 1
A= k+ +
3 9 9(3k − 1)
1 1
Thus the graph of A against k has an asymptote with equation A = k + .
" # 3 9
1
In part vii it was established that k ∈ , 1 .
2
2 4
Using a calculator, the minimum is at k = and then A = which appears to be
! 3 9
2 4
,
3 9
1 k2
To check this algebraically, first note that for k > , 3k − 1 > 0, so A = is
3 3k − 1
always positive.

423
 !2
2
Also k− ≥0 A
3

∴
4 4
k2 − k + ≥ 0 ( 12 , 21 ) (1, 21 )
3 9
4 4
∴ k2 ≥ k −
3 9 1 1
A=3k+9
4 1
∴ k2 ≥ (3k − 1)
9 9
0 1
k2 k=3 k
Now A= and so
3k − 1
4
(3k − 1)
A≥ 9
3k − 1
4
∴ A≥
9

424
Solutions to Problem-solving and modelling investigations
1 a The centre of the circumcircle is the midpoint of the hypotenuse. The hypotenuse is
c
a diameter. The radius is where c is the length of the hypotenuse.
2
b

Let r be the radius of the incircle.

We use the equal tangents from a point to establish the values 4 − r and 3 − r on the
diagram. Then
4−r+3−r =5
∴r=1

c In this case
5 − r + 12 − r = 13
∴r=2

d In this case
24 − r + 7 − r = 25
∴r=3

e If the sides are {a, b, b + 1}we can construct as below:

a−r+b−r =b+1
a − 1 = 2r
a
r=
2
The three examples above fit this description.

425
2 a rA (t) = 3ti + 4t j
rB (t) = (10 + at)i + (4 + bt) j

b i If they collide rA (t) = rB (t) for some t ≥ 0. This implies:

10 + at = 3t . . . (1)
and
4 + bt = 4t . . . (2)
10
From (1) t =
3−a
4
From (2) t =
4−b
From this we can see that since t ≥ 0, a ≤ 3 and b ≤ 4. For collision:
10 4
=
3−a 4−b
⇒ 10(4 − b) = 4(3 − a)
⇒ 40 − 10b = 12 − 4a
28 + 4a
⇒b=
10
14 + 2a
=
5
ii We know to try values a ≤ 3 and b ≤ 4. You can use a spreadsheet to help get a
selection. For example :

 if a = −2 then b = 2 and the collision when t = 2.

The collision occurs at the point where r = 6i + 8 j
1
 if a = then b = 3 and the collision when t = 4.
2
The collision occurs at the point where r = 12i + 16 j

 if a = 7 then b = 0 and the collision when t = 1.

The collision occurs at the point where r = 3i + 4 j

c We can consider the cartesian equation of the straight lines of motion. Particle A:
4x
y=
3
bx 10b
Particle B: y = +4−
a a
They intersect when

426
 4x bx 10b
= +4−
3 a a
(4a − 3b)x 10b
=4−
a a
(4a − 3b)x = 4a − 10b
4a − 10b
x=
4a − 3b
The first restriction for paths meeting is that 4a , 3b. Check conditions for t ≥ 0

d The velocity vectors give the direction of motion. We require

(ai + b j) · (3i + 4 j) = 0
3a + 4b = 0
3a
b=−
4
For collision
14 + 2a
b=
5
3a 14 + 2a
Hence − =
4 5
−15a = 56 + 8a
23a = −56
56
a=−
23
42
and b =
23
26 78 92
Collision occurs when t = at the point with position vector i + j
25 25 25
e Relative velocity v = v A − v B
That is the relative velocity
v = 3i + 4 j − (ai + b j)
That is,
v = (3 − a)i + (4 − b) j
Consider relative velocities when the particles are going to collide for example.

427
3 a

−−→
You want the vector sum components of the vectors perpendicular to AB to be zero.
Therefore v sin α = w sin θ

b We can now avoid using α in our consideration of the problem.

Outward journey
−−→
Let v0x be the component of the planes ’steered velocity’ in the direction of AB and
−−→
v0y be the component perpendicular to AB . Let u1 be the actual outward speed of the
plane. Then
u1 = v0x + w cos θ, v2 = v0x 2 + v0y 2 , v0y = w sin θ
Hence
p
u1 = v0x + w cos θ = v2 − w2 sin2 θ + w cos θ
Back journey
−−→
Let v00x be the component of the planes ’steered velocity’ in the direction of BA and
−−→
v00y be the component perpendicular to BA . Let u2 be the actual return speed of the
plane. Then
u2 = v0x − w cos θ, v2 = v00x 2 + v00y 2 , v0y = w sin θ
Hence
p
u2 = v0x − w cos θ = v2 − w2 sin2 θ − w cos θ

i Hence
d d
+ = v0x + v00x
t1 t2
That is,
d(t1 + t2 )
= v0x + v00x
t1 t2
∴ d(t1 + t2 ) = 2vt1 t2 cos α

ii
d(t1 − t2 )
= v0x + v00x
t1 t2
∴ d(t2 − t1 ) = 2wt1 t2 cos θ

428
 Since
u1 u2 = v2 − w2 sin2 θ − w2 cos2 θ = v2 − w2
d2 = t1 t2 (v2 − w2 )

4 a i ? ? ? ? | ? ? ? ? ? |?

| ? ? ? ? ? ?| ? ? ? ?

||??????????
Note that the bars divide the stars into 3 cells. In the third example there are two
empty cells to the left of the symbol. We are looking at the way of dividing 10
stars into 3 cells. The stars are indistinguishable as are the bars. Hence there are
12!
2!10!
ways of organising them. In general this can be thought of at
n+k−1
Cn =n+k1 Ck−1
ways of organising n stars into k cells.
For 2 stars and 3 cells.

||?? (0, 0, 2)

|?|? (0, 1, 1)

?| | ? (1, 0, 1)

| ? ?| (0, 2, 0)

?| ? | (1, 1, 0)

??|| (2, 0, 0)

ii It is the number of ways that 10 stars and 2 bars can be arranged. There are:
12
C2 = 66 ways of distributing 10 chocolates among 3 children

iii
11
C3 = 165 ways of distributing 8 chocolates among 4 children

iv
n+k−1
Ck−1 ways of distributing n chocolates among k children

v The number of places is reduced

n−1
Ck−1 ways of distributing n chocolates among k children in this way

429
b There are 3 stars and 3 cells. Therefore there are
3+3−1
C3−1 =5 C2 = 10 ways
We can illustrate these as only ten:

◦ ◦ ◦| | (3, 0, 0)

|◦◦◦| (0, 3, 0)

| |◦◦ ◦ (0, 0, 3)

◦| ◦ | ◦ (1, 1, 1)

◦◦ |◦| (2, 1, 0)

◦ ◦ || ◦ (2, 0, 1)

| ◦ ◦| ◦ (0, 2, 1)

|◦|◦ ◦ (0, 1, 2)

◦| ◦ ◦| (1, 2, 0)

◦| | ◦ ◦ (1, 0, 2)

c This includes 0. We can apply the stars and bars mode. Here there are 10 stars and 4
cells (3 bars). Therefore
10
C3 = 120 ways
For example:
◦ ◦ | ◦ ◦ ◦ ◦| ◦ ◦ ◦ |◦
corresponds to the sum 2 + 4 + 3 + 1 = 10
| ◦ ◦| ◦ ◦ ◦ ◦ ◦ ◦ ◦ |◦
corresponds to the sum 0 + 2 + 7 + 1 = 10

d 36 ways . The numbers to work with are 1,3,5,7,9,11,13,15. We cannot use 0.

Systematic listing succeeds here, together with noticing that sums such as 1 + 3 + 13
can be arranged in 6 ways and sums such as 3 + 3 + 11 can be arranged in 6 ways

e You can consider sequences of the form RRDDRD . . . DR with m R’s and n D’s. The
total number will be m+n−1Cn−1 . Explore this further.

f These are left to the reader.

430
Solutions to degree of difficulty questions
−−→
Simple familiar questions 5 |OA|2 = 102 + 82 − 2 × 10 × 8 cos 120◦
1
1 a a + b = 5i + j = 164 + 160 ×
2
b a − b = i + 9j = 244
−−→ √ √
c 3a − 4b = 9i + 15 j − 8i + 16 j = i + 31 j ∴ |OA| = 244 = 2 61
Let ∠AOX = θ◦ and use the sine rule in
d a · a = 9 + 25 = 34 triangle OAX.√
8 2 61
√ =
e |a| = 34 sin θ◦ sin 120◦
8 sin 120◦
f a · b = 6 − 20 = −14 sin θ◦ = √
2 61
sin θ◦ = 0.4435 . . .
2 (2 + t)b + ta = (2 + s)a + (1 + 3s)b ∴ θ = 26.33 . . .◦
∴ t = 2 + s . . . (1) Bearing is 63.67
2 + t = 1 + 3s . . . (2)
Substitute from (1) in (2) 6 a

2 + 2 + s = 1 + 3s
3 = 2s
3 7
s = ,t =
2 2

√
3 | 3i − j| = 2
1 √ √ 3
(4i + 3 j) · ( 3i − j) = 2 3 − Draw line segment CE. Let
2 2
Therefore
√ resolute of 4i + 3 j parallel to ∠CEB = w◦ and ∠CED = x◦
3i − j is Then y = w + z
√ 3 √
( 3 − )( 3i − j) z = 60◦ (Angles subtended by the
4 √ same arc)
Resolute perpendicular to 3i − j is:
√ 3 √ w + x = 180 (CFBE is cyclic,
(4i + 3 j) − ( 3 − )( 3i − j) opposite angles are supplementary)
4
Hence x + y = w + z + w = 180 + 60 =
−−→ 240
4 a OA0 = 3i + 4 j + 5(i + j)
= 8i + 9 j
−−→
b OA0 = 3i + 4 j + t(i + j)
= (3 + t)i + (4 + t) j

431
 b 9 3! × 3! = 36 ways

11!
10 = 1 663 200 ways
2 × 2 × 3!

11 a 9C4 = 126 ways

b 8C3 = 56 ways

∠CBA = 50◦ c 9C4 −6 C4 = 111 ways

(alternate segment theorem)
∠CAD = 100◦ 12 a 15p2 − 19pq + 6q2 = 0
(angle at the the centre is twice angle (5p − 3q)(3p − 2q) = 0
subtended at circumference by the same arc) 5p = 3q or 3p = 2q
∠ACD = ∠ADC = 40 ◦ 3q 2q
p= or p =
5 3
(isosceles triangle) p and q are prime numbers.
∠BDC = 22 + 40 = 62◦ This implies q = 5, p = 3 or
q = 3, p = 2
∠BCD = 180 − (50 + 62) = 68◦
(angle sum of triangle) b 10p2 − 9pq + 2q2 = 0
∴ x = 68 − 40 = 28◦ (5p − 2q)(2p − q) = 0
5p = 2q or 2p = q
√
7 a |a| = 3 + 1 = 2 2q q
p= or p =
5 2
1 √ p and q are prime numbers.
b â = ( 3i + j)
2 This implies q = 2, p = 1 or
1 √ √ q = 5, p = 2
c 30 × ( 3i + j) = 15( 3i + j)
2
c 6p2 − 5pq + q2 = 0 This is

8 a 5! = 120 ways (3p − q)(2p − q) = 0

3p = q or 2p = q
5!
b = 60 ways q q
(5 − 2)! p = or p =
3 2
5! impossible. No such p and q exist.
c 5C 3 = = 10 ways
2!3!

432
Solutions to degree of difficulty questions
−−→ −−→
Complex familiar questions 4 OA = i + j and OB = 2i + j
−−→ −−→ −−→
OP = OA + tOB
1 −−→
OP = i + j + t(2i + j)
= (1 + 2t)i + (1 + t) j
−−→ −−→
a OP · AB = 0
−−→
AB = i.
4CAB ∼ 4CDE (AAA) −−→ −−→
2 OP · AB = 1 + 2t
AD = AC ∴ 1 + 2t = 0 → t = −
1
5 2
−−→ −−→ −−→
b |OP|2 = OP · OP
−−→
∴ |OP|2 = 1 + 4t + 4t2 + 1 + 2t + t2
= 2 + 6t + 5t2
−−→ −−→ −−→
AP = AO + OP
= −i − j + (1 + 2t)i + (! + t) j
= 2ti + ti
−−→ −−→ −−→
|AP|2 = AP · AP
4CXB ∼ 4CY E (AAA) = 4t2 + t2 = 5t2
EY EC CD 3
= = = Now,
BX CB CA 5 −−→ −−→
6 |OP| = |AP|
∴ area of 4ADE = area of 4ABC
25 ⇒ 2 + 6t + 5t2 = 5t2
2 + 6t = 0
1
a+b 2a t=−
2 = 3
b a+b
⇒a +b =0
2 2
5
But b , 0, a , −b. ∴ a2 + b2 > 0.

Quadrilateral ABCD is cyclic.

∠ABC + ∠CDA = 180◦ (Opposite angles
in a cyclic quadrilateral)
4APO = 4ABM (AAA) 62◦ + 28◦ = 90◦
∴
AP
=
AO ∴ ∠ABD + ∠CDB = 90◦
AB AM Hence Arc lengthAB + Arc lengthCD
∴ AP × AM = AB × AO

433
 = Arc lengthBC + Arc lengthAD
Arc length = rθ where θ is the angle
subtended by the arc at the centre.
6
Let the circle with centre F have radius
x.
In 4CED, CD = 5, CE = 3 and thus
by Pythagoras’ theorem ED = 4
MN = MF + FN = ED = 4
In 4CMF, MF 2 = CF 2 − CM 2 =
(4 + x)2 − (4 − x)2 (Pythagoras’ theorem)
In 4DNF, NF 2 = DF 2 − CM 2 =
(1 + x)2 − (1 − x)2 (Pythagoras’ theorem)
Therefore:
p (4 + x) − (4 − x) +
p
2 2
(1 + x)2 − (1 − x)2 = 4
√ √
4 x+2 x=4
4 3!
x=
9
7 a The number can start with a 4
or 3 (We rule out 30 000 as the
requirement is greater than 30 000)
If it starts with a 4, the last place can
be filled in 3 ways (0,2 or 4) and
the middle digits can be chosen in
5 × 5 × 5 = 125 ways.
Therefore 125 × 3 = 375
If it starts with a 3, the last place can
be filled in 3 ways (0,2 or 4) and
the middle digits can be chosen in
5 × 5 × 5× = 125 ways.
Therefore 125 × 3 = 375
Therefore 750 − 1 = 749 ways of
obtaining a 5 digit number greater
than 30 000.
b If it starts with a 3, the last place
can be chosen in 3 ways (0,2,4), the
second place in 3, the second in 2,
and the third in 1. Therefore total
number of ways starting with a 3
=18.
If it starts with a 4, the last place can
be chosen in 2 ways, the second place
in 3, the second in 2, and the third in
1. Therefore total number of ways
starting with a 4 =12.
The total number of ways is 30.
8 a There are 9 letters with 3 A’s.
9!
The number of ways = = 60480
3!
b There are 4 consonants. The first
place can be chosen in 4 ways and the
last in 3. The remaining 7 places can
7!
be chosen in ways.
Therefore number of ways with
consonants in the first and last place
7!
=4×3× = 10 080
3!
c There are 5 vowels and 4 consonants.
The vowels are a group. The number
5!
of ways they can be arranged = .
3!
Finally there are 5 things to arrange,
the four consonants and the group of
vowels. There are 5! ways of doing
this.
434
 Therefore total number of ways c Assume a − b = 2n for some positive
5! integer n. Then all of its factors are
= × 5! = 2400
3! powers of 2.
But a and b are odd. Therefore 1 is
9 The product of the two digits is another the highest common factor of a and b.
digit.
Possibilities
1 1
11 a i S1 = 2
=
 2×3=6 4·1 −1 3
1 1
 2×2=4 ii S 2 = +
4 · 12 − 1 4 · 22 − 1
1 1
 3×3=9 = +
3 15
2
 4×2=8 =
5
There are no other non-zero digit 1
combinations possible. With these iii S 3 = S 2 +
4 · 32 − 1
digits: 2 1
= +
(2,3,6) and and there are 6 arrangements 5 35
of these 3 digits. 3
=
(2,2,4) and and there are 3 arrangements 7
of these 3 digits. n
b Sn =
(3,3,9) and and there are 3 arrangements 2n + 1
of these 3 digits.
c Prove by mathematical induction.
(4,2,8) and and there are 6 arrangements 1 1
of these 3 digits. S1 = =
2+1 3
Hence there are 18 ways. Therefore true for n = 1.
If you count 0 there are another 8,
200, 300, . . . 900

10 a There exist integers k1 and k2 such

that a = k1 d and b = k2 d

a − b = k1 d − k2 d = (k1 − k2 )d

Therefore d is a factor of a − b

b 1 000 001 − 999 999 = 2

but 1 000 001 and 999 999 are odd.
Therefore 1 is the highest common
factor.

435
 Assume true for n = k. That is The result holds for k + 1 and there-
1 1 k fore by the principle of mathematical
Sk = + · · · + =
4 · 12 − 1 4 · k2 − 1 2k + 1 induction it holds for all integers
1
S k+1 = S k + n ≥ 1.
4(k + 1)2 − 1
k 1
= +
2k + 1 4(k + 1)2 − 1
k 1
= +
2k + 1 (2k + 1)(2k + 3)
!
1 1
= k+
2k + 1 2k + 3
2k + 3k + 1
2
!
1
=
2k + 1 2k + 3
(2k + 1)(k + 1)
=
(2k + 1)(2k + 3)
k+1
=
2k + 3

436
Solutions to degree of difficulty questions
√
Complex unfamiliar questions 9 3
Area of triangle AMN =
32
1 Therefore area of quadrilateral
√ √
√ 9 3 3
AMNP = 3 − −
√ 32 8
19 3
=
32
Therefore required ratio 19 : 32

3 The real line is rollled onto. a

4ABE ∼ 4ADB circle with circumference one.
AB AD There are 100 arcs of equal length,
=
AE AB with marks in cyclic order at 0,
AB = AE × AD
2 0.01,0.02,. . . 0.98, 0.99. The arcs are
[0, 0.01], [0.01, 0.02], . . . [0.99, 0].
= AE × (AE + ED)
All integers will coincide with 0 on
∴ AB2 = AE 2 + AE × ED the circle. If at least one multiple
∴ AB − AE = AE × ED
2 2 kx, 1 ≤ k ≤ 99 lies on one of the arcs
Also [0.99, 0], or[0, 0.1 we are finished.
AE × ED = BE × EC (Power of a point) If this is not the case. That is if none of
the multiples kx, 1 ≤ k ≤ 99 lies on one
Hence
of the two arcs [0.99, 0], or[0, 0.1
AB2 − AE 2 = BE × CE Then we have 99 pigeons, the
numbers x, 2x, . . . 99x and 98 pi-
2 geon holes, the arcs on the circle
[0.01, 0.02], [0.02, 0.03], . . . [0.98, 0.99]
Therefore at least two of the multiples
lie on the same arc. We now note" If k1 x
and k2 x lie in the same arc of length 0.01
with k1 > k2 . Then (k1 − k2 )x is one of
the given 99 multiples and it must lie on
one of the arcs [0.99, 0], or[0, 0.1 which
Let AB = BC = 2
1 contradicts our assumption that none
Then MB = 1, BN = , MN =
√ 2 √ of the multiples lie on one of these two
3 3 3 3 3 arcs.
NC = , PC = , PN =
2 2 4 4
√ ABC =
Area of triangle
−−→ −−→ −−→
1 3 √ 4 a i OP = OA + t AB = a + t(b − a)
×2×2× = 3
2 2 √
Area of triangle AMN =
3 ii a = i + j, b = 4i − 2 j
8

437
 −−→
OP = a + t(b − a)  3N’s, 1E
= i + j + t(3i − 3 j)  3E’s, 1N
= (3t + 1)i + (−3t + 1) j
−−→ √ We now look at the number of ways
OA = 2
−−→ √ 2 of choosing each of these.
OP = 18t + 2
−−→ −−→
OP · OA =√2 √  There are 8C4 = 70 ways of
∴ 2 = 2 × 18t2 + 2 cos 60◦ choosing where to put the 4 easts.
√ √
2 2 = 18t2 + 2
 There are 8C4 = 70 ways of
8 = 18t + 2
2
choosing where to put the 4 norths.
3t2 − 1 = 0
 There are 8C2 ×6 C2 × 6 = 2520
1
t=±√ ways of choosing where to put the
3 2 N’s and 2S’s with the easts and
b wests go in the remaining places.
(4C2 = 6 ways of choosing where
−−−→ √ √ to put the easts).
OP1 = ( 3 + 1)i + (− 3 + 1) j
−−−→ √ √  There are 8C3 ×5 C3 × 2 = 1120
OP2 = (− 3 + 1)i + ( 3 + 1) j
ways of choosing where to put the
−−−→ −−−→
OP1 · OP2 = (−3 + 1) + (−3 + 1) 3 N’s and 3S’s with the east and
= −4 west to go in the remaining place.

 There are 8C3 ×5 C3 × 2 = 1120

5 a You must have an even number of
’norths’ and ’souths’ and an even
number of ’easts’ and ’wests’
Examples are: NNNNSSSS,
EEEEWWWW, NNSSEEWW,
NNEESSWW. In summary of
possibilities only considering easts
and norths. In the below we only
list ’norths’ and ’easts’ for a total
of 4. The other 4 must be matching
’souths’ and ’easts’.)
 4E’s , 0N’s
 4N’s, 0E’s
 2N’s, 2E’s
ways of choosing where to put the
3 E’s and 3W’s with the north and
south to go in the remaining place.
Therefore total number of ways is
70 + 70 + 2520 + 1120 + 1120 = 4900
b The ways to get to P can be
summarised as:
 4N 1S 2E 1W
 3N 3E 2W
 5N 2S 1E
The number of ways for each in
order.

438
  8C 4 ×4 C1 ×3 C2 = 840 That is

 8C 3 ×5 C3 × 1 = 560 1 4 9
+ + ≥ 12
x y z
 8C 5 ×3 C2 × 1 = 168

Total number of ways= (n + 1)! + n! n!(n + 2)

7 =
840 + 560 + 168 = 1568 n! + (n − 1)! (n − 1)!(n + 1)
n(n + 2)
c It is impossible. It will take an odd =
(n + 1)
number of steps.

8 a To show k × (nCk ) = n × (n−1Ck−1 )

6 a n!
(a + b) 2
a 2
b 2 k × ( n
C k ) = k ×
≤ + (n − k)!k!
x+y x y
n!
a2 b2 (a + b)2 =
⇔0≤ + − (n − k)!(k − 1)!
x y x+y
(n − 1)!
⇔ 0 ≤ a2 yx + a2 y2 + b2 x2 + b2 yx − (a2 + 2ab + b2 )xy =n×
(n − k)!(k − 1)!
⇔ 0 ≤ a2 y2 − 2abxy + b2 x2
= n × (n−1Ck−1 )
⇔ 0 ≤ (ay − bx)2
(a + b)2 a2 b2 b nC0 +n C1 +n C2 + · · · +n Cn−1 +n Cn =
Hence ≤ +
x+y x y 2n
∴ nn−1C0 + nn−1C1 + nn−1C2 + · · · nn−1Cn−1 +
(a + b + c) 2
a 2
b 2
b 2
nn−1Cn = n · 2n−1
b To prove ≤ + +
x+y+z x y z Using part a
We know from a
0nC0 + (1nC1 + 2nC2 + · · · n − 1nCn−1 + nnCn ) =
(a + (b + c))2 a2 (b + c)2
≤ + n · 2n−1
x + (y + z) x y+z
but √
1
(b + c)2 b2 c2 9 For n = 1, √ ≥ 1 is true.
≤ + 1
y+z y z Assume true for n = k
1 1 1 √
Therefore √ + √ + ··· √ ≥ k
(a + b + c)2 a2 b2 c2 1 2 k
≤ + + Then,
√
x+y+z x y z 1 1 1 1 1
√ + √ + ··· √ + √ ≥ k+ √
c Suppose x + y + z = 3 and take 1 2 k k+1 k+1
√
a = 1, b = 2 and c = 3. ≥ k+1
The last inequality holds since
(a + b + c)2 a2 b2 c2 √ 1 √
≤ + + k+ √ ≥ k+1
x+y+z x y z
k+1
becomes √ √
⇔ k k+1+1≥k+1
(1 + 2 + 3)2 1 4 9 √ √
≤ + + ⇔ k k+1≥k
3 x y z

439
10 Some observations:
n2 ≥ 2n for n ≥ 2
n(n + 1) ≥ 2n + 1 for n ≥ 2
32 > 23
Then 3 + 3 + 3 + 3 + 3 + 3 + 2 = 20
Product is 2 × 36
How to check
Suppose 8 + 9 + 3: Product is 216
Split the 8 since n2 ≥ 2n The new
sum= 4 + 4 + 9 + 3 = 20
Instead of 9 write 4+ 5
4 + 4 + 4 + 5 + 3 = 20
The product increases
Split again in the same way to increase
the product.
2 + 2 + 2 + 2 + 2 + 2 + 2 + 3 = 20
We can do better with powers of 3
440