Markscheme MHL

1.
(a)
(b)
(i)
P(A B) = P(A) + P(B) = 0.7
(ii)
P(A B) = P(A) + P(B) P(A B)

= P(A) + P(B) P(A)P(B)
= 0.3 + 0.4 0.12 = 0.58
P(A B) = P(A) + P(B) P(A B)

= 0.3 + 0.4 0.6 = 0.1
P( A B )
P(AB) =
P( B )
=
0 .1
= 0.25
0.4
A1
(M1)
(M1)
A1
A1
(M1)
A1
[7]
2.
METHOD 1
z = (2 i)(z + 2)
= 2z + 4 iz 2i
z(1 i) = 4 + 2i
4 + 2i
z=
1 i
4 + 2i 1 + i
z=
1 i
1+ i
=3i
M1
A1
M1
A1
METHOD 2
let z = a + ib
a + ib
=2i
a + ib + 2
a + ib = (2 i)((a + 2) + ib)
a + ib = 2(a + 2) + 2bi i(a + 2) + b
a + ib = 2a + b + 4 + (2b a 2)i
attempt to equate real and imaginary parts
a = 2a + b + 4( a + b + 4 = 0)
and b = 2b a 2( a + b 2 = 0)
M1
M1
A1
Note: Award A1 for two correct equations.

b = 1;a = 3
z=3i
A1
[4]
IB Questionbank Mathematics Higher Level 3rd edition
3.
(a)
(b)
u1 = 27
81 27
=
2 1 r
1
r=
3
v2 = 9
v4 = 1
2d = 8 d = 4
v1 = 13
N
(2 13 4(N 1)) > 0 (accept equality)
2
N
(30 4N) > 0
2
N(15 2N) > 0
N < 7.5
N=7
M1
A1
(A1)
(A1)
M1
(M1)
A1
Note: 13 + 9 + 5 + 1 3 7 11 > 0 N = 7 or equivalent

receives full marks.
[7]
4.
(a)
(b)
AB = b a
A1
CB = a + b
A1
AB CB = (b a)(b + a)
= b2a2
= 0 since b=a
M1
A1
R1
Note: Only award the A1 and R1 if working indicates that they

understand that they are working with vectors.
C is a right angle
so AB is perpendicular to CB i.e. AB
AG
[5]
5.
(a)
sin 2
2 sin cos
=
1 + cos 2 1 + 2 cos 2 1
M1
Note: Award M1 for use of double angle formulae.

=
2 sin cos
2 cos 2
sin
=
cos
= tan
(b)
tan
=
8
sin
A1
AG
1 + cos
4
cot =
8
sin
4
2
1+
2
=
2
2
=1+ 2
(M1)
1 + cos
M1
A1
[5]
6.
R is rabbit with the disease

P is rabbit testing positive for the disease
P(P) = P(R P) + P(R P)

= 0.01 0.99 + 0.99 0.001
= 0.01089 (= 0.0109)
(a)
M1
A1
Note: Award M1 for a correct tree diagram with correct probability values shown.
0.001 0.99
0.00099
=
0.001 0.99 + 0.01 0.99 0.01089

0.00099 0.001
<
= 10 % (or other valid argument)
0.01089 0.01
(b)
P(R|P) =
M1A1
R1
[5]
7.
METHOD 1
arctan xdx
A1
attempting to integrate by parts

3
1
= [ x arctan x] 0 3
x
dx
0
1+ x 2
M1
area =
= [ x arctan x] 0 3 ln(1 + x 2 )
2
A1A1
3
A1
Note: Award A1 even if limits are absent.

=
1
ln 4
2
A1
=
ln 2
METHOD 2
area =
3
0
tan ydy
M1A1A1
3
+ [ln cos y ] 03
3
3
1 3
=
+ ln =
ln 2
3
2
3
M1A1
A1
[6]
8.
(a)
(i)
(g f)(x) =
1
3
, x (or equivalent)
2x + 3
2
A1
(ii)
(f g)(x) =
2
+ 3, x 0 (or equivalent)
x
A1
(b)
EITHER
f(x) = (g1 f g)(x) (g f)(x) = (f g)(x)
1
2
= +3
2x + 3 x
(M1)
A1
OR
(g1 f g)(x) =
2x + 3 =
1
2
+3
x
1
2
+3
x
A1
M1
THEN
6x2 + 12x + 6 = 0 (or equivalent)
x = 1, y = 1 (coordinates are (1, 1))
A1
A1
[6]
9.
Attempt at implicit differentiation

dy
dy
+ y
e(x+y) 1 + = sin( xy ) x
d
x
d
x
let x = 0, y = 0
dy
e0 1 + = 0
dx
dy
= 1
dx
let x = 2 , y = 2
dy
dy
+ y = 0
e0 1 + = sin( 2 ) x
dx
dx
dy
so
= 1
dx
since both points lie on the line y = x this is a common tangent
M1
A1A1
M1
A1
A1
R1
Note: y = x must be seen for the final R1. It is not sufficient to note
that the gradients are equal.
[7]
10.
(a)
f (x a) b
x 0 and x 2a (or equivalent)
(b)
vertical asymptotes x = 0, x = 2a
horizontal asymptote y = 0
(M1)
A1
A1
A1
Note: Equations must be seen to award these marks.
maximum a,
b
A1A1
Note: Award A1 for correct x-coordinate and A1 for correct y-coordinate.

one branch correct shape
other 2 branches correct shape
A1
A1
[8]
11.
(a)
4
4

AB = 1 , AC = 3
3
1

A1A1
Note: Accept row vectors.
(b)
i
j k 8

AB AC = 4 1 3 = 16
4 3 1 16
1
1 1 1

normal n = 2 so r 2 = 2 2
2
2 1 2

x + 2y + 2z = 7
M1A1
(M1)
A1
Note: If attempt to solve by a system of equations:

Award A1 for 3 correct equations, A1 for eliminating a variable
and A2 for the correct answer.
(c)
5
1

r = 3 + 2 (or equivalent)
7
2

A1
1(5 + ) + 2(3 + 2) + 2(7 + 2) = 7

9 = 18
= 2
M1
A1
8
1
Note: = if 16 is used.
4
16
distance = 2 12 + 2 2 + 2 2
=6
(d)
(i)
(ii)
(M1)
A1
1
1 2
AB AC =
8 + 16 2 + 16 2
2
2
1
576 )
= 12 (accept
2
area =
(M1)
A1
EITHER
1
area height
3
1
=
12 6 = 24
3
volume =
(M1)
A1
OR
volume =
1
AD (AB AC)
6
= 24
(e)
M1
A1
AB AC = 8 2 + 16 2 + 16 2
i
j k
AC AD = 4 3 1
4 1 6
M1
= 19i 20j + 16k
A1
EITHER
1
1 2
19 2 + 20 2 + 16 2 >
8 + 16 2 + 16 2
2
2
therefore since area of ACD bigger than area ABC implies that
B is closer to opposite face than D
M1
R1
OR
correct calculation of second distance as
144
19 2 + 20 2 + 16 2
which is smaller than 6
A1
R1
Note: Only award final R1 in each case if the calculations are correct.
[19]
1
ln x
f(x) = x 2
x
1 ln x
=
x2
so f(x) = 0 when ln x = 1, i.e. x = e
x
12.
(a)
(i)
(ii)
f(x) > 0 when x < e and f(x) < 0 when x > e

hence local maximum
M1A1
A1
R1
AG
Note: Accept argument using correct second derivative.
(iii)
1
e
A1
1
(1 ln x)2 x
x
f(x) =
x4
x 2 x + 2 x ln x
=
x4
3 + 2 ln x
=
x3
x2
(b)
M1
A1
Note: May be seen in part (a).

f(x) = 0
3 + 2 ln x = 0
x=
M1
3
e2
3
e2
since f(x) < 0 when x <

and f(x) > 0 when x >
3
3
then point of inflexion e 2 , 3
2e 2
3
e2
R1
A1
(c)
A1A1A1
Note: Award A1 for the maximum and intercept, A1 for a vertical
asymptote and A1 for shape (including turning concave up).
(d)
(i)
A1A1
Note: Award A1 for each correct branch.
(ii)
all real values
A1
(iii)
(M1)(A1)
Note: Award (M1)(A1) for sketching the graph of h, ignoring
any graph of g.
e2 < x < 1 (accept x < 1)
A1
[19]
13.
(a)
(cos + i sin )3 = cos3 + 3cos2 (i sin ) + 3 cos (isin )2 + (isin )3 (M1)

= cos3 3 cos sin2 + i(3 cos2 sin sin3 )
A1
10
(b)
from De Moivres theorem

(cos + i sin )3 = cos 3 + i sin 3
cos 3 + i sin 3 = (cos3 3 cos sin2 ) + i(3 cos2 sin sin3 )
equating real parts
cos 3 = cos3 3 cos sin2
= cos3 3 cos (1 cos2 )
= cos3 3 cos + 3 cos3
= 4 cos3 3 cos
(M1)
M1
A1
AG
Note: Do not award marks if part (a) is not used.
(c)
(cos + i sin )5 =
cos5 + 5 cos4 (i sin ) + 10 cos3 (i sin )2 + 10 cos2 (i sin )3
+ 5cos (i sin )4 + (i sin )5
from De Moivres theorem
cos 5 = cos5 10 cos3 sin2 + 5 cos sin4
= cos5 10 cos3 (1 cos2 ) + 5cos (1 cos2 )2
= cos5 10 cos3 + 10 cos5 + 5 cos 10 cos3 + 5 cos5
cos 5 = 16 cos5 20 cos3 + 5 cos
(A1)
M1
A1
AG
Note: If compound angles used in (b) and (c), then marks can be
allocated in (c) only.
(d)
cos 5 + cos 3 + cos

= (16 cos5 20 cos3 + 5 cos ) + (4 cos3 3 cos ) + cos = 0
16 cos5 16 cos3 + 3 cos = 0
cos (16 cos4 16 cos2 + 3) = 0
cos (4 cos2 3)(4 cos2 1) = 0
3
1
cos = 0;
;
2
2
= ; ;
6
3
2
M1
A1
A1
A1
A2
11
(e)
cos 5 = 0
3 5 7
5 = ... ; ; ; ; ...
2 2 2 2
= ...
(M1)
3 5 7
; ; ; ; ...
10 10 10 10
(M1)
Note: These marks can be awarded for verifications later in the question.
now consider 16 cos5 20 cos3 + 5 cos = 0
cos (16 cos4 20 cos2 + 5) = 0
cos2 =
20 400 4(16)(5)
cos =
32
M1
; cos = 0
A1
20 400 4(16)(5)
32
20 + 400 4(16)(5)
since max value of cosine angle

=
10
32
closest to zero
cos
4.5 + 4 25 4(5)
cos
=
10
cos
7
5 5
=
10
8
4.8
5+ 5
8
R1
A1
A1A1
[22]
14.
(a)
METHOD 1
f(x) = q 2x = 0
f(3) = q 6 = 0
q=6
f(3) = p + 18 9 = 5
p = 4
M1
A1
M1
A1
METHOD 2
(b)
f(x) = (x 3)2 + 5
= x2 + 6x 4
q = 6, p = 4
M1A1
g(x) = 4 + 6(x 3) (x 3)2 (= 31 + 12x x2)
M1A1
A1A1
Note: Accept any alternative form that is correct.

Award M1A0 for a substitution of (x + 3).
[6]
15.
(a)
2
2a
A2 =
a 2a + 1
(M1)A1
12
(b)
METHOD 1
det A2 = 4a2 + 2a 2a = 4a2
a = 2
M1
A1A1
N2
METHOD 2
det A = 2a
det A = 4
a = 2
M1
A1A1
N2
[5]
16.
(a)
A1
Note: Award A1 for intercepts of 0 and 2 and a concave down curve
in the given domain
Note: Award A0 if the cubic graph is extended outside the domain [0, 2].
13
(b)
kx( x + 1)(2 x)dx = 1

0
(M1)
Note: The correct limits and = 1 must be seen but may be seen later.
( x
0
+ x 2 + 2 x)dx = 1
A1
1
1
k x 4 + x 3 + x 2 = 1
3
4
0
8
k 4 + + 4 = 1
3
8
k=
3
M1
(A1)
A1
[6]
17.
(a)
AB =
=
12 + ( 2 3 ) 2
M1
88 4 3
A1
= 2 2 3
(b)
A1
METHOD 1
arg z 1 =
, arg z 2 =
4
3
A1A1
and .
4
3
Note: Allow
Note: Allow degrees at this stage.
3 4
(accept )
=
12
12
B=
AO
A1
Note: Allow FT for final A1.

METHOD 2
attempt to use scalar product or cosine rule
B = 1+ 3
cos AO
2 2
B=
AO
12
M1
A1
A1
[6]
18.
(a)
14
A3
Note: Award A1 for each correct branch with position of asymptotes
clearly indicated. If x = 2 is not indicated, only penalise once.
(b)
A3
Note: Award A1 for behaviour at x = 0, A1 for intercept at x = 2,
A1 for behaviour for large x.
[6]
19.
(a)
CB = b c, AC = b + c
A1A1
Note: Condone absence of vector notation in (a).
15
(b)
AC CB = (b + c) (b c)
= b2 c2
= 0 since b=c
M1
A1
R1
Note: Only award the A1 and R1 if working indicates that they understand
that they are working with vectors.
B is a right angle
so AC is perpendicular to CB i.e. AC
AG
[5]
20.
(a)
area of AOP =
(b)
TP = r tan
1 2
r sin
2
A1
(M1)
1
r(r tan )
2
1
= r2 tan
2
area of POT =
(c)
1 2
r
2
area of triangle OAP < area of sector OAP < area of triangle POT
1 2
1
1
r sin < r 2 < r 2 tan
2
2
2
sin < < tan
area of sector OAP =
A1
A1
R1
AG
[5]
16
21.
x = 2ey
M1
ey
Note: The M1 is for switching the variables and may be awarded at any
stage in the process and is awarded independently. Further marks
do not rely on this mark being gained.
xey = 2e2y 1
2e2y xey 1 = 0
x x +8
4
x x2 +8
y = ln
x + x2 +8
therefore h1(x) = ln
since ln is undefined for the second solution

ey =
A1
M1A1
A1
R1
x + x2 +8
.
Note: Accept y = ln
Note: The R1 may be gained by an appropriate comment earlier.

[6]
17
22.
(a)
METHOD 1
8 4 3 2 11 10 9 8 7
P(3 defective in first 8) =
3 15 14 13 12 11 10 9 8
M1A1A1
Note: Award M1 for multiplication of probabilities with decreasing

denominators.
Award A1 for multiplication of correct eight probabilities.
8
Award A1 for multiplying by .
3
=
56
195
A1
METHOD 2
4 11

3 5
P(3 defective DVD players from 8) =
15

8
M1A1
Note: Award M1 for an expression of this form containing three combinations.
4! 11!
3
!
1
!
5!6!
=
15!
8!7!
56
=
195
(b)
M1
A1
P(9th selected is 4th defective player3 defective in first 8) =
56 1
195 7
8
=
195
P(9th selected is 4th defective player) =
1
7
(A1)
M1
A1
[7]
18
23.
(a)
let the first three terms of the geometric sequence be given by u1, u1 r, u1r2
u1 = a + 2d, u1r = a + 3d and u1r2 = a + 6d

a + 6d a + 3d
=
a + 3d a + 2d
a2 + 8ad + 12d2 = a2 + 6ad + 9d2
2a + 3d = 0
3
a= d
2
(b)
u1 =
(M1)
A1
A1
AG
d
3d
9d
, u1 r =
, u1 r 2 =
2
2
2
M1
r=3
A1
27d
geometric 4th term u1r3 =
2
A1
3
d + 15d
2
27d
=
2
arithmetic 16th term a + 15d =
M1
A1
Note: Accept alternative methods.

[8]
24.
(a)
dy
1
= 2x x 3
dx
2
1
x 2 x 2 = 0
2
x = 0, 2
dy
25 25
9
= 0 at 0, , 2, , 2,
dx
8 8
8
A1
A1A1A1
Note: Award A2 for all three x-values correct with errors/omissions in y-values.
19
(b)
at x = 1, gradient of tangent =
3
2
(A1)
Note: In the following, allow FT on incorrect gradient.

equation of tangent is y 2 =
meets x-axis when y = 0, 2 =
x=
3
3
1
(x 1) y = x +
2
2
2
3
(x 1)
2
(M1)
1
3
1
coordinates of T are , 0
3
(c)
(A1)
gradient of normal =
2
3
equation of normal is y 2 =
at x = 0, y =
A1
(A1)
2
2
8
( x 1) y = x +
3
3
3
8
3
(M1)
A1
Note: In the following, allow FT on incorrect coordinates of T and N.
13
52
, PT =
9
9
1
13
52
area of triangle PTN =

2
9
9
13
=
(or equivalent e.g.
9
lengths of PN =
A1A1
M1
676
)
18
A1
[15]
25.
(a)
using the factor theorem z + 1 is a factor

z3 + 1 = (z + 1)(z2 z + 1)
(M1)
A1
20
(b)
(i)
METHOD 1
z3 = 1 z3 + 1 = (z + 1)(z2 z + 1) = 0
solving z2 z + 1 = 0
1 1 4 1 i 3
z=
=
2
2
therefore one cube root of 1 is
(M1)
M1
A1
AG
METHOD 2
2
1+ i 3
= 1+ i 3
=
2
2
1+ i 3 1+ i 3 1 3
3 =
=
2
2
4
= 1
2
M1A1
A1
AG
METHOD 3
i
1+ i 3
=e 3
2
3
i
=e 1
(ii)
A1
A1
METHOD 1
as is a root of z2 z + 1 = 0 then 2 + 1 = 0
2 = 1
M1R1
AG
Note: Award M1 for the use of z2 z + 1 = 0 in any way.

Award R1 for a correct reasoned approach.
METHOD 2
1+ i 3
2
1+ i 3
1+ i 3
1=
1 =
2
2
2 =
M1
A1
21
(iii)
METHOD 1
(1 )6 = (2)6
= ()12
= (3)4
= (1)4
=1
(M1)
A1
(M1)
A1
METHOD 2
(1 )6
= 1 6 + 152 203 + 154 65 + 6
M1A1
Note: Award M1 for attempt at binomial expansion.

use of any previous result e.g. = 1 6 + 15 2 + 20 15 + 6 2 + 1M1
=1
A1
Note: As the question uses the word hence, other methods that
do not use previous results are awarded no marks.
(c)
METHOD 1
2
A =
0
1
1
0

2
1
1 =

0
A1
1
2
1
2
+1 + 1
A2 A + I =
1 1
0
+1
from part (b)

2 + 1 = 0
1
1
+ 1 = ( 2 + 1) = 0
1 1
1
+ + 1 = 2 ( 2 + 1) = 0
2
M1
A1
A1
hence A2 A + I = 0
AG
METHOD 2
1+ i 3
2
A2 =
1 i 3
A1A1A1
Note: Award 1 mark for each of the non-zero elements expressed in this form.
verifying A2 A + I = 0
(d)
(i)
A2 = A I
22
A3 = A2 A
=AIA
= I
M1A1
A1
AG
Note: Allow other valid methods.
(ii)
I = A A2
A1 = A1A A1A2
A1 = I A
M1A1
AG
Note: Allow other valid methods.

[20]
26.
(a)
(i)
A2
Note: Award A1 for correct sin x, A1 for correct sin 2x.
Note: Award A1A0 for two correct shapes with
and/or 1 missing.
2
Note: Condone graph outside the domain.
(ii)
2
2 sin x cos x sin x = 0
sin x (2 cos x 1) = 0
x = 0,
3
sin 2x = sin x, 0 x
M1
A1A1 N1N1
23
(iii)
area =
3
0
(sin2 x sinx) dx
M1
Note: Award M1 for an integral that contains limits, not necessarily

correct, with sin x and sin 2x subtracted in either order.
=
=
=
=
(b)
1
3
2 cos 2 x + cos x
0
2
1
1
+ cos cos 0 + cos 0

cos
3
3 2
2
3 1
4 2
1
4
x
dx =
4 x
6
0
4 sin 2
4 4 sin 2
8 sin cos d
A1
(M1)
A1
M1A1A1
Note: Award M1 for substitution and reasonable attempt at finding

expression for dx in terms of d, first A1 for correct limits,
second A1 for correct substitution for dx.
6 8 sin 2 d
0
6 4 4 cos 2
0
A1
M1
= [4 2 sin 2 ]06
2
2 sin 0
=
3
3
2
3
=
3
A1
(M1)
A1
24
(c)
(i)
M1
from the diagram above
a
f ( x)dx = ab
= ab f ( x)dx
the shaded area =
( y )dy
R1
AG
(ii)
x
f1(x) = 4 sin x
4
x
arcsin dx = 6 4 sin xdx
0
3 0
4
f(x) = arcsin
Note: Award A1 for the limit
A1
M1A1A1
seen anywhere, A1 for all else correct.

6
[ 4 cos x ]06
3
= 4+2 3
3
=
A1
A1
Note: Award no marks for methods using integration by parts.

[25]
27.
(a)
(i)
median = 104 grams
A1
Note: Accept 105.
(ii)
30th percentile = 90 grams
A1
25
(b)
80 49
= 31
(M1)
A1
Note: Accept answers 30 to 32.

[4]
28.
(a)
f (x) = 3x2 6x 9 (= 0)
(x + 1)(x 3) = 0
x = 1; x = 3
(max)(1, 15); (min)(3, 17)
(M1)
A1A1
Note: The coordinates need not be explicitly stated but the values
need to be seen.
y = 8x + 7
(b)
f(x) = 6x 6 = 0 inflexion (1, 1)

which lies on y = 8x + 7
A1
N2
A1
R1AG
[6]
29.
METHOD 1
sin C sin 40
=
7
5
BCD = 64.14...
CD = 2 5cos 64.14...
M1(A1)
A1
M1
Note: A1so allow use of sine or cosine rule.

CD = 4.36
A1
METHOD 2
let AC = x
cosine rule
52 = 72 + x2 2 7 x cos 40
x2 10.7... x + 24 = 0
x=
10.7... (10.7...) 2 4 24
2
x = 7.54; 3.18
CD is the difference in these two values = 4.36
M1A1
(M1)
(A1)
A1
Note: Other methods may be seen.

[5]
26
30.
(a)
(b)
f(a) = 4a3 + 2a2 7a = 10

4a3 + 2a2 7a + 10 = 0
(a + 2) (4a2 6a + 5) = 0 or sketch or GDC
a = 2
substituting a = 2 into f(x)
f(x) = 4x3 4x + 14 = 0
M1
(M1)
A1
A1
EITHER
graph showing unique solution which is indicated (must include
max and min)
R1
OR
convincing argument that only one of the solutions is
real (1.74, 0.8681.12i)
R1
[5]
31.
(a)
2x2 + x 3 = (2x + 3)(x 1)
A1
Note: Accept 2 x + (x 1).

2
Note: Either of these may be seen in (b) and if so A1 should be awarded.

(b)
EITHER
(2x2 + x 3)8 = (2x + 3)8(x 1)8
= (38 + 8(37)(2x) + ...)((1)8 + 8(1)7(x) + ...)
coefficient of x = 38 8 (1)7 + 37 8 2 (1)8
= 17 496
M1
(A1)
M1
A1
Note: Under FT, final A1 can only be achieved for an integer answer.
OR
(2x2 + x 3)8 = (3 (x 2x2))8
= 38 + 8((x 2x2)(37) + ...)
coefficient of x = 8 ( 1) 37
= 17 496
M1
(A1)
M1
A1
Note: Under FT, final A1 can only be achieved for an integer answer.
[5]
27
32.
4.5
= 2 arcsin
( = 1.396... = 80.010 ...)
7
4.5
= 2 arcsin
( = 2.239... = 128.31...)
5
M1(A1)
(A1)
Note: Allow use of cosine rule.
1
72 ( sin ) = 10.08...
2
1
area Q =
52 ( sin ) = 18.18...
2
area P =
M1(A1)
(A1)
Note: The M1 is for an attempt at area of sector minus area of triangle.

Note: The use of degrees correctly converted is acceptable.
area = 28.3(cm2)
A1
[7]
33.
(a)
( x + 2) dx +
4
3
0
kdx = 1
8k 4 k
+
=1
3
3
1
k=
4
M1
A1
Note: Only FT on positive values of k.
28
(b)
(i)
(ii)
1 0
1
x( x + 2) 2 dx +
4 2
4
1 4 2
+
=
4 3 9
1
= (= 0.111)
9
E(X) =
4
3
0
xdx
median given by a such that P (X < a) = 0.5

1 a
( x + 2) 2 dx = 0.5
2
4
M1
A1
M1
( x + 2) 3
=2
3 2
(a + 2)3 0 = 6
a = 3 6 2 (= 0.183)
(A1)
A1
[7]
34.
(a)
equation of line in graph a =
25
t + 15
60
A1
a = t + 15
12
(b)
dv
5
= t + 15
dt
12
5 2
t + 15t + c
v=
24
when t = 0, v = 125 m s1
5 2
t + 15t + 125
v=
24
from graph or by finding time when a = 0
maximum = 395 m s1
(M1)
(A1)
A1
A1
29
(c)
EITHER
graph drawn and intersection with v = 295 m s1

t = 57.91 14.09 = 43.8
(M1)(A1)
A1
OR
5 2
t + 15t + 125 t = 57.91...; 14.09...
24
t = 57.91 14.09 = 43.8 (8 30 )
295 =
(M1)(A1)
A1
[8]
35.
logx+1 y = 2
1
logy+1 x =
4
so (x + 1)2 = y
(y
1
+ 1) 4
=x
A1
A1
EITHER
x4 1 = (x + 1)2
x = 1, not possible
x = 1.70, y = 7.27
M1
R1
A1A1
30
OR
1
( x 2 + 2 x + 2) 4 x = 0
attempt to solve or graph of LHS
x = 1.70, y = 7.27
M1
M1
A1A1
[6]
36.
METHOD 1
equation of journey of ship S1
10
r1 = t
20
equation of journey of speedboat S2 ,setting off k minutes later
70
60
r2 = + (t k )
30
30
M1A1A1
Note: Award M1 for perpendicular direction, A1 for speed, A1 for

change in parameter (e.g. by using t k or T, k being the time
difference between the departure of the ships).
10 70
60
solve t = + (t k )
20 30
30
(M1)
Note: M mark is for equating their two expressions.

10t = 70 60t + 60k
20t = 30 + 30t 30k
M1
Note: M mark is for obtaining two equations involving two different parameters.
7t 6k = 7
t + 3k = 3
28
k=
15
latest time is 11:52
A1
A1
31
METHOD 2
y
O
(A)
time 26 5
taken t
10 58
S (26,52) time taken

t-k
22 5
B (70,30)
SB = 22 5
(by perpendicular distance)
SA = 26 5
(by Pythagoras or coordinates)
26 5
t=
10 5
tk=
k=
22 5
30 5
28
leading to latest time 11:52
15
M1A1
M1A1
A1
A1
A1
[7]
37.
(a)
0 2 1 x 3

1 1 3 y = 1
2 1 2 z k

0 2 1
1 1 3 = 0 2( 2 + 6) + ( 1 + 2) = 7
M1A1
2 1 2
since determinant 0 unique solution to the system planes
intersect in a point
R1
AG
Note: For any method, including row reduction, leading to the explicit
6 5k 10 + k 1 2k
,
,
solution
, award M1 for an attempt at
7
7
7
a correct method, A1 for two correct coordinates and A1 for
a third correct coordinate.
32
(b)
a
2
1 a +1
2
1
3
a+2
= a((a + 1)(a + 2) 3) 2(1(a + 2) + 6) + (1 + 2(a + 1))

M1(A1)
planes not meeting in a point no unique solution i.e. determinant = 0(M1)
a(a2 + 3a 1) + (2a 8) + (2a + 1) = 0
a3 + 3a2 + 3a 7 = 0
A1
a=1
A1
[5]
(c)
1 2 1 3 r1 + r2
0 4 4 4
2 1 3 k
1
2
1
3
2r1 + r3
4
0 4 4
0 5 5 6 + k
3 4r3 5r2
1 2 1
4
0 4 4
0 0 0 4 + 4k
for an infinite number of solutions to exist, 4 + 4k = 0 k = 1

x + 2y + z = 3
y+z=1
x 1
1

y = 1 + 1
z 0
1

M1
(A1)
(A1)
A1
M1
A1
Note: Accept methods involving elimination.
x 2
1 x 0
1

Note: Accept any equivalent form e.g. y = 0 + 1 or y = 2 + 1 .
z 1
1 z 1
1

x

Award A0 if y = or r = is absent.
z

[14]
33
38.
(a)
P(X < 30) = 0.4

P(X < 55) = 0.9
or relevant sketch
X
given Z =
P(Z < z) = 0.4

P(Z < z) = 0.9
(M1)
30
55
= 0.253...
(A1)
= 1.28...
(A1)
= 30 + (0.253...) = 55 (1.28...)
= 16.3, = 34.1
M1
A1
Note: Accept 16 and 34.

Note: Working with 830 and 855 will only gain the two M marks.
(b)
X ~ N(34.12..., 16.28...2)
late to school X > 60
P(X > 60) = 0.056...
number of students late = 0.0560... 1200
= 67 (to nearest integer)
(A1)
(M1)
A1
Note: Accept 62 for use of 34 and 16.
(c)
P( X > 60)
M1
P( X > 30)
= 0.0935 (accept anything between 0.093 and 0.094) A1
P(X > 60 | X > 30) =
Note: If 34 and 16 are used 0.0870 is obtained. This should be accepted.

(d)
let L be the random variable of the number of students who

leave school in a 30 minute interval
since 24 30 = 720
L ~ Po(720)
P(L 700) = 1 P(L 699)
= 0.777
A1
(M1)
A1
Note: Award M1A0 for P (L > 700) = 1 P(L 700) (this leads to 0.765).
(e)
(i)
Y ~ B(200, 0.7767)
E(Y) = 200 0.7767 = 155
(M1)
A1
Note: On FT, use of 0.765 will lead to 153.
34
(ii)
P(Y > 150) = 1 P(Y 150)

= 0.797
(M1)
A1
Note: Accept 0.799 from using rounded answer.

Note: On FT, use of 0.765 will lead to 0.666.
[17]
39.
(a)
cos sin cos sin
A2 =
sin cos sin cos
cos 2 sin 2
cos sin + sin cos
=
sin 2 + cos 2
sin cos cos sin
cos 2 sin 2
2 sin cos
=
2
2
2 sin cos cos sin

cos 2 sin 2
=
sin 2 cos 2
M1(A1)
A1
AG
35
(b)
cos
let P(n) be the proposition that
sin
+
for all n
P(1) is true
1
cos sin cos
=
sin cos sin
assume P(k) to be true
sin
cos n
=
cos
sin n
sin n
cos n
A1
sin
cos
A1
Note: Must see the word true or equivalent, that makes clear an
assumption is being made that P(k) is true.
cos
sin
sin
cos k
=
cos
sin k
sin k
cos k
consider P(k + 1)
cos
sin
sin
cos
k +1
cos sin cos

=
sin cos sin
cos k sin k cos
=
sin k cos k sin
cos k cos sin k sin
=
sin k cos cos k sin
sin
cos
sin
cos
(M1)
A1
cos k sin + sin k cos

A1
sin k sin + cos k cos
cos(k + 1) sin( k + 1)
A1
=
sin( k + 1) cos(k + 1)
if P(k) is true then P(k + 1) is true and since P(1) is true then P(n) is true
for all n +
R1
Note: The final R1 can only be gained if the M1 has been gained.
36
(c)
EITHER
cos( ) sin( )
from formula
A1 =
sin( ) cos( )
cos sin
=
sin cos
cos
A1A = AA1 =
sin
sin cos
cos sin
sin cos
=
cos sin
A1
sin cos sin
cos sin cos

M1
Note: Accept either just A1A or just AA1.
1 0
=
0 1
A1 is inverse of A
A1
OR
cos sin
cos + sin sin cos

cos sin
A1 =
sin cos
putting n = 1 in formula gives inverse
A1 =
M1
A1
A1
[13]
40.
(a)
volume =
x 2 dy
ydy
(M1)
M1
y2
h 2
= =
2
2 0
A1
37
(b)
dV
= 3 surface area
dt
surface area = x2
= h
h 2
2V
h=
since V =
2
dV
2V
= 3
dt
dV
= 3 2 V
dt
Note: Assuming that
A1
(M1)
A1
M1A1
A1
AG
dh
= 3 without justification gains no marks.
dt
[6]
(c)
V0 = 5000 (= 15700 cm3)

dV
= 3 2 V
dt
attempting to separate variables
A1
M1
EITHER
dV
= 3 2 dt
A1
2 V = 3 2 t + c
A1
c = 2 5000
V=0
2 5000
t =
= 33 13 hours
3
2
A1
M1
A1
OR
dV
5000
= 3 2 dt
0
M1A1A1
Note: Award M1 for attempt to use definite integrals, A1 for correct

limits and A1 for correct integrands.
[2 V ]
= 3 2 T
A1
2 5000
= 33 13 hours
3
2
A1
5000
T=
[16]
41.
1 2
8 sin 59
2
= 27.43
area of triangle POQ =
M1
(A1)
38
59
360
= 32.95
area between arc and chord = 32.95 27.43
= 5.52 (cm2)
area of sector = 82
M1
(A1)
A1
[5]
42.
u4 = u1 + 3d = 7, u9 = u1 + 8d = 22
A1A1
Note: 5d = 15 gains both above marks

u1 = 2, d = 3
n
Sn = (4 + (n 1)3) > 10000
2
n = 83
A1
M1
A1
[5]
43.
(a)
a = 10e0.2t
at t = 10, a = 1.35 (m s2) (accept 10e2)
(b)
METHOD 1
d=
10
(M1)(A1)
A1
50(1 e 0.2t )dt
= 283.83...
so distance above ground = 1720 (m) (3 s.f.) (accept 1716 (m))
(M1)
A1
A1
METHOD 2
s = 50(1 e0.2t)dt = 50t + 250e0.2t (+ c)
Taking s = 0 when t = 0 gives c = 250
So when t = 10, s = 283.3...
so distance above ground = 1720 (m) (3 s.f.) (accept 1716 (m))
M1
M1
A1
[6]
44.
(a)
det A = cos 2 cos + sin 2 sin

= cos (2 )
M1A1
A1
Note: Allow use of double angle formulae if they lead to the correct answer
= cos
AG
39
(b)
cos2 = sin
= 0.666, 2.48
A1
A1A1
[6]
45.
M1A1A1A1A1A1A1
Note: Award A1 for both vertical asymptotes correct,
M1 for recognizing that there are two turning points near the origin,
A1 for both turning points near the origin correct, (only this
A mark is dependent on the M mark)
A1 for the other pair of turning points correct,
A1 for correct positioning of the oblique asymptote,
A1 for correct equation of the oblique asymptote,
A1 for correct asymptotic behaviour in all sections.
[7]
46.
(a)
P(x < 1.4) = 0.691 (accept 0.692)
(b)
METHOD 1
Y ~ B(6, 0.3085...)
P(Y 4) = 1 P(Y 3)
= 0.0775 (accept 0.0778 if 3 s.f. approximation from (a) used)
A1
(M1)
(M1)
A1
40
METHOD 2
X ~ B(6, 0.6914...)
P(X 2)
= 0.0775 (accept 0.0778 if 3 s.f. approximation from (a) used)
(c)
P(x < 1 | x < 1.4) =
P( x < 1)
P( x < 1.4)
(M1)
(M1)
A1
M1
0.06680...
0.6914...
= 0.0966 (accept 0.0967)
=
A1
[6]
47.
(a)
(b)
x3 + 1 =
1
3
x +1
(1.26, 1) (= ( 3 2 , 1))
f(1.259...) = 4.762...
A1
(3
g(1.259...) = 4.762...
2
23
(3
1
required angle = 2arctan
4
.
762
...
= 0.414 (accept 23.7)
2
23
A1
)
A1
M1
A1
Note: Accept alternative methods including finding the obtuse angle first.
[5]
48.
let the length of one side of the triangle be x

consider the triangle consisting of a side of the triangle and two radii
EITHER
x2 = r2 + r2 2r2 cos 120
= 3r2
M1
OR
x = 2r cos 30
M1
41
THEN
x= r 3
A1
so perimeter = 3 3 r
now consider the area of the triangle
1
area = 3 r2sin 120
2
3 2
=3
r
4
P
3 3r
=
A 3 3 2
r
4
4
=
r
A1
M1
A1
A1
Note: Accept alternative methods

[6]
49.
let x = distance from observer to rocket

let h = the height of the rocket above the ground
METHOD 1
dh
= 300 when h = 800
dt
A1
1
x = h 2 + 360000 = (h 2 + 360000) 2
dx
h
=
dh
h 2 + 360000
when h = 800
dx dx dh
=
dt dh dt
300h
=
h 2 + 360000
= 240 (m s1)
M1
A1
M1
A1
A1
42
METHOD 2
h2 + 6002 = x2
dx
2h = 2x
dh
dx h
=
dh x
800 4
=
=
1000 5
dh
= 300
dt
dx dx dh
=
dt dh dt
4
=
300
5
= 240 (m s1)
M1
A1
A1
A1
M1
A1
METHOD 3
x2 = 6002 + h2
dx
dh
= 2h
2x
dt
dt
when h = 800, x = 1000
dx 800 dh
=
dt 1000 dt
= 240 m s1
M1
A1A1
M1A1
A1
METHOD 4
2
Distance between the observer and the rocket = (600 + 800

Component of the velocity in the line of sight = sin 300
(where = angle of elevation)
800
sin =
1000
component = 240 (m s1)
1
)2
= 1000
M1A1
M1A1
A1
A1
[6]
43
50.
x2 + y2 = a2
1
1 2 1 2 dy
x + y
=0
2
2
dx
1
dy
y
2 x
=
=
1
dx
x
2 y
Note: Accept
dy
= 1
dx
M1
A1
1
a2
1
x2
from making y the subject of the equation,
and all correct subsequent working

therefore the gradient at the point P is given by
dy
q
=
dx
p
A1
equation of tangent is y q =
q
( x p)
p
M1
q
x+q+ q p )
p
(y =
x-intercept: y = 0, n =
q p
y-intercept: x = 0, m =
n+m=
+p= q p+p
q p +q
q p + p+ q p + p
A1
A1
M1
= 2 q p + p+q
= ( p + q)2
=a
A1
AG
[8]
51.
(a)
1
0 x

PQ = 1, SR = 5 y
3
1 z

point S = (1, 6, 2)
(M1)
A1
44
(b)
1

PQ = 1
3

2

PS = 4
1

A1
13
PQ PS = 7
2
(c)
m = 2
A1
area of parallelogram PQRS = PQ PS = (13) 2 + 7 2 + (2) 2
M1
=
(d)
(e)
222 = 14.9
equation of plane is 13x + 7y 2z = d

substituting any of the points given gives d = 33
13x + 7y 2z = 33
0
13

equation of line is r = 0 + 7
0
2

A1
M1A1
A1
A1
Note: To get the A1 must have r = or equivalent.

(f)
(g)
169 + 49 + 4 = 33
33
=
(= 0.149...)
222
143 77 11
, , (= (1.93, 1.04, 0.297))
closest point is
74 74 37
angle between planes is the same as the angle between the normals
13 1 + 7 2 2 1
cos =
222 6
= 143 (accept = 37.4 or 2.49 radians or 0.652 radians)
M1
A1
A1
(R1)
M1A1
A1
[17]
52.
(a)
P(x = 0) = 0.607
A1
45
(b)
(c)
EITHER
Using X ~ Po(3)
(M1)
OR
Using (0.6065...)6
(M1)
THEN
P(X = 0) = 0.0498
A1
X ~ Po(0.5t)
P(x 1) = 1 P(x = 0)
P(x = 0) < 0.01
e0.5t < 0.01
0.5t < ln (0.01)
t > 9.21 months
therefore 10 months
(M1)
(M1)
A1
A1
(M1)
A1N4
Note: Full marks can be awarded for answers obtained directly from GDC
if a systematic method is used and clearly shown.
(d)
(i)
P(1 or 2 accidents) = 0.37908

E(B) = 1000 0.60653... + 500 0.37908...
= $796 (accept $797 or $796.07)
(ii)
P(2000) = P(1000, 1000, 0) + P(1000, 0, 1000)

+ P(0, 1000, 1000) + P(1000, 500, 500)
+ P(500, 1000, 500) + P(500, 500, 1000)
A1
M1A1
A1
(M1)(A1)
Note: Award M1 for noting that 2000 can be written both as

2 1000 + 1 0 and 2 500 + 1 1000.
= 3(0.6065...)2(0.01437...) + 3(0.3790...)2(0.6065...)
= 0.277 (accept 0.278)
M1A1
A1
[18]
46
53.
1 1
1
1
prove that 1 + 2 + 3 + 4 + ... + n
2 2
2
2
for n = 1
1+ 2
LHS = 1, RHS = 4 0 = 4 3 = 1
2
so true for n = 1
assume true for n = k
2
1 1
1
1
so 1 + 2 + 3 + 4 + ... + k
2 2
2
2
now for n = k + 1
2
k 1
1 1
1
1
LHS: 1 + 2 + 3 + 4 + ... + k
2 2
2
2
k+2
n 1
= 4
k 1
= 4
n+2
2 n 1
R1
M1
k+2
2 k 1
1
+ (k + 1)
2
A1
1
= 4 k 1 + (k + 1)
2
2
2(k + 2) k + 1
+ k (or equivalent)
=4
2k
2
(k + 1) + 2
k +3
=4
(accept 4
)
( k +1) 1
2
2k
Therefore if it is true for n = k it is true for n = k + 1. It has been shown
to be true for n = 1 so it is true for all n ( +).
M1A1
A1
A1
R1
Note: To obtain the final R mark, a reasonable attempt at induction

must have been made.
[8]
54.
(a)
METHOD 1
e2x sin x dx = cos xe2x + 2e2x cos x dx
= cos xe2x + 2e2x sin x 4e2x sin x dx
5e2x sin x dx = cos xe2x + 2e2x sin x
1
e2x sin x dx = e2x(2 sin x cos x) + C
5
M1A1A1
A1A1
M1
AG
47
METHOD 2
sin xe 2 x
e 2x
cos x
dx
2
2
sin xe 2 x
e 2x
e 2x
=
cos x
sin x
dx
2
4
4
5 2x
e 2 x sin x cos xe 2 x
e sin xdx =
4
2
4
1
e 2 x sin xdx = e 2 x (2 sin x cos x) + C
5
sin xe2x dx =
(b)
dy
1 y 2
= e 2 x sin xdx
1 2x
e (2 sin x cos x)(+ C)
5
1
when x = 0, y = 0 C =
5
1
1
y = sin e 2 x (2 sin x cos x) +
5
5
arcsin y =
(c)
M1A1A1
A1A1
M1
AG
M1A1
A1
M1
A1
(i)
P is (1.16, 0)
A1
A1
Note: Award A1 for 1.16 seen anywhere, A1 for complete sketch.

Note: Allow FT on their answer from (b)
48
(ii)
V=
1.162....
y 2 dx
= 1.05
M1A1
A2
Note: Allow FT on their answers from (b) and (c)(i).

[25]
55.
(a)
200 205
= 0.5
10
probability = 0.691 (accept 0.692)
z=
(M1)
A1
Note: Award M1A0 for 0.309 or 0.308

(b)
(c)
let X be the total weight of the 5 oranges

then E(X) = 5 205 = 1025
Var(X) = 5 100 = 500
P(X < 1000) = 0.132
(A1)
(M1)(A1)
(A1)
let Y = B 3C where B is the weight of a random orange and C the

weight of a random lemon
(M1)
E(Y) = 205 3 75 = 20
(A1)
Var(Y) = 100 + 9 9 = 181
(M1)(A1)
P(Y > 0) = 0.0686
A1
Note: Award A1 for 0.0681 obtained from tables

[11]
56.
(a)
H0 : p = 03 H0 : p 0.3
A1
Note: Accept H0: X ~ Geo (0.3) versus H1: X is not Geo (0.3)
but do not accept H0 : X ~ Geo versus H1: X is not Geo
49
(b)
the expected values are found using E(X) = 100 0.3 0.7x1
the table of expected values is
(M1)
Value of X
Frequency
30
21
14.7
10.29
7.203
16.807
A3
Note: Award A3 for all correct, A2 for one error, A1 for two errors and
A0 for three or more errors.
Do not penalize expected values that are correct to 1 decimal place.
EITHER
2
calc
=
35 2
10 2
+ ... +
100 = 5.27
30
16.807
(M1)A1
Note: Accept answers that round to 5.26 or 5.27

DF = 5
critical value = 11.07
accept H0, because 5.27 < 11.07
(A1)
A1
R1
Note: Allow FT on final R1.

OR
2
calc
=
35 2
10 2
+ ... +
100 = 5.27
30
16.807
(M1)(A1)
Note: Accept answers that round to 5.26 or 5.27

DF = 5
p-value = 0.384
(A1)
A1
Note: Accept any p-value that rounds to 0.384

accept H0, because p-value > 0.05
R1

[10]
57.
(a)
the weight losses are

2.2 3.5 4.3 0.5 4.2
x = 18.1,
x 2 = 67.55
0.2
2.5
2.7
0.1
0.7
UE of mean = 1.81
67.55 18.12
UE of variance =
= 3.87
9
90
(M1)(A1)
A1
(M1)A1
Note: Accept weight losses as positive or negative. Accept unbiased

estimate of mean as positive or negative.
Note: Award M1A0 for 1.97 as UE of variance.
(b)
(i)
H0 : d = 0 versus H1 : d > 0
A1
50
Note: Accept any symbol for d

(ii)
(iii)
using t test
1.81
t=
= 2.91
3.87
10
(M1)
DF = 9
(A1)
A1
Note: Award this (A1) if the p-value is given as 0.00864

1% critical value = 2.82
accept H1
A1
R1

(c)
the t value satisfies

3.87
2t
= 3.36 0.26 = 3.1
10
so t = 2.49(158)
P(T > 2.49) = 0.0172 or P(T < 2.49) = 0.983
the confidence level is therefore
1 2 0.017 or 2 0.983 1 = 0.966 (96.6%)
M1A1
A1
A1
M1A1
[17]
58.
(a)
under H0, S is Po(30)
(A1)
EITHER
P(S 22) = 0.080569
P(S 38) = 0.089012
significance level = 0.080569 + 0.089012
= 0.170
A1
A1
(M1)
A1
OR
P(S 22) = 0.080569
P(S 37) = 0.910987
significance level = 1 (0.910987) + 0.089012
= 0.170
A1
A1
(M1)
A1
Note: Accept 17 % or 0.17.

Note: Award 2 marks out of the final 4 marks for correct use of the
Central Limit Theorem, giving 0.144 without a continuity
correction and 0.171 with a continuity correction. The
first (A1) is independent.
51
(b)
S is now Po (25)
P (Type II error) = P (accept H0| = 2.5)
= P(23 S 37 | S is Po(25))
(A1)
(M1)
(M1)
Note: Only one of the above M1 marks can be implied.

= 0.990789 0.317533
= 0.673
(A1)
A1
Note: Award 2 marks out of the final 4 marks for correct use of the
Central Limit Theorem, giving 0.647 without a continuity
correction and 0.685 with a continuity correction. The
first (A1) is independent.
[10]
59.
(a)
(i)
x 1 3
p (1 p)x3
f(x) =
2
M1A1
x 1 3 x3
p q
Note: Award M1A0 for f(x) =
2
taking logs,
x 1 3
p (1 p ) x 3
ln f(x) = ln
2
( x 1)( x 2)
p 3 (1 p ) x 3
= ln
2
M1
A1
Note: Award A1 for simplifying binomial coefficient, seen anywhere.
( x 1)( x 2)
(1 p ) x
= ln
p3
2
(1 p ) 3
A1
Note: Award A7 for correctly splitting (1 p)x3, seen anywhere.
(ii)
p
+ ln(x 1) + ln(x 2) + x ln(1 p) ln 2
= 3 ln
1 p
AG
the domain is {3, 4, 5, }
A1
Note: Do not accept x 3

(iii)
differentiating with respect to x,

f ( x)
1
1
=
+
+ ln(1 p )
f ( x) x 1 x 2
M1
AG
52
(b)
setting f(x) = 0 and putting p = 0.35,

1
1
+
+ ln 0.65 = 0
x 1 x 2
solving, x = 6.195
we need to check x = 6 and 7
f(6) = 0.1177 and f (7) = 0.1148
the most likely value of Y is 6
M1A1
A1
A1
A1
Note: Award the final A1 for the correct conclusion even if the previous
A1 was not awarded.
[12]
60.
(a)
*
10
12
12
10
10
12
12
10
10
12
10
12
10
12
10
12
4
A4
Note: Award A4 for all correct, A3 for one error, A2 for two errors,
A1 for three errors and A0 for four or more errors.
(b)
(i)
(ii)
closure: there are no new elements in the table

identity: 8 is the identity element
inverse: every element has an inverse because there is an 8
in every row and column
associativity: (modulo) multiplication is associative
A1
A1
therefore {S, *} is a group
AG
A1
A1
the orders of the elements are as follows
element
order
10
12
6
A4
53
Note: Award A4 for all correct, A3 for one error, A2 for two errors,
(iii)
EITHER
the group is cyclic because there are elements of order 6
R1
OR
the group is cyclic because there are generators
R1
THEN
10 and 12 are the generators
(c)
looking at the Cayley table, we see that

T = {2, 4, 8}
this is a subgroup because it contains the identity element 8,
no new elements are formed and 2 and 4 form an inverse pair
A1A1
A1
R2
Note: Award R1 for any two conditions

[18]
61.
(a)
A = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}

B = {3, 8, 13, 18, 23, 28}
(A1)
(A1)
Note: FT on their A and B
(b)
A \ B = {elements in A that are not in B}

= {2, 5, 7, 11, 17, 19, 29}
(M1)
A1
B\A = {8, 18, 28}

AB = (A\B) (B\A)
= {2, 5, 7, 8, 11, 17, 18, 19, 28, 29}
(A1)
(M1)
A1
[7]
62.
(a)
reflexive: aRa because a2 a2 = 0 (which is divisible by 5)

symmetric: let aRb so that a2 b2 = 5M
it follows that b2 a2 = 5M, which is divisible by 5 so bRa
transitive: let aRb and bRc so that a2 b2 = 5M and b2 c2 = 5N
A1
M1
A1
M1
a2 b2 + b2 c2 = 5M + 5N
a2 c2 = 5M + 5N, which is divisible by 5 so aRc
A1
A1
R is an equivalence relation
AG
54
(b)
the equivalence classes are

{1, 4, 6, 9, ...}
{2, 3, 7, 8, ...}
{5, 10, ...}
A2
A1
A1
Note: Do not award any marks for classes containing fewer elements than shown above.
[10]
63.
for f to be a bijection it must be both an injection and a surjection
R1
Note: Award this R1 for stating this anywhere.

injection:
let f(a, b) = f(c, d) so that
a c
ab2 = cd2 and =
b d
dividing the equations,
b3 = d3 so b = d
substituting,
a=c
it follows that f is an injection because f(a, b) = f(c, d) (a, b) = (c, d)
surjection:
let f(a, b) = (c, d) where (c, d)
a
then c ab2 and d =
b
dividing,
c
c
b3 =
so b = 3
d
d
substituting,
c
a=d 3
d
it follows that f is a surjection because
given (c, d) + +, there exists (a, b)
therefore f is a bijection
(M1)
A1
A1
A1
R1
(M1)
A1
A1
A1
+
such that f(a, b) = (c, d) R1

AG
[11]
64.
(a)
pq = pr
p1(pq) = p1(pr), every element has an inverse
(p1p)q = (p1p)r, Associativity
A1
A1
Note: Brackets in lines 2 and 3 must be seen.

eq = er, p1 p = e, the identity
q r, ea a for all elements a of the group
A1
A1
55
(b)
(i)
let ab = a so b = e, which is a contradiction

let ab = b so a = e, which is a contradiction
therefore ab cannot equal either a or b
(ii)
the two possible Cayley tables are
R1
R1
AG
table 1
e
e
A2
table 2
e
e
A2
(iii)
the group defined by table 1 is isomorphic to the given group

because
R1
EITHER
both contain one self-inverse element (other than the identity)
R1
OR
both contain an inverse pair
R1
OR
both are cyclic
R1
THEN
the correspondence is e 1, c 1, a i, b i
(or vice versa for the last two)
A2
Note: Award the final A2 only if the correct group table has been identified.
[14]
56
65.
(a)
METHOD 1
f(x) = ln(1 + ex); f(0) = ln 2
1
ex
f (x) =
; f (0) =
x
2
1+ e
Note: Award A0 for f(x) =

f (x) =
1
1+ e
e x (1 + e x ) 2e 2 x
x 2
(1 + e )
A1
A1
; f (0) =
; f (0) =
Note: Award M0A0 for f (x) if f (x) =

ln(1 + ex) = ln 2 +
1
2
1
4
1
1+ e x
M1A1
is used
1
1
x + x 2 + ...
2
8
M1A1
METHOD 2
1 2
x + ...)
2
1
1
= ln 2 + ln(1 + x + x 2 + ...)
2
4
2
1
1
1
11
= ln 2 + x + x 2 + ... x + x 2 + ... + ...

4
4
2
22
1
1 2 1 2
= ln 2 + x + x x + ...
2
4
8
1
1
= ln 2 + x + x 2 + ...
2
8
ln(1 + ex) = ln(1 + 1 + x +
(b)
M1A1
A1
A1
A1
A1
METHOD 1
x4
+ x 3 terms & above x ln 4
2 ln(1 + e ) x ln 4
4
lim
= lim
x 0
x 0
x2
x2
M1A1
1
1
= lim + powers of x =
M1A1
x 0 4
4
x
2 ln 2 + x +
Note: Accept + as evidence of recognition of cubic and higher powers.

Note: Award M1A0M1A0 for a solution, which omits the cubic and higher powers.
57
METHOD 2
using lHpitals Rule
lim
2 ln(1 + e x ) x ln 4
x2
x 0
2e x (1 + e x ) 1
x 0
2x
x
2e (1 + e x ) 2 1
= lim
=
x 0
2
4
= lim
M1A1
M1A1
[10]
66.
(a)
use of y y + h
dy
dx
0
0.1
0.2
0.3
0.4
1
1.1
1.222
1.3753284
1.573481221
(M1)
dy
dx
1
1.22
1.533284
1.981528208
dy
dx
0.1
0.122
0.1533284
0.1981528208
h
approximate value of y = 1.57
A1
A1
A1
A1
(A1)
A1
Note: Accept values in the tables correct to 3 significant figures.

(b)
the approximate value is less than the actual value because it is

dy
assumed that
remains constant throughout each interval
dx
whereas it is actually an increasing function
R1
[8]
58
67.
put y = vx so that =
dy
dv
=v+x
dx
dx
substituting,
dv v 2 x 2 + 3vx 2 + 2 x 2
=
v+ x
= (v2 + 3v + 2)
2
dx
x
dv
x
= v2 + 2v + 2
dx
dv
dx
=
2
x
v + 2v + 2
dv
dx
=
x
(v + 1) 2 + 1
M1
M1
(A1)
A1
M1
(A1)
arctan (v + 1) = ln x + c
A1
Note: Condone absence of c at this stage.
y
+ 1) = ln x + c
x
When x = 1, y = 1
c=0
y
+ 1 = tan ln x
x
y = x(tan ln x 1)
arctan(
M1
M1
A1
A1
[11]
59
68.
(a)
I0 =
e x sin xdx
M1
Note: Award M1 for I0 =
e x sin x dx
Attempt at integration by parts, even if inappropriate modulus

signs are present.
[
= [e
or [e
= [e
= e
cos x
cos xdx
M1
A1
] e cos xdx or [e sin x] +

cos x ] [e sin x ] e sin xdx
sin x + e cos x ] e sin xdx
cos x ] [e sin x ] I or [e sin x + e
A1
cos x 0 I 0
M1
Note: Do not penalise absence of limits at this stage

I0 = e + 1 I0
1
I0 = (1+ e)
2
A1
AG
Note: If modulus signs are used around cos x, award no accuracy marks
but do not penalise modulus signs around sin x .
(b)
In =
( n +1)
e x sin x dx
Attempt to use the substitution y = x n

(putting y = x n, dy = dx and [n, (n + 1)] [0, ])
so In =
e ( y + n) sin( y + n) dy
= e n
= e n
M1
A1
e y sin( y + n) dy
A1
e y sinydy
A1
= enI0
AG
60
(c)
e x sin x dx =
I
n 0
M1
I0
(A1)
n =0
the term is an infinite geometric series with common ratio e

therefore
I0
e x sin x dx =
0
1 e
1 + e
e +1
=
=
2(1 e ) 2(e 1)
(M1)
(A1)
A1
[15]
69.
(a)
using a ratio test,

x
Tn +1
x n +1
n!
=
n =
Tn
(n + 1)! x
n +1
M1A1
Note: Condone omission of modulus signs.

0 as n for all values of x
the series is therefore convergent for x
(b)
(i)
x2
x2
+ ...
+
2 23
x2
x2
<x+
+ ... (for x > 0)
+
2 2 2
x
=
(for x < 2)
x
1
2
2x
=
(for 0 < x < 2)
2 x
ex 1 = x +
R1
A1
M1
A1
A1
AG
61
(ii)
ex < 1 +
2x
2+ x
=
2 x 2 x
A1
2+ xx
ex <
2 x
A1
replacing x by
therefore
2n + 1
e<
2n 1
(c)
(i)
(ii)
1
1
(and noting that the result is true for n >
and
n
2
M1
AG
x2 x3
+ ...
A1
+
2
6
for 0 < x < 2 , the series is alternating with decreasing terms
so that the sum is greater than the sum of an even number of terms R1
therefore
1 ex = x
1 ex > x
x2
2
ex < 1 x +
x2
2
ex >
AG
M1
x2
1 x +
x
e>
2
2 2x + x
1
1
replacing x by
(and noting that the result is true for n >
and
n
2
therefore +)
2n 2
e > 2
2n 2n + 1
(d)
A1
from (b) and (c), e < 2.718282 and e > 2.718281

we conclude that e = 2.71828 correct to 5 decimal places
AG
A1
A1
[16]
62
70.
(a)
(b)
315 = 5 56 + 35
56 = 1 35 + 21
35 = 1 21 + 14
21 = 1 14 + 7
14 = 2 7
therefore gcd = 7
M1
(i)
M1
(ii)
7 = 21 14
= 21 (35 21)
= 2 21 35
= 2 (56 35) 35
= 2 56 3 35
= 2 56 3 (315 5 56)
= 17 56 3 315
therefore 56 51 + 315 (9) = 21
x = 51, y = 9 is a solution
the general solution is x = 51 + 45 N, y = 9 8N, N
putting N = 2 gives y = 7, which is the required value of x
A1
A1
A1
(A1)
(A1)
(A1)
M1
(A1)
A1A1
A1
[13]
71.
(a)
using any method, the minimum spanning tree is
(M1)
A2
Note: Accept MST = {BC, EC, DC} or {BC, EB, DC}
Note: In graph, line CE may be replaced by BE.
lower bound = weight of minimum spanning tree + 2 smallest weights
connected to A
(M1)
= 11 + 13 + 14 + 10 + 15 = 63
A1
(b)
weight of ADCBEA = 10 + 14 + 11 + 13 + 15 = 63
A1
63
(c)
the conclusion is that ADCBEA gives a solution to the travelling

salesman problem
A1
[7]
72.
(a)
a = c + 1
so ab = bc + b ab b (mod c)
M1
A1 AG
(b)
the result is true for n = 0 since 90 = 1 1 (mod 4)

assume the result is true for n = k, i.e. 9k 1(mod 4)
consider 9k+1 = 9 9k
9 1 (mod 4) or 1 9k (mod 4)
1 (mod 4)
so true for n = k true for n = k + 1 and since true for n = 0
result follows by induction
A1
M1
M1
A1
A1
R1
Note: Do not award the final R1 unless both M1 marks have been awarded.
Note: Award the final R1 if candidates state n = 1 rather than n = 0
(c)
let M = (anan1...a0)9
= a 9n + an1 9n1 + ... + a0 90
(M1)
A1
EITHER
an (mod 4) + an1 (mod 4) + ... + a0 (mod 4)
A1
A1
(mod 4)
so M is divisible by 4 if
is divisible by 4
AG
OR
= an(9n 1) + an1(9n1 1) + ... + a1(91 1)
+ an + an1 + ... + a1 + a0
A1
Since 9n 1(mod 4), it follows that 9n 1 is divisible by 4,

a i is divisible by 4
so M is divisible by 4 if
R1
AG
73.
(a)
[12]
(i)
any Hamiltonian circuit ACBEFDA
A2
(ii)
no Eulerian circuit exists because the graph contains

vertices of odd degree
A2
64
(b)
(i)
the adjacency matrix is
1
1
0
0
1 1 1 0 0
0 1 0 1 0
1 0 1 0 0
0 1 0 1 1
1 0 1 0 1
0 0 1 1 0
A2
Note: Award A2 even if the zero is replaced by dashes.

(ii)
(iii)
to find the number of walks of length 5, we need to raise

this matrix to the 5th power
doing this, we find that the smallest off-diagonal term
corresponds to EF
M1
A1
any 4 walks, for example:

EBEBEF
EDEDEF
EFEFEF
EBADEF
A2
Note: Award A1 for 3 correct walks

Note: FT their answer to (b)(ii) even if their two vertices are the same.
(iv)
(c)
consider the inequality e 3v 6 for simple planar graphs

here, v = 6 so e 12
the graph G has 9 edges so the inequality permits no more than
3 extra edges to be added
A1
M1
M1A1
M1AG
65
(d)
METHOD 1
6
for G, v = 6 and e = 9 = 6
2
using Eulers relation
f=2+ev
=2
A1
M1
A1
METHOD 2
A2
2 faces
Note: Only award the final A1 if the previous A2 mark has been awarded.
[18]
74.
(a)
any clearly indicated method of dividing 1189 by successive numbers

find that 1189 has factors 29 and/or 41
it follows that 1189 is not a prime number
M1
A2
A1
Note: If no method is indicated, award A1 for the factors and A1 for

the conclusion.
(b)
(i)
every positive integer, greater than 1, is either prime or can be

expressed uniquely as a product of primes
A1A1
Note: Award A1 for product of primes and A1 for uniquely.
66
(ii)
METHOD 1
let M and N be expressed as a product of primes as follows
M = AB and N = AC
where A denotes the factors that are common and B, C the
disjoint factors that are not common
it follows that G = A
and L = GBC
from these equations, it follows that
GL = A ABC = MN
M1A1
A1
A1
AG
METHOD 2
x
y
Let M = 2 x1 3 x2 ... p n n and N = 2 y1 3 y 2 ... p n n where pn
denotes the nth prime
min( x n , y n )
Then G = 2 min( x1 , y1 ) 3 min( x2 , y 2 ) ... p n
and L = 2 max( x1 , y1 ) 3 max( x2 , y 2 ) ... p n
M1
A1
max( x n , y n )
It follows that GL = 2 x1 2 y1 3 x2 3 y 2 ... p n

= MN
A1
xn
pn
yn
A1
AG
[10]
75.
(a)
(i)
497.2, 502.0, 501.0, 498.6, 496.3, 499.1, 500.1, 497.7

using the GDC
x = 499.0, 2 = 3.8(0)
A1A1
Note: Accept 499.

(ii)
EITHER
p-value = 0.0950
since 0.0950 > 0.05 accept H0
A1
R1A1
OR
tcalc = 1.45, tcritical = 1.895 for v = 7 at 5 % level
since tcalc > tcritical accept H0
A1
R1A1
(b)
each X ~ N(60, 36) so
~ N(4(60), 4(36)) = N(240, 144)
M1A1A1
n =1
250 240 5
=
Pr(Sum < 250) = Pr z <
12
6
= 0.798 (by GDC)
(M1)(A1)
A1
Notes: Accept 0.797 (tables).

Answer only is awarded M0A0A0(M1)(A1)A1.
[11]
76.
(a)
(i)
x n +1
x dx =
, n 1
n + 1 1
n
M1
67
b n +1
1
n +1 n +1
A1
b
x n dx = [ln x ]1 = ln b when n = 1
A1
b n +1
1
n+1
if n + 1 > 0, lim
does not exist since b increases

b n + 1
n + 1
without limit
R1
b n +1
1
n+1
if n + 1 < 0, lim
R1
exists since b 0 as b
b n + 1
n + 1
if n = 1, lim [ln b] does not exist since ln b increases without limit R1

b
(so integral exists when n < 1)
(ii)
(b)
x n dx =
1
, (n < 1)
n +1
A1
dy
+ (cos x + sin x)y = cos x + sin x
dx
dy cos x + sin x
cos x + sin x
+
y=
dx cos x sin x
cos x sin x
(cos x sin x)
cos x + sin x
IF = e
cos x sin x dx
= e ln(cos x sin x ) =
y
cos x + sin x
=
dx
cos x sin x
(cos x sin x) 2
1
=
+k
cos x sin x
1
cos x sin x
M1
M1A1A1
(M1)
A1
Note: Award the above A1 even if k is missing.

y = 1 + k(cos x sin x)
x = , y = 1,
2
1 = 1 + k(1)
k=2
y = 1 + 2(cos x sin x)
M1
A1
Note: It is acceptable to solve the equation using separation of variables.

[15]
68
77.
(a)
14641 (base a > 6) = a4 + 4a3 + 6a2 + 4a + 1,

= (a + 1)4
this is the fourth power of an integer
(b)
(i)
(ii)
M1A1
A1
AG
a
= 1 = 20, hence R is reflexive
a
a
b
aRb = 2 k = 2 k bRa
b
a
so R is symmetric
a
b
aRb and bRc = 2m, m and bRc = 2n, n
b
c
a b a
= = 2m+n, m + n
b c c
aRc so transitive
hence R is an equivalence relation
R1
AG
equivalence classes are {1, 2, 4, 8}, {3, 6} , {5,10} , {7}, {9}
A3
aRa since
A1
A1
M1
A1
Note: Award A2 if one class missing,

A1 if two classes missing,
A0 if three or more classes missing.
[11]
78.
(a)
EITHER
since gcd(a, b) = 1 and gcd(a, c) = 1 then
ax + by = 1 and ap + cq = 1 for x, y, p, q
hence
(ax + by)(ap + cq) = 1
a(xap + xcq + byp) + bc (yq) = 1
since (xap + xcq + byp) and (yq) are integers
then gcd(a, bc) = 1
M1A1
A1
M1
R1
AG
OR
if gcd(a, bc) 1, some prime p divides a and bc
p divides b or c
either gcd(a, b) or gcd(a, c) 1
contradiction gcd (a, bc) = 1
(b)
(i)
each edge contributes 2 to the degree sum

so 2e = degree sum
so 2e kv
M1A1
M1
A1
R1
R1
R1
AG
69
(ii)
k = 6 so 2e 6v
M1
for a planar graph with v vertices and e edges, e 3v 6
M1
so 2e 6v 12
A1
this is a contradiction so at least one vertex must have degree < 6 R1
Note: Alternative proofs are possible.

[11]
79.
(a)
A2
(b)
A
B
M=
C
D
E
F
A
0
1
2
2
2
B C D E F
1 2 1 2 2
0 0 0 1 2
0 0 1 0 1
0 1 0 1 0
1 0 1 0 1
2 1 0 1 0
A2
Note: Award A1 for one error or omission, A0 for more than one error or
omission. Two symetrical errors count as one error.
(c)
A B C D E F
(8, 4, 4, 3, 5, 6)
A2
Note: Award no more than A1 for one error, A0 for more than one error.
(d)
(i)
no, because there are odd vertices
M1A1
(ii)
yes, because there are exactly two odd vertices
M1A1
70
(e)
M4 =
A
B
C
D
E
F
A
309
174
140
118
170
214
B C D
E
F
174 140 118 170 214
117 106 70 122 132

106 117 66 134 138
70 66 53 80 102
122 134 80 157 170

132 138 102 170 213
number of walks of length 4 is 170
(M1)A1
Note: The complete matrix need not be shown. Only one of the FE has
to be shown.
[12]
80.
(a)
852 548
852
1400 1400
interval is
1.96
1400
1400
Note: Award M1 for
852
..., A1 for 1.96 and A1 for
1400
= [0.583, 0.634]
(b)
(i)
(ii)
using the interval symmetry

0.2511 + 0.3155 0.5666
=
p=
= 0.2833
2
2
hence
n = 0.2833 600 = 169.98
n = 170
M1A1A1
852 548
1400 1400
1400
A1A1
N5
M1
A1
A1
1 p = q = 0.7167
(A1)
0.2833 + z 0.2833 0.7167 0.2833 + z 0.2833 0.7167
600
600
= 0.3155 0.2511
M1A1
0.0322
z =
= 1.7504... 1.75
A1
0.2833 0.7167
600
= 92.0% (do not penalize if only the 92.0 % is seen)
A1A1
Note: Award first A1 if 0.04 or 0.96 seen.
71
(c)
H0 : data can be modelled B(5, 0.35)

H1 : data cannot be modelled B(5, 0.35)
x
A1
fo 15
49
65
36
10
fe 20.89
56.23
60.55
32.61
8.78
0.95
M1A2
Note: Award A1 for one error, and A0 for two or more errors.
x
4 or 5
fo 15
49
65
36
15
fe 20.89
56.23
60.55
32.61 9.72
R1
Note: R1 is for combining 2 columns.

EITHER
(15 20.89) 2 (49 56.23) 2

(15 9.72) 2
6.14
+
+ ... +
20.89
56.23
9.72
52% (4) = 9.488 , v = 4
2
calc
=
(M1)A1
A1A1
OR
2
by GDC with v = 4, GDC
6.14, p = 0.189
(M1)A1A1A1
THEN
2
hence since 52% (4) = 9.488 > GDC
(or p = 0.189 > 0.05) then accept H0 R1
[24]
81.
(a)
ax b (mod p)
ap2 ax ap2 b (mod p)
ap1x ap2 b(mod p)
but ap1 1(mod p) by Fermats little theorem
x = ap2 b (mod p)
M1A1
A1
R1
AG
Note: Award M1 for some correct method and A1 for correct statement.
72
(b)
(i)
(ii)
17x 14(mod 21)

x 1719 14 (mod 21)
176 1 (mod 21)
x (1)3 17 14 (mod 21)
x = 7 (mod 21)
x 7 (mod 21)
x = 7 + 21t, t
17(7 + 21t) + 21y = 14
119 + 357t + 21y = 14
21y = 105 357t
y = 5 17t
M1A1
A1
A1
A1
M1A1
A1
A1
A1
[14]
82.
(a)
EITHER
lim cot x
x 0 x
tan x x
= lim
x 0 x tan x
sec 2 x 1
, using lHopital
= lim
x 0 x sec 2 x + tan x
2 sec x tan x
= lim
x 0 2 sec 2 x + 2 x sec 2 x tan x
=0
M1A1
A1
A1A1
A1
OR
lim cot x
x 0 x
sin
x
x cos x
= lim
x 0
x sin x
x
sin
x
= lim
, using lHopital
x 0 sin x + x cos x
sin x + x cos x
= lim
x 0 2 cos x x sin x
=0
M1A1
A1
A1A1
A1
73
(b)
un =
( x + 2) n
A1
3n n
( x + 2) n +1
u n +1 3 n +1 (n + 1) ( x + 2)n
=
=
un
3(n + 1)
( x + 2) n
M1A1
3n n
( x + 2)n ( x + 2)
lim
=
n 3( n + 1)
3
M1A1
(x + 2)
< 1 5 < x < 1
3
1 1
if x = 1, series is 1 + + + ... which diverges
2 3
1 1
(1) n
if x = 5, series is 1 + + ... +
which converges
2 3
n
hence interval is 5 x < 1
(c)
(i)
A1
A1
A1
f(x) = ln(1 + sinx), f(0) = 0

A1
cos x
f(x) =
, f(0) = 1,
A1
1 + sin x
sin x(1 + sin x) cos 2 x (1 + sin x)
1
f(x) =
, f(0) = 1A1
=
=
2
2
1 + sin x
(1 + sin x)
(1 + sin x)
f(x) =
cos x
(1 + sin x) 2
ln(1 + sin x) x
(ii)
M1A1
, f(0) = 1,
A1
x2 x3
+
...
2
6
A1
sin x = sin (x)

so, ln (1 sin x) x
M1
2
x
x
...
2
6
A1
74
(iii)
ln (1 + sin x) ln (1 sin x)
x3
1 + sin x
= ln
2x +
3
1 sin x

1+
6
2
let x = then, ln
= ln 3 2 +
1
6
3
6
1
= 1 +
3 216
M1A1
3
M1A1A1
AG
[28]
83.
(a)
(i)
+6
0
1
2
3
4
5
0
0
1
2
3
4
5
1
1
2
3
4
5
0
2
2
3
4
5
0
1
3
3
4
5
0
1
2
4
4
5
0
1
2
3
5
5
0
1
2
3
4
the table is closed.

the identity is 0
0 is in every row and column once so each element has
a unique inverse
addition is associative
therefore {S, +6}is a group
(ii)
(iii)
(b)
A2
A1
A1
A1
A1
R1
1+1+1+1+1+ 1=0
1+1+1+1+1= 5
1+1+1+1=4
1+1+1=3
1+1=2
so 1 is a generator of {S, +6} and the group is cyclic
(since 5 is the additive inverse of 1) 5 is also a generator
M1
{0, 2, 4}
A1
if a is a generator of group (G, *) then so is a1

if (G, *) has exactly one generator a then a = a1
so a2 = e and G = {e, a} {e}
so cyclic group with exactly one generator cannot have more
than two elements
A1
A1
A1
A1
A1R1
AG
75
(c)
every element of a group has a unique inverse so is a bijection

(ab) = (ab)1 = b1a1
if H is Abelian then it follows that
b1a1 = a1b1 = (a)(b)
so is an isomorphism
if is an isomorphism, then
for all a, b H, (ab) = (a)(b)
(ab)1 = a1b1
b1a1 = a1b1
so H is Abelian
A1
M1A1
A1
R1
M1
M1
A1
R1
[24]
84.
using the factor theorem or long division

A + B 1 + 6 = 0 A B = 5
8A + 4B + 2 + 6 = 0 2A + B = 2
3A = 3 A = 1
B = 4
M1
A1
A1
A1
A1
N3
Note: Award M1A0A0A1A1 for using (x 3) as the third factor, without

justification that the leading coefficient is 1.
[5]
85.
g(x) = 0 or 3
x = 1 or 4 or 1 or 2
(M1)(A1)
A1A1
Notes: Award A1A1 for all four correct values,

A1A0 for two or three correct values,
A0A0 for less than two correct values.
Award M1 and corresponding A marks for correct attempt to
find expressions for f and g.
[4]
86.
(a)
for using normal vectors

1 1

2 0 = 1 1 = 0
1 1

hence the two planes are perpendicular
(M1)
M1A1
AG
76
(b)
METHOD 1
EITHER
i j k
1 2 1 = 2i 2j 2k
1 0
M1A1
OR
a

if b is normal to 3, then
c

a + 2b c = 0 and a + c = 0
a solution is a = 1, b = 1, c = 1
M1
A1
THEN
3 has equation x y z = d
as it goes through the origin, d = 0 so 3 has equation x y z = 0
(M1)
A1
Note: The final (M1)A1 are independent of previous working.

METHOD 2
0 1 1

r = 0 + s 2 + t 0
0 1 1

A1(A1)A1A1
[7]
87.
22x2 = 2x + 8
1 2x
2 = 2x + 8
4
22x 4 2x 32 = 0
(2x 8)(2x + 4) = 0
2x = 8 x = 3
(M1)
(A1)
A1
(M1)
A1
Notes: Do not award final A1 if more than 1 solution is given.

[5]
88.
(a)
an attempt to use either asymptotes or intercepts

1
a = 2, b = 1, c =
2
(M1)
A1A1A1
77
(b)
A4
Note: Award A1 for both asymptotes,
A1 for both intercepts,
A1, A1 for the shape of each branch, ignoring shape at (x = 2).
[8]
89.
(a + b)(a b) = a a + b a a b b b
=aabb
= |a|2 |b|2 = 0 since |a| = |b|
the diagonals are perpendicular
M1
A1
A1
R1
Note: Accept geometric proof, awarding M1 for recognizing OACB is a

rhombus, R1 for a clear indication that (a + b) and (a b) are the
diagonals, A1 for stating that diagonals cross at right angles and
A1 for hence dot product is zero.
Accept solutions using components in 2 or 3 dimensions.
[4]
78
90.
1
6
25 1
P (six in third throw) =

36 6
2
25 1
P (six in fifth throw) =
36 6
P (six in first throw) =
(A1)
(M1)(A1)
1 25 1 25 1
+ + + ...
6 36 6 36 6
25
recognizing that the common ratio is
36
1
P(A obtains first six) = 6
(by summing the infinite GP)
25
1
36
6
=
11
P(A obtains first six) =
(M1)
(A1)
M1
A1
[7]
x e x = e x x = 0 or 1
91.
attempt to find
dx
(A1)
M1
V1 = e 2 xdx
0
= e 2 x 2
2
0
=
e 2
2
A1
79
V2 =
xe
2x
dx
= xe 2x
2
0
1 2 x
e dx
M1A1
Note: Award M1 for attempt to integrate by parts.

1
e 2
1
e 2x
=
2
4
0
finding difference of volumes
volume = V1 V2
M1
= e 2x
4
0
1
= (e2 1)
4
A1
[7]
92.
(a)
1
1
du = 2 dx
x
x
du
dx = 2
u
1
1
1
du
d
x
=
2
2
2
1 1+ x
1
1 u
1+
u
u=
M1
A1
A1M1A1
Note: Award A1 for correct integrand and M1A1 for correct limits.
=
(b)
1 + u
1
du (upon interchanging the two limits)
arctan x1 = arctan u 11
AG
A1

1
= arctan
4 4
1
arctan or + arctan =
2
arctan
A1
AG
[7]
80
93.
EITHER
let yi = xi 12
x = 10 y = 2
x = y = 3
10
2
i
i =1
y =9
10
10
M1A1
A1
2
i
M1A1
= 10(9 + 4) = 130
A1
i =1
OR
10
( x i 12) 2 =
i =1
10
x i 24
i =1
10
x = 10
10
i =1
x i + 144
10
M1A1
i =1
= 100
A1
i =1
10
x = 3,
x
i =1
10
10
2
i
2
i
x =9
= 10(9 + 100)
(M1)
A1
i =1
10
(x
12) 2 = 1090 2400 + 1440 = 130
A1
i =1
[6]
94.
(a)
x2 + 5x + 4 = 0 x = l or x = 4
so vertical asymptotes are x = 1 and x = 4
as x then y 1 so horizontal asymptote is y = 1
(b)
x2 5x + 4 = 0 x = 1 or x = 4
x=0 y=1
so intercepts are (1, 0), (4, 0) and (0, 1)
(M1)
A1
(M1)A1
A1
81
(c)
(i)
f(x) =
=
( x 2 + 5 x + 4)(2 x 5) ( x 2 5 x + 4)(2 x + 5)
( x 2 + 5 x + 4) 2
10 x 2 40
2
( x + 5 x + 4)
f(x) = 0 x = 2
10( x 2)( x + 2)
=
( x 2 + 5 x + 4) 2
so the points under consideration are (2, 9) and 2,

9
looking at the sign either side of the points (or attempt

to find f(x))
e.g. if x = 2 then (x 2)(x + 2) > 0 and if x = 2+ then
(x 2)(x + 2) < 0, therefore (2, 9) is a maximum
(ii)
e.g. if x = 2 then (x 2)(x + 2) < 0 and if x = 2+ then

1
(x 2)(x + 2) > 0, therefore 2, is a minimum

9
M1A1A1
A1
M1
A1A1
M1
A1
A1
Note: Candidates may find the minimum first.

(d)
A3
Note: Award A1 for each branch consistent with and including the
features found in previous parts.
82
(e)
one
A1
[20]
95.
(a)
ae
ax
dx = 1
[ e ]
ax 1
0
M1A1
2
1
= 1
M1A1
2
1
ea + 1 = 1
A1
Note: Accept e0 instead of 1.

ea =
a
e =
1
2
2
1
1
a = ln 2 2 accept a = ln 2 2
1
a = ln 2
2
(b)
ae ax dx =
[ e ]
1
2
1
2
1
eMa + 1 =
2
1
eMa =
2
Ma = ln 2
ln 2
M=
=2
a
ax M
0
A1
AG
M1A1
A1
A1
83
(c)
P(1 < X < 3) =

= e3a + ea
ae ax dx
M1A1
A1
P(1 < X < 3)

P(X < 3|X > 1) =
P( X > 1)
M1A1
e 3a + e a
1 P( X < 1)
A1
e 3a + e a
1
A1
2
2 (e3a + ea)
1
3

2 2 2 + 2 2
=
=
=
A1
1
2
Note: Award full marks for P (X < 3X > 1) = P (X < 2) =
A1
1
or quoting
2
properties of exponential distribution.

[20]
96.
(a)
sin (2n + 1)x cosx cos (2n + 1)x sinx = sin (2n + 1)x x
= sin 2nx
M1A1
AG
84
(b)
if n = 1
LHS = cos x
sin 2 x 2 sin x cos x
=
RHS =
= cos x
2 sin x
2 sin x
so LHS = RHS and the statement is true for n = 1
M1
M1
R1
M1
Note: Only award M1 if the word true appears.

Do not award M1 for let n = k only.
Subsequent marks are independent of this M1.
so cos x + cos 3x + cos 5x + ... + cos(2k 1)x =
sin 2kx
2 sin x
if n = k + 1 then
cos x + cos 3x + cos 5x + ... + cos(2k 1)x + cos(2k + 1)x
sin 2kx
=
cos (2k + 1)x
2 sin x
sin 2kx + 2 cos(2k + 1) x sin x
=
2 sin x
sin(2k + 1) x cos x cos(2k + 1) x sin x + 2 cos(2k + 1) x sin x
=
2 sin x
sin(2k + 1) x cos x + cos(2k + 1) x sin x
=
2 sin x
sin(2k + 2) x
=
2 sin x
sin 2(k + 1) x
=
2 sin x
so if true for n = k, then also true for n = k + 1
as true for n = 1 then true for all n +
M1
A1
M1
M1
A1
M1
A1
R1
Note: Final R1 is independent of previous work.
85
(c)
sin 4 x 1
=
2 sin x 2
sin 4x = sin x
4x = x x = 0 but this is impossible
4x = x x =
5
2
4x = 2 + x x =
3
3
4x = 3 x x =
5
for not including any answers outside the domain
M1A1
A1
A1
A1
R1
Note: Award the first M1A1 for correctly obtaining 8 cos3 x 4 cos x 1 = 0
or equivalent and subsequent marks as appropriate including the
1 1 5
.
answers arccos ,
2
[20]
97.
(a)
the total area under the graph of the pdf is unity

area = c
xx
0
(A1)
dx
1
1
1
= c x 2 x 3
3 0
2
c
=
6
c=6
(b)
E(X) = 6
x
0
x 3 dx
1 1 1
= 6 =
3 4 2
A1
A1
(M1)
A1
Note: Allow an answer obtained by a symmetry argument.

[5]
98.
(a)
attempt at completing the square

3x2 6x + 5 = 3(x2 2x) + 5 = 3 (x 1)2 1 + 5
= 3(x 1)2 + 2
(a = 3, b = 1, c = 2)
(M1)
(A1)
A1
86
(b)
99.
(a)
definition of suitable basic transformations:

T1 = stretch in y direction scale factor 3
1
T2 = translation
0
0
T3 = translation
2
2y + 8x = 4
3x + 2y = 7
2x + 6 2x = 6
A1
A1
A1
[6]
M1
A1
Note: Award M1 for attempt at components, A1 for two correct equations.

No penalty for not checking the third equation.
solving : x = 1, y = 2
(b)
A1
4 4

a + 2b= 3 + 2 2
2 2

4

= 7
6

a + 2b = 4 2 + (7) 2 + 6 2
=
101
(M1)
A1
[5]
4
100. recognition of X ~ B 6,
7
3
3
6 4 3
4 3 33
P(X = 3) = = 20
7 6
3 7 7
2
4
6 4 3
4 2 34
P(X = 2) = = 15
7 6
2 7 7
P( X = 3) 80 16
=
=
P( X = 2) 45 9
(M1)
A1
A1
A1
[4]
101. (a)
1 3 3 2 18 14
BA =
2
2
5
4
4
A2
87
Note: Award A1 for one error, A0 for two or more errors.

(b)
det(BA) = (72 56) = 16
(c)
EITHER
A(A1B + 2A1)A = BA + 2A
24 18
=
6 4
(M1)A1
(M1)(A1)
A1
OR
1 4 2
2 5 3
an attempt to evaluate
1 0 16 4 2
A1B + 2A1 =
2 1 21 5 3
6
4
=
4.5 7.5
A1 =
6 3 2
3 2 4
A(A1B + 2A1)A =
5 4 4.5 7.5 5 4
3 3 3 2 24 18
=
2 0 5 4 6 4
102. sin x + = sin x cos + cos x sin

3
3
sin x cos + cos x sin = 2 sin x sin

3
3

3
1
3
3
sin x +
cos x = 2
sin x
2
2
2
dividing by cos x and rearranging
3
tan x =
2 3 1
rationalizing the denominator
11 tan x = 6 + 3
(A1)
(M1)
A1
[7]
(M1)
A1
M1
A1
M1
A1
[6]
103. (a)
du
2
= 2x 2
u = x 2 x 1.5;
dx
df df du
=
= ex (2x 2)
dx du dx
2
= 2(x 1) e x 2 x 1.5
(M1)
A1
88
(b)
dy ( x 1) 2( x 1)e x 2 x 1.5 1 e x
=
dx
( x 1) 2
=
2x 2 4x + 1
( x + 1)
ex
2 x 1.5
dy
=0
dx
1
4 8
x=1
accept x =
2
4
minimum occurs when
a=1+
1
2
accept a = 4 + 8
2 x 1.5
M1A1
(A1)
(M1)
A1
R1
[8]
104. EITHER
differentiating implicitly:
dy
dy
+ey
1 ey xey
=1
dx
dx
at the point (c, ln c)
dy
1
1 dy
c
+c
=1
c
c dx
dx
dy 1
= (c 1)
dx c
M1A1
M1
(A1)
89
OR
reasonable attempt to make expression explicit
xey + ey = 1 + x
x + e2y = ey(1 + x)
e2y ey(1 + x) + x = 0
(ey 1)(ey x) = 0
ey = 1, ey = x
y = 0, y = ln x
(M1)
(A1)
A1
Note: Do not penalize if y = 0 not stated.
dy 1
=
dx 2
gradient of tangent =
1
c
A1
Note: If candidate starts with y = ln x with no justification,

award (M0)(A0)A1A1.
THEN
the equation of the normal is
y ln c = c(x c)
x = 0, y = c2 + 1
c2 + 1 ln c = c2
ln c = 1
c=e
M1
(A1)
A1
[7]
105. EITHER
attempt at integration by substitution
(M1)
using u = t + 1, du = dt, the integral becomes

2
(u 1) ln udu
A1
then using integration by parts
M1
2
u 2
(u 1) ln udu =
u ln u
1
2
1
2u2
2 u u du
A1
u 2
=
u
4
1
1
=
(accept 0.25)
4
(A1)
A1
90
OR
attempt to integrate by parts
correct choice of variables to integrate and differentiate
1
t 2
t ln(t + 1)dt = ln(t + 1)

0
2
0
1
t 2
1
= ln(t + 1)
2
0 2
1t2
1
dt
t +1
A1
t 1 + t + 1dt
A1
(M1)
M1
t 2
1 t 2
= ln(t + 1) t + ln(t + 1)
2
0 2 2
0
1
=
(accept 0.25)
4
(A1)
A1
[6]
106. (a)
Note: Interchange of variables may take place at any stage.

for the inverse, solve for x in
2x 3
y=
x 1
y(x 1) = 2x 3
yx 2x = y 3
x(y 2) = y 3
y 3
x=
y2
( x) =
x3
(x 2)
x2
M1
(A1)
A1
Note: Do not award final A1 unless written in the form f1(x) = ...
(b)
f1(x) = 1 + f1(x) leads to

x3
2
= 1
x2
8
x=
3
(M1)A1
A1
[6]
107. (a)
(b)
(i)
1 2 + 2 3 + ... + n(n + 1) =
(ii)
LHS = 40; RHS = 40
1
n(n + 1)(n + 2)
3
the sequence of values are:

5, 7, 11, 19, 35 or an example
35 is not prime, so Bills conjecture is false
R1
A1
A1
R1AG
91
(c)
P(n) : 5 7n + 1 is divisible by 6
P(1): 36 is divisible by 6 P(1) true
assume P(k) is true (5 7k + 1 = 6r)
A1
M1
Note: Do not award M1 for statement starting let n = k.

Subsequent marks are independent of this M1.
consider 5 7k+1 + 1
M1
= 7(6r 1) + 1
(A1)
= 6(7r 1) P(k + 1) is true
A1
P(1) true and P(k) true P(k + 1) true, so by MI P(n) is true for all n +R1
Note: Only award R1 if there is consideration of P(1), P(k) and P (k + 1)
in the final statement.
Only award R1 if at least one of the two preceding A marks has
been awarded.
[10]
108. (a)
(i)
(ii)
use of a b = abcos
a b = 1
a = 7, b = 5
1
cos =
35
(M1)
(A1)
(A1)
A1
the required cross product is

i
j k
2 = 18i 24j 18k
M1A1
0 3 4
(iii)
using r n = p n the equation of the plane is

18x 24y 18z = 12 (3x 4y 3z = 2)
(M1)
A1
(iv)
recognizing that z = 0
2
1
x-intercept = , y-intercept =
3
2
2 1 1 1
area = =
3 2 2 6
(M1)
(A1)
A1
92
(b)
(i)
p p = ppcos 0
= p2
(ii)
consider the LHS, and use of result from part (i)

p + q2 = (p + q)(p + q)
=pp+pq+qp+qq
= p p + 2p q + q q
= p2 + 2p q + q2
(iii)
M1A1
AG
M1
(A1)
A1
AG
EITHER
use of p q pq
M1
so 0 |p + q|2 = p2 + 2p q + q2 p2 + 2pq+q2A1
take square root (of these positive quantities) to establish
A1
p + qp+q
AG
OR
M1M1
Note: Award M1 for correct diagram and M1 for correct labelling
of vectors including arrows.
since the sum of any two sides of a triangle is greater than the third side,
p + q > p + q
A1
when p and q are collinear p + q = p + q
AG
p + q p + q
[19]
109. (a)
(i)
2
2
= cos + isin
3
3
2
2
= cos 3 + isin 3
3
3
= cos 2 + i sin 2
=1
3
(M1)
A1
AG
93
(ii)
(b)
(i)
2
2
4
4
1 + + 2 = 1 + cos + i sin + cos + i sin M1A1
3
3
3
3
1
3 1
3
= 1 + +i
A1
i
2
2 2
2
=0
AG
+e
i +
3
+e
2
i
3
i +
3
4
i
= e i + e i e
+ e i e 3
2
4

i
i
i
3
+ e 3
= e 1+ e

= ei(1 + + 2)
=0
(M1)
A1
AG
(ii)
A1A1
Note: Award A1 for one point on the imaginary axis and another
point marked with approximately correct modulus and argument.
Award A1 for third point marked to form an equilateral triangle
centred on the origin.
(c)
(i)
attempt at the expansion of at least two linear factors

(z 1)z2 z( + 2) + 3 or equivalent
use of earlier result
F(z) = (z 1)(z2 + z + 1) = z3 1
(M1)
(A1)
(M1)
A1
94
(ii)
equation to solve is z3 = 8
z = 2, 2, 22
(M1)
A2
Note: Award A1 for 2 correct solutions.

[16]
110. (a)
the differential equation is separable and can be written as
y dy = cos
1 + cos 2 x
dx
=
2
2
xdx (or equivalent)
(i)
(ii)
A1A1
M1
A1
recognizing use of (1 + tan x)2

(1 + tan x)2 = 1 + 2 tan x + tan2 x 1 + tan2 x = sec2 x
(since all terms are positive)
(1 + tan x)2 sec2 x
sec2 x = 1 + tan2 x 1
(1 + tan x)2 sec2 x 1
since all terms are positive, taking square root gives
1 sec x 1 + tan x
4 dx
0
x 04
4
0
sec xdx
4 1+
0
tan xdx
4 sec xdx x ln cos

0
1
4 sec xdx
ln
0
4
2
sec xdx
(M1)
A1
A1
R1
AG
M1
x 04
4
0
A1
A1
1 1
1
= x + sin 2 x(+C )
y 2
4
when x = 0, y = 1
C=1
1
y=
1
1
x + sin 2 x + 1
2
4
(b)
(M1)
1
+ ln 2
4 2
M1A1
A1
AG
[15]
95
111. a = 3
c=2
2
=3
b
(M1)
2
(= 2.09)
3
A1
period =
b=
A1
A1
[4]
112. EITHER
using row reduction (or attempting to eliminate a variable)
2 1 3 2
3 1 2 2 2 R 2 3R1
1 2 a b 2 R3 + R1
2 1
3
2
5 10 R 2 / 5
0 5
0 3 2a + 3 2b + 2
M1
A1
Note: For an algebraic solution award A1 for two correct equations in two variables.
2 1
3
2
1
2
0 1
0 3 2a + 3 2b + 2 R3 3R 2
2 1
3
2
1
2
0 1
0 0 2a + 6 2b + 8
Note: Accept alternative correct row reductions.

recognition of the need for 4 zeroes
so for multiple solutions a = 3 and b = 4
M1
A1A1
96
OR
2
3
1 3
1 2 =0
M1
2(a 4) + (3a + 2) + 3(6 + 1) = 0

5a + 15 = 0
a = 3
2 1 2
3 1 2 = 0
1 2
b
2(b + 4) + (3b 2) + 2(6 + 1) = 0
5b + 20 = 0
b = 4
113. AC = AB = 10 (cm)
triangle OBC is equilateral
BC = 6 (cm)
A1
M1
A1
A1
[5]
A1
(M1)
A1
EITHER
3
10
BAC = 34.9 (accept 0.609 radians)
C = 2 arcsin
BA
M1A1
A1
OR
2
2
2
C = 10 + 10 6 = 164
cos BA
2 10 10
200
BAC = 34.9 (accept 0.609 radians)
M1A1
A1
Note: Other valid methods may be seen.

[6]
97
114. (a)
z3 = 2 2 e
z1 =
3i
4
(M1)(A1)
i
2e 4
A1
adding or subtracting
z2 =
i 2 i
+
2e 4 3
z3 =
i 2 i
2e 4 3
2i
3
M1
11i
2e 12
A1
5 i
2e 12
A1
19 i
2e 12
Notes: Accept equivalent solutions e.g. z3 =

Award marks as appropriate for solving (a + bi)3 = 2 + 2i.
Accept answers in degrees.
(b)
i
2e 4
= 2 1 + i
2
2
=1+i
A1
AG
Note: Accept geometrical reasoning.

[7]
(A + B)2 = A2 + AB + BA + B2
A2
(b)
(A kI)3 = A3 3kA2 + 3k2A k3I
A2
(c)
CA = B C = BA1
A2
115. (a)
Note: Award A1 in parts (a) to (c) if error is correctly identified, but not corrected.
[6]
116. (100 + 101 + 102 + ... + 999) (102 + 105 + ... + 999)
900
300
(100 + 999)
(102 + 999)
=
2
2
= 329 400
(M1)
M1A1A1
A1
N5
Note: A variety of other acceptable methods may be seen including

300
600
(201 + 1995) or
(100 + 998) .
for example
2
2
[5]
98
117. (a)
(b)
There are 3! ways of arranging the Mathematics books, 5! ways

of arranging the English books and 4! ways of arranging the
Science books.
Then we have 4 types of books which can be arranged in 4! ways.
3! 5! 4 4! = 414 720
There are 3! ways of arranging the subject books, and for each
of these there are 2 ways of putting the dictionary next to the
Mathematics books.
3! 5! 4! 3! 2 = 207 360
(A1)
(A1)
(M1)A1
(M1)(A1)
A1
[7]
118. weight of glass = X

X ~ N(160, 2)
P(X < 160 + 14) = P(X < 174) = 0.75
(M1)(A1)
Note: P(X < 160 14) = P(X < 146) = 0.25 can also be used.
14
P Z < = 0.75

14
= 0.6745...
= 20.8
(M1)
(M1)(A1)
A1
[6]
119. (a)
x 0 and x 16
A1A1
99
(b)
graph not to scale
(M1)
finding crossing points

e.g. 4 x2 = 4 x
x = 0 or x = 1
0 x 1 or x > 16
(A1)
A1A1
Note: Award M1A1A1A0 for solving the inequality only for the case x < 16
[6]
120.
3
x 3 = 0 when x = 2
2
the equation of the parabola is y = p(x 2)2 3
3
through (0, 3) 3 = 4p 3 p =
2
3
3
the equation of the parabola is y = ( x 2) 2 3 = x 2 6 x + 3

2
2
area = 2
3 3 2
3 x x 6 x + 3 dx
2
2
Note: Award M1 for recognizing symmetry to obtain 2

M1 for the difference,
A1 for getting all parts correct.
=
(3 x 2 + 9 x)dx
(A1)
(M1)
(M1)
A1
M1M1A1
A1
[8]
100
121. (a)
EITHER
normal to plane given by
i
j k
M1A1
6 3 2
= 12i + 8j 24k
equation of is 3x + 2y 6z = d
as goes through (2, 3, 2) so d = 12
:3x + 2y 6z = 12
A1
(M1)
M1A1
AG
OR
x = 2 + 2 + 6
y = 3 + 3 3
z = 2 + 2 + 2
eliminating
x + 2y = 4 + 8
2y + 3z = 12
eliminating
3(x + 2y) 2(2y + 3z) = 12
: 3x + 2y 6z = 12
(b)
therefore A(4, 0, 0), B(0, 6, 0) and C(0, 0, 2)
M1A1A1
M1A1A1
AG
A1A1A1
Note: Award A1A1A0 if position vectors given instead of coordinates.
(c)
area of base OAB =

V=
(d)
(e)
1
4 6 = 12
2
1
12 2 = 8
3
3 1

2 0 = 3 = 7 1 cos
6 0

3
= arccos
7
3
so = 90 arccos = 25.4 (accept 0.443 radians)
7
d = 4 sin =
12
(= 1.71)
7
M1
M1A1
M1A1
M1A1
(M1)A1
101
(f)
8=
1 12
area area = 14
3 7
M1A1
Note: If answer to part (f) is found in an earlier part, award M1A1,

regardless of the fact that it has not come from their answers
to part (c) and part (e).
[20]
122. (a)
(b)
(c)
number of patients in 30 minute period = X

X ~ Po(3)
P(X = 0) = 0.0498
(A1)
(M1)A1
number of patients in working period = Y

Y ~ Po(12)
P (X < 10) = P (X 9) = 0.242
(A1)
(M1)A1
number of working period with less than 10 patients = W

W ~ B(6, 0.2424...)
P(W 3) = 0.966
(M1)(A1)
(M1)A1
Note: Accept exact answers in parts (a) to (c).

(d)
number of patients in t minute interval = X

X ~ Po(T)
P(X 2) = 0.95
P(X = 0) + P(X = 1) = 0.05
eT(1 + T) = 0.05
T = 4.74
t = 47.4 minutes
(M1)(A1)
(M1)
(A1)
A1
[15]
123. (a)
B = (allied)
OA
recognizing OAB as an isosceles triangle
O =
so AB
BOC = (alternate)
A1
M1
A1
AG
Note: This can be done in many ways, including a clear diagram.

(b)
area of trapezium is T = areaBOC + areaAOB

1
1
= r 2 sin( ) + r 2 sin(2 )
2
2
1 2
1 2
= r sin r sin 2
2
2
(M1)
M1A1
AG
102
(c)
(i)
(ii)
dT 1 2
= r cos r 2 cos 2
d 2
1
for maximum area r 2 cos r 2 cos 2 = 0
2
cos = 2 cos 2
max = 2.205...
1
1
sin max sin 2 max = 0.880
2
2
M1A1
M1
AG
(A1)
A1
[11]
124. (a)
dv
v2
=
32
dt
200
T
dt =
0
40
T = 200
(b)
(i)
(ii)
v 2 6400
=
200
200
v + 80 2
40
1
v 2 + 80 2
dv
M1A1A1
dv
AG
dv dv ds
=
dt ds dt
dv
= v
ds
a=
dv v 2 80 2
=
ds
200
S
V
200v
ds = 2
dv
0
40
v + 80 2
S
40
200v
ds =
dv
2
0
V v + 80 2
40
v
S = 200
dv
V v 2 + 80 2
v
AG
(M1)
M1A1A1
M1
letting V = 0
distance = 200
A1
(M1)
40
dv = 22.3 metres
v + 80 2
40
1
time = 200
dv = 1.16 seconds
0 v 2 + 80 2
A1
18n 10 (or equivalent)
A1
125. (a)
R1
(c)
(M1)
A1
[14]
103
(b)
(18r 10) (or equivalent)
A1
(c)
by use of GDC or algebraic summation or sum of an AP
(M1)
15
(18r 10) = 2010
A1
[4]
126. (a)
(b)
p + q = 0.44
2.5p + 3.5q = 1.25
p = 0.29, q = 0.15
use of Var(X) = E(X2) E(X)2
Var(X) = 2.10
A1
(M1)A1
A1
(M1)
A1
[6]
127. (a)
21 15
required to solve P Z <

= 0.8

6
= 0.842... (or equivalent)
= 7.13 (days)
(b)
P (survival after 21 days) = 0.337
(M1)
(M1)
A1
N1
(M1)A1
[5]
128. (a)
rewrite the equation as (4x 1)ln 2 = (x + 5)ln 8 + (1 2x) log216

(M1)
(4x 1)ln 2 = (3x + 15)ln 2 + 4 8x
(M1)(A1)
4 + 16 ln 2
x=
A1
8 + ln 2
104
(b)
x = a2
a = 1.318
(M1)
A1
Note: Treat 1.32 as an AP.

Award A0 for .
[6]
129. use of cosine rule: BC =
(8 2 + 7 2 2 7 8 cos 70) = 8.6426...
(M1)A1
Note: Accept an expression for BC2.

BD = 5.7617... (CD = 2.88085...)
7 sin 70
use of sine rule: B = arcsin
= 49.561...
BC
use of cosine rule: AD =
A1
( C = 60.4387...)
8 2 + BD 2 2 BD 8cosB = 6.12 (cm)
(M1)A1
A1
Note: Scale drawing method not acceptable.

[6]
130. (a)
required to solve e + e = 0.123

solving to obtain = 3.63
M1A1
A2
N2
Note: Award A2 if an additional negative solution is seen but A0 if only

a negative solution is seen.
(b)
P(0 < X < 9)

= P(X 8) P(X = 0) (or equivalent)
= 0.961
(M1)
A1
[6]
131. (a)
use GDC or manual method to find a, b and c

obtain a = 2, b = 1, c = 3 (in any identifiable form)
(M1)
A1
105
(b)
use GDC or manual method to solve second set of equations

4 11t
7t
;y=
obtain x =
, z = t (or equivalent)
2
2
2 5.5

r = 0 + t 3.5 (accept equivalent vector forms)

0 1

(M1)
(A1)
M1A1
Note: Final A1 requires r = or equivalent.

[6]
132. (a)
(b)
the expression is
(2n)!
n!
(n 3)!3! (2n 2)!2!

n(n 1)(n 2) 2n(2n 1)
6
2
2
n(n 15n + 8)
n 3 15n + 8n)
=
6
6
the inequality is
n 3 15n 2 + 8n
> 32n
6
attempt to solve cubic inequality or equation
n3 15n2 184n > 0 n(n 23)(n + 8) > 0
n > 23 (n 24)
(A1)
M1A1
A1
(M1)
A1
[6]
133. (a)
using de Moivres theorem

1
zn + n = cos n + i sin n + cos n i sin n (= 2 cos n), imaginary
z
part of which is 0
M1A1
1
so Im z n + n = 0
AG
z
106
(b)
z 1 cos + i sin 1
=
z + 1 cos + i sin + 1
(cos 1 + i sin )(cos + 1 i sin )
=
(cos + 1 + i sin )(cos + 1 i sin )
M1A1
Note: Award M1 for an attempt to multiply numerator and denominator

by the complex conjugate of their denominator.
2
z 1 (cos 1)(cos + 1) + sin
Re
=
real denominator
z +1
M1A1
Note: Award M1 for multiplying out the numerator.
cos 2 + sin 2 1
real denominator
=0
A1
AG
[7]
134. (a)
the distance of the spot from P is x = 500 tan

the speed of the spot is
dx
d
= 500 sec 2
(= 4000 sec2 )
dt
dt
d
= 8
when x = 2000, sec2 = 17 ( = 1.32581...)
dt
dx
= 500 17 8
dt
speed is 214000 (metres per minute)
A1
M1A1
M1A1
AG
Note: If their displayed answer does not round to 214 000, they lose the final A1.
(b)
d
d
= 8000 sec tan
or 500 2sec 2 tan
2
dt
dt
dt
d 2
since
=
0
dt 2
= 43000000 (= 4.30 107) (metres per minute2)

d2x
M1A1
A1
[8]
135. (a)
(b)
solving to obtain one root: 1, 2 or 5

obtain other roots
A1
A1
D = x [5, 2] [1, ) (or equivalent)
M1A1
Note: M1 is for 1 finite and 1 infinite interval.
(c)
coordinates of local maximum 3.73 ( 2
3 ), 3.22( 6 3 )
A1A1
107
(d)
use GDC to obtain one root: 1.41, 3.18 or 4.23

obtain other roots
A1
A1
(e)
A1A1A1
Note: Award A1 for shape, A1 for max and for min clearly in correct
places, A1 for all intercepts.
Award A1A0A0 if only the complete top half is shown.
(f)
required area is twice that of y = f(x) between 5 and 2

answer 14.9
Note: Award M1A0A0 for
136. (a)
M1A1
A1
N3
f ( x)dx = 7.47... or N1 for 7.47.
(i)
the median height is 1.18
(ii)
the interquartile range is UQ LQ

= 1.22 1.13 = 0.09 (accept answers that round to 0.09)
[14]
A1
A1A1
Note: Award A1 for the quartiles, A1 for final answer.
108
(b)
(i)
1.00 < h 1.05 1.05 < h 1.10 1.10 < h 1.15 1.15 < h 1.20 1.20 < h 1.25 1.25 < h 1.30
5
13
24
19
10
A1A1
Note: Award A1 for entries within 1 of the above values and

A1 for a total of 80.
(c)
137. (a)
(ii)
unbiased estimate of the population mean

5 1.025 + 9 1.075 + 13 1.125 + 24 1.175 + 19 1.225 + 10 1.275
= 1.17
80
A1
unbiased estimate of the population variance
n 2
use of s n21 =
(M1)
s n or GDC
n 1
obtain 0.00470
A1
(i)
P(h 1.15 m) =
(ii)
use of the conditional probability formula P(A | B) = P (A B) / P(B)(M1)

18 27
obtain
(A1)(A1)
80 80
2
18
(0.667) allow
(0.692)
=
A1
3
26
27
26
(0.3375 or 0.338) (allow
(0.325))
80
80
1 2
2
2
the sequence of areas is 2, 2k, 2k2...
the sum of these areas is 2(1 + k + k2 + ...)
2
=
= 4
1 k
hence = 2(1 k)
the area of the first sector is
A1
[13]
(A1)
(A1)
(M1)
M1A1
AG
Note: Accept solutions where candidates deal with angles instead of area.
109
(b)
the perimeter of the first sector is 4 + 2

the perimeter of the third sector is 4 + 2k2
the given condition is 4 + 2k2 = 2 +
which simplifies to 2 = (1 2k2)
eliminating , obtain cubic in k: (1 k) (1 2k2) 1 = 0
or equivalent
solve for k = 0.456 and then = 3.42
(A1)
(A1)
M1
A1
A1
A1A1
[12]
138. (a)
(b)
g f(x) =
A1
1+ e x
x
1<1+e <
range g f is ]0, 1[
(M1)
A1
N3
Note: Interchange of variables and rearranging can be done in either order.

attempt at solving y =
rearranging
1 y
ex =
y
1
1+ e x
1 x
(g f)1(x) = ln
M1
M1
A1
Note: The A1 is for RHS.

domain is ]0, 1[
A1
Note: Final A1 is independent of the M marks.
(c)
(i)
y = f g h = 1 + ecos x
dy
= sin xecos x
dx
= (1 y)sin x
M1A1
M1A1
AG
Note: Second M1A1 could also be obtained by solving the differential

equation.
110
(ii)
EITHER
rearranging
y sin x = sin x
dy
dx
A1
dy
y sin xdx = sin xdx dxdx
M1
= cos x y(+ c)
= cos x ecos x(+ d)
A1
A1
OR
y sin xdx = (1 + e ) sin xdx

= sin xdx + sin x e dx
cos x
A1
cosx
Note: Either the first or second line gains the A1.

= cos x ecos x(+ d)
(iii)
use of definition of y and the differential equation or

GDC to identify first minimum at x = (3.14...)
A1M1A1
(M1)A1
EITHER
the required integral is
y max
y min
x 2 dx
M1A1
Note: ymax = 1 + e and ymin = 1 + e1 but these do not need to be specified.
x 2 sin xe cosx dx = 4.32... = 13.6
(M1)A1
OR
the required integral is
1+ e
x 2dy
1+ e 1
1+ e
1+ e 1
arccos ln( y 1) 2 dy = 4.32... = 13.6
M1A1
M1A1
Note: 1 + e = 3.7182... and 1 + e1 = 1.3678...

[21]
139. (a)
estimate of = 13.1
estimate of 2 = 0.416
A1
A1
111
(b)
using a GDC (or otherwise), the 95% confidence interval is

[12.6, 13.6]
(M1)
A1A1
Note: Accept open or closed intervals.
(c)
(i)
t=
13.1 12.5
= 2.94
0.6446...
10
v=9
p-value = 2 P(T > 2.9433...)
= 0.0164 (accept 0.0165)
(ii)
(M1)A1
(A1)
(M1)
A1
we accept the null hypothesis (the mean travel time is 12.5 minutes)A1
because 0.0164 (or 0.0165) > 0.01
R1
Note: Allow follow through on their p-value.

[12]
10
140. (a)
let T =
, so that T is Po (10) under H0
(M1)
i =1
P(Type I error) = P T 15| = 1

= 0.0835
M1A1
A2
N3
Note: Candidates who write the first line and only the correct answer
award (M1)M0A0A2.
10
(b)
let T =
so that T is Po(20) under H1
(M1)
i =1
P(Type II error) = P T 14| = 2

= 0.105
M1A1
A2
N3
Note: Candidates who write the first line and only the correct answer
award (M1)M0A0A2.
Note: Award 5 marks to a candidate who confuses Type I and Type II
errors and has both answers correct.
[10]
112
141. P(a X b) =
x
dx
18
M1A1
x2
=
36 a
=
A1
b2 a2
36
(b)
AG
H0 : X has the given distribution; H1: it does not

expected number of values between a and b is 5(b2 a2)
the expected frequencies are
5, 15, 25, 35, 45, 55
A1
(M1)
A2
Note: Award A1 for 5 correct frequencies.
8 2 18 2 24 2 37 2 44 2 49 2
+
+
+
+
+
= 180
5
15
25
35
45
55
= 3.23...
v=5
2
calc
=
(M1)(A1)
(A1)
(A1)
EITHER
A1
OR
p-value = 0.664 (accept 0.665)
A1
THEN
accept the assumption
R1
Note: Allow follow through from their previous working for the R1.
[13]
142. let X, Y, Z denote respectively the weights, in grams, of a randomly

chosen apple, pear, peach
then U = X + Y 2Z is N(115 + 110 2 105, 52 + 42 + 22 32)
(M1)(A1)(A1)
Note: Award M1 for attempted use of U.
i.e. N(15, 77)
we require
P(X + Y > 2Z) = P(U > 0)
= 0.956
A1
M1A1
A2
Note: Award M0A0A2 for 0.956 only.

[8]
113
143. (a)
p = 12/20
mean = np = 3.6
since the distribution of red balls is hypergeometric
with parameters (6, 12, 20)
N n
variance = np (1 p)
N 1
14
= 3.6 0.4
19
= 1.06
(b)
9
P(X = 10) = p5(1 p)5 (= 0.05)
4
(A1)
A1
(M1)
(A1)
(M1)
(A1)
A1
(M1)A1A1
Note: First A1 is for the binomial coefficient. Second A1 is for the rest.
solving by any method, p = 0.297...
A4
Notes: Award A2 for anything which rounds to 0.703.

Do not apply any AP at this stage.
10
P(X = 11) = (0.297...)5 (1 0.297...)6
4
= 0.0586
(M1)A1
A1
Note: Allow follow through for incorrect p-values.

[17]
114
144. (a)
EITHER
consider
f(x) = 2ex + ex > 0 for all x
so f is an injection
M1A1
A1
OR
let 2ex ex = 2ey ey
2(ex ey) + ey ex = 0
2(ex ey) + e(x+y) (ex ey) = 0
(2 + e(x+y))(ex ey) = 0
ex = ey
x=y
M1
A1
Note: Sufficient working must be shown to gain the above A1.

so f is an injection
A1
Note: Accept a graphical justification i.e. horizontal line test.

THEN
(b)
it is also a surjection (accept any justification including graphical)

therefore it is a bijection
R1
AG
let y = 2ex ex
2e2x yex 1 = 0
M1
A1
e =
y y2 +8
4
since ex is never negative, we take the + sign
x + x2 +8
f1(x) = ln
M1A1
R1
A1
[10]
145. (a)
R is reflexive because AI = IA
R is symmetric because AH = HB H1AHH1 = H1HBH1
BH1 = H1A
and H1 is non-singular because H is non-singular
R is transitive because AH = HB and BJ = JC
AHJ = HBJ = HJC
and HJ is non-singular because H and J are non-singular
R1
M1
A1
A1
M1
A1
A1
AG
115
(b)
if ARB, then
det (A) det (H) = det (H) det (B)
det (A) = 0 det (H) det (B) = 0
det (H) 0
det (B) = 0
A1
M1
R1
AG
[10]
146. (a)
(i)
*
1
A3
Note: Award A2 for 15 correct, A1 for 14 correct and A0 otherwise.

(ii)
(iii)
it is a group because:
the table shows closure
multiplication is associative
it possesses an identity 1
justifying that every element has an inverse e.g. all self-inverse
A1
A1
A1
A1
(since * is commutative, 5 * x = y)
so solutions are (1, 5), (3, 7), (5,1), (7, 3)
A2
Notes: Award A1 for 3 correct and A0 otherwise.

Do not penalize extra incorrect solutions.
(b)
Note: It is not necessary to see the Cayley table.
(c)
a valid reason
e.g. from the Cayley table the 5 row does not give a Latin square,
or 5 does not have an inverse, so it cannot be a group
R2
(i)
A1
remove the 5
116
(ii)
they are not isomorphic because all elements in A are self-inverse

this is not the case in C , (e.g. 3 3 = 9 1)
R2
Note: Accept any valid reason.

[14]
147. (a)
(i)
(ii)
the inverse is
1 2 3 4
3 1 4 2
A1
EITHER
1 2 4 3 1 (is a cycle of length 4)
so p1 is of order 4
R3
A1
N2
OR
(b)
(i)
consider
1 2 3 4
p12 =
4 3 2 1
M1A1
it is now clear that

1 2 3 4
p14 =
1 2 3 4
so p1 is of order 4
A1
consider
1 2 3 4 1 2 3
p1 p 2 =
2 4 1 3 3 2 4
1 2 3 4 1 2 3
p 2 p1 =
3 2 4 1 2 4 1
composition is not commutative
A1
4 1 2 3 4
=
1 1 4 3 2
4 1 2 3 4
=
3 2 1 3 4
N2
M1A1
A1
A1
Note: In this part do not penalize candidates who incorrectly

reverse the order both times.
117
(ii)
EITHER
pre and postmultiply by p11, p21 to give
p3 = p11 p21
1 2 3 4 1 2 3 4
=
3 1 4 2 4 2 1 3
1 2 3 4
=
2 1 3 4
(M1)(A1)
A1
A1
OR
starting from
1 2 3 4 1 2 3 4 1 2 3 4
2 4 1 3
3 2 4 1
successively deducing each missing number, to get
1 2 3 4 1 2 3 4 1 2 3 4
2 4 1 3 2 1 3 4 3 2 4 1
148. (a)
(b)
let a be a generator and consider the (general) elements b = am, c = an

then
bc = aman
= anam (using associativity)
= cb
therefore G is Abelian
M1
A3
[13]
M1
A1
R1
A1
AG
let G be of order p and let m {1, .........., p}, let a be a generator

consider aa1 = e am (a1)m = e
M1R1
1 m
m
this shows that (a ) is the inverse of a
R1
as m increases from 1 to p, am takes p different values and it generates G R1
it follows from the uniqueness of the inverse that (a1)m takes p different
values and is a generator
R1
118
(c)
EITHER
by Lagrange, the order of any element divides the order of the
group, i.e. 5
the only numbers dividing 5 are 1 and 5
the identity element is the only element of order 1
all the other elements must be of order 5
so they all generate G
R1
R1
R1
R1
AG
OR
let a be a generator.
successive powers of a and therefore the elements of G are
a, a2, a3, a4 and a5 = e
successive powers of a2 are a2, a4, a, a3, a5 = e
successive powers of a3 are a3, a, a4, a2, a5 = e
successive powers of a4 are a4, a3, a2, a, a5 = e
this shows that a2, a3, a4 are also generators in addition to a
A1
A1
A1
A1
AG
[13]
149.
dy
= ex + 2y2
dx
x
y
dy/dx
0.3
0.1
1.3
4.485170918
0.4485170918
A1
0.2
1.7485170918
7.336026799
0.7336026799
A1
0.3
2.482119772
13.67169593
1.367169593
A1
0.4
3.849289365
(A1)
M1A1
A1
required approximation = 3.85
A1
[8]
150. (a)
d x
(e )dx
M1A1
0
0
dx
since ex 0 as x and sin x is bounded ex sin x 0 as x
R1
(or alternative convincing argument)
ex sin x = 0 when x = 0
R1
e x cos xdx = e x sin x
the second term =

so
e x cos xdx =
sin x
e x sin xdx
e x sin xdx
A1
AG
119
(b)
continuing the process
e x cos xdx = e x cos x
] +
cos x
d x
(e )dx
dx
the value of the first term is 1

the second term =
so 2
A1
e x cos xdx
A1
e x cos xdx = 1
the common value of the integrals is
M1A1
A1
1
2
A1
[11]
dy
dv
=v+x
dx
dx
dv
= v2 + v + 4
the equation becomes v + x
dx
dv
dx
=
x
v2 + 4
1
v
arctan = ln x + C
2
2
substituting (x, v) = (1, 2)
C=
8
the solution is
y
arctan = 2 ln x +
2
x
4

151. put y = vx so that
y = 2x tan 2 ln x +
4
152. (a)
n(n 1) 2
x + ...
2
1
2 2
1 ( x ) 1 3
(1 x 2 ) 2 = 1 + ( x 2 ) +
+ ...
2
2
2 2
1
3
= 1 + x 2 + x 4 + ...
2
8
using or obtaining (1 + x)n = 1 + nx +
(M1)
A1
A1
A1A1
M1A1
A1
A1
[9]
(M1)
(A1)
A1
120
(b)
(c)
integrating, and changing sign

1
3 5
x + C + ...
arccos x = x x 3
6
40
put x = 0,
=C
2
1 3 3 5
x
arccos x x x
2
6
40
M1A1
M1
AG
EITHER
1
3 10
x2 x6
x
2
6
30
x6
+ higher powers
arccos x 2 x 2
6
lim 2
=
lim
x 0
x 0
x6
x6
1
=
6
using arccos x2
M1A1
M1A1
A1
OR
using lHpitals Rule
1
2x 2x
1 x 4
limit = lim
x 0
6x 5
1
1
4
1
x
= lim
x 0
3x 4
1
1

4x 3
3
2
(1 x 4 ) 2
= lim
x 0
12 x 3
1
=
6
M1
M1
A1
M1
A1
121
(d)
0.2
arccos x dx
0.2
1
3
5
x 2 1 x 2 3 x 2 dx
2
6
40
M1
0.2
3
5
7
2
1
3 2
= x x2 x2
x
3
15
140
2
0
(A1)
7
2
1
3
= 0.2 0.2 2 0.2 2
0.2 2
2
3
15
140
= 0.25326 (to 5 decimal places)
(A1)
A1
Note: Accept integration of the series approximation using a GDC.

using a GDC, the actual value is 0.25325
so the approximation is not correct to 5 decimal places
A1
R1
[17]
(n + 1) x n +1
153. (a)
(i)
T
consider n +1 =
Tn
2 n +1
M1
nx n
2n
(n + 1) x
A1
2n
x
as n
2
the radius of convergence satisfies
R
= 1, i.e. R = 2
2
(ii)
A1
A1
the series converges for 2 < x < 2, we need to consider x = 2

when x = 2, the series is 1 + 2 + 3 + ...
this is divergent for any one of several reasons e.g. finding
an expression for Sn or a comparison test with the harmonic
series or noting that lim u n 0 etc.
n
(i)
(ii)
R1
when x = 2, the series is 1 + 2 3 + 4...

this is divergent for any one of several reasons
e.g. partial sums are
1, 1, 2, 2, 3, 3... or noting that lim u n 0 etc.
A1
the interval of convergence is 2 < x < 2
A1
this alternating series is convergent because the moduli of

successive terms are monotonic decreasing
and the nth term tends to zero as n
R1
R1
(b)
(R1)
A1
consider the partial sums

0.333, 0.111, 0.269, 0.148, 0.246
R1
M1A1
122
since the sum to infinity lies between any pair of successive

partial sums, it follows that the sum to infinity lies between
0.148 and 0.246 so that it is less than 0.25
R1
Note: Accept a solution which looks only at 0.333, 0.269, 0.246 and
states that these are successive upper bounds.
[15]
154. (a)
(i)
48 = 65536 7(mod9)
not valid because 9 is not a prime number
A1
R1
Note: The R1 is independent of the A1.

(ii)
using Fermats little theorem

56 1(mod 7)
M1
A1
therefore
(56)10 = 560 1 (mod 7)
A1
also, 54 = 625
2(mod 7)
M1
A1
therefore
564 1 2 2 (mod 7)
(so n = 2)
A1
Note: Accept alternative solutions not using Fermat.

(b)
EITHER
solutions to x 3 (mod 4) are
3, 7, 11, 15, 19, 23, 27, ...
solutions to 3x 2 (mod 5) are
4, 9, 14, 19 ...
so a solution is x = 19
using the Chinese remainder theorem (or otherwise)
the general solution is x = 19 + 20n (n )
(accept 19 (mod 20))
A1
(M1)A1
A1
(M1)
A1
123
OR
x = 3 + 4t 9 + 12t 2 (mod 5)
2t 3 (mod 5)
6t 9 (mod 5)
t 4 (mod 5)
so t = 4 + 5n and x = 19 + 20n (n
(accept 19 (mod 20))
M1A1
A1
A1
M1A1
Note: Also accept solutions done by formula.

[14]
155. (a)
(i)
the edges are joined in the order

AC
BE
AB
ED
A2
A1
Note: Final A1 independent of the previous A2.
(ii)
the weight of this spanning tree is 33

to find a lower bound for the travelling salesman problem,
we add to that the two smallest weights of edges to D,
i.e. 15 + 16 , giving 64
(b)
an upper bound is the weight of any Hamiltonian cycle,

e.g. ABCDEA has weight 75, so 80 is certainly an upper bound
A1
A1
M1A1
M1A1
[9]
124
156. (a)
(b)
let N = anan1...a1a0 = an 9n + an1 9n1 + ... + a1 9 + a0

M1A1
all terms except the last are divisible by 3 and so therefore is their sum
R1
it follows that N is divisible by 3 if a0 is divisible by 3
AG
EITHER
consider N in the form
N = an (9n 1) + an1 (9n1 1) + ... + a1(9 1) +
M1A1
i =0
all terms except the last are even so therefore is their sum
R1
it follows that N is even if
is even
AG
i =0
OR
working modulo 2, 9k 1 (mod 2)
hence N = anan1...a1a0 = an 9n + an1 9n1 + ... + a1 9 + a0
M1A1
(mod 2)
R1
i =0
it follows that N is even if
is even
AG
i =0
(c)
the number is divisible by 3 because the least significant digit is 3

R1
it is divisible by 2 because the sum of the digits is 44, which is even
R1
dividing the number by 2 gives (232430286)9,
M1A1
which is even because the sum of the digits is 30 which is even
R1
N is therefore divisible by a further 2 and is therefore divisible by 12
R1
Note: Accept alternative valid solutions

[12]
157. (a)
start with a graph consisting of just a single vertex

for this graph, v = 1, f = 1 and e = 0, the relation is satisfied
M1
A1
Note: A1low solutions that begin with 2 vertices and 1 edge.

to extend the graph you either join an existing vertex to another
existing vertex, which increases e by 1 and f by 1 so that v + f e
remains equal to 2
or add a new vertex and a corresponding edge, which increases e
by 1 and v by 1 so that v + f e remains equal to 2
therefore, however we build up the graph, the relation remains valid
M1A1
M1A1
R1
125
(b)
since every face is bounded by at least 3 edges, the result

follows by counting up the edges around each face
R1
the factor 2 follows from the fact that every edge bounds (at most) 2 faces R1
hence 3f 2e
AG
from the Euler relation, 3f = 6 + 3e 3v
M1
substitute in the inequality, 6 + 3e 3v 2e
A1
hence e 3v 6
AG
(c)
let G have e edges
12
since G and G have a total of = 66 edges
2
it follows that G has 66 e edges
for planarity we require
e 3 12 6 = 30
and 66 e 30 e 36
these two inequalities cannot both be met indicating that both
graphs cannot be planar
M1
A1
A1
M1A1
A1
R1
[18]
158. EITHER
we work modulo 3 throughout
the values of a, b, c, d can only be 0, 1, 2
since there are 4 variables but only 3 possible values, at least 2 of the
variables must be equal (mod 3)
therefore at least 1 of the differences must be 0 (mod 3)
the product is therefore 0 (mod 3)
R2
R2
R2
R1AG
OR
we attempt to find values for the differences that do not give 0 (mod 3)
for the product
we work modulo 3 throughout
we note first that none of the differences can be zero
a b can therefore only be 1 or 2
suppose it is 1, then b c can only be 1
since if it is 2, (a b) + (b c) 3 0(mod 3)
c d cannot now be 1 because if it is
(a b) + (b c) + (c d) = a d 3 0(mod 3)
c d cannot now be 2 because if it is
(b c) + (c d) = b d 3 0(mod 3)
we cannot therefore find values of c and d to give the required result
a similar argument holds if we suppose a b is 2, in which case b c must
be 2 and we cannot find a value of c d
the product is therefore 0 (mod 3)
R1
R1
R1
R1
R1
R1
R1
AG
[7]
126
159. H0 : There is no association between performance in the entrance examination

and performance in the final examination.
H1 : There is an association.
A1
EITHER
p-value = 1.19 104
accept H1 because 1.19 104 < 0.01
A4
A2
OR
the expected frequencies are
First class
Second class
Third class
Excellent
21.5
16
12.5
Very good
10.75
6.25
Good
10.75
6.25
M1A1
2
= 23.1
calc
A1
2
= 13.277
crit
A1
accept H1 because 23.1 > 13.277
A2
[7]
160. (a)
(b)
since A = AI where I is the identity

and det (I) = 1,
R is reflexive
ARB A = BX where det (X) = 1
it follows that B = AX1
and det (X1) = det(X)1 = 1
R is symmetric
ARB and BRC A = BX and B = CY where det (X) = det (Y) = 1
it follows that A = CYX
det (YX) = det (Y) det (X) = 1
R is transitive
AG
for reflexivity, we require ARA so that A = AI (for all A S)

since det (I) = 1 and we require I S the only possibility is n = 1
M1
A1
A1
A1
M1
A1
A!
M1
A1
A1
[10]
127
161. (a)
(i)

0 1 0 0 0
1 0 1 0 1
0 1 0 1 0
0 0 1 0 1
0 1 0 1 0
A2
Note: Award A2 for correct matrix,

A1 for one or two errors and
A0 for more than two errors.
(ii)
(b)
the required number of walks is the (B, B) element in the

fourth power of the adjacency matrix
using a GDC gives the answer as 13
(M1)
A2
(i)
A2
(ii)
G
2
A2
128
(iii)
In G, the vertex of degree 1 is adjacent to the vertex of degree 3,

whereas in G the vertex of degree 1 is adjacent to a vertex of
degree 2. They are not therefore isomorphic.
R2
Note: Accept alternative correct solutions.

[11]
162. consider the following

n
(n2 + 2n + 3)(mod 8)
3
M1A2
we see that the only possible values so far are 2, 3 and 6

also, the table suggests that these values repeat themselves but we have
to prove this
let f(n) = n2 + 2n + 3, consider
f(n + 4) f(n) = (n + 4)2 + 2(n + 4) + 3 n2 2n 3
= 8n + 24
since 8n + 24 is divisible by 8,
f(n + 4) = f(n)(mod 8)
this confirms that the values do repeat every 4 values of n so that 2, 3 and 6
are the only values taken for all values of n
R1
M1
A1
M1
A1
R1
[9]
129
2tanxdx
163. integrating factor = e
= e2 ln sec x
= sec2x
it follows that
ysec2 x = sin x sec2x dx
= sec x tan x dx
= sec x + C
substituting, 0 = 2 + C so C = 2
the solution is
y = cos x 2 cos2 x
M1
A1
A1
M1
(A1)
A1
M1A1
A1
EITHER
using a GDC
maximum value of y is 0.125
A2
OR
y = sin x + 4 sin x cos x = 0
1
cos x = (or sin x = 0, which leads to a minimum)
4
1
y=
8
M1
A1
[11]
164. (a)
(i)
a * (b * c) = a*(b + c bc)
= a + b + c bc a(b + c bc)
= a + b + c bc ca ab + abc
(a * b) * c = (a + b ab)*c
= a + b ab + c (a + b ab)c
= a + b + c bc ca ab + abc, hence associative
(ii)
let e be the identity element, so that a * e = a

then,
a + e ae = a
e(l a) = 0
e=0
(M1)
let a1 be the inverse of a, so that a * a1 = 0

then,
a + a1 aa1 = 0
a
a1 =
a 1
(M1)
(iii)
(iv)
M1
A1
A1
M1
A1
AG
A1
A1
A1
A1
this gives an inverse for all elements except 1, which

has no inverse
R1
2x x2 = 1
M1
130
(x 1)2 = 0
x=1
(b)
A1
A1
(i)
*
4
A3
Note: Award A3 for correct table, A2 for one error, A1 for two
errors and A0 for more than two errors.
(ii)
there are no new elements in the table so it is closed

there is an identity element, 0
every row (column) has a 0 so every element has an inverse
associativity has been proved earlier
therefore {S, *} is a group
A1
A1
A1
A1
AG
(iii)
Element
Order
3
A3
Note: Award A3 for correct table, A2 for one error, A1 for two
errors and A0 for more than two errors.
it is cyclic because there are elements of order 6
(iv)
the proper subgroups are {0, 2}, {0, 4, 6}

the orders of the subgroups (2, 3) are factors of the order
of the group (6)
(v)
recognizing x * x = 4
x = 3, 6
R1
A1A1
A1
M1
A1A1
[32]
131
165. (a)
(b)
(i)
G has an Eulerian trail because it has 2 vertices of odd degree

and the remaining vertices of even degree
G does not have an Eulerian circuit because not all vertices
are of even degree
(ii)
BAFBCFECDE
(i)
the edges are added in the order

FE
CE
AB
BF, CD
or CD, BF
R1
R1
A1
A1
A1
A1
A1
(c)
(ii)
minimum weight is 19
A1
Step
1
2
3
4
5
6
Vertices labelled
A
AB
ABF
ABFE
ABFEC
ABFECD
Working values
A(0), B 4, F 7
M1A1
A(0), B(4), C 12, F 7
A1
A(0), B(4), F(7), C 11, E 9
A1
A(0), B(4), F(7), E(9), C 11, D 18
A1
A(0), B(4), F(7), E(9), C(11), D 16
A1
A(0), B(4), F(7), E(9), C(11), D(16)
A1
the shortest path is AFCD

the weight is 16
A2
A1
[18]
166. (a)
(i)
1071
= 51
21
54705 10712
= 4.2
S n21 =
20
20 21
x=
A1
M1A1
132
(ii)
(b)
degrees of freedom = 20; t-value = 2.086

95 % confidence limits are
4.2
51 2.086
21
leading to [50.1,51.9]
(A1)(A1)
(M1)(A1)
A1
Var (Sn1) > 0
S n21 )
A1
E(
=
substituting in the given equation,
2 E(Sn1)2 > 0
it follows that
E(Sn1) <
this shows that Sn1 is not an unbiased estimator for since that
would require = instead of <
(A1)
M1
A1
R1
[13]
167. (a)
(i)
mean = 6
(A1)
5
P(5 customers before 10:00) =
(ii)
6 6
e = 0.161
5!
(M1)A1
P(2 in 30 mins5 in 60 mins)

P(2 in 30 mins) P(3 in next 30 mins)
=
P(5 in 60 mins)
(M1)(A1)
3 2 3 3 3 3
e e
2
!
3!
=
6 5 6
e
5!
5
=
(accept 0.312 or 0.313)
16
A1
A1
(b)
(i)
P(T > t) = P 0 or 1 arrivals in [0, t] = 1 + e 10

10
R1
133
(ii)
the distribution function is given by

t
F(t) = 1 1 + e 10
10
the probability density is given, for t > 0, by
f(t) = F(t)
=
t
10
e
1
t
1 +
10 10
10
e
1
10
M1A1
(M1)
A1
t 10
=
e
100
(iii)
E(T) =
1
100
A1
t 2e
t
10 dt
M1
t
1
1
= t 2 e 10 +
10
10
t
2 te 10
+2
0
2te
t
10 dt
t
10 dt
M1A1
M1A1
t
= 20 e 10 = 20
A1
Note: Accept a method based on adding two exponential variables.

[19]
134
168. (a)
(M1)
total area of upper rectangles
1
1
1
1
= 4 1 +
1
+
1
+
...
=
4
4
4
n
(n + 1)
(n + 2)
r =n r
total area of lower rectangles
1
1
1
1
=
1
+
1
+
1
+
...
=
4
4
4
4
(n + 1)
(n + 2)
(n + 3)
r = n +1 r
the total area under the curve from x = n to infinity lies between
dx
1
1
these two sums hence
<
<
4
4
4
n
x
r = n +1 r
r =n r
M1A1
A1
R1AG
135
(b)
first evaluate the integral
1
1
= 3 = 3
n x4
3 x n 3n
it follows that
1
1
< 3
4
3n
r = n +1 r
dx
adding
r
r =1
S<
r
r =1
to both sides,
n 1
r
r =1
n 1
S>
(c)
(i)
(ii)
M1
A1
to both sides,
3n 3
hence the value of S lies between
n 1
n
1
1
1
1
+
and
+ 3
4
3
4
3n
3n
r =1 r
r =1 r
r =1
A1
A1
3n 3
similarly,
1
1
> 3
4
3n
r =n r
adding
M1A1
putting n = 8, we find that

S < 1.08243 and S > 1.08219
it follows that S = 1.082 to 3 decimal places
substituting this value of S,
4
N
90.0268...
1.082
N = 90
M1
A1
AG
A1A1
A1
M1A1
A1
136
(d)
EITHER
successive partial sums are
1
0.9375
0.9498
0.9459
0.9475
0.9467
0.9471
it follows that T = 0.947 correct to 3 decimal places
M1
A1
A1
OR
2
S
16
= 0.9471 using part (c)(i) or 0.94703 using the sum
given in part (c)(ii)
it follows that T = 0.947 correct to 3 decimal places
T=S
M1A1
A1
[22]
169. EITHER
x 1 > 2x 1 (x 1)2 > (2x 1)2
x2 2x + 1 > 4x2 4x + 1
3x2 2x < 0
2
0<x<
3
M1
A1
A1A1
N2
Note: Award A1A0 for incorrect inequality signs.

OR
x 1 > 2x 1
x 1 = 2x 1
x 1 = 1 2x
x = 0
3x = 2
2
x=0
x=
3
M1A1
Note: Award M1 for any attempt to find a critical value. If graphical

methods are used, award M1 for correct graphs, A1 for correct
values of x.
0<x<
2
3
A1A1
N2
Note: Award A1A0 for incorrect inequality signs

[4]
1
k 1
2 k 1 0 k 1 0 2
170. det 0 2 k 1 = k
+
0 k 2 k k 2 k 0
k 0 k 2
= 2k(k 2) + k(k 1) 2k
(M1)
A1
137
Note: Allow expansion about any row or column.

2k(k 2) + k(k 1) 2k = 0
3k2 7k = 0
k(3k 7) = 0
7
k = 0 or k =
3
M1
A1A1
N2
[5]
2
2
2 2
171. x 2 = ( x 2 ) 4 + 4( x 2 ) 3 + 6( x 2 ) 2 + 4( x 2 ) +
x
x
x
x x
32 16
= x8 8x5 + 24x2
+
x x4
(M1)
A3
Note: Deduct one A mark for each incorrect or omitted term.

[4]
138
172.
(A1)
11 3
P ( R L) =
20 20
9 7 11 3
+
P(L) =
20 20 20 20
P( R L)
P(R|L) =
P( L)
=
33 11
=
96 32
A1
A1
(M1)
A1
[5]
173. METHOD 1
5(2a + 9d) = 60 (or 2a + 9d = 12)
10(2a + 19d) = 320 (or 2a + 19d = 32)
solve simultaneously to obtain
a = 3, d = 2
the 15th term is 3 + 14 2 = 25
M1A1
A1
M1
A1
A1
Note: FT the final A1 on the values found in the penultimate line.
139
METHOD 2
with an AP the mean of an even number of consecutive terms equals
the mean of the middle terms
a10 + a11
= 16 (or a10 + a11 = 32)
2
a5 + a6
= 6 (or a5 + a6 = 12)
2
a10 a5 + a11 a6 = 20
5d + 5d = 20
d = 2 and a = 3 (or a5 = 5 or a10 = 15)
the 15th term is 3 + 14 2 = 25 (or 5 + 10 2 = 25 or 15 + 5 2 = 25)
(M1)
A1
A1
M1
A1
A1
Note: FT the final A1 on the values found in the penultimate line.

[6]
174. METHOD 1
(a)
un = Sn Sn1
n
(b)
7 a
(M1)
n 1
n 1
A1
7 n 1
EITHER
u1 = 1
a
7
a2
A1
a
1
7
7
a a
= 1
7 7
a
common ratio =
7
u2 = 1
M1
A1
A1
OR
n
a
a
un = 1 1 +
7
7
a
=
7
n 1
n 1
M1
a
1
7
n 1
7a a
=

7 7
7a
a
u1 =
, common ratio =
7
7
(c)
A1
A1A1
(i)
0 < a < 7 (accept a < 7)
A1
(ii)
A1
140
METHOD 2
(a)
(b)
7 a a
un = brn1 =

7 7
n 1
A1A1
for a GP with first term b and common ratio r

b(1 r n ) b b n
=
Sn =
r
1 r
1 r 1 r
7n an
M1
a
= 1
n
7
7
comparing both expressions
b
a
= 1 and r =
1 r
7
a 7a
b=1 =
7
7
7a
a
u1 = b =
, common ratio = r =
7
7
as Sn =
M1
A1A1
Note: Award method marks if the expressions for b and r are deduced
in part (a).
(c)
(i)
0 < a < 7 (accept a < 7)
A1
(ii)
A1
[8]
175. (a)
4

a = 2 tothe plane
1

2

e = 1 is parallel to the line
k

(A1)(A1)
Note: Award A1 for each correct vector written down, even if not identified.
line plane e parallel to a
4 2

1
since 2 = t 1 k =
2
1 k

(M1)A1
141
(b)
4(3 2) 2 1 + = 1
2
(M1)(A1)
Note: FT their value of k as far as possible.
8
7
5 8 3
P , ,
7 7 7
176. (1 + x3)
A1
A1
[8]
dy
= 2 x 2 tan y
dy
dy
2x 2
=
dx
tan y
1+ x3
cos y
2 3x 2
dy =
dx
sin y
3 1+ x3
2
ln sin y = ln 1 + x 3 + C
3
M1
(A1)(A1)
A1A1
Notes: Do not penalize omission of modulus signs.

Do not penalize omission of constant at this stage.
EITHER
ln sin
2
= ln 1 + C C = 0
2 3
M1
OR
|sin y| = A 1 + x 3
sin
= A1 + 0 3
2
2
3
2
3
, A = eC
A =1
M1
THEN
2
y = arcsin (1 + x 3 ) 3
A1
Note: Award M0A0 if constant omitted earlier.

[7]
142
177. (a)
arccos x 0
4
arccos x
4
2
1
accept x
x
2
2
since 1 x 1
2
1
x 1 accept
x 1
2
2
(M1)
(A1)
(M1)
A1
Note: Penalize the use of < instead of only once.
(b)
arccos x x = cos y 2
4
4
f1 : x cos x 2
4
y=
0x
M1A1
A1
A1
[8]
178. METHOD 1
(a)
a b =
=
a+b =
=
a + b 2 a b cos
M1
2 2 cos
A1
a + b 2 a b cos( )
2 + 2 cos
A1
Note: Accept the use of a, b for |a|, |b|.
(b)
2 + 2 cos = 3 2 2 cos
4
cos =
5
M1
A1
143
METHOD 2
(a)
|a b|= 2 sin
M1A1

|a + b| = 2 sin = 2 cos
2
2 2
A1
Note: Accept the use of a, b for |a|, |b|.
(b)
2 cos
2
1
9
= cos 2 =
tan
2 3
2 10
4
cos = 2 cos2 1 =
2
5
= 6 sin
M1
A1
[5]
179. (a)
METHOD 1
z+i
=i
z+2
z + i = iz + 2i
(1 i)z = i
i
z=
1 i
M1
A1
A1
EITHER
z=
cis
2
3
2cis
4
z=
2 3
cis
2
4
M1
1
3
or
cis
2 4
A1A1
OR
1+ i
1 1
= + i
2
2 2
2 3
1
3
z=
cis or
cis
2
4
2 4
z=
M1
A1A1
144
METHOD 2
x + i( y + 1)
x + 2 + iy
x + i(y + 1) = y + i(x + 2)
x = y; x + 2 = y + 1
1
1
solving, x = ; y =
2
2
1 1
z= + i
2 2
2 3
1
3
z=
cis or
cis
2
4
2 4
i=
M1
A1
A1
A1
A1A1
Note: Award A1 fort the correct modulus and A1 for the correct argument,
but the final answer must be in the form r cis .
Accept 135 for the argument.
(b)
x + ( y + 1)i
( x + 2) + yi
use of (x + 2) yi to rationalize the denominator
x( x + 2) + y ( y + 1) + i( xy + ( y + 1)( x + 2))
=
( x + 2) 2 + y 2
substituting z = x + iy to obtain w =
(c)
( x 2 + 2 x + y 2 + y ) + i( x + 2 y + 2)
Re =
( x + 2) 2 + y 2
x 2 + 2x + y 2 + y
( x + 2) 2 + y 2
=1
x2 + 2x + y2 + y = x2 + 4x + 4 + y2
y = 2x + 4
which has gradient m = 2
(A1)
M1
A1
AG
M1
A1
A1
A1
145
(d)
EITHER
x = y (and x, y > 0)
4
i(3x + 2)
2 x 2 + 3x
=
+
2
2
( x + 2) + x
( x + 2) 2 + x 2
3x + 2
if arg() = tan = 2
2 x + 3x
3x + 2
=1
2 x 2 + 3x
arg (z) =
(A1)
(M1)
M1A1
OR
x = y (and x, y > 0)
4
arg (w) = x2 + 2x + y2 + y = x + 2y + 2
4
solve simultaneously
x2 + 2x + x2 + x = x + 2x + 2 (or equivalent)
arg (z) =
A1
M1
M1
A1
THEN
x2 = 1
x = 1 (as x > 0)
A1
Note: Award A0 for x = 1.

z =
A1
Note: A1low FT from incorrect values of x.

[19]
180. (a)
(i)
the period is 2
A1
146
(ii)
(iii)
ds
= 2 cos (t) + 2 cos (2t)
dt
dv
a=
= 22 sin (t) 42 sin (2t)
dt
v=
(M1)A1
(M1)A1
v=0
2 (cos (t) + cos (2t)) = 0
EITHER
cos (t) + 2 cos2 (t) 1 = 0
(2 cos (t) 1) (cos (t) + 1) = 0
1
cos (t) =
or cos (t) = 1
2
1
t= ,t=1
3
5
7
11
t = ,t = ,t =
t=3
3
3
3
M1
(A1)
A1
A1
A1
OR
t 3t
2 cos cos
=0
2 2
t
3t
cos = 0 or cos
=0
2
2
1
t= ,1
3
5 7 11
t = , , 3,
3 3
3
(b)
P(n) : f(2n)(x) = (1)n(Aa2n sin (ax) + Bb2n sin (bx))

P(1): f(x) = (Aa cos (ax) + Bb cos (bx))
= Aa2 sin (ax) Bb2 sin (bx)
= 1(Aa2 sin (ax) + Bb2 sin(bx))
P(1) true
assume that
P(k) : f(2k)(x) = (1)k [(Aa2k sin (ax) + Bb2k sin (bx)) is true
consider P(k + 1)
f(2k+1)(x) = (1)k (Aa2k+1 cos(ax) + Bb2k+1 cos(bx))
f(2k+2) (x) = (1)k (Aa2k+2 sin (ax) + Bb2k+2 sin (bx))
= (1)k+1 (Aa2k+2 sin (ax) + Bb2k+2 sin (bx))
P(k) true implies P(k + 1) true, P(1) true so P(n) true n
M1
A1A1
A1
A1
M1
A1
M1
M1A1
A1
A1
R1
Note: Award the final R1 only if the previous three M marks have been awarded.
[18]
181. (a)
(i)
xex = 0 x = 0
so, they intersect only once at (0, 0)
A1
147
(ii)
(b)
y = ex + xex = (1 + x)ex
y(0) = 1
= arctan1 =
( = 45)
4
M1A1
A1
A1
when k = 1, y = x
xex = x x(ex 1) = 0
x=0
y(0) = 1, which equals the gradient of the line y = x
so, the line is tangent to the curve at origin
M1
A1
R1
AG
Note: Award full credit to candidates who note that the equation x(ex 1) = 0
has a double root x = 0 so y = x is a tangent.
(c)
(i)
xex = kx x(ex k) = 0
x = 0 or x = ln k
k > 0 and k 1
(ii)
(0, 0) and (ln k, k ln k)
(iii)
A=
ln k
kx xe x dx
M1
A1
A1
A1A1
M1A1
Note: Do not penalize the omission of absolute value.
148
(iv)
attempt at integration by parts to find xex dx
xexdx = xex exdx = ex(x 1)

as 0 < k < 1 ln k < 0
A1
R1
0
A = kx xe dx = x 2 ( x 1)e x
ln k
2
ln k
k
= 1 (ln k ) 2 (ln k 1)k

2
k
= 1 ((ln k ) 2 2 ln k + 2)
2
k
= 1 ((ln k 1) 2 + 1)
2
k
since ((ln k 1)2 + 1) > 0
2
A<1
M1
A1
A1
M1A1
R1
AG
[23]
182. (a)
(b)
1
BC AB sin B
2
1
10 = 5 6 sin B
2
2
sin B =
3
area =
(M1)
A1
5
(= 0.7453...) or B = 41.8... and 138.1...
3
AC2 = BC2 + AB2 2 BC AB cos B
cos B =
(A1)
(M1)
AC = 5 + 6 2 5 6 0.7453... or 5 + 6 + 2 5 6 0.7453...
AC = 4.03 or 10.28
A1A1
[6]
149
183.
6.7 + 7.2 + ... + 7.3

= 6.91
10
1
s n21 = ((6.7 6.91)2 + ... + (7.3 6.91)2)
9
0.489
=
= 0.0543 (3 sf)
9
m=
(M1)A1
(M1)
A1
Note: Award M1A0 for 0.233.

[4]
184. X ~ N(, 2)
P(X 5) = 0.670
= 0.4399...
7
P(X > 7) = 0.124
= 1.155...
+ 0.4399 = 5 and + 1.1552 = 7
= 3.77 (3 sf)
the expected weight loss is 3.77 kg
M1A1
A1
M1
A1
N3
Note: Award A0 for = 3.78 (answer obtained due to early rounding).

[5]
185. x3y3 xy = 0
3x2y3 + 3x3y2y y xy = 0
M1A1A1
Note: Award A1 for correctly differentiating each term.

x = 1, y = 1
3 + 3y 1 y = 0
2y = 2
y = 1
gradient of normal = 1
equation of the normal y 1 = x 1
y=x
(M1)A1
(A1)
A1
N2
Note: Award A2R5 for correct answer and correct justification.

[7]
150
186. EITHER
x
ln x ln y = 1
ln y = 1
3 ln x + 2 ln y = 5
ln x 3 + ln y 2 = 5
7
ln x = 5
ln y = 2
5
x=
7
e5
(= 4.06) and y =
2
5
e
(= 1.49)
M1A1
M1
A1A1
OR
x
=1
y
x = ey
ln x3 + ln y2 = 5
ln x3y2 = 5
x 3y 2 = e 5
e 3y 5 = e 5
y5 = e2
ln
y=
2
5
e
,x=
7
e5
A1
M1
M1
A1A1
[5]
187. METHOD 1
1 + i is a zero 1 i is a zero
1 2i is a zero 1 + 2i is a zero
(x (1 i))(x (1 + i)) = (x2 2x + 2)
(x (1 2i))(x (1 + 2i)) = (x2 2x + 5)
p(x) = (x2 2x + 2) (x2 2x + 5)
= x4 4x3 + 11x2 14x + 10
a = 4, b = 11, c = 14, d = 10
(A1)
(A1)
(M1)A1
A1
M1
A1
151
METHOD 2
p(1 + i) = 4 + (2 + 2i)a + (2i)b + (1 + i)c + d
4 2 a + c + d = 0
p(1 + i) = 0
2a + 2b + c = 0
p(1 2i) = 7 + 24i + (11 + 2i)a + (3 4i)b + (1 2i)c + d
7 11a 3b + c + d = 0
p(1 2i) = 0
24 + 2a 4b 2c = 0
M1
M1A1A1
A1
1 1 4 4
a 2 0

2
1 0 0 11
b 2
c = 11 3 1 1 7 = 14

d 2 4 2 0 24 10

a = 4, b = 11, c = 14, d = 10
M1A1
[7]
188. (a)
(b)
P(X = 1) + P(X = 3) = P(X = 0) + P(X = 2)

m 3 e m
m 2 e m
mem +
= e m +
6
2
3
2
m 3m + 6m 6 = 0
m = 1.5961 (4 decimal places)
m = 1.5961 P(1 X 2) = me m +
m 2 e m
= 0.582
2
(M1)(A1)
(M1)
A1
(M1)A1
[6]
152
189.
correct concavities
Note: Award A1 for concavity of each branch of the curve.
f
correct x-intercept of
(which is EXACTLY the x-intercept of f)
g
f
correct vertical asymptotes of
(which ONLY occur when x equals the
g
x-intercepts of g)
A1A1
A1
A1A1
[5]
190. (a)
(b)
cos =
ab
sin 2 cos + sin cos 2 1 sin 3 1
=
=
2
ab
2 2
a b cos = 0
sin 2 cos + sin cos 2 1 = 0

= 0.524 =
6
M1A1
M1
A1
153
(c)
METHOD 1
i
sin 2
j
cos 2
k
1
cos
sin
assuming =
(M1)
7
6
Note: Allow substitution at any stage.
i
3
2
3
j
1
2
1
2
k
1
A1
3 1 1
3
3
3
1 1
= i j
+
+ k

2
2 2 2
2 2 2 2
=0
a and b are parallel
A1
R1
Note: Accept decimal equivalents.

METHOD 2
from (a) cos = 1 (and sin = 0)
ab=0
a and b are parallel
M1A1
A1
R1
[8]
154
191. EITHER
1
1
y =
1 x
(1 x) 2
1
1
= m( x m) and
=m
1 x
(1 x) 2
y=
1
1
=
1 x (1 x) 2
1
x
(1 x) 2
M1A1
M1
A1
Note: Accept equivalent forms.

(1 x)3 x(1 x)2 + 1 = 0, x 1
1
x = 1.65729... y =
= 1.521379...
1 1.65729
tangency point (1.66, 1.52)
m = (1.52137...)2 = 2.31
A1A1
A1
OR
(1 x)y = 1
m (1 x) (x m) = 1
m (x x2 m + mx) = 1
mx2 x(m + m2) + (m2 + 1) = 0
b2 4ac = 0
(m + m2)2 4m(m2 + 1) = 0
m = 2.31
substituting m = 2.31... into mx2 x(m + m2) + (m2 + 1) = 0
x = 1.66
1
y=
= 1.52
1 1.65729
tangency point (1.66, 1.52)
M1
A1
(M1)
A1
(M1)
A1
A1
[7]
192.
(a)
let T be Tims score
1
9
(i)
P(T = 6) =
(= 0.111 to 3 s.f.)
(ii)
P(T 3) = 1 P(T 2) = 1
1 8
=
9 9
A1
(= 0.889 to 3 s.f.)
(M1)A1
155
(b)
(c)
let B be Bills score
1 1 1
=
(= 0.012 to 3 s.f.)
9 9 81
(i)
P(T = 6 and B = 6) =
(ii)
P(B = T) = P(2)P(2) + P(3)P(3) + ... + P(6)P(6)

1 1 2 2 3 3 2 2 1 1
= + + + +
9 9 9 9 9 9 9 9 9 9
19
=
(= 0.235 to 3 s.f.)
81
(i)
(M1)A1
M1
A1
EITHER
2 2 2 2

3 3 3 3
because P(X 2) = P((a, b, c, d)a, b, c, d = 1, 2)
or equivalent
16
P(X 2) =
81
P(X 2) =
M1A1
R1
AG
OR
there are sixteen possible permutations, which are
Combinations
Number
1111
1112
1122
1222
2222
1
M1A1
Note: This information may be presented in a variety of forms.

P(X 2) =
=
1+ 4 + 6 + 4 +1
81
16
81
A1
AG
156
(ii)
x
P(X = x)
1
81
15
81
65
81
A1A1
(iii)
E(X) =
xP( X = x)
(M1)
x =1
1 30 195
+
+
81 81 81
226
=
(= 2.79 to 3 sf)
81
=
E(X2) =
A1
P( X = x)
x =1
1 60 585
+
+
81 81 81
646
=
(= 7.98 to 3 sf)
81
Var(X) = E(X2) (E(X))2
= 0.191 (to 3 s.f.)
=
A1
(M1)
A1
Note: Award M1A0 for answers obtained using rounded values

(e.g. Var(X) = 0.196).
(d)
Combinations
Number
3311
3221
12
P(total is 8 ( X = 3)) =
since P(X = 3) =
65
81
18
81
P((total is 8) ( X = 3))
P( X = 3)
18
=
(= 0.277)
65
P(total is 8(X = 3)) =
M1A1
M1
A1
[21]
193. (a)
1
0
0

OM = 2 , ON = 1 and OP = 2
2
2
1

A1A1A1
157
(b)
1
1

MP = 0 and MN = 1,
1
0

j k 1
i

MP MN = 1 0 1 = 1
1 1 0 1
(c)
(i)
1
MP MN
2
1
1
= 1
2
1
area of MNP =
(ii)
3
2
2
0

OA = 0 , OG = 2
0
2

2

AG = 2
2

since AG = 2(MP MN) AG is perpendicular to MNP
(iii)
1 1 1

r 1 = 2 1
1 2 1

1

r 1 = 3 (accept x + y + z = 3)
1

A1A1
(M1)A1
M1
A1
A1
R1
M1A1
A1
158
(d)
2
2

r = 0 + 2
0
2

A1
2 2 1

2 1 = 3
2 1
M1A1
2 + 2 + 2 + 2 = 3
5
=
6
2
2
5
r = 0 + 2
0 6 2

A1
M1
1 5 5
coordinates of point , ,
3 3 3
194. (a)
f(x) =
=
=
(b)
be x (ae x + b) ae x (a + be x )
(ae x + b) 2
abe 2 x + b 2 e x a 2 e x abe 2 x
(ae x + b) 2
(b 2 a 2 )e x
A1
[20]
M1A1
A1
AG
(ae x + b) 2
EITHER
f(x) = 0 (b2 a2)ex = 0 b = a or ex = 0
which is impossible as 0 < b < a and ex > 0 for all x
A1
R1
OR
f(x) < 0 for all x
since 0 < b < a and ex > 0 for all x
A1R1
OR
f(x) cannot be equal to zero because ex is never equal to zero
A1R1
159
(c)
EITHER
f(x) =
(b 2 a 2 )e x (ae x + b) 2 2ae x (ae x + b)(b 2 a 2 )e x

(ae x + b) 4
M1A1A1
Note: Award A1 for each term in the numerator.

=
=
(b 2 a 2 )e x (ae x + b 2ae x )
(ae x + b)3
(b 2 a 2 )(b ae x )e x
(ae x + b) 3
OR
f(x) = (b2 a2)ex(aex + b)2
f(x) = (b2 a2)ex(aex + b)2 + (b2 a2)ex(2aex)(aex + b)3
M1A1A1
Note: Award A1 for each term.

= (b2 a2)ex(aex + b)3((aex + b) 2aex)
= (b2 a2)ex(aex + b)3(b aex)
THEN
f(x) = 0 b aex = 0 x = ln
2
2
b a +b
f ln =
2ab
a
b a2 + b2
coordinates are ln ,
2ab
a
(d)
b
a
M1A1
A1
a
a
y = horizontal asymptote
b
b
b
b
lim f ( x) = y = horizontal asymptote
x +
a
a
x
0 < b < a ae + b > 0 for all x (accept aex + b 0)
so no vertical asymptotes
lim f ( x) =
A1
A1
R1
Note: Statement on vertical asymptote must be seen for R1.
160
(e)
y=
4+ ex
4e x + 1
1
7
y = x = ln (or 1.25 to 3 sf)
2
2
7
ln 4 + e x
1
dx
V = 2 x
0
4e + 1 4
= 1.09 (to 3 s.f.)
(M1)(A1)
(M1)A1
A1
N4
[19]
195. (a)
let W =
(M1)
i =1
wi is N(200, 152)
6
E (W) =
E(w ) = 6 200 = 1200
A1
i =1
Var(W) =
Var(w ) = 6 152 = 1350

i
A2
i =1
W is N(1200, 1350)
P(W > 1150) = 0.913 by GDC
(M1)
A1A1
Note: Using 6 times the mean or a lower bound for the mean are
acceptable methods.
(b)
let W = 12w
w is N(80, 102)
E(W) = 12E(w) = 12 80 = 960
Var(W) = 122Var(w) = 122 102 = 14400
W is N(960, 1202)
P(W > 1150) = 0.0567 by GDC
(M1)
A1
A2
(M1)
A1A1
Note: Using a lower bound for one copy is an acceptable method.

[14]
196. (a)
(i)
2
as 2 is known x is N ,
n
CI is x z *
< < x+ z*
(M1)
n
n
x = 9.24, z* = 1.960 for 95 % CI
CI is 6.61 < < 11.87 by GDC
(ii)
CI is x z *
< < x+ z*
(M1)
(A1)
A1A1
161
require 2 1.645
<2
4.935 < n
24.35 < n
so smallest value for n = 25
R1A1
(A1)
A1
A1
Note: Accept use of table.
(b)
as 2 is not known x has the t distribution with v = 4

s
s
CI is x t * n 1 < < x + t * n 1
n
n
x = 9.24, sn1 = 5.984, t* = 2.776 for 95 % CI
CI is 1.81 < < 16.67 by GDC
(M1)(A1)
(A1)
A1A1
[15]
197. (a)
1
we are dealing with the Negative Binomial distribution: NB 4,
3
let X be the number of scheduled lessons before the email is sent
4
4
7 2 1
P(X = 8) = = 0.0854
3 3 3
r 4
= = 12
p 1
3
(b)
E(X) =
(c)
we are asking for 2 missed lessons in the second 6 lessons, with

1
the last lesson missed so this is NB 2,
3
4
(M1)
(M1)A1
(M1)A1
(M1)
5 2 1
P(X = 6) = = 0.110
1 3 3
(M1)A1
Note: Accept solutions laid out in terms of conditional probabilities.
162
(d)
EITHER
We know that she missed the 6th lesson so she must have missed
3 from the first 5 lessons. All are equally likely so the probability
3
that she missed the 2nd lesson is .
5
R1A1
OR
require P (missed 2ndX = 6) =
P(missed 2 nd and X = 6)
P( X = 6)
R1
P (missed 2nd and X = 6) = P(missed 2nd and 6th and 2 of remaining 4)

2
2
1 1 4 1 2
24
= = 6
3 3 2 3 3
3
4
5 1 2
40
P(X = 6) = = 6
3
3 3 3
24 3 6 3
=
so required probability is 6
3 40 5
A1
[10]
198. (a)
(b)
a Type I error is when H0 is rejected, when H0 is actually true
A1
P(H0 rejected | H0 true) = P(at least one R|6 J and 2 R)
M1
EITHER
P(no R | H0 true) =
6 5 15
=
8 7 28
(A1)
OR
let X count the number of Rs given by the computer
under H0, X ~ Hyp(2, 2, 8)
2 6

0 2 15
=
P(X = 0) =
28
8

2
(A1)
THEN
P (at least one R | H0 true) = 1
P (Type I error) =
15
28
13
(= 0.464)
28
(M1)
A1
163
(c)
a Type II error is when H0 is accepted, when H0 is actually false
A1
(d)
P (H0 accepted | H0 false) = P (2 J|3 J and 4 R)
M1
EITHER
P(2 J|H0 false) =
3 2 1
=
7 6 7
(A1)
OR
let Y count the number of Rs given by the computer.
H0 false implies Y ~ Hyp(2, 4, 7)
4 3

0 2 1
=
P(Y = 0) =
7
7

2
(A1)
THEN
P (Type II error) =
1
(= 0.143)
7
A1
[9]
199. (a)
observed table
x
75 x
60 x
x 35
A1A1A1
(b)
expected table
45 30
15 10
A1A1
Note: Award A1 for every 2 correct entries.
(c)
2
calc
=
( x 45) 2 ( x 45) 2 ( x 45) 2 ( x 45) 2

+
+
+
45
30
15
10
2
(x 45)2
9
(M1)
A1
164
(d)
v=1
(M1)
H0 accepted at 5 % level implies
2
(x 45)2 < 3.841
9
(x 45)2 < 17.28

4.157 < x 45 < 4.157
40.8 < x < 49.2
x = 41, 42, 43, 44, 45, 46, 47, 48, 49
R1
A1A1
A1
[12]
200. (a)
(b)
(i)
a2 0 for all a
(ii)
aRb ab 0
ba 0
bRa, hence R is symmetric
M1
R1
A1
(iii)
aRb and bRc ab 0 and bc 0, is aRc?

no, for example, 3R0 and 0R5, but 3R5 is not true
aRc is not generally true, hence R is not transitive
M1
A1
A1
, hence R is reflexive
R does not satisfy all three properties, hence R is not an equivalence

relation
R1
R1
[8]
201. (a)
(b)
(c)
let x
for example, f(0, x) = x,
hence f is surjective
M1
A1
(ii)
for example, f(2, 3) = f(4, 3) = 3, but (2, 3) (4, 3)

hence f is not injective
M1
A1
(i)
there is no element of P such that g(p) = 7, for example

hence g is not surjective
R1
A1
(ii)
g(p) = g(q) xp = xq p = q, hence g is injective
(i)
for x > 0, h(x) = 2, 4, 6, 8...

for x 0, h(x) = 1, 3, 5, 7...
therefore h is surjective
A1
A1
A1
(ii)
for h(x) = h(y), since an odd number cannot equal an even

number, there are only two possibilities:
R1
(i)
M1A1
165
x, y > 0, 2x = 2y x = y;
x, y 0, 1 2x = 1 2y x = y
therefore h is injective
A1
A1
A1
Note: This can be demonstrated in a variety of ways.

(d)
so h is the only bijection
A1
[16]
202. to show that A (B C) (A B) (A C)

let (a, b) A (B C)
a A and b B C
a A, and b B and b C
(a, b) A B and (a, b) A C
(a, b) (A B) (A C)
to show that (A B) (A C) A (B C)
let (a, b) (A B) (A C)
(a, b) A B, and (a, b) A C
a A and b B, and a A and b C
a A and b B C
(a, b) A (B C)
hence the two sets are equal
(M1)
A1
A1
A1
R1
A1
A1
R1
AG
Note: The first five marks are awarded for the first half of the proof
that the candidate attempts.
[8]
166
203. (a)
(i)
Cayley table for {S, }
x0
x1
x2
x3
x4
x5
x0
x0
x1
x2
x3
x4
x5
x1
x1
x2
x3
x4
x5
x0
x2
x2
x3
x4
x5
x0
x1
x3
x3
x4
x5
x0
x1
x2
x4
x4
x5
x0
x1
x2
x3
x5
x5
x0
x1
x2
x3
x4
A4
Note: Award A4 for no errors, A3 for one error, A2 for two errors,
S is closed under
x0 is the identity
x0 and x3 are self-inverses,
x2 and x4 are mutual inverses and so are x1 and x5
modular addition is associative
hence, {S, } is a group
(ii)
(b)
(i)
A1
A1
A1
A1
A1
AG
the order of x1 (or x5) is 6, hence there exists a generator,

and {S, } is a cyclic group
A1R1
e, a, b, ab
and b2, ab2
A1
A1A1
Note: Accept ba and b2a.
(ii)
(ab)2 = b2
(ab)3 = a
(ab)4 = b
hence order is 6
groups G and S have the same orders and both are cyclic
hence isomorphic
M1A1
A1
A1
A1
R1
AG
[20]
167
204. since G is closed, H will be a subset of G

closure: p, q H p = ar, q = as, r, s +
p*q = ar *as = ar+s
r + s + p*q H, hence H is closed
associativity follows since * is associative on G
A1
A1
R1
(R1)
EITHER
identity: let the order of a in G be m +, m 2
then am = e H
inverses: am1*a = e am1 is the inverse of a
(am1)n * an = e, showing that an has an inverse in H
hence H is a subgroup of G
M1
R1
A1
R1
AG
OR
since (G, *) is a finite group, and H is a non-empty closed subset of G,
then (H, *) is a subgroup of (G, *)
R4
Note: To receive the R4, the candidate must explicitly state the theorem,
i.e. the three given conditions, and conclusion.
[8]
205. METHOD 1
0
hence using lHpitals Rule,
0
g ( x) 6 x 5 sin( x 6 ) sin( x 6 )
g(x) = 1 cos(x6), h(x) = x12;
=
=
h ( x)
12 x 11
2x 6
f(0) =
(M1)
A1A1
EITHER
g ( x) 0
= , using lHpitals Rule again,
h ( x) 0
g ( x) 6 x 5 cos( x 6 ) cos( x 6 )
=
=
h ( x)
2
12 x 5
g ( x) 1
1
= , hence the limit is
h ( x) 2
2
(M1)
A1A1
A1
168
OR
So lim
1 cos x 6
x 12
x 0
= lim
sin x 6
A1
2x 6
1
sin x 6
= lim
2 x0 2 x 6
1
sin x 6
= since lim
=1
x 0 2 x 6
2
x 0
A1
A1(R1)
METHOD 2
substituting x6 for x in the expansion cos x = 1
x 12 x 24
1 1
+
2
24
1 cos x 6
=
12
12
x
x
12
1 x
=
+ ...
2 24
1 cos x 6 1
lim
=
x 0
2
x 12
x2 x4
...
+
2 24
...
(M1)
M1A1
A1A1
M1A1
Note: Accept solutions using Maclaurin expansions.

[7]
206. (a)
sin
n =0
(n + 1)
n
sin
2
2
3
3
sin 2 + ...
= sin 0 sin + sin sin + sin sin
+ sin
2
2
2
2
(M1)
th
th
the n term is 1 for all n, i.e. the n term does not tend to 0
A1
hence the series does not converge
A1
169
(b)
EITHER
using the ratio test
e n +1 1 n
a
lim n +1 = lim n +1 n
n a
n
n

e 1
e n +1 1 n e
= ( 0.865)
lim n
n e 1 n +1

e
< 1, hence the series converges
(M1)
M1A1
M1A1
R1A1
OR
n =1
e n 1
n
e 1
=
=
n =1
e
1

n =1
n =1
the series is the difference of two geometric series, with r =
1
( 0.318)
for both r < 1, hence the series converges

and
M1A1
e
( 0.865)M1A1
A1
R1A1
OR
en 1 en
(M1)A1A1
< n
n
en
the series n converges since it is a geometric series such that r < 1A1R1
e n 1
therefore, by the comparison test,
converges
R1A1
n
n, 0 <
(c)
by limit comparison test with
n
n2
n +1
n + 1 n2
n +1
n(n 1)
= lim n
=1
lim
=
lim
n
n
n 1
n
n
n
n(n 1)
n2
hence both series converge or both diverge
by the p-test
n
n =1
n
2
3
n2
converges, hence both converge
(M1)
M1A1
R1
R1A1
[16]
170
207. (a)
x2 x3 x4
+ ...
+
+
2! 3! 4!
x2
putting x =
2
ex = 1 + x +
(b)
x2
2
u2
2
(M1)
x2 x4 x6
x2
x4
x6
+ 2
3
1
+
2 2 2! 2 3!
2
8 48
x
u3
u5
u7
du u
+
2
3
3 2 5 2 2! 7 2 3! 0
x3
x5
x7
+
3 2 5 2 2 2! 7 2 3 3!
x3 x5 x7
x
+
6 40 336
= x
(c)
putting x = 1 in part (b) gives
1
2
A2
e
0
x2
2
x2
2
dx 0.341
M1(A1)
A1
dx 0.85535...
(M1)(A1)
A1
[9]
171
208. writing the differential equation in standard form gives

dy
x
+
y = ex
dx x 1
x
1
dx = 1 +
dx = x + ln(x 1)
x 1
x
1
M1
M1A1
hence integrating factor is ex+ln(x1) = (x 1)ex

dy
hence, (x 1) e x
+ xex y = x 1
dx
d[( x 1)e x y ]
= (x 1)
dx
(x 1)ex y =
M1A1
(A1)
(A1)
(x 1) dx
A1
x2
x+c
2
substituting (0, 1), c = 1
x 2 2x 2
( x 1)e x y =
2
2
x 2x 2
hence, y =
(or equivalent)
2( x 1)e x
( x 1)e x y =
A1
(M1)A1
(A1)
A1
[13]
209. (a)
applying the alternating series test as n 2,
n ln n
1
1
(n + 1) ln(n + 1) n ln n
1
lim
=0
n n ln n
hence, by the alternating series test, the series converges
n,
M1
A1
A1
R1
172
(b)
1
is a continuous decreasing function, apply the integral test
x ln x
to determine if it converges absolutely
(M1)
b
1
1
dx = lim
dx
M1A1
2 x ln x
b 2 x ln x
1
let u = ln x then du = dx
(M1)A1
x
1
du = ln u
(A1)
u
b 1
dx = lim[ln(ln x)]b2 which does not exist
hence, lim
M1A1A1
b 2 x ln x
b
hence, the series does not converge absolutely
(A1)
the series converges conditionally
A1
as
[15]
210. (a)
(i)
Graph G
vertex
degree
1
A1
Graph H
vertex
degree
1
A1
(ii)
not isomorphic
Graph G has K3 as a subgraph but Graph H does not.
(or an equally valid reason)
A1
R1
Note: Award A1R0 FT if degrees are wrong in part (i) as

this makes it simpler.
(b)
(i)
e 3v 6, for v 3
(ii)
A1
(iii)
A1
A1A1
173
(iv)
from Eulers relation v e + f = 2

v v2 + 8 = 2
v2 v 6 = 0
(v + 2)(v 3) = 0
v=3
for example
M1
A1
A1
A1
Note: There are many possible graphs.
[12]
211. (a)
N = 3 + 11t
3 + 11 t 4(mod 9)
2t 1 (mod 9)
multiplying by 5, 10t 5 (mod 9)
t 5 (mod 9)
t = 5 + 9s
N = 3 + 11(5 + 9s)
N = 58 + 99s
58 + 99s 0(mod 7)
2 + s 0(mod 7)
s 5 (mod 7)
s = 5 + 7u
N = 58 + 99(5 + 7u)
N = 553 + 693u
M1
(A1)
(M1)
A1
M1
A1
A1
M1
A1
Note: Allow solutions that are done by formula or an exhaustive,

systematic listing of possibilities.
(b)
u = 3 or 4
hence N = 553 + 2079 = 2632 or N = 553 + 2772 = 3325
A1A1
[11]
174
212. (a)
(i)
(Kruskals: successively take an edge of smallest weight

without forming a cycle)
1st edge DC (weight 1)
2nd edge EG (weight 2)
3rd edge DE (weight 3)
4th edge EF (weight 6)
5th edge AD (weight 7)
6th edge AB (weight 8)
A1
A1
A1
A1
A1
A1
A1
Notes: Weights are not required on the diagram.
Allow A2(d) if the (correct) edges are in the wrong order
e.g. they have used Prims rather than Kruskals algorithm.
(ii)
total weight is 1 + 2 + 3 + 6 + 7 + 8 = 27
A1
175
(b)
EITHER
A3
OR
A3
Notes: Award A2 for five or four correct edges,
A1 for three or two correct
A0 otherwise.
Weights are not required on the diagram.
THEN
total weight is 6 + 7 + 7 + 8 + 9 + 10 = 47
A1
[12]
213. (a)
EITHER
if p is a prime ap a(mod p)
A1A1
OR
if p is a prime and a / 0(mod p) then ap1 1(mod p)
A1A1
Note: Award A1 for p being prime and A1 for the congruence.

(b)
a0 X (mod 7)
X = k 56 + 25 + 15 + 5 k
by Fermat 56 1(mod 7)
X k + 45 k (mod 7)
X 3 (mod 7)
a0 = 3
M1
R1
(M1)
A1
A1
176
(c)
X = 2 56 + 25 + 15 + 3 = 31293
A1
EITHER
X 75 = 14486
X 75 6 74 = 80
X 75 6 74 72 = 31
X 75 6 74 72 4 7 = 3
X = 75 + 6 74 + 72 + 4 7 + 3
X = (160143)7
(M1)
(A1)
A1
OR
31293 = 7 4470 + 3
4470 = 7 638 + 4
638 = 7 91 + 1
91 = 7 13 + 0
13 = 7 1 + 6
X = (160143)7
(M1)
(A1)
A1
[11]
214. (a)
as each edge contributes 1 to each of the vertices that it is incident

with, each edge will contribute 2 to the sum of the degrees
of all the vertices
so 2e = degrees
n(n + 1)
2e =
2
4n(n + 1)
n and n + 1 are coprime
(R1)
(A1)
A1
A1
R1
Note: Accept equivalent reasoning e.g. only one of n and n + 1 can be even.
4n or 4n + 1
n 0 (mod 4) or n 3 (mod 4)
(b)
A1
AG
since G is simple, the highest degree that a vertex can have is n 1

R1
the degrees of the vertices must belong to the set S = {0, 1, 2, ..., n 1} A1
proof by contradiction
if no two vertices have the same degree, all n vertices must have
different degrees
R1
as there are only n different degrees in set S, the degrees must be
precisely the n numbers 0, 1, 2, ..., n 1
R1
let the vertex with degree 0 be A, then A is not adjacent to any
of the other vertices
R1
let the vertex with degree n 1 be B, then B is adjacent to all
of the other vertices including A
R1R1
this is our desired contradiction, so there must be two vertices
of the same degree
R1
[14]
215. (a)
z =
5 and w=
4 + a2
177
w = 2z
4 + a2 = 2 5
attempt to solve equation
M1
Note: Award M0 if modulus is not used.

a = 4
(b)
A1A1
zw = (2 2a) + (4 + a)i
forming equation 2 2a = 2 (4 + a)
3
a=
2
N0
A1
M1
A1
N0
[6]
216. (a)
(b)
2 = 1 + ksin
6
1
3 = k
2
k = 6
M1
A1
AG
N0
METHOD 1
maximum sin x = 1
3
a=
2
b = 1 6(1)
=7
M1
A1
A1
N2
METHOD 2
y = 0
k cos x = 0 x =
M1
3
, ,...
2 2
3
2
b = 1 6(1)
=7
a=
A1
A1
N2
3
Note: Award A1A1 for ( , 7)
2
[5]
178
217. g(x) = 0
log5|2log3x| = 0
|2log3x| = 1
1
log3x =
2
x= 3
(M1)
A1
(A1)
1
2
so the product of the zeros of g is
A1
1
32
1
2
=1
218. finding det A = ex ex(2 + ex) or equivalent

A is singular det A = 0
ex ex(2 + ex) = 0
e2x ex 2 = 0
solving for ex
as ex > 0 (or equivalent explanation)
ex = 2
x = ln2 (only)
A1
N0
[5]
A1
(R1)
A1
(M1)
(R1)
A1
N0
[6]
219. (a)
METHOD 1
1
1
1
1
tan x = and y = arctan tan y =
2
2
3
3
1 1
+
tan x + tan y
tan (x + y) =
= 2 3 =1
1 1
1 tan x tan y
1
2 3
so, x + y = arctan 1 =
4
let x = arctan
M1
A1AG
METHOD 2
x+ y
if xy < 1
for x, y > 0 , arctan x + arctan y = arctan
1 xy
1 1
+
1
1
2
3
=
so, arctan + arctan = arctan
1 1 4
2
3
1
2 3
M1
A1AG
179
METHOD 3
an appropriate sketch
e.g.
M1
correct reasoning leading to
(b)
R1AG
METHOD 1
arctan(2) + arctan(3) =
1
1
arctan + arctan
2
2 2
3
1
1
= arctan + arctan
2
3
(M1)
(A1)
Note: Only one of the previous two marks may be implied.

=
3
=
4 4
A1
N1
180
METHOD 2
let x = arctan 2 tan x = 2 and y = arctan 3 tan y = 3
tan x + tan y
2+3
=
= 1
tan (x + y) =
1 tan x tan y 1 2 3
< x < accept 0 < x <

4
2
2
and < y < accept 0 < y <

4
2
2
< x + y < (accept 0 < x + y < )

2
(M1)
as
(R1)

so, x + y =
3
4
A1
N1
METHOD 3
x+ y
+ if xy > 1
for x, y > 0 , arctan x + arctan y = arctan
1 xy
2+3
so, arctan 2 + arctan 3 = arctan
+
1 2 3
(M1)
(A1)

=
3
4
A1
N1
181
METHOD 4
an appropriate sketch
e.g.
correct reasoning leading to
M1
3
4
R1A1
[5]
220. A =
B=
(R2 r2)
A1
r2
A1
2
from A: B = 2:1, we have R2 r2 = 2r2
R = 3r
hence exact value of the ratio R : r is
M1
(A1)
3 :1
A1
N0
[5]
182
221. METHOD 1
for finding two of the following three vectors (or their negatives)
0
2
2

AB = 2 , AC = 2 , BC = 0
1
2
1

and calculating
(A1)(A1)
EITHER
i
j k
2

AB AC = 0 2 1 = 2
2 2 2 4
1
area ABC = AB AC
2
M1A1
M1
OR
i
j
k 2

BA BC = 0 2 1 = 2
2 0 1 4
area ABC =
1
BA BC
2
M1A1
M1
OR
i
j k 2

CA CB = 2 2 2 = 2
2 0 1 4
area ABC =
1
CA CB
2
M1A1
M1
THEN
area ABC =
=
24
2
A1
AG
N0
183
METHOD 2
0
2
2

AB = 2 , AC = 2 , BC = 0
1
2
1

(A1)(A1)
EITHER
cos A =
AB AC
AB AC
5 12
sin A =
M1
6
3
or
60
15
2
5
A1
1
AB AC sin A
2
1
2
5 12
=
2
5
1
24
=
2
= 6
area ABC =
M1
A1
AG
N0
OR
cos B =
BA BC
M1
BA BC
=
1
5 5
1
5
24
24
or
25
5
1
area ABC = BA BC sin B
2
1
24
5 5
=
2
25
1
24
=
2
= 6
sin B =
A1
M1
A1
AG
N0
184
OR
cos C =
CA CB
CA CB
6
12 5
sin C =
M1
6
3
or
60
15
2
5
1
CA CB sin C
2
1
2
12 5
=
2
5
1
24
=
2
= 6
area ABC =
A1
M1
A1
AG
N0
METHOD 3
0
2
2

AB = 2 , AC = 2 , BC = 0
1
2
1

AB =
5 = c, AC = 12 = 2 3 = b, BC = 5 = a
5+2 3+ 5
= 3+ 5
2
area ABC = s ( s a )( s b)( s c)
s=
(A1)(A1)
M1A1
M1
( 3 + 5 )( 3 )( 5 3 )( 3 )
3(5 3)
A1
AG
N0
185
METHOD 4
0
2
2

AB = 2 , AC = 2 , BC = 0
1
2
1

AB = BC = 5 and AC =
ABC is isosceles
12 = 2 3
let M be the midpoint of [AC], the height BM =

area ABC =
=
2 3 2
2
(A1)(A1)
M1A1
53 = 2
M1
A1
AG
N0
[6]
186
222. (a)
A1A1
Note: Award A1 for the correct x-intercept,
A1 for completely correct graph.
(b)
METHOD 1
the area under the graph of y = x
a
for a x a, can be divided
2
into ten congruent triangles;
M1A1
the area of eight of these triangles is given by

and the areas of the other two by
so,
a
dx = 4
2
a
x dx k = 4
2
a
dx
2
a
dx
2
M1A1
A1
N0
187
METHOD 2
use area of trapezium to calculate
0
a
1 3a a
x dx = a + = a 2
a
2
2 2 2
and area of two triangles to obtain
A1
M1
a
1a
a
dx = 2 =
0
2
22
4
so, k = 4
M1
A1
A1
N0
METHOD 3
use integration to find the area under the curve
0
0
a
a
x dx =
x + dx
a
a
2
2
x2 a
=
+
2 2
M1
a2 a2
x =
+
= a2
2
2
a
A1
and
a
dx =
2
a
2
0
x+
a
dx +
2
a
2
a
x dx
2
M1
x2 a 2 x2 a
a2 a2 a2 a2 a2 a2 a2
=
A1
+ x + x =
+
+
+
=
8
4
2
2
8
4
4
2 2 0 2 2 a
2
so, k = 4
A1
N0
[7]
223. (a)
METHOD 1
V = a3
a3
3
1
3
x = a
a
3 1
= a3 3a + 3
a a
1
1
= a3 3 3 a (or equivalent)
a
a
1
a 3 3 = x 3 + 3x
a
V = x3 + 3x
A1
M1
(A1)
A1
N0
188
METHOD 2
V = a3
a3
attempt to use difference of cubes formula, x3 y3 = (x y) (x2 + xy + y2)
2
1
1
V = a a 2 + 1 +
a
a
2
1
1
= a a + 3
a
a
= x(x2 + 3) or x3 + 3x
A1
M1
(A1)
A1
N0
METHOD 3
diagram showing that the solid can be decomposed

1
into three congruent x a
cuboids with volume x
a
and a cube with edge x with volume x3
so, V = x3 + 3x
M1
A1
A1
A1
N0
189
(b)
Note: Do not accept any method where candidate substitutes

1
the given value of a into x = a .
a
METHOD 1
V = 4x x3 + 3x = 4x x3 x = 0
x(x 1)(x + 1) = 0
x = 1 as x > 0
1
1 5
so, a = 1 a2 a 1 = 0 a =
a
2
1+ 5
as a > 1, a =
2
M1
A1
M1A1
AG
N0
METHOD 2
= 4 a = a6 4a4 + 4a2 1 = 0
a
a
2
4
(a 1)(a 3a2 + 1) = 0
a3
1+ 5
3+ 5
as a > 1 a > 1, a =
a2 =
2
2
a=
1+ 5
2
M1A1
2
M1A1
AG
N0
[8]
224. (a)
f(1) = 1 arctan1 = 1
f ( 3 ) = 3 arctan( 3 ) = 3 +
(b)
f(x) = x arctan(x)
= x + arctan x
= (x arctan x)
= f(x)
A1
A1
M1
A1
AG
N0
190
(c)
(d)
< arctan x < , for any x

2
2
< arctan x < , for any x

2
2
then by adding x (or equivalent)
we have x < x arctan x < x +

2
2
as
f(x) = 1
or
x2
1+ x 2 1+ x 2
2 x(1 + x 2 ) 2 x 3
2x
f(x) =
or
2 2
(1 + x )
(1 + x 2 ) 2
f(0) = f(0) = 0
EITHER
as f (x) 0 for all values of x
((0,0) is not an extreme of the graph of f (or equivalent))
A1
R1
AG
N0
A1A1
M1A1
A1A1
R1
OR
as f(x) > 0 for positive values of x and f(x) < 0 for
negative values of x
R1
THEN
(0, 0) is a point of inflexion of the graph of f (with zero gradient)
A1
N2
191
(e)
A1A1A1
Note: Award A1 for both asymptotes.
A1 for correct shape (concavities) x < 0.
A1 for correct shape (concavities) x > 0.
(f)
(see sketch above)

as f is increasing (and therefore one-to-one) and its range is ,
f1 is defined for all x
use the result that the graph of y = f1(x) is the reflection
in the line y = x of the graph of y = f(x) to draw the graph of f1
R1
(M1)A1
[20]
225. (a)
(i)
a, 2a, 3a, ..., na are n consecutive terms of an AP

with first term a and common difference a
n(n + 1)
a
a + 2a + 3a + ... + na
2
so their mean is
=
n
n
a (n + 1)
=
2
M1A1
AG
N0
192
(ii)
4 + 2 4 + 3 4 + ... + 4n >
4(n + 1)
+ 100
2
4n(n + 1)
> 2(n + 1) + 100
2
2n2 + 2n > 2n + 102
attempt to solve
n2 > 51
so the minimum value of n that satisfies the condition is 8
M1
A1
(M1)
A1
N0
Note: Award M1A1(M1)A1 for use of equations if there is a

clear conversion to an inequality.
(b)
(i)
x1 + ... + x m + y1 + ... + y n
m+n
0 m + 1 n
=
m+n
n
=
m+n
M=
M1
A1
AG
N0
EITHER
2
n
n
0
m + 1
n
m
+
n
m
+n
S=
m+n
attempt to simplify
M1A1
m2n + n2m
( m + n) 2
m+n
S=
=
=
mn(m + n)
( m + n) 3
mn
(m + n 2 )
mn
m+n
A1
AG
N0
193
OR
m
Var(x) =
i =1
x i2 +
2
i
i =1
M 2
m+n
attempt to simplify
n
n2
Var(x) =
m + n ( m + n) 2
n
n
1
m+n m+n
n
m
=
m+n m+n
mn
=
( m + n) 2
M1A1
M1
S =
(ii)
A1
mn
m+n
AG
n
mn
=
m+n m+n
attempt to solve
n = mn
n = m, as n > 0
so, then the set has 2n numbers, x1, ..., xn, y1, ..., yn
from which the first n are all 0 and the last n are all 1
x + y1 1
hence the value of the median is n
=
2
2
M=S
N0
A1
M1
A1
(M1)
A1
N0
[17]
226. (a)
(b)
z = z, arg(z) = 0
so L(z) = ln z
A1A1
AG
N0
(i)
L(1) = ln 1 + i = i
A1A1
N2
(ii)
L(1 i) = ln 2 + i
A1A1
N2
(iii)
L(1 + i) = ln 2 + i
A1
N1
7
4
3
4
194
(c)
for comparing the product of two of the above results with the third
M1
for stating the result 1 + i = 1 (1 i) and L (1 + i) L (1) + L (1 i)R1
hence, the property L(z1z2) = L(z1) + L(z2)
does not hold for all values of z1 and z2
AG
N0
[9]
227. (a)
from f(x + y) = f(x)f(y)

for x = y = 0
we have f(0 + 0) = f(0)f(0) f(0) = (f(0))2
as f(0) 0, this implies that f(0) = 1
(b)
M1
A1
R1AG
N0
M1A1
R1AG
N0
METHOD 1
for y = x, we have f(x x) = f(x)f(x) f(0) = f(x)f(x)
as f(0) 0 this implies that f(x) 0
METHOD 2
suppose that, for a value of x, f(x) = 0
for y = x, we have f(x x) = f(x)f(x) f(0) = f(x)f(x)
substituting f(x) by 0 gives f(0) = 0 which contradicts part (a)
therefore f(x) 0 for all x.
(c)
by the definition of derivative

f ( x + h) f ( x )
f(x) = lim
h 0
h
f ( x) f (h) f ( x) f (0)
= lim
h 0
h
f (h) f (0)
= lim
f ( x)
h 0
h
= f(0)f(x) (= kf(x))
(d)
f ( x)
dx = kdx ln f(x) = kx + C
f ( x)
ln f(0) = C C = 0
f(x) = ekx
M1
A1
R1
AG
N0
(M1)
A1(A1)
A1
AG
N0
M1A1
A1
A1
N1
Note: Award M1A0A0A0 if no arbitrary constant C.

[14]
228. q(1) = k + 9
q(2) = 4k + 9
k + 9 = 7(4k + 9)
M1A1
A1
M1
195
k = 2
A1
Notes: The first M1 is for one substitution and the consequent equations.
Accept expressions for q(1) and q(2) that are not simplified.
[5]
229. (a)
64
A1
(b)
(i)
90 percentile = 87 minimum mark = 87 (accept 88)
(M1)A1
(ii)
70 percentile = 74 minimum mark = 74 (accept 73)
(M1)A1
[5]
230. (a)
kx(2 x)dx = 1
M1A1
Note: Award M1 for LHS and A1 for setting = 1 at any stage.

2
2k 2 k 3
2 x 3 x =1
0
8
k 4 = 1
3
3
k=
4
(b)
E(X) =
3
4
x 2 (2 x)dx
=1
A1
A1
AG
(M1)
A1
Note: Accept answers that indicate use of symmetry.

[6]
231. (a)
(b)
3
2
3( x + 3) + 2( x + 1)
+
=
x +1 x + 3
( x + 1)( x + 3)
3x + 9 + 2 x + 2
=
x 2 + 4x + 3
5 x + 11
= 2
x + 4x + 3
5 x + 11
2 3
2
dx =
+
dx
0 x + 4x + 3
0 x +1
x +3
= [3 ln( x + 1) + 2 ln( x + 3)] 02
= 3 ln 3 + 2 ln 5 3 ln 1 2 ln 3 (= 3 ln 3 + 2 ln 5 2 ln 3)
= ln 3 + 2 ln 5
= ln 75 (k = 75)
M1
A1
AG
M1
A1
A1
A1
[6]
196
232. (a)
8x + 2y
dy
=0
dx
M1A1
Note: Award M1A0 for 8x + 2y
dy
=4
dx
dy
4x
=
dx
y
A1
(b)
A1
(c)
V=
y dx or equivalent
V = (4 4 x )dx
2
M1
A1
= 4 x x 3
3 0
8
=
3
A1
A1
Note: If it is correct except for the omission of , award 2 marks.

[8]
233. (a)
(b)
det M = a2 + b2
a2 + b2 > 0, therefore M is non-singular or equivalent statement
a b a b a 2 b 2
=
M2 =
b a b a 2ab
2ab
a b 2
2
A1
R1
M1A1
197
(c)
EITHER
det(M2) = (a2 b2)(a2 b2) + (2ab)(2ab)
det(M2) = (a2 b2)2 + (2ab)2

(= (a2 + b2)2)
since the first term is non-negative and the second is positive
therefore det(M2) > 0
A1
R1
Note: Do not penalise first term stated as positive.

OR
det(M2) = (det M)2
since det M is positive so too is det (M2)
A1
R1
[6]
234. (a)
(b)
1 i 3
A1
EITHER
(z (1 + i 3 ))(z (1 i 3 )) = z2 2z + 4
2
p(z) = (z 2)(z 2z + 4)
= z3 4z2 + 8z 8
therefore b = 4, c = 8, d = 8
(M1)A1
(M1)
A1
OR
relating coefficients of cubic equations to roots
b = 2 + 1 + i 3 + 1 i 3 = 4
M1
c = 2 (1 + i 3 ) + 2 (1 i 3 ) + (1 + i 3 ) (1 i 3 ) = 8
d = 2(1 + i 3 )(1 i 3 ) = 8
b = 4, c = 8, d = 8
i
(c)
z2 = 2e 3 , z 3 = 2e
i
3
A1A1A1
A1A1A1
Note: Award A1 for modulus,

A1 for each argument.
[8]
198
235. let n = 1
LHS = 1 1! = 1
RHS = (1 + 1)! 1 = 2 1 = 1
hence true for n = 1
R1
r (r! ) = (k + 1)! 1
M1
r =1
k +1
r (r! ) = (k + 1)! 1 + (k + 1) (k + 1)!
M1A1
r =1
= (k + 1)!(1 + k + 1) 1
= (k + 1)!(k + 2) 1
= (k + 2)! 1
hence if true for n = k, true for n = k + 1
since the result is true for n = 1 and P (k) P(k + 1) the result is proved
by mathematical induction n +
236. (a)
(b)
a reasonable attempt to show either that n2 + n + 1 > 2n + 1 or

n2 + n + 1 > n2 1
complete solution to each inequality
cos =
=
(2n + 1) 2 + (n 2 1) 2 (n 2 + n + 1) 2
2(2n + 1)(n 2 1)
2n 3 n 2 + 2n + 1
2(2n + 1)(n 2 1)
(n 1)(n + 1)(2n + 1)
2(2n + 1)(n 2 1)
1
2
= 120
=
A1
A1
R1
R1
[8]
M1
A1A1
M1A1
M1
A1
A1
AG
[8]
237. (a)
2
2

identifies a direction vector e.g. AB = 1 or BA = 1
1
1

identifies the point (1, 1, 2)
x 1 y +1 z 2
=
=
line l1:
2
1
1
A1
A1
AG
199
(b)
1
2

r = 1 + 1
2
1

1
1

r = 2 + 2
3
1

1 + 2 = 1 + , 1 + = 2 + 2, 2 + = 3 +
equating two of the three equations gives = 1 and = 2
check in the third equation
satisfies third equation therefore the lines intersect
therefore coordinates of intersection are (1, 2, 1)
(c)
d1 = 2i + j + k, d2 = i + 2j + k
i j k
d1 d2 = 2 1 1 = i j + 3k
(M1)
A1A1
R1
A1
A1
M1A1
1 2 1
Note: Accept scalar multiples of above vectors.
(d)
(e)
equation of plane is x y + 3z = k
M1A1
contains (1, 2, 3) (or (1, 2, 1) or (1, 1, 2)) k = 1 2 + 3 3 = 6
A1
x y + 3z = 6
AG
1

direction vector of the perpendicular line is 1
3

3
1

r = 1 + m 1
4
3

(M1)
A1
Note: Award A0 if r omitted.

(f)
(i)
find point where line meets plane

(3 m) (1 m) + 3( 4 + 3m) = 6
m=2
point of intersection is (1, 1, 2)
M1
A1
A1
(ii)
for T, m = 4
so T = (1, 3, 8)
(M1)
A1
(iii)
TT = (3 + 1) 2 + (1 + 3) 2 + (4 8) 2
(M1)
176 (= 4 11)
A1
[22]
200
238. (a)
A1
Note: Award A1 for correct concavity, passing through (0, 0) and increasing.
Scales need not be there.
(b)
a statement involving the application of the Horizontal Line Test or equivalent A1
(c)
y= k x
for either x = k y or x =
f1(x) =
y2
k2
x2
A1
k2
1
dom(f (x)) = [0, [
(d)
(e)
A1
x2
= k x or equivalent method
k2
k= x
k=2
(i)
A=
A=
(y
a
y 2 )dx
M1
A1
(M1)
A1
2 x 2 1 x 2 dx
A1
4 3 1 3
= x2 x
12
3
0
16
=
3
A1
A1
201
(ii)
attempt to find either f(x) or (f1)(x)

1 1
x
, ( f ) ( x) =
f(x) =
2
x
1
c
M1
A1A1
c
2
M1
c = 23
A1
[16]
239. (a)
(b)
any appropriate form, e.g. (cos + i sin )n = cos (n) + i sin (n)
A1
zn = cos n + i sin n
1
= cos(n) + i sin(n)
zn
= cos n i sin (n)
1
therefore zn n = 2i sin (n)
z
A1
(c)
(M1)
A1
AG
5 4 1 5 3 1 5 2 1 5 1 1
1
5
z = z + z + z + z + z +
z
1 z 2 z 3 z 4 z z
(M1)(A1)
10 5
1
= z 5z + 10z
+ 3 5
z z
z
5
A1
(d)
1
1
1
3 1
5
z = z 5 5 z 3 + 10 z
z
z
z
z
5
(2i sin ) = 2i sin 5 10i sin 3 + 20i sin
16 sin5 = sin 5 5 sin 3 + 10 sin
M1A1
M1A1
AG
202
(e)
16 sin5 = sin 5 5 sin 3 + 10 sin
LHS = 16 sin
4
= 16
2
= 2 2 =
2
5
3
RHS = sin 5 sin + 10 sin

4
4
4
2
2
+ 10 2
=
5
2
2
2
A1
M1A1
Note: Award M1 for attempted substitution.
= 2 2 =
2
A1
hence this is true for =
(f)
2
0
1
sin d =
16
5
2
0
AG
(sin 5 5 sin 3 + 10 sin )d
M1
1 cos 5 5 cos 3
2
+
10 cos
=
16
5
3
0
1 1 5
0 + 10
16 5 3
8
=
15
=
(g)
2
0
cos 5 d =
A1
A1
A1
8
, with appropriate reference to symmetry and graphs.A1R1R1
15
Note: Award first R1 for partially correct reasoning e.g. sketches

of graphs of sin and cos.
Award second R1 for fully correct reasoning involving sin5 and cos5.
[22]
203
240. (a)
(b)
H ~ N(166.5, 52)
P(H 170) = 0.242...
0.242... 63 = 15.2
so, approximately 15 students
correct mean: 161.5 (cm)
variance remains the same, i.e. 25 (cm2)
(M1)(A1)
A1
A1
A2
[6]
241. (a)
(b)
i4 5i3 + 7i2 5i + 6 = 1 + 5i 7 5i + 6
=0
i root i is second root
moreover, x4 5x3 + 7x2 5x + 6 = (x i) (x + i) q(x)
where q(x) = x2 5x + 6
finding roots of q(x)
the other two roots are 2 and 3
M1A1
AG
N0
(M1)A1
A1A1
Note: Final A1A1 is independent of previous work.

[6]
204
242.
f(x) =
2
(1 + x) 2
M1A1
Note: Alternatively, award M1A1 for correct sketch of the derivative.

find at least one point of intersection of graphs
y = f(x) and y = f(x) for x = 3 or 1.73
y = f(x) and y = g (x) for x = 0
forming inequality 0 x 3 (or 0 x 1.73)
(M1)
(A1)
(A1)
A1A1
N4
Note: Award A1 for correct limits and A1 for correct inequalities.

[7]
243. (a)
X ~ Po(0.6)
P(X 1) = 1 P(X = 0)
= 0.451
M1
A1
(b)
Y ~ Po(2.4)
P(Y = 3) = 0.209
(M1)
A1
(c)
Z ~ Po(0.6n)
P(Z 3) = 1 P(Z 2) > 0.8
(M1)
(M1)
N1
Note: Only one of these M1 marks may be implied.

n 7.132.. . (hours)
so, Mr Lee needs to fish for at least 8 complete hours
A1
N2
Note: Accept a shown trial and error method that leads to a correct solution.
[7]
205
244. consider a vector parallel to each line,
4
3

e.g. u = 2 and v = 3
1
1

let be the angle between the lines
u v 12 6 + 1
cos =
=
uv
21 19
7
=
= 0.350...
21 19
7

so 0 = 69.5 or 1.21 rad or arccos
21
19
A1A1
M1A1
(A1)
A1
N4
Note: Allow FT from incorrect reasonable vectors.

[6]
245. (a)
sin
1 cos d =
(1 cos )
d = ln (1 cos ) + C
1 cos
(M1)A1A1
Note: Award A1 for ln (1 cos ) and A1 for C.
(b)
sin
1
1
a
d = [ln(1 cos ] =
1 cos
2
2
2
M1
1 cos a = e 2 a = arccos(1 e ) or 2.28
A1
N2
[5]
246. (a)
(b)
1 1 2
x
2

let A = 2 1 3 , X = y and B = 2
5 1 4
z
5

11 7 1
point of intersection is , , (or (0.917, 0.583, 0.25))
12 12 4
(M1)
A1
METHOD 1
(i)
1 1 2
det 2 1 3 = 0
5 1 a
3a + 24 = 0
a=8
M1
(A1)
A1
N1
206
1 1 2 2
consider the augmented matrix 2 1 3 2

5 1 8 5
(ii)
1 1
2 2 1 0 53 0

use row reduction to obtain 0 3 1 2 or 0 1 13 0
0 0
0 1 0 0 0 1
(or equivalent)
any valid reason
(e.g. as the last row is not all zeros, the planes do not meet)
M1
A1
R1
N0
METHOD 2
use of row reduction (or equivalent manipulation of equations)
1 1 2 2 1 1
2
2
1 2
e.g. 2 1 3 2 0 3
5 1 a 5 0 6 a 10 5
M1
A1A1
Note: Award an A1 for each correctly reduced row.

(i)
a 10 = 2 a = 8
(ii)
when a = 8, row 3 2 row 2
M1A1
N1
R1
N0
[8]
247. (a)
cos 2 x
y
dy
= 0 to obtain cos 2 xdx = e y e e dy
dx
e
1 + cos(2 x)
1
1
dx = x + sin(2 x) + C1
as cos 2 xdx =
2
2
4
y ey
ey
and e e dy = e + C 2
rearrange
ee
(M1)
M1A1
A1
Note: The above two integrations are independent and should not be
penalized for missing Cs.
a general solution of
cos 2 x
e
ee
y
dy
1
1
= 0 is x + sin(2 x) e e = C
dx
2
4
A1
0
1
+ sin(2 ) e e = e (or 1.15) (M1)

2 4
2
so, the required solution is defined by the equation
y
1
1
1
1

A1
x + sin(2 x) e e = e or y = ln ln x + sin(2 x) + e
2
4
2
4
2
2
(or equivalent)
given that y = 0 when x = , C =
(b)
for x =

, y = ln ln e (or 0.417)
2
4

N0
A1
[8]
207
248. (a)
dm dm dy
=
dt
dy dt
(M1)
= sec 2 arcsin y arcsin y r
r
r 1000
1
1
r
r
=
(or equivalent)
2
1000
y
2
y

cos arcsin
1
r
r
1
=
r2 y2
2
r y
A1A1A1
r
1000
(A1)
r2
=
r3
10 3 (r 2 y 2 ) 3
r
=
2
2
10 r y
(b)
(or equivalent)
A1
AG
dm
represents the rate of change of the gradient of the line OP
dt
N0
A1
[7]
249. (a)
(i)
1 0 0 1 1 0 0

X = B A = 1 1 0 0 1 1 = 1
1 1 1 0 0 1 1

1
0
0
1
1
1

1
Y = B A = 1 1 0 0 1 1 = 1
0 1 1 0 0 1 0
1 0
0 1
1 0
1 1
0 1
1 0
A1
A1
208
(ii)
(b)
0 1 0
X + Y = 1 0 1
0 1 0
1
1
X + Y has no inverse
as det(X1 + Y1) = 0
1
n(n + 1)
2
n
1
1(1 + 1)
1 1
for n = 1, P(1) : A = 0 1
1 P(1) is true
0 0
1
k (k + 1)
1 k
k
assume P(k) is true i.e. A = 0 1
k
0 0
1
for n = k + 1,
Ak+1 = Ak A or AAk
k (k + 1)
1 k
1 1 1
2
= 0 1
k 0 1 1
0 0
1 0 0 1
k (k + 1)
1 1+ k 1+ k +
= 0
1
1+ k
0
1
(
k
+
1
)(
k
+
2
)
1 1+ k
= 0
1
1+ k
0
1
hence P(k) P(k + 1) and P(1) is true, so P(n) is true for all n
(A1)
A1
R1
1 n
n
if P(n): A = 0 1
0 0
A1
M1
M1
M1A1
A1
R1
N0
209
(c)
(i)
(ii)
n(n + 1)
1 n
1 x y 1 0 0
2

n n 1
A (A ) = I 0 1
n 0 1 x = 0 1 0
0 0
1 0 0 1 0 0 1
n
(
n
+
1
)
1 x + n y + nx +
1 0 0
2

0
1
x+n
= 0 1 0
0
0 0 1
0
1
solve simultaneous equations to obtain

n(n + 1)
=0
x + n = 0 and y + nx +
2
n(n 1)
x = n and y =
2
1 n
n
n 1
A + (A ) = 0 1
0 0
n(n + 1)
1 n
2
n + 0 1
1 0 0

M1
A1
M1
A1A1
N2
n(n 1)
2 0 n2
2
n = 0 2 0
1 0 0 2
A1
[18]
250. (a)
(b)
OP = i + 2j k
the coordinates of P are (1, 2, 1)
(M1)
A1
EITHER
x = 1 + t, y = 2 2t, z = 3t 1
y2
z +1
= t,
=t
x 1 = t,
2
3
y 2 z +1
=
x1=
2
3
M1
A1
AG
N0
OR
x 1 1

y = 2 + t 2
z 1 3

M1A1
y 2 z +1
=
2
3
AG
x1=
210
(c)
(i)
2(1 + t) + (2 2t) + (3t 1) = 6 t = 1
(ii)
coordinates are (2, 0, 2)
M1A1
N1
A1
Note: Award A0 for position vector.

(iii)
distance travelled is the distance between the two points

2
(2 1) + (0 2) + (2 + 1) = 14 (= 3.74)
(d)
(i)
(M1)A1
distance from Q to the origin is given by

d(t) =
t 4 + (1 t ) 2 + (1 t 2 ) 2 (or equivalent)
e.g. for labelled sketch of graph of d or d
(ii)
(M1)
M1A1
(M1)(A1)
the minimum value is obtained for t = 0.761
A1
the coordinates are (0.579, 0.239, 0.421)
A1
N3
Note: Accept answers given as a position vector.
(e)
(i)
0
1
4

a = 1 , b = 0 and c = 1
1
0
3

substituting in the equation a b = k(b c), we have
1 4
0 1
1
3

1 0 = k 0 1 1 = k 1
0 3
1 0
1
3

1
k = 1 and k = which is impossible
3
so there is no solution for k
(M1)A1
(M1)
A1
R1
211
(ii)
BA and CB are not parallel

(hence A, B, and C cannot be collinear)
R2
Note: Only accept answers that follow from part (i).

[23]
251. (a)
METHOD 1
using GDC
a = 1, b = 5, c = 3
A1A2A1
METHOD 2
x = x + 2 cos x cos x = 0
3
x = , ...
2 2
a = 1, c = 3
1 2 sin x = 0
1
5
sin x = x = or
2
6
6
b=5
M1
A1
M1
A1
Note: Final M1A1 is independent of previous work.
(b)
(c)
5 5
f =
3 (or 0.886)
6 6
f(2) = 2 + 2 (or 8.28)
5
the range is 3 , 2 + 2 (or [0.886, 8.28])

6
f(x) = 1 2 sin x
3
f = 3
2
gradient of normal =
1
3
(M1)
3
1
3
= x
2
3
2
1
x + 2 (or equivalent decimal values)
3
(i)
V=
A1
A1
y=
3
2
(M1)
(M1)
equation of the normal is y
(d)
(M1)
( x 2 ( x + 2 cos x) 2 )dx (or equivalent)
(M1)
A1
N4
A1A1
Note: Award A1 for limits and A1 for and integrand.
(ii)
V=
3
2
( x 2 ( x + 2 cos x) 2 )dx
212
3
2
(4 x cos x + 4 cos 2 x)dx
using integration by parts

and the identity 4cos2 x = 2cos 2x + 2,
M1
M1
3
V = [(4 x sin x + 4 cos x) + (sin 2 x + 2 x)] 2
A1A1
Note: Award A1 for 4x sin x + 4 cos x and A1 for sin 2x + 2x.
3
3
= 6 sin
+ 4 cos + sin 3 + 3 2 sin + 4 cos + sin +
2
2
2
2

A1
= (6 + 3 2 )
= 62
AG
N0
Note: Do not accept numerical answers.

[19]
252. (a)
A1A1
Note: Award A1 for a diagram with two intersecting regions and at
least the value of the intersection.
(b)
9
20
A1
(c)
9 3
=
12 4
A1
1
253. direction vector for line = or any multiple
1
2 sin 1
= 0
1 sin 1
2 sin 1 + sin = 0
[4]
A1
M1
A1
213
Note: Allow FT on candidates direction vector just for line above only.
3 sin = 1
1
sin =
3
= 0.340 or 19.5
A1
A1
Note: A coordinate geometry method using perpendicular gradients is acceptable.

[5]
254. (a)
f(x) =
1
1 x2
2x
1 x2
1 2x
=
1 x2
M1A1A1
Note: Award A1 for first term,

M1A1 for second term (M1 for attempting chain rule).
(b)
f(x) = 0
x = 0.5, y = 2.26 or
(M1)
+ 3 (accept (0.500, 2.26))

6
A1A1
N3
[6]
255. (a)
EITHER
1
parallel to the x-axis
2
1
stretch of a scale factor of
2
translation of
A1A1
OR
1
2
translation of 1 parallel to the x-axis
stretch of a scale factor of
A1A1
Note: Accept clear alternative terminologies for either transformation.
214
(b)
EITHER
1.16 < x < 5.71 6.75 < x 10
A1A1A1A1
OR
]1.16, 5.71[ ]6.75,10]
A1A1A1A1
Note: Award A1 for 1 intersection value, A1 for the other 2,

A1A1 for the intervals.
[6]
256. (a)
using the law of total probabilities:

0.1p + 0.3(1 p) = 0.22
0.1p + 0.3 0.3p = 0.22
0.2p = 0.08
0.08
p=
= 0.4
0 .2
p = 40% (accept 0.4)
(b)
required probability =
=
0.4 0.1
0.22
2
(0.182)
11
(M1)
A1
A1
M1
A1
[5]
215
257.
dv
1
= v
dt
2
dv
1
= dt
v
2
1
ln v = t + c
2
1
1
t +c
t
= Ae 2
v= e 2
t = 0, v = 40, so A = 40
v=
A1
1
t
40e 2
(A1)
(A1)
(A1)
M1
(or equivalent)
A1
[6]
258. (a)
(b)
dy
= 24x2 + 2bx + c
dx
24x2 + 2bx + c = 0
= (2b)2 96(c)
4b2 96c > 0
b2 > 24c
1
1
b + c + d = 12
4
2
6+b+c=0
9
3
27 + b c + d = 20
4
2
54 3b + c = 0
(A1)
(M1)
(A1)
A1
AG
1+
A1A1A1
Note: Award A1 for each correct equation, up to 3, not necessarily simplified.

b = 12, c = 18, d = 7
A1
[8]
216
259. EITHER
with no restrictions six people can be seated in 5! = 120 ways
we now count the number of ways in which the two restricted people will be
sitting next to each other
call the two restricted people p1 and p2
they sit next to each other in two ways
A1
the remaining people can then be seated in 4! ways

the six may be seated (p1 and p2 next to each other) in 2 4! = 48 ways
with p1 and p2 not next to each other the number of ways = 120 48 = 72
A1
M1
A1
N3
A1
M1A1
A1
A1
N3
A1
OR
person p 1 seated at table in 1 way
p2 then sits in any of 3 seats (not next to p1)
the remaining 4 people can then be seated in 4! ways
number ways with p1 not next to p2 = 3 4! = 72 ways
Note: If candidate starts with 6! instead of 5!, potentially leading to an
answer of 432, do not penalise.
[5]
260.
4 x 2 dx
x = 2 sin
dx = 2 cos d
A1
4 4 sin 2 cos d
= 2 cos 2 cos d
= 4 cos d
now cos d
2
M1A1
2 cos 2 + 2 d
sin 2 1
+
=
2
4
M1A1
A1
217
so original integral
= sin 2 + 2
= 2 sin cos + 2
x
4 x 2
x
+ 2 arcsin
= 2
2
2
2
x 4 x2
x
+ 2 arcsin + C
2
2
A1A1
Note: Do not penalise omission of C.
A = , B = 2
2
261. (a)
(b)
let HPQ =
h
tan =
40
d
1 dh
sec 2
=
dt 40 dt
d
1
=
dt 4 sec 2
16
5
=
sec = or = 0.6435
4 25
4
= 0.16 radians per second

x 2 = h2 + 1600, where PH = x
dx
dh
= 2h
2x
dt
dt
dx h
= 10
dt x
10h
=
2
h + 1600
dx
h = 30,
= 6 m s1
dt
[8]
M1
(A1)
A1
AG
M1
A1
(A1)
A1
Note: Accept solutions that begin x = 40 sec or use h = 10t.

[7]
262. (a)
X ~ N(998, 2.52)
P(X > 1000) = 0.212
M1
AG
(b)
X ~ B(5, 0.2119...)
evidence of binomial
(M1)
218
5
P(X = 3) = (0.2119...)3 (0.7881...)2 = 0.0591 (accept 0.0592)
3
(c)
P(X 1) = 1 P(X = 0)
1 (0.7881...)n > 0.99
(0.7881...)n < 0.01
(M1)A1
(M1)
A1
Note: Award A1 for line 2 or line 3 or equivalent.

n > 19.3
minimum number of bottles required is 20
(d)
996
1000
= 1.1998 (accept 1.2)
M1A1
= 0.3999 (accept 0.4)
M1A1
= 999 (ml), = 2.50 (ml)
(e)
(i)
(ii)
(A1)
A1N2
e m m 2 e m m 3 e m m 4
=
+
2!
3!
4!
2
3
4
m
m
m
=
+
2
6
24
2
3
12m 4m m4 = 0
m = 6, 0, 2
m=2
P(X > 2) = 1 P(X 2)
= 1 P(X = 0) P(X = 1) P(X = 2)
2 2 e 2
= 1 e2 2e2
2!
= 0.323
A1A1
M1A1
(A1)
A1N2
(M1)
A1
[20]
263. (a)
(b)
PQ = 50 and non-intersecting
R1
a construction QT (where T is on the radius MP), parallel to MN,

so that QTM = 90 (angle between tangent and radius = 90)
lengths 50, x 10 and angle marked on a diagram, or equivalent
M1
R1
Note: Other construction lines are possible.
(c)
50 2 ( x 10) 2
(i)
MN =
(ii)
maximum for MN occurs when x = 10
A1
A1
219
(d)
(i)
(ii)
(e)
(i)
= 2 2
M1
x 10
= 2 2 arccos
50
A1
= 2 (= 2)
x 10
= 2 cos 1

50
b(x) = x + 10 + 2 50 2 ( x 10) 2
A1
A1
A1A1A1
x 10
1 x 10
2
2
= x 2 2 cos 1
+ 20 cos
+ 2 50 ( x 10)
50
50
M1A1
(ii)
maximum value of perimeter = 276
(iii)
perimeter of 200 cm b (x) = 200

when x = 21.2
A2
(M1)
A1
[18]
220
264. (a)
A3
Note: Award A1 for each correct shape,
A1 for correct relative position.
(b)
(c)
(d)
ex sin (4x) = 0
sin (4x) = 0
4x = 0, , 2, 3, 4, 5
2 3 4 5
, ,
,
x = 0, ,
4 4 4 4 4
ex = ex sin (4x) or reference to graph
sin 4x = 1
5 9
,
4x = ,
4 2 2
5 9
,
x= ,
8 8 8
(i)
(ii)
y = ex sin 4x
dy
= ex sin 4x + 4ex cos 4x
dx
y = ex
dy
= ex
dx
verifying equality of gradients at one point
verifying at the other two
since
dy
0 at these points they cannot be local maxima
dx
(M1)
A1
A1
AG
M1
A1
A1
N3
M1A1
A1
R1
R1
R1
221
(e)
(i)
maximum when y = 4ex cos 4x ex sin 4x = 0

arctan(4) arctan(4) + arctan(4) + 2
,
,
, ...
x=
4
4
4
maxima occur at
arctan(4) arctan(4) + 2 arctan(4) + 4
,
,
x=
4
4
4
so y1 = e
1
(arctan( 4 ))
4
sin(arctan (4))
(= 0.696)
1
(arctan( 4 ) + 2 )
e 4
y2 =
sin(arctan (4) + 2)
1
(arctan(4) + 2 )
= e 4
sin(arctan(4)) = 0.145
1
(arctan( 4 ) + 4 )
y3 = e 4
sin(arctan (4) + 4)
1
(arctan(4) + 4 )
= e 4
sin(arctan(4)) = 0.0301
(ii)
for finding and comparing

r= e
y3
y
and 2
y2
y1
M1
A1
A1
A1
A1
N3
M1
A1
Note: Exact values must be used to gain the M1 and the A1.
[22]
265. (a)
(b)
(c)
A ~ N (30, 32)
P(A > 35) = 0.0478
(M1)A1
let X = B1 + B2 + B3 + B4 + B5
E(X) = 5E(B) = 60
Var(X) = 5Var(B) = 20
P(X < 70) = 0.987
A1
(M1)A1
A1
let Y = A 2B
E(Y) = E(A) 2E(B) = 6
Var (Y) = Var (A) + 4Var (B) = 25
P(Y > 0) = 0.885
(M1)
A1
(M1)A1
A1
[11]
266. (a)
x=
= 1.2
n
s n21 = 0.524...
it is a one tailed test
H0 : = 1.1, H1 : > 1.1
(A1)
(A1)
A1
222
EITHER
1.2 1.1
t=
= 0.535
0.524...
15
v = 14
tcrit = 1.761
since 0.535 < tcrit, we accept H0 that there is no increase in the
amount of the chemical
(M1)A1
(A1)
A1
R1
OR
p = 0.301
since p > 0.05 we accept H0 that there is no increase in the
amount of the chemical
(b)
90 % confidence interval = 1.18 1.645
0.0256
15
= [1.11, 1.25]
A4
R1
(M1)A1A1A1
A1
N5
[13]
267. (a)
P(X x) = 1
= 1 e t
=1+e
= et
(b)
(i)
e t dt
(M1)
x
0
A1
estimate of mean =
=
(ii)
A1
AG
270
1
=9=
30
(M1)
1
9
40
using part (a) a = 40 and b = 9 e 9
A1
A1A1
223
(iii)
P(X d) = 1 P(X < d)
(M1)
d
9
= 0.65
1
d = ln 0.65
9
d = 9 ln 0.65 = 9 ln
A1
A1
20
13
AG
224
(c)
H0 : the data follows an exponential distribution with = 0.1

H1 : the data does not follow an exponential distribution with = 0.1
A1
Note: = 0.1 must be seen.

any attempt to use the exponential distribution to calculate
expected probabilities
M1
Rainfall (cm)
Observed
Expected
x6
18
13.536
6 < x 13
8.288
13 < x 35
7.270
x > 35
0.906
A1A1A1A1
we need to combine last two classes
M1
Rainfall (cm)
Observed
Expected
x6
18
13.536
6 < x 13
8.288
x > 13
8.176
EITHER
( fo fe )2
= 4.81 (accept answers that are between
fe
4.8 and 4.9)
degrees of freedom = v = 3 1 = 2
2
calc
=
(M1)A1
(A1)
critical value is 5.991

2
since calc
< 5.991 we accept H0 and hence the data follows an
exponential distribution with = 0.1
A1
R1
OR
p = 0.0903 (accept answers that are between 0.086 and 0.091)
since p > 0.05 we accept H0 and hence the data follows an exponential
distribution with = 0.1
A4
R1
[22]
268. (a)
geometric distribution
A1
225
(b)
let R be the event throwing the disc and it landing on red and
let B be the event throwing the disc and it landing on blue
P(X = 1) = p = P(1B and (n 1)R or 1R and (n 1)B)
1 1
= n
2 2
n
= n 1
2
n 1
1 1
+ n
2 2
(M1)
n 1
(A1)
A1
n
n
hence P(X = x) = n 1 1 n 1
2 2
x 1
, (x 1)
A1
Notes: x 1 not required for final A1.

Allow FT for final A1.
(c)
E(X) =
=
(d)
1
p
2 n 1
n
A1
when n = 7, P(X = x) = 1
64
=
7 57

64 64
7
64
(M1)
x 1
P(X k) =
x 1
7 57

x =1 64 64
x 1
(M1)(A1)
57
1
7
64
> 0.5
57
64
1
64
k
57
1 > 0.5
64
(M1)(A1)
57
< 0.5
64
log 0.5
k>
57
log
64
k > 5.98
k=6
(M1)
(A1)
A1
Note: Tabular and other GDC methods are acceptable.

[14]
269. (a)
1
226
see the Cayley table, (since there are no new elements) the set is closed
1 is the identity element
1 and 1 are self inverses and i and i form an inverse pair, hence every
element has an inverse
multiplication is associative
hence {1, 1, i, i} form a group G under the operation of multiplication
(b)
(i)
(ii)
(c)
A1
A1
A1
A1
AG
aba = aab
= eb
=b
A1
AG
abab = aabb
= ee
=e
A1
AG
(i)
*
ab
ab
ab
ab
ab
ab
e
A2
Note: Award A1 for 1 or 2 errors, A0 for more than 2.

(ii)
see the Cayley table, (since there are no new elements) the set is closed
H has an identity element e
A1
all elements are self inverses, hence every element has an inverse A1
the operation is associative as stated in the question
hence {e, a, b, ab} forms a group G under the operation *
AG
(iii)
since there is symmetry across the leading diagonal of the group

table, the group is Abelian
A1
A1
227
(d)
consider the element i from the group G

(M1)
i2 = 1
i3 = i
i4 = 1
thus i is a generator for G and hence G is a cyclic group
A1
i is the other generator for G
A1
for the group H there is no generator as all the elements are self inverses R1
(e)
since one group is cyclic and the other group is not, they are not isomorphicR1
[17]
270. (a)
(i)
(ii)
(iii)
(b)
if * is commutative a * b = b * a
since a + b + 1 = b + a + 1, * is commutative
R1
let e be the identity element

a*e=a+e+1=a
e = 1
M1
A1
let a have an inverse, a1

a * a1 = a + a1 + 1 = 1
a1 = 2 a
M1
A1
(x1, y1) ((x2, y2) (x3, y3)) = (x1, y1)

= (x1 + x2 + x3 + 2, 9y1y2y3)
(x2 + x3 + 1, 3y2y3)
((x1, y1) (x2, y2)) (x3, y3) = (xl + x2 + 1, 3y1y2)

= (x1 + x2 + x3 + 2, 9y1y2y3)
hence
is associative
(x3, y3)
M1
A1A1
M1
A1
R1
[11]
228
271. (a)
consider (x, y)R(x, y)

since x x = 0 and y y = 0, R is reflexive
A1
assume (x, y)R(a, b)

x a = 3M and y b = 2N
a x = 3M and b y = 2N
(a, b)R(x, y)
hence R is symmetric
M1
A1
assume (x, y)R(a, b)

x a = 3M and y b = 2N
assume (a, b)R(c, d)
a c = 3P and b d = 2Q
x c = 3(M + P) and y d = 2(N + Q)
hence (x, y)R(c, d)
hence R is transitive
M1
M1
A1
A1
therefore R is an equivalence relation

(b)
{(x, y) : x = 3m + 2, y = 2n + 1, m, n
(c)
{3m, 2n} {3m + 1, 2n} {3m + 2, 2n}

{3m, 2n + 1} {3m + 1, 2n + 1} m, n
272. (a)
(b)
AG
}
A1A1
A1A1A1A1A1
[14]
we need to show that the function is both injective and surjective

to be a bijection
R1
suppose f(x, y) = f(u, v)

(2x + y, x y) = (2u + v, u v)
forming a pair of simultaneous equations
2x + y = 2u + v
(i)
xy=uv
(ii)
(i) + (ii) 3x = 3u x = u
(i) 2(ii) 3y = 3v y = v
hence function is injective
M1
let 2x + y = s and x y = t
3x = s + t
s+t
x=
3
also 3y = s 2t
s 2t
y=
3
for any (s, t) there exists (x, y)
surjective
M1
x + y x 2y
,
the inverse is f1(x, y) =
3
3
M1
A1
A1
R1
A1
A1
and the function is

R1
A1
[11]
229
273. we are trying to prove (A\B)\C A\(B\C)

LHS = (A B)\C
= (A B) C
RHS = A\(B C)
= A (B C)
= A (B C)
as LHS does not contain any element of C and RHS does, LHS RHS
hence set difference is not associative
M1(A1)
(A1)
A1
(A1)
A1
R1
AG
Note: Accept answers that use a proof containing a counter example.

[7]
274. (a)
(b)
sec 2 x
x 0 x + x 2
x 0 1 + 2 x
tan x 1
lim
= =1
x 0 x + x 2
1
lim
tan x
= lim
1 x 2 + 2 x 2 ln x
2 x + 2 x + 4 x ln x
= lim
x 1
x 1
x
x
1 sin
cos
2
2
2
4 + 4 ln x
lim 2
x 1
x
sin
4
2
2
1 x + 2 x 2 ln x
4
16
lim
= 2 = 2
x 1
x
1 sin
2
4
lim
M1A1A1
A1
M1A1A1
M1A1A1
A1
[11]
230
275. (a)
dy
= y tan x + cos x, f(0) = 1
dx
d2 y
dy
= y sec 2 x +
tan x sin x
now
2
dx
dx
from
A1
M1A1A1A1
Note: Award A1 for each term on RHS.
A1
x 2
+x
2
4
A1
f (0) =
y=
(b)
recognition of integrating factor

tan xdx
integrating factor is e
(M1)
= eln cosx
= cos x
(A1)
(A1)
y cos x = cos 2 xdx
M1
1
(1 + cos 2 x)dx
2
x sin 2 x
y cos x = +
+k
2
4
when x = , y = 0 k =
2
x sin 2 x
y cos x = +
2
4
2
x sin 2 x
y = sec x +

4
2
2
y cos x =
276. (a)
comparing with the series
A1
A1
M1A1
(A1)
A1
[17]
A1
n =1
using the limit comparison test

1
sin
n = lim sin x = 1
lim
n
1 x 0 x
n
1
1
since
diverges, sin diverges
n
n =1 n
n =1
(M1)
M1A1
A1
231
(b)
using integral test

let u = ln x
du 1
=
dx x
1
1
1
1
dx =
du = =
2
2
u
ln x
x(ln x)
u
(M1)
(M1)
A1
1
dx = lim
2
a
x(ln x)
ln x 2
1
1
1
+
= lim
a ln a
ln 2
1
as a ,
0
ln a
1
1
dx =
2
2 x (ln x )
ln 2
(M1)(A1)
(A1)
A1
hence the series is convergent
AG
[12]
277. (a)
Using an increment of 0.25 in the x-values
A1
xn
yn
f(xn, yn)
hf(xn, yn)
yn+1 = yn + hf(xn, yn)
0.25
0.75
(M1)A1
1.25
0.75
0.68
0.17
0.58
A1
1.5
0.58
0.574756
0.143689
0.4363...
A1
1.75 0.436311
0.531080
0.132770
0.3035...
A1
Note: The A1 marks are awarded for final column.
y(2) 0.304
A1
232
(b)
(i)
let y = vx
dy
dv
=v+x
dx
dx
dv v 2 x 2 + x 2
v+x
=
dx
2x 2
dv 1 2v + v 2
x
=
dx
2
dv (1 v) 2
x
=
dx
2
2
1
dv =
dx
2
x
(1 v)
2(1 v)1 = ln x + c
2
= ln x + c
y
1
x
when x = 1, y = 1 c = 1
2x
= ln x + 1
x y
y = x
(ii)
2x
x ln x x
=
1 + ln x 1 + ln x
when x = 2, y = 0.362 accept 2
1 + ln 2
M1
(A1)
(M1)
(A1)
A1
M1
A1A1
M1A1
M1A1
A1
[20]
278. (a)
EITHER
Prims algorithm
A1
OR
Kruskals algorithm
A1
233
(b)
EITHER
using Prims algorithm, starting at A
Edge
Cost
AC
A1
CD
A1
CF
A1
FE
A1
AB
A1
lowest cost road system contains roads AC, CD, CF, FE and AB
cost is 20
A1
A1
OR
using Kruskals algorithm
Edge
Cost
CD
A1
CF
A1
FE
A1
AC
A1
AB
A1
lowest cost road system contains roads CD, CF, FE, AC and AB
cost is 20
A1
A1

[8]
279. (a)
12 306 = 4 2976 + 402

2976 = 7 402 + 162
402 = 2 162 + 78
162 = 2 78 + 6
78 = 13 6
therefore gcd is 6
M1
M1
A1
A1
R1
234
(b)
6996 means there is a solution

6 = 162 2(78)
= 162 2(402 2(162))
= 5 (162) 2 (402)
= 5 (2976 7 (402)) 2 (402)
= 5 (2976) 37 (402)
= 5(2976) 37(12 306 4(2976))
= 153(2976) 37(12 306)
996 = 25 398(2976) 6142(12 306)
x0 = 6142, y0 = 25 398
2976
x = 6142 +
t = 6142 + 496t
6
12306
y = 25398
t = 25398 2051t
6
(M1)(A1)
(A1)
(A1)
(A1)
(A1)
M1A1A1
[14]
280. (a)
A3
Note: Award A2 for one missing or misplaced edge,
A1 for two missing or misplaced edges.
(b)
(i)
(ii)
(c)
(i)
an Eulerian circuit is one that contains every edge of the graph

exactly once
A1
a possible Eulerian circuit is

PQSPQQRTRRP
A2
a Hamiltonian cycle passes through each vertex of the graph
A1
235
exactly once
(ii)
(d)
(i)
A1
to pass through T, you must have come from R and must return to R.R3
hence there is no Hamiltonian cycle
2
using the adjacency matrix A = 1
2
1
1
1
0
1
1
1
0
2
1
1
0
0
0
0
2 ,
(M1)
we need the entry in the first row second column of the matrix A5 (M1)
245 309 274 143 126
309 363 322 168 156

A5 = 274 322 295 141 164
(A1)
143 168 141 77 72
126 156 164 72 72

hence there are 309 ways
A1
(ii)
13 21 17 10 6
21 22 19 11 8
A3 = 17 19 18 7 14
10 11 7 5 4
6 8 14 4 4
hence the pairs of vertices are PQ, PR and QR
(M1)
A1A1A1
[19]
236
281. let x be the number of guests

x 1(mod 2)
x 1(mod 3)
x 1(mod 4)
x 1(mod 5)
x 1(mod 6)
x 0(mod 7) congruence (i)
the equivalent of the first five lines is
x 1(mod(lcm of 2, 3, 4, 5, 6)) 1(mod 60)
x = 60t + 1
from congruence (i) 60t + 1 0 (mod 7)
60t 1 (mod 7)
60t 6 (mod7)
4t 6 (mod 7)
2t 3 (mod 7)
t = 7u + 5 (or equivalent)
hence x = 420u + 300 + 1
x = 420u + 301
smallest number of guests is 301
(M1)(A2)
A1
M1A1
A1
A1
A1
A1
N6
Note: Accept alternative correct solutions including exhaustion or formula

from Chinese remainder theorem.
[10]
282. (a)
(b)
using Fermats little theorem n5 n(mod 5)

n5 n 0 (mod 5)
now n5 n = n(n4 1)
= n(n2 1)(n2 + 1)
= n(n 1)(n + 1)(n2 + 1)
hence one of the first two factors must be even
i.e. n5 n 0 (mod 2)
thus n5 n is divisible by 5 and 2
hence it is divisible by 10
in base 10, since n5 n is divisible by 10, then n5 n must end in
zero and hence n5 and n must end with the same digit
(M1)
A1
(M1)
A1
R1
R1
R1
consider n5 n = n (n 1) (n + 1) (n2 + 1)
this is divisible by 3 since the first three factors are consecutive integers R1
hence n5 n is divisible by 3, 5 and 2 and therefore divisible by 30
in base 30, since n5 n is divisible by 30, then n5 n must end in zero and
hence n5 and n must end with the same digit
R1
[9]
237
283. (a)
(b)
4a + b = 5n for a, b, n
reflexive:
4a + a = 5a so aRa, and R is reflexive
A1
symmetric:
4a + b = 5n
4b + a = 5b b + 5a 4a
= 5b + 5a (4a + b)
= 5m so bRa , and R is symmetric
M1
A1
A1
transitive:
4a + b = 5n
4b + c = 5k
4a + 5b + c = 5n + 5k
4a + c = 5(n + k b) so aRc , and R is transitive
M1
M1
A1
A1
therefore R is an equivalence relation
AG
equivalence classes are

{... 10, 5, 0, 5, 10, ...}
{... 9, 4, 1, 6, 11, ...}
{... 8, 3, 2, 7, 12, ...}
{... 7, 2, 3, 8, 13, ...}
{... 6, 1, 4, 9, 14, ...}
or { 0 , 1 , 2 , 3 , 4 }
(M1)
A2
Note: Award A2 for all classes, A1 for at least 2 correct classes.

[11]
284. (a)
(b)
P(X 2) = 0.4
P(X = 0) + P(X = 1) + P(X = 2) = 0.4
2 e
e + e +
= 0.4
2!
mean, = 3.11
(M1)
(A1)
using a GDC
mode = 3
(M1)
A1
A1
A1
[6]
238
285. 3k + 2 and 5k + 3, k are relatively prime

if, for all k , there exist m, n such that
m(3k + 2) + n(5k + 3) = 1
3m + 5n = 0
2m + 3n = 1
m = 5, n = 3
hence they are relatively prime
R1M1A1
A1
A1
A1
AG
[6]
286. (a)
the probability density of R is

1
(1 r 4)
f(r) = 3
0 otherwise
M1
1
(r 1)
3
A1
F(r) =
=
(b)
(c)
1 r
dt
3 1
A1
P(A a) = P(R2 a)
a
= P R
= F

1 a
=
1
d
P(A a)
da
1
( a 16 )
f (a ) = 6 a
0 otherwise
pdf of A =
M1
A1
A1
AG
M1
A1
Note: Do not penalize absence of otherwise.

[8]
239
287. (a)
3
(3n 1)(3n + 2)
M1
9n + 3n 2
1
1
=
3n 1 (3n + 2)
A1A1
1
1 1 1 1 1 1 1 1
1
nth partial sum = + + + + ... +
2 5 5 8 8 11 11 14
3n 1 3n + 2
A1
1
1
2 3n + 2
3
lim 2
=
n 9n + 3n 2
(b)
(i)
A1
= 1 + x + x2 + x3 + x4 + ... =
(a)
A1
n =1
r =0
(ii)
2 3n + 2 = 2
1
1 x
replacing x by x2 gives
1
= 1 + (x2) + (x2)2 + (x2)3 + (x2)4 + ...
2
1 ( x )
= 1 x2 + x4 x6 + x8 ...
1+ x 2
(1)
x 2r
A1
(M1)
A1
(A1)
A1
N2
r =0
(b)
arctan x =
dx
1+ x
= x
x=0 c=0
(1)
r =0
(c)
by taking x =
M1A1
A1
arctan x =
x3 x5 x7
+
+ ... + c
3
5
7
2 r +1
x
2r + 1
A1
M1
3
r
1
(1)
= =
arctan
2r + 1
3 6 r =0
2 r +1
A1
240
100
(c)
n! = 1! + 2! + 3! + 4! + 5! + ...
M1
n =1
= 1 + 2 + 6 + 24 + 120 + ...
1 + 2 + 6 + 24 + 0 + 0 + 0 + ... (mod 15)
33(mod 15)
3 (mod 15)
M1A1
A1
AG
[21]
288. (a)
x2 x3 x4
+
+
+ ...
2! 3! 4!
ex = 1 + x +
x2
2
1
2
(b)
x2
x2
x2
2
2
x 2 2
+
+ ...
= 1 +
+
+
2!
3!
4!
2
x2
2
(i)
1 x2 x4 x6
x8
1
+
2
8 48 384
2
t2 t4 t6
t8
+
+
dt
2 8 48 384
1
x3 x5 x7
x9
x
+
6 40 336 3456
2
1
x3 x5 x7
x9
x
P(Z x) = 0.5 +
+
+
...
6 40 336 3456
2
(ii)
P(0.5 Z 0.5) =
2
0.5 3 0.5 5 0.5 7 0.5 9
0.5
+
+
...
6
40
336 3456
2
= 0.38292 = 0.383
M1A1
A1
M1
A1
R1A1
M1
A1
[9]
289. (a)
this is a two tailed test of the sample mean x

we use the central limit theorem to justify assuming that
0.54 2
X ~ N 28,
24
H0 : = 28
H1 : 28
R1
R1A1
A1
A1
241
(b)
since P (Type I error) = 0.035, critical value 2.108
0.54 2
0.54 2
or x 28 + 2.108
and x 28 2.108
24
24
(M1)A1
x 27.7676 or x 28.2324
so x 27.8 or x 28.2
(c)
(M1)(A1)(A1)
A1A1
if = 28.1
0.54 2
X ~ N 28.1,
24
P(Type II error) = P(27.7676 < x < 28.2324)

= 0.884
R1
A1
[14]
290. (a)
(i)
A2
+4
Note: Award A1 for table if exactly one error and A0 if more

than one error.
all elements belong to 4 so it is closed
0 is the identity element
2 is self inverse
1 and 3 are an inverse pair
hence every element has an inverse
hence { 4, +4} form a group G
(ii)
1 +4 1 2 (mod 4)
1 +4 1 +4 1 3 (mod 4)
1 +4 1 +4 1 +4 1 0 (mod 4)
hence 1 is a generator
therefore G is cyclic
(3 is also a generator)
A1
A1
A1
A1
AG
M1A1
R1
AG
242
(b)
+4
1
A1A1
EITHER
for the group ({1, 2, 3, 4}, 5)
is the identity and 4 is self inverse
and 3 are an inverse pair
A1
A1
OR
for G,
0 has order 1
1 has order 4
2 has order 2
3 has order 4
for H,
1 has order 1
2 has order 4
3 has order 3
4 has order 2
A1A1
THEN
hence there is a bijection
h(1) 0, h(2) 1, h(3) 3, h(4) 2
the groups are isomorphic
R1
A1
AG
k (1) 0, k (2) 3, k (3) 1, k(4) 2

is also a bijection
A1
[16]
291. (a)
h k group h k = e or h or k
hk = h hk = he k = e
but k e so h k h
similarly h k = k h k = e k h = e
but h e so h k k
hence h k = e
M1
A1
A1
AG
243
(b)
if cyclic then the group is {e, h, h2}

h2 = e or h or k
h2 = e h h = h k
h=k
but h k so h2 e
h2 = h h h = h e h = e
but h e so h2 h
so h2 = k
also h3 = h k = e
hence the group is cyclic
R1
M1
A1
A1
A1
AG
Note: An alternative proof is possible based on order of elements and Lagrange.

[8]
292. (a)
Start at an edge with weight 2, say BH, add other edges of weight 2
such that a cycle is not formed. Continue to add edges of increasing
weight until all vertices have been included.
M1
thus the minimum spanning tree is

BH + HC + GK + KH + KE + EF + GA + CD
total weight = 2 + 2 + 3 + 4 + 4 + 4 + 5 + 5 = 29
A3
A1
Note: GB may replace KH and other orders are possible.

(b)
(i)
upper bound = 2 weight of minimum spanning tree

= 58
M1
A1
244
(ii)
deleting vertex F
M1
the minimum spanning tree is

BH + HC + GK + KE + KH + GA + CD
total weight = 2 + 2 + 3 + 4 + 4 + 5 + 5 = 25
A2
A1
adding the two edges of least weight from F

lower bound = 25 + 4 + 6 = 35
M1
A1
Note: Alternative solutions may be given by deleting a different vertex.

[13]
293. (a)
EITHER
3m m 0 (mod 3)
if this is false then m 1 or 2 (mod 3) and m2 1 or 4 (mod 3)
since 4 1(mod 3) then m2 1(mod 3)
similarly n2 1(mod 3)
hence m2 + n2 2 (mod 3)
but m2 + n2 0 (mod 3)
this is a contradiction so 3m and 3n
(R1)
R1A1
A1
A1
(R1)
R1AG
OR
m 0, 1 or 2 (mod 3) and n = 0, 1 or 2 (mod 3)
m2 0 or 1 (mod 3) and n2 0 or 1 (mod 3)
so m2 + n2 0, 1, 2 (mod 3)
but 3| m2 + n2, so m2 + n2 0 (mod 3)
m 0 (mod 3) and n 0 (mod 3)
3m and 3n
M1R1
A1A1
A1
R1
R1
AG
245
(b)
suppose
2=
a
, where a, b
b
and a and b are coprime
then
2b2 = a2
a2 + b2 = 3b2
3b2 0 (mod 3)
A1
A1
A1
but by (a) a and b have a common factor so
a
b
2 is irrational
294. (a)
(b)
the general term is
M1
R1
AG
[12]
( x + 2) n
3n n
( x + 2) n +1
a
3n n
lim n +1 = lim n +1
n
n a
n n 3 (n + 1) ( x + 2)
( x + 2)n
= lim
n 3( n + 1)
( x + 2)
n
since lim
=1
n n + 1
3
( x + 2)
the series is convergent if
<1
3
then 3 < x + 2 < 3 5 < x < 1
(1) n
1 1
if x = 5, series is 1 1 + + ... +
+ ... which converges
2 3
n
1 1
1
if x = 1, series is 1 + 1 + + + ... + + ... which diverges
2 3
n
the interval of convergence is 5 x < 1
=
A1
M1A1A1
A1
A1R1
R1
A1
M1A1
M1A1
A1
[14]
246
dv
= 2v
du
du (u + 3v 3 ) u 3v 2
=
=
+
dv
2v
2v
2
2
du u 3v
=
dv 2v
2
295. (u + 3v3)
IF is e
=
2v dv
=e
1
ln v
2
v 2
u
v
M1A1
A1
M1
A1
3
3v 2
dv
M1
3
= v2 +c
5
3
u = v3 + c v
5
A1
A1
[8]
296. (a)
(b)
f(1) = 3 a + b
f(1) = 3 + a + b
3a+b=3+a+b
2a = 6
a=3
b is any real number
(A1)
(A1)
M1
A1
N4
A1
[5]
247
297. EITHER
changing to modulus-argument form
r=2
= arctan 3 =
3
n
n
n
1 + 3 = 2 n cos
+ isin
3
3
n
= 0 n = {0, 3, 6,...}
if sin
3
(M1)A1
M1
(M1)A1
N2
OR
= arctan 3 =
(M1)(A1)
M1
= k, k
n
3
n = 3k , k
M1
A1
N2
[5]
298. (a)
(b)
(c)
a = 16
A1
1 2 1
1
A = 3 1 0
16
0 3 1
1
AX = C X = A1C
1 2 1 8

1
=
3 1 0 0
16

0 3 1 4
12
1
=
24
16
4
0.75

= 1.5
0.25
(M1)A1
(M1)
A1
[5]
299. (a)
l ln x 1
(M1)
248
(b)
300. (a)
1
xe
e
y = arcsin (ln x) ln x = sin y

ln y = sin x y = esinx
f1(x) = esinx
A1A1
(M1)
(M1)
A1
[6]
EITHER
graph of the cubic is shifted horizontally one unit to the right
x = 0.796
(M1)
A1
OR
(x 1) = 1.796
x = 0.796
(b)
(M1)
A1
EITHER
stretch factor of 0.5 in the x-direction
2x = 1.796
(M1)
(M1)
Note: At least one of the above lines must be seen to award the M marks.
x = 0.898
A1
OR
8x3 2x + 4 = (2x)3 2x + 4 = 0
2x = 1.796
(M1)
(M1)
Note: At least one of the above lines must be seen to award the M marks.
x = 0.898
A1
[5]
249
P( M G )
P(G )
0.2 0.9
=
0.2 0.9 + 0.8 0.7
0.18
=
0.74
9
=
37
301. P MG =
(M1)
M1A1A1
A1
[5]
302. (a)
EITHER
let u = tan x; du = sec2 x dx
consideration of change of limits
sec 2
3
3
tan
4
x
x
dx =
1
1
u3
du
(M1)
(M1)
(A1)
Note: Do not penalize lack of limits.
2
3u 3
=
2
A1
3 3 3 3 33 3 3
=
=
2
2 2
A1A1
N0
OR
2
2
sec x
3(tan x) 3
3
dx =
3
2
tan x
4
3 3
2
2
3
M2A2
3 33 3 3
=
2 2
A1A1
N0
250
(b)
tan xdx = tan x(sec x 1)dx

= (tan x sec x tan x)dx
3
M1
1
tan 2 x ln sec x + C
2
A1A1
Note: Do not penalize the absence of absolute value or C.

[9]
303. (a)
dy
= ky cos (kt)
dt
dy
= k cos(kt)dt
y
dy
= k cos(kt )dt
y
ln y = sin(kt) + c
y = Aesin(kt)
t = 0 y0 = A
y = y0esin kt
(b)
l sin kt 1
y0e1 y y0e1
1
so the ratio is
: e or 1 : e2
e
(M1)
M1
A1
(M1)
A1
(M1)
A1
[7]
251
304.
A5
Note: Award A1 for origin
A1 for shape
A1 for maximum
A1 for each point of inflexion.
[5]
305. y = ex x = ln y
volume =
(lny ) 2 dy
(M1)A1
using integration by parts
]
2 y ln y + 2 y ]
ln( y ) 2 dy = y (ln
= y (lny ) 2
5
y) 2 1
(M1)
2 ln ydy
1
5
1
A1A1
A1A1
Note: Award A1 marks if is present in at least one of the above lines.
306. (a)
(ln y ) 2 dx = 5(ln 5)2 10 ln 5 + 8
A1
[8]
6
( 2 a + 5d )
2
27 = 2a + 5d
11
S11 = 231 231 = (2a + 10d )
2
21
=
a
+
5d
solving simultaneously, a = 6, d = 3
S6 = 81 81 =
M1A1
M1A1
A1A1
252
(b)
(c)
a + ar = 1
a + ar + ar2 + ar3 = 5
(a + ar) + ar2(1 + r) = 5
1
1 + ar 2 = 5
a
2
obtaining r 4 = 0
r = 2
r = 2 (since all terms are positive)
1
a=
3
M1
A1
A1
AP rth term is 3r + 3
1
GP rth term is 2 r 1
3
1
3(r + 1) 2r1 = (r + 1)2r1
3
n
(d)
A1
A1
prove: Pn :
(r + 1)2
r 1
= n2n, n
A1
A1
M1AG
r =1
show true for n = 1, i.e.

LHS = 2 20 = 2 = RHS
assume true for n = k, i.e.
k
(r + 1)2
r 1
= k2k , k
A1
M1
+
r =1
consider n = k + 1
k +1
(r + 1)2
r 1
= k 2 k + (k + 1)2 k
M1A1
r =1
= 2k(k + k + 2)
= 2(k + 1)2k
= (k + 1)2k+1
hence true for n = k + 1
Pk+1 is true whenever Pk is true, and P1 is true, therefore Pn is true
for n +
A1
A1
R1
[21]
253
307. (a)
A3
Note: Award A1 for each graph
A1 for the point of tangency.
point on curve and line is (a, ln a)
y = ln (x)
dy 1
dy 1
=
= (when x = a)
dx x
dx a
(M1)
(M1)A1
EITHER
gradient of line, m, through (0, 0) and (a, ln a) is
ln a 1
1
= ln a = 1 a = e m =
a
a
e
ln a
a
(M1)A1
M1A1
OR
1
(x a)
a
passes through 0 if
ln a 1 = 0
1
a=e m=
e
y ln a =
(M1)A1
M1
A1
THEN
y =
1
x
e
(b)
the graph of ln x never goes above the graph of y =
(c)
lnx
(d)
x
e ln x x ln x e x
e
exponentiate both sides of lnxe x xe ex
equality holds when x = e
letting x = e < e
A1
1
x
x , hence ln x
e
e
R1
M1A1
R1AG
R1
A1
N0
254
[17]
308. (a)
(i)
x iy
y
1
1
x
=
= 2
i 2
2
z x + iy x iy x + y
x + y2
(ii)
z+
y
1
x
=k
= x+ 2
+ i y 2
2
2
z
x +y
x +y
y
for k to be real, y 2
= 0 y(x2 + y2 1) = 0
2
x +y
hence, y = 0 or x2 + y2 1 = 0 x2 + y2 = 1
(iii)
when x2 + y2 = 1, z +
1
= 2x
z
x 1
k 2
(b)
(i)
(M1)A1
(A1)
M1A1
AG
(M1)A1
R1
AG
wn = cos(n) + i sin(n) = cos n i sin n

M1A1
n
n
w + w = (cos n + i sin n) + (cos n i sin n) = 2 cos nM1AG
255
(ii)
(rearranging)
3(w2 + w2) (w + w1) + 2 = 0
3(2 cos 2) 2 cos + 2 = 0
2(3 cos 2 cos + 1) = 0
3(2 cos2 1) cos + 1 = 0
6 cos2 cos 2 = 0
(3 cos 2)(2 cos + 1) = 0
2
1
cos = , cos =
3
2
2
5
cos = sin =
3
3
1
3
cos = sin =
2
2
2 i 5
1 i 3
w =
,
3
3
2
2
(M1)
A1
M1
A1
M1
A1A1
A1
A1
A1A1
Note: Allow FT from incorrect cos and/or sin .

[22]
309. from GDC, sketch a relevant graph

maximum: y = 3 or (1, 3)
49
1 49
minimum: y = 1.81 or (0.333, 1.81) or y =
or ,
27
3 27
hence, 1.81 < k < 3
A1
A1
A1
A1A1
N3
Note: Award A1 for 1.81 k 3.

[5]
256
310. EITHER
l goes through the point (1, 3, 6), and the plane contains A(4, 2, 5)
the vector containing these two points is on the plane, i.e.
1 4 3

3 2 = 5
6 5 1

i
j k
1 3

2 5 = 1 2 1 = 7i + 4j + k
1 1 3 5 1

4 7

2 4 = 25
5 1

hence, Cartesian equation of the plane is 7x + 4y + z = 25
(M1)A1
M1A1
(M1)
A1
OR
finding a third point
e.g. (0, 5, 5)
three points are (1, 3, 6), (4, 2, 5), (0, 5, 5)
equation is ax + by + cz = 1
system of equations
a + 3b + 6c = 1
4a 2b + 5c = 1
5b + 5c = 1
7
4
1
,b =
,c =
a=
, from GDC
25
25
25
7
4
1
x+
y+
z =1
so
25
25
25
or 7x + 4y + z = 25
M1
A1
M1
M1A1
A1
[6]
311. (a)
shaded area = area of triangle area of sector, i.e.

1 2
1 2
4 sin x 2 x = 8 sin x 2x
2
2
(M1)
A1A1AG
257
(b)
EITHER
any method from GDC gaining x 1.32
maximum value for given domain is 5.11
(M1)(A1)
A2
OR
dA
= 8cosx 2
dx
dA
set
= 0, hence 8 cos x 2 = 0
dx
1
cos x = x 1.32
4
hence Amax = 5.11
A1
M1
A1
A1
[7]
312. (a)
n 1
coefficient of x is = 70
3 2
n!
1
= 70
3! (n 3)! 8
n(n 1)(n 2)
= 70
48
n = 16
3
M1(A1)
(A1)
(M1)
A1
(b)
16 1
= 30
2 2
A1
[6]
258
313.
2.5(200) 2.5
200
x 3.5
dx = 0.5
M1A1A1
Note: Award M1 for the integral equal to 0.5

A1A1 for the correct limits.
200 2.5
M
2.5
200 2.5

2.5
200
= 0.5
M1A1A1
Note: Award M1 for correct integration

A1A1 for correct substitutions.
200 2.5
2.5
M
M = 264
+ 1 = 0.5 M 2.5 = 2(200) 2.5
(A1)
A1
[8]
314. the waiting time, X ~ N (18, 42)

(a)
P(X > 25) = 0.0401
(b)
P X < 20X > 15

P(15 < X < 20)
=
P( X > 15)
(M1)A1
(A1)
Note: Only one of the above A1 marks can be implied.

=
0.4648...
= 0.601
0.7733...
(M1)A1
[6]
259
315. (a)
one root is 1 3i
distance between roots is 6, implies height is 3
A1
(M1)A1
EITHER
l + 3 = 2 third root is 2
A1
OR
l 3 = 4 third root is 4
(b)
A1
EITHER
(z (l + 3i))(z (l 3i)) (z 2) = 0
(z2 + 2z + 10)(z 2) = 0
z3 + 6z 20 = 0
a = 0, b = 6 and c = 20
M1
(A1)
A1
OR
(z (l + 3i))(z (l 3i)) (z + 4) = 0
(z2 + 2z + 10)(z + 4) = 0
z3 + 6z2 + 18z + 40 = 0
a = 6, b = 18 and c = 40
M1
(A1)
A1
[7]
260
316. exy + ln (y2) + ey = 1 + e

dy 2 dy
dy
+ey
exy y + x +
= 0, at (0, 1)
dx y dx
dx
dy
dy
+e
1(1 + 0) + 2
=0
dx
dx
dy
dy
+e
1+2
=0
dx
dx
dy
1
=
(= 0.212)
dx
2+e
317. (a)
(b)
a = 2.24 ( 5 )
A1A1A1A1A1
M1A1
N2
[7]
A1
(i)
A2
Note: Award A1 for end point
A1 for its asymptote.
(ii)
sketch of g1 (see above)
A2
Note: Award A1 for end point

A1 for its asymptote.
261
(c)
y=
3x
5+ x
x=
yx2 3x + 5y = 0
3 9 20 y 2
g 1 ( x) =
2y
3 + 9 20 x 2
2x
M1
A1
A1
[8]
318. (a)
(i)
x a x =0
x x a=0
x = 0, x = a2
(ii)
(iii)
f(x) = 1
2 x
f is decreasing when f < 0
a
2 x a
a4
1
<0
<0 x<
4
2 x
2 x
f is increasing when f > 0
a
2 x a
a4
1
>0
>0 x>
4
2 x
2 x
M1
(A1)
A1
N2
A1
(M1)
A1
A1
Note: Award the M1 mark for either (ii) or (iii).
(iv)
(b)
a4
4
a2
minimum value is y =
4
2
a
hence y
4
minimum occurs at x =
concave up for all values of x
(M1)A1
A1
R1
[11]
262
319. (a)
on l1 A(3 + 3, 4 + 2, 6 2)
4
3

on l2 l2 : r = 7 + 4
3
1

B(4 3, 7 + 4, 3 )
3 + 3 7
BA = a b = 2 4 + 3
2 + + 9
A1
(M1)
A1
(M1)A1
EITHER
3

BA l1 BA 2 = 0
2

3(3 + 3 7) + 2(2 4 + 3) 2(2 + + 9) = 0
17 = 33
3

BA l 2 BA 4 = 0
1

3(3 + 3 7) + 4(2 4 + 3) 2(2 + + 9) = 0
26 = 24
solving both equations above simultaneously gives
= 2; = 1 A(3, 0, 2), B(1, 3, 4)
M1
A1
M1
A1
A1A1A1A1
OR
i
3
j k
2 2 = 6i + 9j + 18k
3 4
2 3 + 3 7

so AB = p 3 = 2 4 + 3
6 2 + + 9

3 + 3 2p = 7
2 4 3p = 3
2 + 6p = 9
= 2, = 1, p = 1
A(3 + 6, 4 + 4, 6 4) = (3, 0, 2)
B(4 3, 7 + 4, 3 1) = (1, 3, 4)
(b)
1 3 2

AB = 3 0 = 3
4 2 6

|AB| =
(c)
M1A1
(2) 2 + (3) 2 + (6) 2 = 49 = 7
M1A1
A1A1
A1
A1
(A1)
M1A1
from (b) 2i + 3j + 6k is normal to both lines
263
3 2

l1 goes through (3, 4, 6) 4 3 = 18
6 6

M1A1
hence, the Cartesian equation of the plane through l1, but not l2,
is 2x + 3y + 6z = 18
A1
[19]
320. (a)
d
=3
dt
y = 10 sin
dy
= 10 cos
d
dy dy d
=
= 30 cos
dt d dt
8
at y = 6, cos =
10
dy
= 24 (metres per minute) (accept 24.0)

dt
(b)
(A1)
A1
M1
M1
(M1)(A1)
A1
2 4
d 1 d
=
= 1.5
dt 2 dt
M1A1
A1
[10]
321. (a)
Ying:
Number of heads
1
8
3
8
3
8
1
8
Number of heads
1
4
2
4
1
4
(M1)A1
Mario:
(M1)A1
264
P(Ying wins) =
=
1 32 1 3 1
+ + +
8 84 4 8 4
16
32
(M1)A1
P(Mario wins) =
=
6
32
(M1)A1
P(draw) = 1
=
1 3 1 2 1
+ +
4 8 8 4 8
1
6
16 32
10
32
A1
Yings winnings:
X
10
16
32
6
32
10
32
16
6 10
expected winnings = 5 10 2
32
32 32
=0
M1A1
A1
265
(b)
P(Ying wins on 1st round) =
1
2
(A1)
5 1
16 2
2
5 1
P (Ying wins on 3rd round) = etc.
16 2
P (Ying wins on 2nd round) =
(M1)(A1)
(A1)
P(Ying wins) =
1 5 1 5 1
+ + + ...
2 16 2 16 2
1
2
(M1)
M1A1
5
1
16
8
=
(= 0.727)
11
A1
[20]
322. (a)
(b)
H0 : = 2.5
H1 : 2.5
the critical values are 2.5 1.96
A1
A1
0. 1
(M1)(A1)(A1)
i.e. 2.45, 2.55

the critical region is x < 2.45 x > 2.55
(A1)
A1A1
16
Note: Accept , .
(c)
X is now N(2.6, 0.0252)

a Type II error is accepting H0 when H1 is true
thus we require
P(2.45 < X < 2.55)
= 0.0228 (accept 0.0227)
A1
(R1)
M1A1
A1
Note: If critical values of 2.451 and 2.549 are used, accept 0.0207.
[13]
266
323. (a)
let A, B denote the means of Alans and Brians jumps

attempting to find the distributions of A, B
(M1)
0.1
A is N 5.2,
4
0.12 2
B is N 5.1,
3
attempting to find the distribution of A B
0.12 0.12 2
A B is N 5.2 5.1,
+
4
3
i.e. N(0.1, 0.0073)

P ( A < B ) = P( A B < 0)
= 0.121
2
(b)
(i)
x = 31.38, x
x=
A1
A1
(M1)
(A1)(A1)
A1
M1
A1
= 164.1294
31.38
= 5.23
6
(M1)A1
EITHER
s n21 =
164.1294 31.38 2
= 0.00240
5
5 6
(M1)(A1)A1
OR
sn1 = 0.04899 s n21 = 0.00240
(M1)(A1)A1
Note: Accept the exact answer 0.0024 without an arithmetic penalty.

(ii)
using the t-distribution with DF = 5

critical value of t = 2.015
90% confidence limits are 5.23 2.015
(A1)
A1
0.0024
6
giving [5.19, 5.27]
M1A1
A1
N5
[19]
324. (a)
H0 : X has the negative binomial distribution with r = 3 and p = 0.6

H1 : X does not have the above distribution
A1
267
(b)
the expected frequency corresponding to the value x for 3 x 7 is

x 1
0.63 0.4x3 100
Ex =
2
this gives
E3 = 21.60
E4 = 25.92
E5 = 20.736 = 20.74
E6 = 13.824 = 13.82
E7 = 8.2944 = 8.29
finally,
E 8 + = 100 (above frequencies) = 9.6256 = 9.63
(M1)
A1
A1
A1
A1
A1
(M1)A1
Note: Accept exact values.
(c)
2
calc
=
25 2
72
+ ... +
100
21.6
9.63
= 3.97
DF = 5
p-value = 0.554 (accept 0.553)
(d)
strong evidence to support Charles belief or equivalent statement

that accepts H0
(M1)(A1)
A1
(A1)
A1
R1
[15]
325. (a)
(i)
n!
p x (1 p ) n x
P( X = x)
(n x)! x!
=
P( X = x 1)
n!
p x 1 (1 p ) n x +1
(n x + 1)! ( x 1)!
(ii)
(n x + 1) p
x(1 p )
if P(X = x) > P(X = x 1) then

(n x + 1)p > x(1 p)
np xp + p > x px
x < (n + 1)p
M1A1
AG
(M1)A1
A1
AG
268
(iii)
(b)
to maximise the probability we also need

P(X = x) > P(X = x + 1)
(n ( x + 1) + 1) p
<1
( x + 1)(1 p )
np xp < x xp + 1 p
p(n + 1) < x + 1
hence p(n + 1) > x > p(n + 1) 1
so x is the integer part of (n + 1)p, i.e. the largest integer less
than (n + 1)p
the mode is the value that maximises the probability

20p > 13 > 20p 1
13
7
p>
= 0.65, and p <
= 0.70
20
10
(it follows that 0.65 < p < 0.7)
(M1)
A1
(A1)
A1
(R1)
M1
A1A1
[13]
326. (a)
(i)
0
2
A3
Note: Award A3 for no errors, A2 for one error, A1 for two errors
and A0 for three or more errors.
(ii)
(b)
(i)
it is not a Latin square because some rows/columns contain

the same digit more than once
A1
EITHER
it is not commutative because the table is not symmetric
about the leading diagonal
R2
OR
it is not commutative because a + 2b + ab 2a + b + ab in general R2
Note: Accept a counter example e.g. 1 * 2 = 3 whereas 2 * 1 = 2.
269
(ii)
EITHER
for example (0 * 1) * 1 = 2 * 1 = 2
and 0 * (1 * 1) = 0 * 0 = 0
so * is not associative
M1
A1
A1
OR
associative if and only if a * (b * c) = (a * b) * c
which gives
a + 2b + 4c + 2bc + ab + 2ac + abc
= a + 2b + ab + 2c + ac + 2bc + abc
so * is not associative as 2ac 2c + ac, in general
(c)
x = 0 is a solution
x = 2 is a solution
M1
A1
A1
A2
A2
[13]
327. (a)
f(x) = 2ex ex
A1
(b)
f is an injection because f(x) > 0 for x [0, [

R2
(accept GDC solution backed up by a correct graph)
since f(0) = 0 and f(x) as x , (and f is continuous) it is a surjectionR1
hence it is a bijection
AG
(c)
let y = 2ex + ex 3
so 2e2x (y + 3)ex + 1 = 0
ex =
y + 3 ( y + 3) 2 8
4
y + 3 ( y + 3) 2 8
x = ln
since x 0 we must take the positive square root

x + 3 + ( x + 3) 2 8
1
f (x) = ln
M1
A1
A1
A1
(R1)
A1
[10]
270
328. (a)
(i)
(ii)
R is reflexive, i.e. PRP because the sum of the zeroes of

P is equal to the sum of the zeros of P
R is symmetric, i.e. P1RP2 P2RP1 because the sums of
the zeros of P1 and P2 are equal implies that the sums of the
zeros of P2 and P1 are equal
suppose that P1RP2 and P2RP3
it follows that P1RP3 so R is transitive, because the sum of
the zeros of P1 is equal to the sum of the zeros of P2 which
in turn is equal to the sum of the zeros of P3, which implies
that the sum of the zeros of P1 is equal to the sum of the
zeros of P3
the three requirements for an equivalence relation are
therefore satisfied
the zeros of z2 4z + 5 are 2 i, for which the sum is 4
z2 + az + b has zeros of
a a 2 4b
so the sum is a
2
R1
R1
M1
R1
AG
M1A1
(M1)
Note: Accept use of the result (although not in the syllabus) that
the sum of roots is minus the coefficient of z.
hence a = 4 and so a = 4
the equivalence class is z2 4z + k, (k
(b)
A1
A1
for example, (z 1)(z 2)S(z 1)(z 3) and

(z 1)(z 3)S(z 3)(z 4) but (z 1)(z 2)S(z 3)(z 4) is not true M1A1
so S is not transitive
A1
[12]
329. (a)
Closure: consider, for a, b, c, d

a 0 c 0 ac 0
0 b 0 d 0 bd
,
M1A1
therefore closed because ac and bd +

1 0
belongs to the set
Identity: the identity matrix
0 1
1
a 0 a
is
Inverses: the inverse of
0 b 0
0
which belongs to the set
1
We are given that the operation is associative and since we have

proved closure, identity and inverse, G is a group.
A1
R1
A1A1
R1
271
(b)
consider the function

a 0 0
a 0
0 b 0 for a, b
F :
0 b 0 0 ab
this is a bijection
then,
ac
a 0 c 0
ac 0

= F
= 0
F
0 b 0 d
0 bd 0
and
a 0 0 c 0
a 0 c 0
F
= 0 b 0 0 d
F
0 b 0 d 0 0 ab 0 0
A1
A1
0
bd
0
0
acbd
ac 0

= 0 bd
cd 0 0
0
0
the equality of the above two results proves the isomorphism
M1A1A1
0
abcd
M1A1A1
R1
[16]
272
dy
dv
=v+x
dx
dx
dv
the equation becomes v + x
= v + v2
dx
dv
leading to x
= v2
dx
dx
dv
separating variables,
=
x
v2
1
hence lnx = v + C
x
substituting for v, ln x = + C
y
330. put y = vx so that
M1A1
(A1)
A1
M1A1
A1A1
M1
Note: Do not penalise absence of C at the above stages.

substituting the boundary conditions,
1
0= +C
2
1
C=
2
x 1
+
the solution is ln x =
y 2
leading to y =
M1
A1
(A1)
2x
(or equivalent form)
1 2 ln x
A1
Note: Candidates are not required to note that x
e
[13]
331. (a)
ex 1 = x +
x2 x3
+ ...
+
2
6
A1
2
x2
= 1 + x +
2
2
x
x3
=1+x+
+
2
6
5 3
2
= 1 + x + x + x + ...
6
ee
x2 x3
x2 x3
x+
x+
+
+
2
6
2
6
x 3
+ ...
+ +
+
6
2
6
x2 x3 x3
+
+
+
+ ...
2
2
6
M1A1
M1A1
AG
273
(b)
EITHER
5x 2
+ ...
2
5x 3
x + x2 +
+ ...
f ( x) 1
6
=
f ( x) 1
5x 2
2x +
+ ...
2
1 + x + ...
=
5x
2+
+ ...
2
1
as x 0
2
f(x) = 1 + 2x +
A1
M1A1
A1
A1
OR
using lHopitals rule,
lim
x 0
e
e
(e x 1)
= lim
x 0
(e x 1)
1 1
e (e
e (e
+ x 1)
= lim
x 0
M1
e
e
(e x 1)
(e x + x 1)
+ x 1)
(e x + 1)
1
2
M1A1
A1
A1
[10]
332. (a)
un =
2
1+
n2
2 as n
L=2
M1
A1
274
(b)
for 2 un< then 2 un <

and so we require 2
2n
M1
n2 +1
<
M1
<
n +1
2
n>
1
A1
(M1)A1
we have shown that, given > 0, there exists an integer N

such that 2 un < for n > N, which establishes the limit
Note: Do not penalise N =
1
R2
1 .
[9]
333. (a)
use the comparison test with
(which we know is convergent as it is a p-series with p = 2)

1
1
< 2
n(n + 3) n
hence the given series is convergent
(b)
(i)
M1
M1A1
AG
let
A(n + 3) + Bn
1
A
B
+
n(n + 3) n n + 3
n(n + 3)
1
n = 0 gives A =
3
1
n = 3 gives B =
3
1
1
1
So
3 3
n(n + 3) n n + 3
M1A1
A1
A1
275
(ii)
n =1
1
=
n(n + 3)
1
= 3
1
1
1
3 3
n +3
n =1 n
1
3
4
1
+3
2
(M1)(A1)
M1
1
3
5
1
+3
3
A1
1
3
6
1
+3
4
1
3
7
+ ...
all terms cancel except
1 1 1 11
+ + =
the required sum to infinityM1A1
3 6 9 18
Note: Award M1 for attempting to find an expression for Sn in the form

1 1 1
1
+ + + terms of order .
3 6 9
n
[13]
334. (a)
the nth term is

1 3 5...(2n 1) n
x
un =
2 5 8...(3n 1)
(using the ratio test to test for absolute convergence)
u n +1
(2n + 1)
=
x
(3n + 2)
un
lim
u n +1
2x
3
un
let R denote the radius of convergence
2R
3
then
= 1 so R =
3
2
n
M1A1
M1A1
A1
M1A1
Note: Do not penalise the absence of absolute value signs.
276
(b)
using the compound angle formula or a graphical method

the series can be written in the form
1
u n where un = (1)n sin
n
n =1
1
< i.e. an angle in the first quadrant,
n 2
it is an alternating series
un 0 as n
and un+1 < un
it follows that the series is convergent
since
(M1)
A2
R1
R1
R1
R1
R1
[15]
335. the mth term of the first sequence = 2 + 4 (m 1)

the nth term of the second sequence = 7 + 5 (n 1)
(M1)(A1)
(A1)
EITHER
equating these,
5n = 4m 4
5n = 4(m 1)
4 and 5 are coprime
4n so n = 4s or 5(m 1) so m = 5s + 1, s
thus the common terms are of the form {2 + 20s; s +}
M1
(A1)
(M1)
(A1)A1
A1
OR
the numbers of both sequences are
2, 6, 10, 14, 18, 22
7, 12, 17, 22
so 22 is common
identify the next common number as 42
the general solution is {2 + 20s; s +}
336. (a)
A1
A1
(M1)A1
(M1)A1
[9]
(i)
all the vertices have even degree
A1
(ii)
for example ABCDECFBEFA
A2
277
(b)
(c)
(i)

0 1 0 0 0 1
1 0 1 0 1 1
0 1 0 1 1 1
A=
0 0 1 0 1 0
0 1 1 1 0 1
1 1 1 0 1 0
4
attempting to find A
14 17 22 8 22 17
17 38 32 22 32 37
A 4 = 22 32 38 17 37 32
8 22 17 14 17 22
22 32 37 17 38 32
17 37 32 22 32 38
the required number of walks is the (F, F) element

in A4 which is 38
(M1)(A1)
(M1)
A2
(ii)
FABAF (6)
A1
(iii)
FEFEF (36)
A1
the edges are included in the order shown
M1A1A1A1A1A1
Note: Award each A1 for the edge added in the correct order.
Award no further marks after the first error.
[16]
337. (a)
the complete graph with 6 vertices has 15 edges so G has

6 vertices and 5 edges
the number of faces in G, f = 2 + e v = 1
it is therefore a tree because f = 1
M1A1
M1A1
R1
Note: Accept it is a tree because v = e + 1.
278
(b)
(i)
(ii)
They are not isomorphic because, for example, in

Graph 1 the vertex of degree 1 is adjacent to a vertex
of degree 3; in Graph 2 the vertex of degree 1 is
adjacent to a vertex of degree 4.
remove UQ and insert RT
the bijection is
A, B, C, D, E, F S, Q, R, P, U, T
R2
A2
A2
[11]
338. (a)
consider the decimal number A = anan1, ... a0

A = an 10n + an1 10n1 + ... + a1 10 + a0
M1
M1
= an (10n 1) + an1 (10n1 1) + ... + a1 (10 1)

+ an + an1 + ... + a0
M1A1
= an 99...9 (n digits) + an1 99...9(n 1 digits)
+ ... + 9a1 + an + an1 + ... + a0
A1
all the numbers of the form 999 are divisible by 9 (to give 111),
R1
n
hence A is divisible by 9 if
is divisible by 9
R1
i =0
Note: A method that uses the fact that 10t 1 (mod 9) is equally valid.
(b)
by Fermats Little Theorem 56 1(mod 7)

(126)7 = (49 + 14 + 6)10 = (69)10
M1A1
M1A1
5 (126) 7 5 (116 + 3)10 5 (3)10 (mod 7)

5 (3)10 = (125)10 = (17 7 + 6)10 6 (mod 7)
hence a0 = 6
M1A1
M1A1
A1
[16]
279
339. Suppose the graph is bipartite so that the vertices belong to one of two
disjoint sets M, N.
Then consider any vertex V in M. To generate a cycle returning to V, we
must go to a vertex in N, then to a vertex in M, then to a vertex in N,
then to a vertex in M, etc.
To return to V, therefore, which belongs to M, an even number of steps
will be required.
Now suppose the graph contains only cycles of even length.
Starting at any vertex V, define the set M as containing those vertices
accessible from V in an even number of steps and the set N as
containing those vertices accessible from V in an odd number of steps.
Suppose that the vertex X belongs to both M and N. Then consider the
closed walk from V to X one way and back to V the other way. This
closed walk will be of odd length. This closed walk can be contracted
to a cycle which will also be of odd length, giving a contradiction to
the initial assumption.
There can therefore be no vertices common to M and N, which shows that the
vertices can be divided into two disjoint sets and the graph is bipartite.
Consider any edge joining P to vertex Q. Then either P M in which case
Q N or vice versa. In either case an edge always joins a vertex in M to a
vertex in N so the graph is bipartite.
M1
R1
R1
M1
R1
R1
R1
R1
[8]
280
340. METHOD 1
r = 2, =
1 i 3
(A1)(A1)
=2

cos + i sin
3
3
1
(cos + i sin )
8
1
8
M1
(M1)
A1
METHOD 2
(1 i 3 )(1 i 3 ) = 1 2i 3 3 (= 2 2i 3 )
( 2 2i 3 )(1 i 3 ) = 8
(1 i 3 )
1
8
(M1)A1
(M1)(A1)
A1
METHOD 3
Attempt at Binomial expansion
(1 i 3 )3 = 1 + 3(i 3 ) + 3 (i 3 )2 + (i 3 )3
= 1 3i 3 9 + 3i 3
= 8
(1 i 3 )
(A1)
(A1)
A1
1
8
M1
[5]
341. If M is singular, then det M = 0

|M|=
M1
0 1
1
= (2 + 1) 2 (= 3 )
R1
(M1)
A1
(2 1) = 0
= 0, = 1, = 1
A1A1A1
[6]
281
342. METHOD 1
If the areas are in arithmetic sequence, then so are the angles.
Sn =
n
(a + l ) 12 ( + 2 ) = 18
2
2
18 = 2
(M1)
M1A1
(A1)
(accept 20)
A1
METHOD 2
a12 = 2a1
(M1)
12
(a1 + 2a1 ) = r 2
2
3a1 =
r 2
6
3 2
r 2
r =
2
6
M1A1
2
=
18 9
(A1)
(accept 20)
A1
METHOD 3
Let smallest angle = a, common difference = d
a + 11d = 2a
a = 11d
Sn =
(M1)
A1
12
(2a + 11d ) = 2
2
6(2a + a) = 2
M1
(A1)
18a = 2
a=
(accept 20)
A1
[5]
282
343.
9
12
=
sin C sin B
(M1)
9
12
=
sin C sin 2C
A1
Using double angle formula
9
12
=
sin C 2 sin C cos C
M1
9(2 sin C cos C) = 12 sin C

6 sin C (3 cos C 2) = 0 or equivalent
(A1)
(sin C 0)
cos C =
2
3
A1
[5]
344. (a)
f (x ) =1
(b)
2
1
x3
f (x ) =
A1
1
x3
= 0 x 3 = 2 x =8
2
4
3x 3
f (8) > 0 at x = 8, f (x) has a minimum.
A1
A1
M1A1
[5]
283
345. 2 + x x2 = 2 3x + x2
M1
2x2 4x = 0
2x(x 2) = 0
x = 0, x = 2
A1A1
Notes: Accept graphical solution.

Award M1 for correct graph and A1A1 for correctly labelled roots.
A =
=
((2 + x x ) (2 3x + x ))dx
2
(M1)
(4 x 2 x )dx
2
or equivalent
A1
2x3
= 2 x 2
3 0
A1
8
2
=2
3
3
A1
[7]
346. (a)
(b)
0 < 2x < 1
(M1)
x<0
A1
35
= 40
1 r
M1
40 40 r = 35
40 r = 5
N2
(A1)
r = 2x =
1
8
A1
x = log2
1
(= 3)
8
A1
Note: The substitution r = 2x may be seen at any stage in the solution.

[6]
347. (a)
h (x) = g f (x) =
1
e
x2
+3
, (x 0 )
(M1)A1
284
(b)
1
4
0<x
A1A1
Note: Award A1 for limits and A1 for correct inequality signs.
(c)
y=
1
e
x2
+3
ye x + 3 y = 1
2
ex =
1 3 y
y
x2 = ln
x=
M1
A1
1 3 y
y
ln
M1
1 3y
y
h1 (x) =
ln
= ln 1 3
1 3x
x
A1
[8]
348. (a)
Any consideration of
0
0
f ( x)dx
(M1)
A1
N2
285
(b)
METHOD 1
Let the upper and lower quartiles be a and a
1
a
cos
t
dt = 0.25
2
M1
t
2
sin = 0.25
2 a
4
A1
t
1
sin = 0.25
2 a
2
a
1 1
sin = 0.25
2
2 2
A1
1
a 1
sin
=
2
2 4
sin
a 1
=
2 2
a
=
2
6
a=
1
3
A1
Since the function is symmetrical about t = 0,

interquartile range is
1 1 2
=
3 3 3
R1
METHOD 2
a
a
cos
dt = 0.5 =
2
2
a
0
cos
t
dt
2
a
sin = 0.5
2
M1A1
A1
a
=
2 6
a=
1
3
The interquartile range is
A1
2
3
R1
[7]
349. METHOD 1
286
V=
ln x
dx
x
M1
Integrating by parts:
u = (ln x ) ,
2
dv 1
=
dx x 2
(M1)
du 2 ln x
1
=
, v=
dx
x
x
(ln x )2
ln x
V =
+2
dx
2
x
x
u = ln x,
A1
dv 1
=
dx x 2
(M1)
du 1
1
= ,v =
dx x
x
ln x
x
dx =
ln x
ln x 1
1
+ 2 dx =
x
x
x
x
(ln x )2
ln x 1
+ 2
V =
x
x
x
= 2
A1
5
e
A1
287
METHOD 2
V=
ln x
dx
x
M1
dx
= du
x
Let ln x = u x = eu,
(M1)
u2
ln x
dx = u du = e u u 2 du = e u u 2 + 2 e u u du
e
x
A1
= e u u 2 + 2 e u u + e u du = e u u 2 2e u u 2e u
= e u u 2 + 2u + 2
A1
When x = e, u = 1. When x = 1, u = 0.
Volume = e u u 2 + 2u + 2
)]
M1
= 5e 1 + 2 = 2
e
350. (a)
(i)
A1
[6]
METHOD 1
1 1 0
AB = b a = 2 1 = 1
3 2 1

(A1)
3 1 2
AC = c a = 0 1 = 1
1 2 1

(A1)
i
j
k
AB AC = 0 1 1
2 1 1
M1
= i (1 + 1) j(0 2) + k (0 2)
(A1)
= 2j 2k
Area of triangle ABC =
A1
1
1
2 j 2k =
8 = 2 sq. units
2
2
M1A1
Note: Allow FT on final A1.
288
METHOD 2
AB = 2 , BC = 12 , AC = 6
A1A1A1
Using cosine rule, e.g. on C

cos C =
6 + 12 2
2 72
Area ABC =
M1
2 2
3
A1
1
ab sin C
2
1
12 6 sin
2
M1
arccos 2 2
2 2
= 3 2 sin arccos
= 2
A1
Note: Allow FT on final A1.
(ii)
AB =
2 =
1
1
AB h =
2 h , h equals the shortest distance
2
2
h=2
(iii)
A1
(M1)
A1
METHOD 1
0

has form r 2 = d
2

(M1)
Since (1, 1, 2) is on the plane
1 1

d = 1 2 = 2 4 = 2
2 2

M1A1
0

Hence r 2 = 2
2

2y 2z = 2 (or y z = 1)
A1
289
METHOD 2
1 0
2

r = 1 + 1 + 1
2 1
1

x = 1 + 2
(i)
y=1+
(ii)
z=2+
(iii)
(M1)
A1
Note: Award A1 for all three correct, A0 otherwise.
x 1
2
From (i) =
x 1
substitute in (ii) y = 1 +
x 1
=y1+
substitute and in (iii)
M1
x 1 x 1
2 2
z=2+y1+
y z = 1
(b)
(i)
A1
The equation of OD is
0

r = 2 ,
2

or r = 1
M1
This meets where

2 + 2 = 1
(M1)
1
4
A1
1 1
Coordinates of D are 0 , ,
2 2
(ii)
1
1 1
OD = 0 + + =
2
2 2
A1
(M1)A1
[20]
351. (a)
f (x) = (1 + 2x) e2x
A1
290
f (x) = 0
(1 + 2x)e2x = 0 x =
(b)
M1
1
2
f (x) = (22x + 2 22 1)e2x = (4x + 4)e2x
A1
1 2
f =
2 e
A1
2
1
> 0 at x = , f (x) has a minimum.
e
2
R1
1
1
P ,
2 2e
A1
f(x) = 0 4x + 4 = 0 x = 1
M1A1
4
1 2
Using the 2nd derivative f = and f (2) = 4 ,
e
2 e
M1A1
the sign change indicates a point of inflexion.

(c)
A1
R1
(i)
f (x) is concave up for x > 1.
A1
(ii)
f (x) is concave down for x < 1.
A1
(d)
A1A1A1A1
Note: Award A1 for P and Q, with Q above P,
A1 for asymptote at y = 0,
A1 for (0, 0),
A1 for shape.
291
(e)
Show true for n = 1
(M1)
f (x) = e2x + 2xe2x
A1
= e2x (1 + 2x) = (2x + 20) e2x

Assume true for n = k, ie f (k) x = (2k x + k 2k 1) e2x, k 1
Consider n = k + 1, ie an attempt to find
d k
f ( x) .
dx
M1A1
M1
f (k + 1) (x) = 2k e2x + 2e2x (2k x + k 2k 1)
A1
= (2k + 2 (2k x + k 2k 1)) e2x

= (2 2k x + 2k + k 2 2k 1) e2x
= (2k + 1 x + 2k + k 2k) e2x
A1
= (2k + 1 x + (k + 1) 2k) e2x
A1
P(n) is true for k P(n) is true for k + 1, and since true

for n = 1, result proved by mathematical induction n
R1
Note: Only award R1 if a reasonable attempt is made to

prove the (k + 1)th step.
[27]
352. (a)
dV
= cr
dt
A1
4
V = r 3
3
dV
dr
= 4r 2
dt
dt
4r 2
dr
= cr
dt
dr
c
=
dt 4r
=
k
r
M1A1
M1
A1
AG
292
(b)
k
dr
=
dt
r
rdr = k dt
M1
r2
= kt + d
2
A1
An attempt to substitute either t = 0, r = 8 or t = 30, r = 12
M1
When t = 0, r = 8
d = 32
A1
r2
= kt + 32
2
When t = 30, r = 12
12 2
= 30k + 32
2
k =
4
3
A1
r2 4
= t + 32
2 3
When t = 15,
r2 4
= 15 + 32
2 3
M1
r2 = 104
A1
r 10 cm
A1
Note: Award M0 to incorrect methods using proportionality

which give solution r =10 cm.
[13]
353. (a)
Using
P( X = x ) = 1
4c + 6c + 6c + 4c = 1 (20c = 1)
c=
1
(= 0.05)
20
(M1)
A1
A1
N1
293
(b)
Using E(X) =
xP(X = x )
= (1 0.2) + (2 0.3) + (3 0.3) + (4 0.2)

= 2.5
(M1)
(A1)
A1
N1
Notes: Only one of the first two marks can be implied.

Award M1A1A1 if the x values are averaged only if
symmetry is explicitly mentioned.
[6]
354. METHOD 1
As (x + 1) is a factor of P(x), then P(1) = 0
a b + 1 = 0 (or equivalent)
As (x 2) is a factor of P(x), then P(2) = 0
4a + 2b + 10 = 0 (or equivalent)
Attempting to solve for a and b
a = 2 and b = 1
(M1)
A1
(M1)
A1
M1
A1
N1
(M1)A1
(M1)A1
(M1)A1
N1
METHOD 2
By inspection third factor must be x 1.
(x + 1)(x 2)(x 1) = x3 2x2 x + 2
Equating coefficients a = 2, b = 1
METHOD 3
Considering
P (x )
or equivalent
x x2
2
(a + b + 3) x + 2 (a + 2)
P (x )
= (x + a + 1) +
x x2
x2 x 2
Recognizing that (a + b + 3) x + 2 (a + 2) = 0
Attempting to solve for a and b
a = 2 and b = 1
2
(M1)
A1A1
(M1)
M1
A1
N1
[6]
294
355. METHOD 1
AC = 5 and AB =
cos =
cos =
13
(may be seen on diagram)
3
4
and sin =
5
5
3
(A1)
and sin =
13
(A1)
(A1)
13
Note: If only the two cosines are correctly given award (A1)(A1)(A0).
Use of cos ( ) = cos cos + sin sin
=
3 3
4 2
+
5 13 5 13
17 13
=
65
5 13
(substituting)
17
(M1)
M1
A1
N1
METHOD 2
AC = 5 and AB =
13
Use of cos ( + ) =
(may be seen on diagram)
AC 2 + AB 2 BC 2
2(AC)(AB)
25 + 13 36
(A1)
(M1)
=
5 13
A1
Use of cos ( + ) + cos ( ) = 2 cos cos
(M1)
cos =
2 5 13
3
3
and cos =
5
13
cos ( ) =
3 3
1 17 13
= 2
=
5
65
5 13
13 5 13
17
(A1)
A1
N1
[6]
356. (a)
h (x ) = g
x+2
=
4
1
x+2
(M1)
2 x
=
2+ x
A1
295
(b)
METHOD 1
x=
4
1
y+2
(interchanging x and y)
M1
Attempting to solve for y

(y + 2)(x + 1) = 4
h 1 (x ) =
4
2
x +1
M1
4
y + 2 =
x + 1
(A1)
(x 1)
A1
N1
METHOD 2
x=
2 y
2+ y
(interchanging x and y)
M1
Attempting to solve for y

xy + y = 2 2x
h 1 (x ) =
2(1 x )
x +1
M1
(y(x + 1) = 2(1 x))
(A1)
(x 1)
A1
N1
Note: In either METHOD 1 or METHOD 2 rearranging first

and interchanging afterwards is equally acceptable.
[6]
357. (a)
Attempting implicit differentiation
M1
dy
dy
+ 2y =0
dx
dx
A1
2x + y + x
EITHER
Substituting x = 1, y = k
Attempting to make
eg 2 + k
dy
the subject
dx
dy
dy
+ 2k
=0
dx
dx
M1
M1
296
OR
(2 x + y )
dy
dy
the subject eg
=
x + 2y
dx
dx
Attempting to make
Substituting x = 1, y = k into
dy
dx
M1
M1
THEN
dy 2 k
=
dx 2k 1
(b)
Solving
A1
dy
= 0 for k gives k = 2
dx
N1
A1
[6]
358. Using integration by parts
u = x,
(M1)
du
dv
1
=1, = sin 2 x and v = cos 2 x
dx
dx
2
1
6
x 2 cos 2 x
0

6
0
cos 2 x dx
2
(A1)
A1
1
6 1
6
= x cos 2 x + sin 2 x
0 4
0
2
A1
Note: Award the A1A1 above if the limits are not included.
6
x 2 cos 2 x = 24
0

A1
3
1
6
4 sin 2 x = 8
6
0
x sin 2 x dx =
8 24
A1
AG
N0
Note: Allow FT on the last two A1 marks if the expressions are the
negative of the correct ones.
[6]
297
359. EITHER
Using P(A | B) =
P( A B )
P(B )
(M1)
0.6P(B) = P(A B)
A1
Using P(A B) = P(A) + P(B) P(A B) to obtain

0.8 = 0.6 + P(B) P(A B)
A1
Substituting 0.6P(B) = P(A B) into above equation
M1
OR
As P(A | B) = P(A) then A and B are independent events
M1R1
Using P(A B) = P(A) + P(B) P(A) P(B)
A1
to obtain 0.8 = 0.6 + P(B) 0.6 P(B)
A1
THEN
0.8 = 0.6 + 0.4P(B)
A1
P(B) = 0.5
A1
N1
[6]
360.
d
1
(arctan (x 1)) =
2
dx
1 + (x 1)
mN = 2 and so mT =
Attempting to solve
(or equivalent)
1
2
(R1)
1 + (x 1)
1
(or equivalent) for x
2
x = 2 (as x > 0)
Substituting x = 2 and y =
c=4+
A1
M1
A1
to find c
4
M1
A1
N1
[6]
298
x
361. 10 cm water depth corresponds to 16 sec 32 = 6
36
(A1)
x
Rearranging to obtain an equation of the form sec = k or
36
equivalent
ie making a trignometrical function the subject of the equation.
x 8
cos =
36 13
(A1)
x
8
= arccos
13
36
x=
M1
M1
36
8
arccos
13
A1
Note: Do not penalize the omission of .

Width of water surface is
72
8
arccos
(cm)
13
R1
N1
Note: Candidate who starts with 10 instead of 6 has the potential

to gain the two M1 marks and the R1 mark.
[6]
362. METHOD 1
Use of | a b | = | a | | b | sin
(M1)
| a b |2 = | a |2 | b |2 sin2
(A1)
Note: Only one of the first two marks can be implied.

= | a |2 | b |2 (1 cos2)
A1
= | a |2 | b |2 | a |2 | b |2 cos2
(A1)
= | a |2 | b |2 (| a | | b | cos)2
(A1)
Note: Only one of the above two A1 marks can be implied.

= | a |2 | b |2 (a b)2
Hence LHS = RHS
A1
AG
N0
299
METHOD 2
Use of a b = | a | | b | cos
(M1)
| a |2 | b |2 (a b)2 = | a |2 | b |2 (| a | | b | cos)2
(A1)
= | a |2 | b |2 | a |2 | b |2 cos2
(A1)
Note: Only one of the above two A1 marks can be implied.

= | a |2 | b |2 (1 cos2)
A1
= | a |2 | b |2 sin2
A1
= | a b |2
A1
Hence LHS = RHS
AG
N0
Notes: Candidates who independently correctlysimplify both sides

and show that LHS = RHS should be awarded full marks.
If the candidate starts off with expression that they are trying to
prove and concludes that sin2 = (1 cos2) award M1A1A1A1A0A0.
If the candidate uses two general 3D vectors and explicitly finds
the expressions correctly award full marks. Use of 2D vectors
gains a maximum of 2 marks.
If two specific vectors are used no marks are gained.
[6]
363. (a)
Use of cos =
OA AB
(M1)
OA AB
AB = i j + k
AB =
A1
3 and OA = 3 2
A1
OA AB = 6
A1
substituting gives cos =
(b)
L1: r = OA + s AB
= 6 or equivalent
6 3
or equivalent
L1: r = i j + 4k + s(i j + k)
or equivalent
M1
N1
(M1)
A1
Note: Award (M1)A0 for omitting r = in the final answer.
300
(c)
Equating components and forming equations involving s and t

1 + s = 2 + 2t, 1 s = 4 + t, 4 + s = 7 + 3t
Having two of the above three equations
Attempting to solve for s or t
Finding either s = 3 or t = 2
Explicitly showing that these values satisfy the third equation
Point of intersection is (2, 2, 1)
(M1)
A1A1
(M1)
A1
R1
A1
N1
Note: Position vector is not acceptable for final A1.

(d)
METHOD 1
1 2
3

r = 1 + 1 + 3
4 3
3

(A1)
x = 1 + 2 3, y = 1 + + 3 and z = 4 + 3 3
Elimination of the parameters
x + y = 3 so 4(x + y) = 12 and y + z = 4 + 3
so 3(y + z) = 12 + 9
M1A1
M1
3(y + z) = 4(x + y) + 9
A1
Cartesian equation of plane is 4x + y 3z = 9 (or equivalent)
A1
N1
METHOD 2
EITHER
The point (2, 4, 7) lies on the plane.
The vector joining (2, 4, 7) and (1, 1, 4) and 2i + j + 3k
are parallel to the plane. So they are perpendicular to the
normal to the plane.
(i j + 4k) (2i + 4j + 7k) = i 5j 3k
i
j
k
n = 1 5 3
2
(A1)
M1
= 12i 3j + 9k
or equivalent parallel vector
A1
301
OR
L1 and L2 intersect at D (2, 2,1)
AD = (2i + 2j + k) (i j + 4k) = 3i + 3j 3k
i
n= 2
j
1
k
3
(A1)
M1
3 3 3
= 12i 3j + 9k
or equivalent parallel vector
A1
THEN
r n = (i j + 4k) (12i 3j + 9k)
= 27
Cartesian equation of plane is 4x + y 3z = 9 (or equivalent)
364. (a)
r=
S =
S =
1
3
27
1
1+
3
81
(= 20.25)
4
M1
A1
A1
N1
[20]
(A1)
M1
A1
N1
302
(b)
Attempting to show that the result is true for n = 1

LHS = a and RHS =
a(1 r )
=a
1 r
Hence the result is true for n = 1

Assume it is true for n = k
a + ar + ar 2 + ... + ar k 1 =
a 1 r k
1 r
Consider n = k + 1:
a + ar + ar 2 + ... + ar k 1 + ar k =
M1
A1
M1
a 1 r k
+ ar k
1 r
M1
a 1 r k + ar k (1 r )
1 r
a ar k + ar k ar k + 1
1 r
A1
Note: Award A1 for an equivalent correct intermediate step.
a ar k +1
1 r
a 1 r k +1
1 r
A1
Note: Illogical attempted proofs that use the result to be proved

would gain M1A0A0 for the last three above marks.
The result is true for n = k it is true for n = k + 1 and as it is
true for n =1, the result is proved by mathematical induction.
R1
N0
Note: To obtain the final R1 mark a reasonable attempt must

have been made to prove the k + 1 step.
[10]
365. (a)
AQ =
x 2 + 4 (km)
(A1)
QY = (2 x) (km)
(A1)
T = 5 5 AQ + 5QY
(M1)
=5 5
(x
+ 4 + 5(2 x ) (mins)
A1
303
(b)
(x
Attempting to use the chain rule on 5 5
d
5 5
dx
(x
1
+ 4 = 5 5 x 2 + 4
1
2
+4
(M1)
2x
A1
5 5x
=
2
x +4
(c)
d
(5(2 x )) = 5
dx
A1
dT
5 5x
=
5
dx
x2 + 4
AG
(i)
5 x = x 2 + 4 or equivalent
N0
A1
Squaring both sides and rearranging to

obtain 5x2 = x2 + 4
M1
x=1
A1
N1
Note: Do not award the final A1 for stating a negative solution

in final answer.
(ii)
T = 5 5 1 + 4 + 5(2 1)
M1
= 30 (mins)
A1
N1
Note: Allow FT on incorrect x value.

(iii)
METHOD 1
Attempting to use the quotient rule
u = x ,v = x 2 + 4 ,
M1
du
dv
=1 and
= x x2 + 4
dx
dx
2
1
x + 4 x2 + 4
d T
2
= 5 5
2
dx
x2 + 4
1
2
2x 2
1
2
(A1)
A1
304
Attempt to simplify
5 5
(x
+4
3
2
(M1)
[x
+ 4 x 2 or equivalent
A1
20 5
(x
+4
When x = 1,
AG
3
2
20 5
(x
+4
3
2
> 0 and hence T = 30
is a minimum
R1
N0
Note: Allow FT on incorrect x value, 0 x 2.

METHOD 2
Attempting to use the product rule
u = x , v = x2 + 4,
d 2T
dx 2
du
dv
=1 and
= x x2 + 4
dx
dx
=5 5 x2 + 4
5 5
=
x2 + 4
M1
1
2
5 5x 2
x +4
2
3
2
1
2
(A1)
2x
A1
5 5 x2
3
2
x + 4 2
) (
1
2
Attempt to simplify
5 5 x2 + 4 5 5 x2
(x
+4
3
2
(M1)
5 5 x2 + 4 x2
=
3
2
2
x
+
4
(
(
20 5
(x
+4
When x = 1,
A1
AG
3
2
20 5
(x
+4
3
2
> 0 and hence T = 30 is a
minimum
Note: Allow FT on incorrect x value, 0 x 2.
R1
N0
[18]
305
366. (a)
EITHER
2
2
w = cos
+ i sin
5
5
(M1)
= cos 2 + i sin 2
A1
=1
A1
Hence w is a root of z5 1 = 0
AG
OR
Solving z5 = 1
z = cos
2
2
n + i sin
n , n = 0 , 1 , 2 , 3 , 4.
5
5
n = 1 gives cos
(b)
(M1)
2
2
+ i sin
which is w
5
5
(w 1)(1 + w + w2 + w3 + w4) = w + w2 + w3 + w4 + w5 1
w w2 w3 w4
= w5 1
Since w5 1 = 0 and w 1, w4 + w3 + w2 + w + 1 = 0.
A1
A1
M1
A1
R1
306
(c)
1 + w + w2 + w3 + w4 =
2
1 + cos
2
2
2
2
+ i sin
+ cos
+ i sin
+
5
5
5
5
3
2
2
2
2
+ i sin
+ i sin
cos
+ cos
5
5
5
5
(M1)
2
2
4
4
+ i sin
+ cos
+ i sin
+
5
5
5
5
6
6
8
8
cos + i sin
+ cos + i sin
5
5
5
5
1 + cos
2
2
4
4
+ i sin
+ cos
+ i sin
+
5
5
5
5
4
4
2
2
cos
i sin
+ cos
i sin
5
5
5
5
M1
1 + cos
M1A1A1
Notes: Award M1 for attempting to replace 6 and 8 by 4 and 2

Award A1 for correct cosine terms and A1 for correct sine terms.
= 1 + 2 cos
4
2
+ 2 cos
=0
5
5
A1
Note: Correct methods involving equating real parts, use of

conjugates or reciprocals are also accepted.
cos
2
4
1
+ cos
=
5
5
2
AG
Note: Use of cis notation is acceptable throughout this question.

[12]
367. METHOD 1
5
0
constant term: ( 2 x )
0
7 0
x = 1
0
7
5
term in x: x + ( 2 x ) = 3 x
1
1
7
5
7 5
2
term in x2: x 2 + ( 2 x ) + x ( 2 x ) = 9 x 2
2
2
1 1
A1
(M1)A1
M1A1
N3
307
METHOD 2
( 2 x )2
2!
(1 2 x )5 (1 + x )7 = 1 + 5 ( 2 x ) + 5 4
76 2
+ ... 1 + 7 x +
x + ...
M1M1
= (1 10x + 40x2 + ...)(1 + 7x + 21x2 + ...)

= 1 + 7x + 21x2 10x 70x2 + 40x2 + ...
= 1 3x 9x2 + ...
A1A1A1
N3
[5]
368. (a)
A1A1A1A1
Note: Award A1 for y-intercept
A1A1 for x-intercepts
A1 for shape.
(b)
correct line
A1
5 solutions
A1
[6]
308
1

369. The normal vector to the plane is 3 .
2

(A1)
EITHER
is the angle between the line and the normal to the plane.
4 1

1 3
2 2
3
cos = =
14 21
14 21
3
=
7 6
(M1)A1A1
= 79.9 (= 1.394 ...)
A1
The required angle is 10.1 (= 0.176)
A1
OR
is the angle between the line and the plane.

4 1

1 3
2 2
3
sin = =
14 21
14 21
= 10.1
370. (a)
(= 0.176)
(M1)A1A1
A2
[6]
P(X 84) = P(Z 1.62...) = 0.0524
(M1)A1
N2
Note: Accept 0.0526.

(b)
P(Z z) = 0.01 z = 2.326...
(M1)
P(X x) = P(Z z) = 0.01 z = 2.326...

x = 81.4
(c)
(accept 81)
P(X 84) = 0.12 z = 1.1749...

mean is 88.3
(accept 88)
A1
N2
(M1)
A1
N2
[6]
309
371. METHOD 1
(from GDC)
1
1
1 0

6 12
2 1
0 1 3 6
0 0 0 0
(M1)
1
1
x+ =
6
12
A1
2
1
y =
3
6
A1
1
2
1
1
r = i j + i + j + k
6
3
12
6
A1A1A1
N3
M1A1
(M1)A1
M1
A1
N3
METHOD 2
(Elimination method either for equations or row reduction of matrix)
Eliminating one of the variables
Finding a point on the line
Finding the direction of the line
The vector equation of the line
[6]
310
372. METHOD 1
3x 2 y 2 + 2 x 3 y
dy
dy
= sin (y )
dx
dx
At (1, 1), 3 2
dy
=0
dx
A1A1A1
M1A1
dy 3
=
dx 2
A1
METHOD 2
3x 2 y 2 + 2 x 3 y
dy
dy
= sin (y )
dx
dx
3 x2 y2
dy
=
dx sin (y ) 2 x 3 y
A1
3 ( 1) (1)
dy
3
=
=
3
dx sin ( ) 2 ( 1) (1) 2
2
At (1, 1),
A1A1A1
M1A1
[6]
373. (a)
(b)
y = arccos (1.2 cos x)
A1
y = arcsin (1.4 sin x)
A1
The solutions are

x = 1.26, y = 0.464
A1A1
x = 0.464, y = 1.26
A1A1
[6]
311
374. METHOD 1
(M1)
Let P(I) be the probability of flying IS Air, P(U) be the probability
flying UN Air and P(L) be the probability of luggage lost.
P(I | L) =
P (I L )
P (L )
P(L | I ) P (I )
or Bayes' formula , P(I | L ) =
P(L | I ) P (I ) + P(L |U ) P (U )
0.23
=
0.18
=
65
135
70
65
+ 0.23
135
135
299
(= 0.543 , accept 0.542)
551
(M1)
A1A1A1
A1
METHOD 2
Expected number of suitcases lost by UN Air is 0.18 70 = 12.6
M1A1
Expected number of suitcases lost by IS Air is 0.23 65 = 14.95
A1
P(I | L) =
14.95
12.6 + 14.95
= 0.543
M1A1
A1
[6]
312
1
dy
y
A1(A1)
tan (ln y )
dy = tan u du
y
A1
375. Let u = ln y du =
sin u
cos u du = ln | cos u | + c
A1
EITHER
tan (ln y )
dy = ln | cos (ln y )| + c
y
A1A1
OR
tan (ln y )
dy = ln | sec (ln y )| + c
y
A1A1
[6]
376. (sin + i (1 cos))2 = sin2 (1 cos)2 + i 2 sin (1 cos)
M1A1
Let be the required argument.
2 sin (1 cos )
tan =
sin 2 (1 cos )
M1
2 sin (1 cos )
(1 cos ) (1 2 cos + cos )

2
2 sin (1 cos )
2 cos (1 cos )
= tan
(b)
A1
[7]
mean for 30 days: 30 0.2 = 6.
P( X = 4 ) =
A1
A1
377. (a)
(M1)
6 4 6
e = 0.134
4!
P(X > 3) = 1 P(X 3) = 1 e6(1 + 6 + 18 + 36) = 0.849
(A1)
(M1)A1
N3
(M1)A1
N2
313
(c)
EITHER
mean for five days: 5 0.2 = 1
P(X = 0) = e1 (= 0.368)
(A1)
A1
N2
OR
mean for one day: 0.2
(A1)
P(X = 0) = (e0.2 )5 = e1 (= 0.368)
(d)
Required probability = e0.2 e0.2 (1 e0.2)

= 0.122
(e)
Expected cost is 1850 6 = 11100 euros
(f)
On any one day P(X = 0) = e 0.2
5
Therefore, e 0.2
1
) (1 e ) = 0.407
4
0.2
A1
N2
M1A1
A1
N3
A1
M1A1
N2
[13]
378. (a)
(b)
CD = AC AD = b c cos A
R1AG
METHOD 1
BC2 = BD2 + CD2
(M1)
a2 = (c sin A)2 + (b c cos A)2
(A1)
= c2 sin2 A + b2 2bc cos A + c2 cos2 A
A1
= b2 + c2 2bc cos A
A1
METHOD 2
BD2 = AB2 AD2 = BC2 CD2
(M1)(A1)
c2 c2 cos2 A = a2 b2 + 2bc cos A c2 cos2 A
A1
a2 = b2 + c2 2bc cos A
A1
314
(c)
METHOD 1
b2 = a2 + c2 2ac cos 60 b2 = a2 + c2 ac
c2 ac + a2 b2 = 0
c=
=
=
M1
( a )2 4(a 2 b 2 )
(M1)A1
2
a 4b 2 3a 2
2
(M1)A1
4b 2 3a 2
a
=
2
4
1
3
a b2 a2
2
4
(M1)A1
AG
Note: Candidates can only obtain a maximum of the first

three marks if they verify that the answer given in
the question satisfies the equation.
METHOD 2
b2 = a2 + c2 2ac cos 60 b2 = a2 + c2 ac
c2 ac = b2 a2
2
a
a
c2 ac + = b 2 a 2 +
2
2
(M1)A1
(M1)
M1A1
3 2
a
2
c =b a
4
2
(A1)
a
3
c = b2 a2
2
4
A1
1
3
c = a b2 a2
2
4
AG
[12]
379. PR = h tan 55, QR = h tan 50 where RS = h

Use the cosine rule in triangle PQR.
202 = h2 tan2 55 + h2 tan2 50 2h tan 55 h tan 50 cos 45
400
h2 =
2
2
tan 55 + tan 50 2 tan 55 tan 50 cos 45
= 379.9...
h = 19.5 (m)
M1A1A1
(M1)
A1
(A1)
(A1)
A1
[8]
380. (a)
(i)
f k (x ) = 3k 2 x 2 2kx + 1
A1
315
f k (x ) = 6k 2 x 2k
(ii)
A1
Setting f (x) = 0
M1
6k2x 2k = 0 x =
3
1
3k
A1
2
1
1
1 1
f = k 2 k +
3k
3k
3k 3k
=
7
27 k
M1
A1
1 7
Hence, Pk is ,
3k 27 k
(b)
Equation of the straight line is y =
7
x
9
As this equation is independent of k, all Pk lie on this straight line

(c)
A1
R1
Gradient of tangent at Pk:

2
2
1
1
1
f (Pk ) = f = 3k 2 2k + 1 =
3
3k
3k
3k
As the gradient is independent of k, the tangents are parallel.
7
2 1
1
= +cc=
27 k 3 3k
27 k
The equation is y =
2
1
x+
3
27 k
M1A1
R1
(A1)
A1
[13]
316
381. (a)
1 + i 3 = 2 or 1 i = 2
arg 1 + i 3 =
(A1)
accept
4
or arg (1 i) =
3
4
z1 = 2 m
z2 = 2
A1
n
arg (z1) = m arctan 3 = m
A1
arg (z2) = n arctan (1) = n
(b)
A1
accept n
4
2 m = 2 n = 2m
(A1)
=n
+ 2 k , where k is an integer
3
4
+ n = 2 k
3
4
+ 2m = 2 k
3
4
A1
N2
(M1)A1
M1A1
(M1)
5
m = 2 k
6
m=
12
k
5
A1
The smallest value of k such that m is an integer is 5, hence

m = 12
A1
n = 24.
A1
N2
[14]
317
382. (a)
Use of x =
x =
x =
(b)
i =1
(M1)
(k 2) + k + (k + 1) + (k + 4)
(A1)
4
4k + 3
3
= k +
4
4
A1
Either attempting to find the new mean or subtracting 3

from their x
x =
4k + 3
9
4k 9
3 =
,k
4
4
4
N3
(M1)
A1
N2
[5]
383. (a)
Either finding depths graphically, using sin
t
= 1
6
or solving h(t) = 0 for t
(M1)
h (t)max = 12 (m), h (t)min = 4 (m)
(b)
Attempting to solve 8 + 4 sin
t
= 8 algebraically or graphically
6
t [0, 6] [12, 18] {24}
384. (a)
A1A1
N3
(M1)
A1A1
N3
[6]
Either solving e x x + 1 = 0 for x, stating e x x + 1 = 0,

stating P(x, 0) or using an appropriate sketch graph.
M1
x = 1.28
A1
N1
Note: Accept P(1.28, 0).
(b)
Area =
1.278...
0
(e
x + 1 dx
= 1.18
M1A1
A1
N1
Note: Award M1A0A1 if the dx is absent.

[5]
385. Attempting to find the mode graphically or by using f (x) = 12x(2 3x)
(M1)
318
Mode =
2
3
Use of E( X ) =
E( X ) =
2
3
3
5
A1
1
0
x f ( x)dx
3
5
1981
f ( x)dx = 0.117 =
16875
(M1)
A1
M1A1
N4
[6]
386. METHOD 1
Attempting to use the cosine rule i.e.
C
BC2 = AB2 + AC2 2 AB AC cos BA
62 = 8.752 + AC2 2 8.75 AC cos 37.8 (or equivalent)
Attempting to solve the quadratic in AC e.g. graphically, numerically or
with quadratic formula
Evidence from a sketch graph or their quadratic formula (AC =)
that there are two values of AC to determine.
AC = 9.60 or AC = 4.22
(M1)
A1
M1A1
(A1)
A1A1
N4
Note: Award (M1)A1M1A1(A0)A1A0 for one correct value of AC.
319
METHOD 2
Attempting to use the sine rule i.e.
sin C =
BC
AB
=
C sin AC
B
sin BA
8.75 sin 37.8

(= 0.8938...)
6
(M1)
(A1)
C = 63.3576...
A1
C = 116.6423... and B = 78.842... or B = 25.5576...
A1
EITHER
AC
6
=
or
sin 78.842... sin 37.8
AC
6
=
sin 25.5576... sin 37.8
Attempting to solve
M1
OR
Attempting to solve AC2 = 8.752 + 62 2 8.75 6 cos 25.5576... or
AC2 = 8.752 + 62 2 8.75 6 cos 78.842...
AC = 9.60 or AC = 4.22
M1
A1A1
N4
Note: Award (M1)(A1)A1A0M1A1A0 for one correct value of AC.

[7]
320
387. METHOD 1
EITHER
Using the graph of y = f (x)
(M1)
A1
The maximum of f (x) occurs at x = 0.5.
A1
OR
Using the graph of y = f (x).
(M1)
A1
The zero of f (x) occurs at x = 0.5.
A1
THEN
Note: Do not award this A1 for stating x = 0.5 as the final answer for x.
f (0.5) = 0.607 (= e0.5)
A2
Note: Do not award this A1 for also stating (0.5, 0.607) as a coordinate.
EITHER
Correctly labelled graph of f (x) for x < 0 denoting the maximum f (x)
(e.g. f (0.6) = 1.17 and f (0.4) = 1.16 stated)
R1
A1
N2
R1
A1
N2
OR
(e.g. f (0.6) = 0.857 and f (0.4) = 1.05 stated)
321
OR
f (0.5) 1.21. f (x) < 1.21 just to the left of x =
and f (x) < 1.21 just to the right of x =
1
2
1
2
R1
(e.g. f (0.6) = 1.17 and f (0.4) =1.16 stated)
A1
N2
OR
f (x) > 0 just to the left of x =
of x =
1
and f (x) < 0 just to the right
2
1
2
R1
(e.g. f (0.6) = 0.857 and f (0.4) = 1.05 stated)
A1
N2
METHOD 2
f (x) = 4x e 2 x
f (x) = 4 e 2 x + 16x2 e 2 x
(= (16 x 4)e )
2
2 x2
Attempting to solve f (x) = 0
x=
A1
(M1)
1
2
Note: Do not award this A1 for stating x =
A1
A1
1
as the final answer for x.
2
1 1
(= 0.607 )
f =
e
2
A1
1 1
as a coordinate.
Note: Do not award this A1 for also stating ,
2 e
EITHER
R1
(e.g. f (0.6) = 1.17 and f (0.4) = 1.16 stated)
A1
N2
R1
A1
N2
OR
(e.g. f (0.6) = 0.857 and f (0.4) = 1.05 stated)
322
OR
f (0.5) 1.21. f (x) < 1.21 just to the left of x =
and f (x) < 1.21 just to the right of x =
1
2
1
2
(e.g. f (0.6) = 1.17 and f (0.4) =1.16 stated)
R1
A1
N2
OR
f (x) > 0 just to the left of x =
of x =
1
and f (x) < 0 just to the right
2
1
2
R1
(e.g. f (0.6) = 0.857 and f (0.4) = 1.05 stated)
388. (a)
X ~ B(n, 0.4)
N2
[7]
(A1)
Using P(X = x) = (0.4 ) (0.6 )

r
x
n x
(b)
A1
(M1)
n
n (n 1)
2
n2
(0.4)2 (0.6)n2
P(X = 2) = (0.4 ) (0.6 )
=
r
2
A1
P(X = 2) = 0.121
A1
Using an appropriate method (including trial and error) to solve

their equation.
n = 10
N3
(M1)
A1
N2
Note: Do not award the last A1 if any other solution is given

in their final answer.
[6]
323
389.
A1A1A1A1A1
Notes: Award A1 for vertical asymptotes at x = 1, x = 2 and x = 5.
A1 for x 2,
A1 for x 8,
1
0+
f (x )
1
1
f (x )
A1 for local maximum at 0 , (branch containing

2
local max. must be present)

A1 for local minimum at (3, 1) (branch containing local
min. must be present)
In each branch, correct asymptotic behaviour must be
displayed to obtain the A1.
Disregard any stated horizontal asymptotes such as y = 0 or y = 1.
[5]
324
390. METHOD 1
Substituting z = x + iy to obtain w =
w=
x + yi
(x + yi )2 + 1
x + yi
x y 2 + 1 + 2 xyi
A1
Use of (x2 y2 + 1 2xyi) to make the denominator real.

=
(x + yi )(x 2 y 2 + 1 2 xyi )
(x
Im w =
y 2 +1 + 4 x 2 y 2
y x 2 y 2 +1 2 x 2 y
(x
(x
y +1 + 4 x 2 y 2
2
y 1 x 2 y 2
2
y +1 + 4 x 2 y 2
2
(A1)
Im w = 0 1 x2 y2 = 0 i.e. z = 1 as y 0
M1
A1
(A1)
A1
R1AG
N0
METHOD 2
w (z2 + 1) = z
(A1)
w(x2 y2 + 1 + 2ixy) = x + yi
A1
Equating real and imaginary parts

w (x2 y2 + 1) = x and 2wx = 1, y 0
Substituting w =
1
x y2 1
to give
+
=x
2x
2 2x 2x
M1A1
A1
1 2
x
y 1 = or equivalent
2x
2
(A1)
x2 + y2 = 1, i.e. z = 1 as y 0
R1AG
[7]
391. Attempting to solve |0.1x2 2x + 3| = log10 x numerically or graphically.
(M1)
x = 1.52, 1.79
(A1)(A1)
x = 17.6, 19.1
(A1)
(1.52 < x < 1.79) (17.6 < x < 19.1)
A1A1
N2
[6]
325
392. (a)
(i)
P(4.8 < X < 7.5) = P(0.8 < Z < 1)
(M1)
= 0.629
A1
N2
Note: Accept P(4.8 X 7.5) = P(0.8 Z 1).

(ii)
Stating P(X < d) = 0.15 or sketching an appropriately labelled

diagram.
d 6
= 1.0364...
1.5
(M1)(A1)
d = (1.0364...)(1.5) + 6
= 4.45 (km)
(b)
A1
Stating both P(X > 8) = 0.1 and P(X < 2) = 0.05 or sketching an
appropriately labelled diagram.
Setting up two equations in and
8 = + (1.281...) and 2 = (1.644...)
Attempting to solve for and (including by graphical means)
= 2.05 (km) and = 5.37 (km)
(M1)
A1
N4
R1
(M1)
A1
(M1)
A1A1
N4
M1
(A1)
A1
M1A1
N3
Note: Accept = 5.36, 5.38.

(c)
(i)
Use of the Poisson distribution in an inequality.

P(T 3) = 1 P(T 2)
= 0.679...
Required probability is (0.679...)2 = 0.461
Note: Allow FT for their value of P(T 3).
(ii)
~ Po(17.5)
P( = 15) =
A1
e 17.5 (17.5)
15!
15
= 0.0849
(M1)
A1
N2
[21]
326
393. (a)
(i)
Attempting to find M2
M1
a 2 + bc ab + bd
M =
2
ac
+
cd
bc
+
d
A1
b (a + d) = b or c(a + d) = c
A1
Hence a + d = 1
AG
(ii)
a2 + bc = a
bc = a a2
(b)
(as b 0 or c 0)
N0
M1
(= a(1 a))
A1
N1
METHOD 1
Using det M = ad bc
det M = ad a(1 a) or det M = a(1 a) a(1 a)
(or equivalent)
= 0 using a + d = 1 or d = 1 a to simplify their
expression
Hence M is a singular matrix
M1
A1
R1
AG
N0
M1A1
R1
AG
N0
METHOD 2
Using bc = a(1 a) and a + d = 1 to obtain bc = ad
det M = ad bc and ad bc = 0 as bc = ad
Hence M is a singular matrix
(c)
a(1 a) > 0
0<a<1
(M1)
A1A1
N3
Note: Award A1 for correct endpoints and A1 for correct

inequality signs.
(d)
METHOD 1
Attempting to expand (I M)2
M1
(I M)2 = I 2M + M2
= I 2M + M
=IM
A1
A1
AG
N0
327
METHOD 2
2
1 a b
(or equivalent)
Attempting to expand (I M)2 =
c 1 d
(e)
M1
(1 a )2 + bc
b(1 a ) b(1 d )
(I M)2 =
2
c(1 a ) c (1 d )
bc + (1 d )
(or equivalent)
A1
Use of a + d = 1 and bc = a a2 to show desired result.
M1
1 a b
Hence (I M)2 =
c 1 d
AG
(Let P(n) be (I M)n = I M)

For n = 1: (I M)1 = I M, so P(1) is true
Assume P(k) is true, i.e. (I M)k = I M
Consider P(k + 1)
A1
M1
(I M)k + 1 = (I M)k (I M)
= (I M) (I M) (= (I M)2)
= (I M)
M1
A1
A1
P(k) true implies P(k + 1) true, P(1) true so P(n) true n
R1
N0
N0
[20]
394. (a)
(i)
EITHER
Attempting to separate the variables
(M1)
dv
dt
=
2
50
v 1+ v
(A1)
OR
Inverting to obtain
dt
50
=
dv v 1 + v 2
dt
dv
(M1)
(A1)
THEN
t = 50
(b)
1
dv = 50
10 v 1 + v 2
10
v(1 + v ) dv
5
(ii)
104
(sec)
t = 0.732 (sec ) = 25 ln
101
(i)
dv
dv
=v
dt
dx
A1
N3
A2
N2
(M1)
328
Must see division by v (v > 0)
dv 1 + v 2
=
dx
50
(ii)
AG
Either attempting to separate variables or inverting to obtain

dx
dv
dv
A1
(M1)
1
dx (or equivalent)
50
A1
Attempting to integrate both sides
M1
1+ v
arctan v =
x
+C
50
N0
A1A1
Note: Award A1 for a correct LHS and A1 for a correct

RHS that must include C.
(iii)
When x = 0, v = 10 and so C = arctan10

x = 50(arctan10 arctan v)
M1
A1
Attempting to make arctan v the subject.
M1
arctan v = arctan10
x
50
v = tan arctan 10
50
N1
A1
M1A1
Using tan (A B) formula to obtain the desired form.
M1
x
50
v=
x
1 + 10 tan
50
AG
10 tan
N0
[19]
329
395. The number of heads X is B (200, p)

H0: p = 0.5; H1: p 0.5
(M1)
A1A1
Note: Award A1A0 for the statement H0: coin is fair; H1: coin is biased.
EITHER
P(X 115 | H0) = 0.0200
p-value = 0.0400
This is greater than 0.01.
There is insufficient evidence to conclude that the coin is biased
(or the coin is not biased).
(M1)(A1)
A1
R1
R1
OR
(Using a proportion test on a GDC) p-value = 0.0339
This is greater than 0.01.
N3
R1
R1
OR
Under H0 X is approximately N (100, 50)
115 100
= 2.12
50
(Accept 2.05 with continuity correction)
This is less than 2.58
z=
(M1)
(M1)A1
R1
R1
OR
99% confidence limits for p are
115
115 85
1
2.576
200
200 200 200
giving [0.485, 0.665]

This interval contains 0.5
(M1)A1
A1
R1
R1
[8]
330
396. H0: Data can be modelled by exponential distribution with mean

100 hours.
H1: Data cannot be modelled by exponential distribution with
mean 100 hours.
R1
Under H0.
f ( x) =
1 x/100
e
100
M1
The expected frequencies are

Lifetime
(hours)
Frequency
0 x < 100
100 x < 200
200 x < 300
300 x < 400
400 x < 500
x 500
632.12
232.54
85.55
31.47
11.58
6.74
A1A1A1A1A1A1
Note: Accept values correct to 3 significant figures.
EITHER
2 =
622 2
225 2
12 2
+
+ ... +
1000
632.12 232.54
6.74
= 5.97
M1
A2
Note: Accept any value that rounds to 6.0.

Degrees of freedom = 5
Critical value = 11.07
We conclude that the data can be modelled by an
exponential distribution with mean 100 hours.
(A1)
A1
R1
Note: Allow FT from their 2.

OR
Using GDC, p-value = 0.309
(A1)
A4
Note: Accept any value between 0.30 and 0.32.

We conclude that the data can be modelled by an
exponential distribution with mean 100 hours.
R1
Note: Allow FT from their p-value.

[14]
331
397. (a)
Let X, Y (grams) denote respectively the weights of a randomly

chosen apple, pear.
Then
X 2Y is N (200 2 120, 152 + 4 102),
i.e. N(40, 252)
(M1)(A1)(A1)
A1
We require
P(X > 2Y) = P(X 2Y > 0)
= 0.0548
(b)
(M1)(A1)
A2
Let T = X1 + X2 + X3 + Y1 + Y2 +Y3 + Y4 (grams) denote

the total weight.
Then
T is N (3 200 + 4 120, 3 152 + 4 102),
i.e. N(1080, 1075)
P(T > 1000) = 0.993
(M1)(A1)(A1)
A1
A2
[14]
398. (a)
4.35 + 4.53
= 4.44 (estimate of )
2
(i)
x=
(ii)
Critical value of t = 2.262
2.262
= 0.09
10
s = 0.12582...
s2 = 0.0158 (estimate of 2)
(b)
(i)
Using t test
t=
(ii)
4.44 4.5
0.0158
10
A2
(A1)
(A1)
M1A1
(A1)
A1
(M1)
= 1.50800 (Accept 1.50946)
(A1)
p-value = 0.0829 (Accept 0.0827)
A2
(a)
Accept H0 / Reject H1.
R1
(b)
Reject H0 / Accept H1.
R1
[14]
399. (a)
X2 is a geometric random variable
A1
332
5
with p = .
6
A1
Therefore E(X2) =
(b)
A1
4
X3 is a geometric random variable with p = .
6
Therefore E(X3) =
(c)
6
.
5
E(X4) =
A1
6
.
4
A1
6
6
6
, E(X5) = , E(X6) =
1
3
2
E(X1) = 1
A1A1A1
(or X1 = 1)
A1
6
Expected number of tosses =
E( X )
M1
n =1
= 14.7
AG
[10]
400. (a)
(i)
(ii)
(iii)
It is not closed because

1 * 1 = 0 +.
R2
a*b=a+b2
b*a=b+a2=a*b
It is commutative.
M1
A1
It is not associative.
Consider (1 * 1) * 5 and 1 * (1 * 5).
The first is undefined because 1 * 1
The second equals 3.
A1
+
.
R2
Notes: Award A1R2 for stating that non-closure implies

non-associative.
Award A1R1 to candidates who show that
a * (b * c) = (a * b) * c = a + b + c 4 and
therefore conclude that it is associative, ignoring
the non-closure.
333
(b)
(i)
(ii)
The identity e satisfies

a*e=a+e2=a
e = 2 (and 2 +)
M1
A1
a * a 1 = a + a 1 2 = 2
a + a 1 = 4
So the only elements having an inverse are 1, 2 and 3.
M1
A1
A1
Note: Due to commutativity there is no need to check two

sidedness of identity and inverse.
[12]
401. (a)
]1, 1[
A1A1
Note: Award A1 for the values 1, 1 and A1 for the open interval.
(b)
EITHER
Let
1 ex
1+ e x
1 e y
M1
1+ e y
1 ex + ey e(x + y) = 1 + ex ey e(x + y)
ex = ey
x=y
Therefore f is an injection
OR
Consider
f (x ) =
e x 1+ e x + e x 1 e x
(1 + e )
x 2
2 ex
(1+ e )
x 2
> 0 for all x.

Therefore f is an injection.
A1
A1
AG
M1
A1
A1
AG
Note: Award M1A1A0 for a graphical solution.
334
(c)
Let y =
1 e x
1+ e x
M1
y (1 + ex ) = 1 ex
ex (1 + y) = 1 y
1 y
e x =
1+ y
A1
A1
1+ y
x = ln
1 y
f
A1
(x ) = ln 1 + x
A1
1 x
[10]
402. (a)
z6 = 1 = cis 2n
The six roots are
cis 0 (1), cis
(M1)
2
4
5
, cis
, cis (1), cis
, cis
3
3
3
3
A3
Note: Award A2 for 4 or 5 correct roots, A1 for 2 or 3 correct roots.
(b)
(i)
Closure: Consider any two roots cis

cis
m
n
, cis
.
3
3
m
n
= cis (m + n )(mod 6 ) G
cis
3
3
3
M1
A1
Note: Award M1A1 for a correct Cayley table showing closure.

Identity: The identity is 1.
Inverse: The inverse of cis
A1
(6 m ) G.
m
is cis
3
3
Associative: This follows from the associativity of

multiplication.
The 4 group axioms are satisfied.
(ii)
Successive powers of cis
A2
R1
R1
5
or cis
3
3
generate the group which is therefore cyclic.

The (only) other generator is cis
or cis .
3
3
R2
A1
Note: Award A0 for any additional answers.

(iii)
The group of the integers 0, 1, 2, 3, 4, 5 under addition

modulo 6.
R2
335
m cis
m
3
R1
Note: Accept any other cyclic group of order 6.

[17]
403. (a)
(b)
Reflexive: (a, b)R(a, b) because ab = ba

Symmetric: (a, b)R(c, d) ad = bc cb = da (c, d)R(a, b)
Transitive: (a, b)R(c, d) ad = bc
(c, d)R(e, f ) cf = de
Therefore
R1
M1A1
M1
ad bc
=
so af = be
de cf
A1
It follows that (a, b)R(e, f)
R1
(a, b)R(c, d)
a c
=
b d
Equivalence classes are therefore points lying, in the first quadrant,

on straight lines through the origin.
(M1)
A2
Notes: Accept a correct sketch.

Award A1 if in the first quadrant is omitted.
Do not penalize candidates who fail to exclude the origin.
[9]
336
404. The identity is 1.

Consider
21, 22, 23, ..., 2k
2k = p 1
Therefore all the above powers of two are different
Now consider
2k + 1 2p 2(mod p) = p 2
2k + 2 2p 4(mod p) = p 4
2k + 3 = p 8
etc.
2k 1
2
= p 2k 1
22k = p 2k
=1
and this is the first power of 2 equal to 1.
The order of 2 is therefore 2k.
Using Lagranges Theorem, it follows that 2k is a factor of 2k,
the order of the group, in which case k must be as given.
(R1)
R1
R1
M1A1
A1
A1
A1
R2
AG
R2
[12]
405. Consider
u n +1
10 n + 1
un
1 1
1 +
10 n
10
(
n + 1) 10 n
=
n10
M1A1
10
A1
1
as n
10
A1
1
<1
10
R1
So by the Ratio Test the series is convergent.
R1
[6]
406. (a)
x
1
= lim x
x
x e
x e
lim
=0
M1A1
AG
337
(b)
Using integration by parts
a
0
] + e
[e ]
x e x dx = xe x
= ae a
M1
a
a
0
dx
x a
0
= 1 aea ea
(c)
Since ea and aea are both convergent (to zero), the integral is
convergent.
Its value is 1.
A1A1
A1
A1
R1
A1
[9]
407. (a)
Rewrite the equation in the form
dy 2
x2
y= 2
dx x
x +1
M1A1
2
Integrating factor = e
M1
= e 2ln x
A1
1
x2
A1
=
Note: Accept
x dx
1
as applied to the original equation.
x3
338
(b)
Multiplying the equation,
1 dy 2
1
3 y= 2
2
x dx x
x +1
(M1)
d y
1
2 = 2
dx x x + 1
(M1)(A1)
y
dx
= 2
2
x
x +1
M1
= arctan x + C
A1
Substitute x = 1, y = 1.
M1
1=
+ C C =1
A1
y = x 2 arctan x + 1
4
A1
[13]
408. (a)
The area under the curve is sandwiched between the sum of the
areas of the lower rectangles and the upper rectangles.
Therefore
dx
1
1
1
1
1
1
1 3 + 1 3 + 1 3 + ... <
< 1 3 + 1 3 + 1 3 + ...
3
3
4
5
6
x
3
4
5
which leads to the printed result.
M2
A1
339
(b)
We note first that
dx 1
1
= 2 =
3
x 2 x 3 18
M1A1
Consider first
n
n =1
=1 +
1 1 1 1 1
+ 3 + 3 + 3 + 3 + ...
3
2 3 4 5 6
1 1 1
< 1+ + +
8 27 18
263
216
n
n =1
=1 +
(1.22) (which is an upper bound )
1 1
1 1
+ 3 + 3 + 3 + ...
3
2 3
4 5
1 1
> 1+ +
8 18
85 255
(1.18) (which is a lower bound)

72 216
409. (a)
(b)
Constant term = 0
f ( x) =
1
1 x
f ( x) =
f (x) =
M1A1
M1A1
A1
M1A1
M1A1
A1
[15]
A1
A1
(1 x )2
2
(1 x )3
f (0) = 1; f (0) = 1; f (0) = 2
A1
A1
A1
Note: Allow FT on their derivatives.
f ( x) = 0 +
1 x 1 x 2 2 x 3
+
+
+ ...
1!
2!
3!
= x+
(c)
x2 x3
+
2 2
M1A1
AG
1
1
= 2 x =
1 x
2
(A1)
1 1 1
ln 2 + +
2 8 24
M1
340
(d)
2
(0.667 )
3
A1
n +1
f (n + 1) (c) 1

Lagrange error =
(n + 1)! 2
<
(1 c )
6
1
1
2
1 1

24 2
1 1
24 16
Actual error = ln 2
A1
A2
giving an upper bound of 0.25.
(e)
(M1)
A1
2
= 0.0265
3
A1
The upper bound calculated is much larger that the actual

error therefore cannot be considered a good estimate.
R1
[17]
410. 7854 = 2 3315 + 1224

3315 = 2 1224 + 867
1224 = 1 867 + 357
867 = 2 357 + 153
357 = 2 153 + 51
153 = 3 51
The gcd is 51.
Since 51 does not divide 41,
there are no solutions.
M1A1
A1
A1
A1
R1
A1
[7]
411. (a)
x y (mod n) x = y + kn, (k
A1
341
(b)
x y(mod n)
x = y + kn
M1
x2 = y2 + 2kny + k2n2
x2 = y2 + (2ky + k2n) n
x2 y2 (mod n)
(c)
A1
M1A1
AG
EITHER
x2 y2 (mod n)
x2 y2 = 0(mod n)
M1
(x y)(x + y) = 0(mod n)
A1
This will be the case if

x + y = 0(mod n) or x = y(mod n)
R1
so x y(mod n) in general
R1
OR
Any counter example, e.g. n = 5, x = 3, y = 2, in which case
x2 y2 (mod n) but x / y (mod n).(false)
R2
R1R1
[9]
412. (a)
N = an 2n + an 1 2n 1 +... + a1 2 + a0
M1
If a0 = 0, then N is even because all the terms are even.
R1
Now consider
n
a0 = N a r 2 r
M1
r =1
If N is even, then a0 is the difference of two even numbers and

is therefore even.
R1
It must be zero since that is the only even digit in binary arithmetic.
R1
342
(b)
N = an 3n + an 1 3n 1 +... + a1 3 + a0
= an (3n 1) + an 1 (3n 1 1) + ... + a1 (3 1) + an
+ an 1 + ... + a1 + a0
Since 3n is odd for all n
, it follows that 3n 1 is even.
Therefore if the sum of the digits is even, N is the sum of even

numbers and is even.
Now consider
an + an 1 + ... + a1 + a0 = N
a (3
n
r =1
If N is even, then the sum of the digits is the difference of even

numbers and is therefore even.
M1A1
R1
R1
M1
R1
[11]
413. (a)
A2
(b)
(c)
For a simple planar graph containing triangles, e 3v 6.

Here v = 5, so e 9.
There are already 8 edges so the maximum number of edges that
could be added is 1.
This can be done e.g. AC or BD
The distinct Hamiltonian cycles are
ABCDEA
ABCEDA
ABECDA
AEBCDA
M1
A1
R1
R1
A2
A2
A2
A2
Note: Do not penalize extra cycles.

The weights are 32, 32, 29, 28 respectively.
The Hamiltonian cycle of least weight is AEBCDA.
A1
R1
[16]
414. (a)
The edges are included in the order
343
CF
EF
BC
CD
AB
A1
A1
A1
A1
A1
A1
(b)
(c)
(i)
A tree with v vertices has v 1 edges.

Using v + f = e + 2 with f = 1, the result follows.
A1
R1
(ii)
Each of the c trees will have one less edge than the number
of vertices.
Thus the forest will have v c edges.
R1
A2
Suppose that all v vertices have odd order.
M1
Then degree = the sum of v odd numbers,

which will be an odd number.
A1
R1
But degree = 2E (as each edge will contribute

two to the sum of degrees)
which is even.
This contradiction shows that at least one vertex must have even
order.
A1
R1
R1
[17]
344
415. (a)
(i)
E(2Y + 3) = 6
2E(Y) + 3 = 6
3
E(Y) =
2
(ii)
(iii)
(b)
A1
Var (2 3Y) = 11
Var ( 3Y) = 11
9 Var (Y) = 11
Var (Y) =
M1
11
9
E(Y2) = Var (Y) + [E(Y)]2

=
11 9
+
9 4
125
36
E(V) = E(3S 4R)

= 3E(S) 4E(R)
= 24 20 = 4
Var (3S 4R) = 9 Var (S) + 16 Var (R), since R and S
are independent random variables
= 18 + 16 = 34
V ~ N(4, 34)
P(V > 5) = 0.432
(M1)
A1
M1
A1
N0
M1
A1
M1
A1
A2
N0
[12]
345
416. Let X denote the number of imperfect glasses in the sample

For recognising binomial or proportion or Poisson
(X ~ B(200, p) where p-value is the probability of a glass being
imperfect)
Let H0: p-value = 0.02 and H1: p-value > 0.02
(M1)
A1
A1A1
EITHER
p-value = 0.0493
Using the binomial distribution p-value = 0.0493 > 0.01 we accept H0
A2
R1
OR
p-value = 0.0511
Using the Poisson approximation to the binomial distribution since
p-value = 0.0511 > 0.01 we accept H0
A2
R1
OR
p-value = 0.0217
Using the one proportion z-test since
p-value = 0.0217 > 0.01 we accept H0
A2
R1
Note: Use of critical values is acceptable.

[7]
417. (a)
H0: d = 0; H1: d > 0, where d is the difference in the number

of digits remembered
A1A1
346
(b)
Child
Number of digits remembered on test 1
Number of digits remembered on test 2
10
10
Difference (d)
A2
Notes: Award A2 for the correct d values.
Award A1 for one error, A0 for two or more errors.
Use the t-test because the variance is not known
By GDC
t = 2.106...
M1R1
(A2)
EITHER
p-value = 0.0295 (accept any value that rounds to this number)
Since 0.0295 < 0.05 there is evidence that practice
sessions improve ability to memorize digits
A2
R1
OR
The critical value of t is 1.796
Since 2.106 ... > 1.796 there is evidence that practice
sessions improve ability to memorize digits
A2
R1
Note: Award M1R1A1A1R1 for testing equality of means

(t = 1.46, p-value = 0.08).
418. (a)
Mean =
(9 0 + 12 1 + 22 2 + 10 3 + 11 4 + 8 5 + 8 6)
80
109
= 2.725 =
40
[11]
(M1)
A1
Note: Do not accept 2.73.
347
(b)
H0: the data can be modelled by a Poisson distribution

H1: the data cannot be modelled by a Poisson distribution
A1
A1
Number
of calls
Observed
frequency
12
22
10
11
14.289
19.469
17.684
12.047
6.566
4.701
80 e 2.725 (2.725)0
0!
Expected
frequency
= 5.244
A3
Note: Award A2 for one error, A1 for two errors, A0 for three
or more errors.
Combining last two columns
(M1)
Note: Allow FT from not combining the last two columns and / or
getting 2.98 for the last expected frequency.
EITHER
2 =
92
12 2
22 2
10 2
112
16 2
+
+
+
+
+
80 (M1)(A1)
5.244 14.289 19.469 17.684 12.047 11.267
= 8.804
(accept 8.8)
A1
= 6 2 = 4, 52% = 9.488
A1A1
Hence 8.804 is not significant since 8.804 < 9.488 and we

accept H0
R1
OR
p-value = 0.0662 (accept 0.066) which is not significant since
0.0662 > 0.05 and we accept H0
A5
R1
N0
[14]
419. (a)
3
With H0, X ~ N13, = N(13 ,1.5)
2
(i)
(M1)(A1)
5% for N (0, 1) is 1.645

so
x 13
1.5
=1.645
(M1)(A1)
x =13+ 1.645 1.5

= 15.0 (3 s.f.)
A1
N0
[15.0, [
348
(ii)
1% for N(0, 1) is 2.326

so
(b)
(c)
x 13
1.5
= 2.326
(M1)(A1)
x =13+ 2.326 1.5

= 15.8 (3 s.f., accept 15.9)
[15.8, [
A1
(i)
= P (X < 15.0147 )
= 0.440
M1
A2
(ii)
= P (X <15.8488)
= 0.702
M1
A2
The probability of a Type II error increases when the

probability of a Type I error decreases.
N0
R2
[16]
420. (a)
+6
4
A3
Note: Award A2 for 1 error, A1 for 2 errors and A0

for more than 2 errors.
(b)
The table is closed

Identity element is 0
Each element has a unique inverse (0 appears exactly once in each
row and column)
Addition mod 6 is associative
Hence {G, +6} forms a group
A1
A1
A1
A1
AG
349
(c)
0 has order 1 (0 = 0),

1 has order 6 (1 + 1 + 1 + 1 + 1 + 1 = 0),
2 has order 3 (2 + 2+ 2 = 0),
3 has order 2 (3 + 3 = 0),
4 has order 3 (4 + 4 + 4 = 0),
5 has order 6 (5 + 5 + 5 + 5 + 5 + 5 = 0).
A3
Note: Award A2 for 1 error, A1 for 2 errors and A0

(d)
(e)
Since 1 and 5 are of order 6 (the same as the order of the

group) every element can be written as sums of either 1 or 5.
Hence the group is cyclic.
R1
The generators are 1 and 5.
A1
A subgroup of order 3 is ({0, 2, 4}, +6)
A2
Note: Award A1 if only {0, 2, 4} is seen.

(f)
Other proper subgroups are ({0}, +6), ({0, 3}, +6)
A1A1
Note: Award A1 if only {0}, {0, 3} is seen.

[16]
421. (a)
f is surjective because every horizontal line through

Q meets the graph somewhere
f is not injective because it is a many-to-one function
g is injective because it always has a positive gradient
(accept horizontal line test reasoning)
g is not surjective because a horizontal line through the
negative part of B would not meet the graph at all
(b)
(i)
R1
R1
R1
R1
EITHER
Let x1, x2 X and y1 = h (x1) and y2 = h (x2)
Then
k (h (x1)) = k (h (x2))
M1
k (y1) = k (y2)
A1
y1 = y2 (k is injective)
A1
h (x1) = h (x2) (h (x1) = y1 and h (x2) = y2)
A1
x1 = x2 (h is injective).
A1
Hence k h is injective
AG
350
OR
(ii)
x1, x2 X, x1 x2
M1
since h is an injection h (x1) h (x2)
A1
h (x1), h (x2) Y
A1
since k is an injection k(h (x1)) k(h (x2))
A1
k(h (x1)), k(h (x2)) Z
A1
so k h is an injection
AG
h and k are surjections and let z Z

Since k is surjective there exists y Y such that k(y) = z
Since h is surjective there exists x X such that h(x) = y
Therefore there exists x X such that
k h(x) = k (h(x))
= k (y)
=z
So k h is surjective
R1
R1
R1
A1
AG
[13]
422. (A B) \ (A C) = (A B) (A C)
= (A B) (A C)
= (A B A) (A B C)
= (A A B) (A B C)
= ( B) (A B C)
= (A B C)
= (A (B C))
= A (B \ C)
M1
A1
A1
A1
(A1)
A1
AG
Note: Do not accept proofs by Venn diagram.

[6]
351
423. (a)
(i)
aRa a.a = a2 so R is reflexive
A1
aRb = m2 bRa so R is symmetric
A1
aRb = ab = m and bRc = bc = n

so a =
M1A1
m2
n2
and c =
b
b
2
ac =
m 2 n 2 mn
=
,
b2
b
A1
2
(ii)
(b)
mn
ac is an integer hence
is an integer
b
R1
so aRc, hence R is transitive

R is therefore an equivalence relation
R1
AG
1R4 and 4R9 or 2R8

so {1, 4, 9} is an equivalence class
and {2, 8} is an equivalence class
M1
A1
A1
a ~ a since aa1 = e H, the identity must be in H since

it is a subgroup.
Hence reflexivity.
a ~ b ab1 H but H is a subgroup so it must contain
(ab1)1 = ba1
i.e. ba1 H so ~ is symmetric
a ~ b and b ~ c ab1 H and bc1 H
But H is closed, so
(ab1) (bc1) H or a(b1b)c1 H
ac1 H a ~ c
Hence ~ is transitive and is thus an equivalence relation
M1
R1
M1R1
A1
M1
R1
A1
R1AG
[19]
424. (a)
Each row and column contains all the elements of the set.
A1A1
352
(b)
There are 5 elements therefore any subgroup must be of an order

that is a factor of 5
e a
e e a
of order 2 so the table is not
But there is a subgroup
a a e
a group table
R2
R2
Note: Award R0R2 for a is an element of order 2 which

does not divide the order of the group.
[6]
425. (a)
Using lHopitals rule,
ln x
x
= lim
lim
x 1 sin 2 x x 1 2 cos 2 x
1
2
4
6

1 1 + x 2 + x + x + ...
x
1 e
2 ! 3!
= lim
lim
2
4
x 0 1 cos x x 0
1 1 x + x ...
2! 4!

M1A1
A1
(b)
M1A1A1
Note: Award M1 for evidence of using the two series.
2 x4 x6
x ...
2 ! 3!
= lim
2
4
x0
x x + ...

2! 4!

A1
EITHER
2
4
1 x x ...
2 ! 3!
= lim
2
x0
1 x + ...

2! 4!

1
= 2
1
2
M1A1
A1
OR
353
3
5
2 x 4 x 6 x ...
2!
3!
= lim
3
x0
2x 4x
2 ! 4 ! + ...
M1A1
2
4
2 4 x 6 x ...
2!
3!
= lim
2
x0
4x
1
+ ...
4!
2
= 2
1
A1
[10]
426.
Let
(x + 2)(2 x + 1)
x = 2 A=
A(2 x + 1) + B(x + 2 )
A
B
+
=
(x + 2)(2 x + 1)
x + 2 2 x +1
1
3
A1
1
2
x= B=
2
3
1
3
M1A1
A1
(2 x + 1) (x + 2) dx
M1
1
[ln (2 x + 1) ln (x + 2)]0h
3
A1
2h + 1
1
1
ln
lim ln
3 h h + 2
2
A1
1
1
ln 2 ln
3
2
A1
2
ln 2
3
A1
I=
N3
Note: If the logarithms are not combined in the third from last line
the last three A1 marks cannot be awarded.
[9]
354
427. (a)
(i)
dy
= 2x 1+ x 2 y
dx
xi
yi
yi
1.1
0.4620
0.0462
1.2
2.0462
0.9451
0.0945
1.3
2.1407
M1
A2
Notes: Award A2 for complete table.

Award A1 for a reasonable attempt.
(ii)
(b)
f (1.3) = 2.14 (accept 2.141)
A1
Decrease the step size
A1
dy
= 2 x 1+ x 2 y
dx
dy
= 2 xy = 2 x 1 + x 2
dx
M1
2 xdx
Integrating factor is e
=ex
2
So, e x y =
(2 xe
x2
M1A1
+ 2 xe x x 2 dx
= e x + x 2 e x 2 xe x dx
2
A1
M1A1
= e x + x 2e x e x + k
2
= x 2e x + k
y = x 2 + ke x
A1
x = 1, y = 2 2 = 1 + ke1
M1
k=e
y = x2 + e 1 x
A1
[14]
355
428. (a)
f (x) = ln cos x
f ( x) =
sin x
= tan x
cos x
M1A1
f (x) = sec2 x
M1
f (x) = 2 sec x sec x tan x
A1
f iv (x) = 2 sec2 x (sec2 x) 2 tan x (2 sec2 x tan x)

= 2 sec4 x 4 sec2 x tan2 x
f (x ) = f (0 ) + xf (0 ) +
A1
x2
x3
x 4 iv
f (0 ) +
f (0 ) +
f (0 ) + ...
2!
3!
4!
f (0) = 0,
M1
f (0) = 0,
f (0) = 1,
f (0) = 0,
f iv (0) = 2,
A1
Notes: Award the A1 if all the substitutions are correct.

Allow FT from their derivatives.
ln (cos x)
=
x 2 2x 4
2! 4!
A1
x2 x4
2 12
AG
356
(b)
Some consideration of the manipulation of ln 2

Attempt to find an angle
(M1)
(M1)
EITHER
Taking x =
A1
2
2

1
3
3
ln
2
2!
4!
A1
2
4
2
ln 2 9 81
2!
4!
ln 2
A1
2 4 2 1 2
+
= +
18 972 9 2 108
A1
OR
Taking x =
A1
2
2
1
4
4

ln
2!
4!
2
A1
2
4
2
1
ln 2 16 256
2
2!
4!
ln 2
2
4
2
+
=
16 1536 8
A1
1 2
+
2 192
A1
[14]
357
429. (a)
The ratio test gives
lim
u n +1
un
( 1)n + 1 x n+1 (n + 1)3n

n (n + 2 )3 n + 1 ( 1)n x n
= lim
= lim
(n + 1)x
3(n + 2 )
A1
A1
So the series converges for
M1A1
x
3
< 1,
the radius of convergence is 3
A1
A1
Note: Do not penalize lack of modulus signs.
(b)
u n = 3 n 3 +1 n
1
= n 3 1 + 3 1
M1A1
= n1 +
1
1
5
6+
... 1
3
9
3n 9n 81n
A1
using v n =
1
as the auxilliary series,
n2
M1
un 1
1 1 1 1
= and 2 + 2 + 2 + 2 + ... converges
n v
3
1 2 3 4
n
since lim
then
converges
M1A1
A1
Note: Award M1A1A1M0M0A0A0 to candidates attempting

to use the integral test.
[13]
430. (a)
324 = 2 129 + 66
129 = 1 66 + 63
66 = 1 63 + 3
hence gcd (324, 129) = 3
M1
A1
A1
358
(b)
METHOD 1
Since 3 | 12 the equation has a solution
M1
3 = 1 66 1 63
3 = 1 129 + 2 66
3 = 2 (324 2 129) 129
M1
3 = 2 324 5 129
12 = 8 324 20 129
(x, y) = (8, 20) is a particular solution
A1
A1
A1
Note: A calculator solution may gain M1M1A0A0A1.

A general solution is x = 8 +
129
t = 8 + 43t , y = 20 108t , t
3
A1
METHOD 2
324x + 129y = 12
108x + 43y = 4
108x 4(mod 43) 27x 1(mod 43)
x = 8 + 43t
108(8 + 43t) + 43y = 4
864 + 4644t + 43y = 4
43y = 860 4644t
y = 20 108t
a particular solution (for example t = 0) is (x, y) = (8, 20)
(c)
A1
A1
A1
M1
A1
A1
EITHER
The left side is even and the right side is odd so there are no
solutions
M1R1AG
OR
gcd (82, 140) = 2
2 does not divide 3 therefore no solutions
A1
R1AG
[11]
359
431. (a)
(i)
A1A1A1
Note: Award A1 for the vertices, A1 for edges and
A1 for planar form.
(ii)
It is possible to find an Eulerian trail in this graph since

exactly two of the vertices have odd degree
R1
360
(iii)
(b)
B and D are the odd vertices
M1
BC + CD = 3 + 2 = 5 and BD = 9,
since 5 < 9, BC and CD must be traversed twice
A1
R1
A possible walk by inspection is ACBDABCDCEA

This gives a total length of
2 (2 + 3) + 8 + 9 + 5 + 7 + 10 + 6 = 55 for the walk
A1
The sum of all the vertex degrees is twice the number of edges,
i.e. an even number.
Hence a graph cannot have exactly one vertex of odd degree.
A1
M1R1
[11]
432. (a)
(i)
(ii)
a d(mod n) and b c(mod n)

so a d = pn and b c = qn,
a d + b c = pn + qn
(a + b) (c + d) = n (p + q)
(a + b) (c + d)(mod n)
2 x + 5 y 1 (mod 6)
x + y 5 (mod 6)
adding 3x + 6y 0(mod 6)
6y 0(mod 6) so 3x 0(mod 6)
x 0 or x 2 or x 4(mod 6)
for x 0, 0 + y 5(mod 6) so y 5(mod 6)
for x 2, 2 + y 5(mod 6) so y 3(mod 6)
If x 4(mod 6), 4 + y 5(mod 6) so y 1(mod 6)
M1A1
A1
AG
M1
R1
A1A1A1
A1
A1
A1
361
(b)
Suppose x is a solution
97 is prime so x97 x (mod 97)
x97 x 0(mod 97)
x97 x + 1 1 0 (mod 97)
Hence there are no solutions
M1
A1
R1
[14]
433. (a)
(i)
(ii)
(b)
(c)
The (i, i)th entry on the diagonal is the

number of walks of length 37 from vi back to itself
A1A1
But in a bipartite graph you can only get from

vi back to itself in an even number of steps. Hence
the entry is 0.
The number of paths from vi to vj with length at most 3.
R1AG
A1
At least two of the three vertices in the triangle must

lie on one of the two disjoint sets
These two are joined by an edge so the graph cannot
be bipartite
M1R1
R1
If there are x vertices in one of the two disjoint sets then there
are (n x) vertices in the other disjoint set
M1
The greatest number of edges occurs when all vertices in one

set are joined to all vertices in the other to give x(n x) edges
A1
Function f (x) = x(n x) has a parabolic graph.
M1
n n2
This graph has a unique maximum at ,
2 4
A1
so x(n x)
n2
4
R1
[12]
434. (a)
(i)
(ii)
A spanning tree with v vertices and (v 1) edges

where f = 1
f e + v = 1 (v 1) + v = 2
So the formula is true for the tree
A1A1
M1
AG
Adding one edge connects two different vertices, and

hence an extra face is created
M1R1
This leaves v unchanged but increases both e and f by 1

leaving f e + v unchanged. Hence f e + v = 2.
R1R1
362
(b)
Using e 3v 6,
M1
5
for K5, v = 5 and e = = 10
2
A1A1
but 3v 6 = 3(5) 6 = 9
9 is not greater or equal to 10 so K5 is not planar
A1
R1
[12]
435. (a)
G is bipartite
because it contains a triangle.
A1
R1
Note: Award R1 for a valid attempt at showing that the vertices

cannot be divided into two disjoint sets.
(b)
(i)
1
0
M=
0
0
1 0 0 0 1
0 1 1 1 0
1 0 1 0 0
1 1 0 1 1
1 0 1 0 1
0 0 1 1 0
(ii)
We require the (A, A) element of M4 which is 13.
A1
M1A2
(c)
A1A1A1A1A1
[11]
363
436. (a)
*
1
2
3
1
1
2
3
2
2
4
6
3
3
6
2
4
3
1
5
5
5
3
1
6
6
5
4
4 4 1 5 2 6 3
5 5 3 1 6 4 2
6 6 5 4 3 2 1
A3
Note: Award A2 for 1 error, A1 for 2 errors, A0 for 3

or more errors.
(b)
(i)
We first identify 1 as the identity

Order of 1 = 1
Order of 2 = 3
Order of 3 = 6
Order of 4 = 3
Order of 5 = 6
Order of 6 = 2
(A1)
A3
Note: Award A2 for 1 error, A1 for 2 errors, A0

(ii)
(c)
{1, 6}; {1, 2, 4}
The equation is equivalent to

6*x*x=3
x*x=4
x = 2 or 5
A1A1
M1
A1A1
[12]
437. (a)
x=
412.11
=1.71
241
s2 =
705.5721 412.112
= 0.0036
240
240 241
A1
M1A1
364
(b)
(i)
(ii)
H0: Data can be modelled by a normal distribution

H1: Data cannot be modelled by a normal distribution
A1
The expected frequencies are
Interval
x < 1.60
1.60 x < 1.65
1.65 x < 1.70
1.70 x < 1.75
1.75 x < 1.80
x 1.80
Exp Freq
8.04
30.19
66.31
75.60
44.75
16.10
A1A1A1A1A1A1
52
34 2
12 2
+
+ ... +
241 = 3.30 / 3.29
8.04 30.19
16.10
M1A1
Critical value = 6.251 or p-value = 0.35
The data can be modelled by a normal distribution.
A1
A1
R1
2 =
[15]
365
438. Rewrite the equation in the form
dy
y
1
+
=
dx (x + 1)(x + 2 ) x + 2
dx
M1
(x + 1)(x + 2 )
Integrating factor = exp
A1
1
1
x + 1 x + 2 dx
= exp
M1A1
x +1
x
+
2
= exp ln
A1
x +1
x+2
A1
Multiplying by the integrating factor,
x + 1 dy
x +1
y
+
=
2
2
x + 2 dx (x + 2 ) (x + 2 )
=
x+2
(x + 2 )
M1
(x + 2)2
A1
Integrating,
x +1
1
y = ln (x + 2 ) +
+C
x+2
x+2
x+2
1
ln (x + 2 ) +
y =
+ C
x+2
x +1
A1A1
A1
[11]
439. (a)
A2
Note: The weights are not required for this A2.
366
(b)
Iteration
First
Second
Third
Fourth
Fifth
Vertices
A
A, B
A, B, F
A, B, F, C
A, B, F, C, E
Labels
A (0) B (2) C (-) D (-) E (-) F (9)
A (0) B (2) C (8) D (-) E (-) F (5)
A (0) B (2) C (7) D (-) E (12) F (5)
A (0) B (2) C (7) D (14) E (10) F (5)
A (0) B (2) C (7) D (11) E (10) F (5)
M1A1A1A1A1A1
Shortest path is ABFCED
A1
Length = 11
A1
[10]
440. (a)
Multiply through by a p 2.
a p 1 x a p 2 b(mod p)
(b)
M1A1
Since, by Fermats little theorem, a p 1 1(mod p),
R1
x a p 2 b(mod p)
AG
Using the above result,

x 33 4(mod 5) 3(mod 5)
= 3, 8, 13, 18, 23,
and
x 55 6(mod 7) 4(mod 7)
= 4, 11, 18, 25,
M1A1
(A1)
M1A1
(A1)
The general solution is

i.e.
441. (a)
x = 18 + 35n
M1
x 18(mod 35)
A1
f (x ) =
f (x ) =
cos x
1 + sin x
sin x(1 + sin x ) cos 2 x
(1 + sin x )2
sin x 1
(1 + sin x )2
1
1 + sin x
[11]
M1A1
M1
A1
AG
367
(b)
cos x
f (x ) =
f
iv
A1
(1 + sin x )2
(x ) =
sin x(1 + sin x ) 2 (1 + sin x )cos 2 x

2
(1 + sin x )4
f (0) = 0, f (0) = 1, f (0) = 1, f (0) = 1, f iv (0) = 2
A1
(A2)
Note: Award A1 for 2 errors and A0 for more than 2 errors.
x2 x3 x4
+ + ...
2 6 12
M1A1
(c)
x2 x3 x4
+ ...
ln (1 sin x) = ln(1 + sin (x)) = x
2 6 12
M1A1
(d)
Adding,
M1
ln (1 sin2 x) = ln cos2 x
A1
ln (1 + sin x) = x
2
= x
ln cos x =
ln sec x =
(e)
ln sec x
x x
x4
+ ...
6
x2 x4
+ ...
2 12
A1
A1
x2 x4
+ + ...
2 12
AG
x x2 x
+
+ ...
2
12
M1
Limit = 0
A1
[18]
442. (a)
Interval width = 26.1 22.7 = 3.4

So 3.4 = 2z
1.6
5
z = 2.375
Probability = 0.9912
Confidence level = 2 0.4912 = 98.2%
M1A1
A1
A1
A1
368
(b)
z-value =1.96
We require
A1
1.96 1.6
n
<2
Whence n > 9.83

So we need n = 10
M1A1
A1
A1
Note: Accept = signs throughout.

[10]
443. (a)
(i)
(ii)
Since a2 a2 = 0 is divisible by n, it follows that aR1a so

R1 is reflexive.
aR1b a2 b2 divisible by n b2 a2 divisible by
n bR1a so symmetric.
aR1b and bR1c a2 b2 = pn and b2 c2 = qn
A1
A1
A1
(a2 b2) + (b2 c2) = pn + qn

so a2 c2 = (p + q) n aR1c
M1
A1
Therefore R1 is transitive.
It follows that R1 is an equivalence relation.
AG
When n = 8, the equivalence classes are

{1, 3, 5, 7, 9, }, i.e. the odd integers
{2, 6,10,14,}
and {4, 8,12,16,}
A2
A2
A2
Note: If finite sets are shown award A1A1A1.

(b)
Attempt to find a counter example.

We note that 1R26 and 6R211 but 1 not R2 11.
(M1)
A2
Note: Accept any valid counter example.

The relation is not transitive.
AG
[14]
369
444. Associativity follows since G is associative.
A1
Closure: Let x, y H so ax = xa, ay = ya for a G

Consider axy = xay = xya xy H
M1
M1A1
The identity e H since ae = ea for a G
A2
Inverse: Let x H so ax = xa for a G

Then
x1 a = x1 axx1
M1A1
= x 1 xax1
M1
= ax1
A1
so x1 H
A1
The four group axioms are satisfied so H is a subgroup.
R1
[12]
445. (a)
P(Z = n) =
k =0
e ( + )
n!
(b)
k
nk
e
(n k )!
k!
n
n!
k !(n k )!
M1A1
nk
M1A1
k =0
e ( + )
( + )n
n!
A1
This shows that Z is Poisson distributed with mean ( + ).
R1
The result is (trivially) true for n = 1.
A1
k
Assuming it to be true for n = k, i.e.
U
r =1
Consider
k +1
r =1
r =1
~ Po(km )
U r = U r + U k +1
M1
M1A1
which, using (a) is Po(km + m) i.e. Po([k + 1]m)
A1
Hence proved by induction since true for n = k true for

n = k + 1 and we have shown true for n = 1.
R1
[12]
370
446. (a)
(b)
S2n = Sn +
1
1
1
+
+ ... +
n +1 n + 2
2n
> Sn +
1
1
1
+ + ... +
2n 2n
2n
= Sn +
1
2
M1
M1A1
AG
Replacing n by 2n,
S 4n > S 2n +
1
2
M1A1
> Sn + 1
A1
Continuing this process,
S 8n > S n +
3
2
(A1)
In general,
S 2m n > S n +
m
2
M1A1
Putting n = 2
S 2m + 1 > S 2 +
(c)
M1
m
2
AG
Consider the (large) number N.

Then, S 2 m + 1 > N if S 2 +
m
>N
2
M1
A1
i.e. if m > 2(N S2)
A1
This establishes the divergence.
AG
[13]
447. f(2) = 16 + 24 + 4p 4 + q = 15
4p + q = 21
f(3) = 81 81 + 9p + 6 + q = 0
9p + q = 6
p = 3 and q = 33
M1
A1
M1
A1
A1A1
N0
[6]
448. ln(x2 1) ln(x + 1)2 + lnx(x + 1)
(A1)
371
= ln
= ln
x( x 2 1)( x + 1)
(M1)A1
( x + 1) 2
x( x + 1)( x 1)( x + 1)
(A1)
( x + 1) 2
= ln x(x 1) (= ln(x2 x))
A1
[5]
449. (a)
(b)
Median = 50 (allow 49 or 51)
A1
Interquartile range = 60 40 = 20 (allow 59, 61, 39, 41

and corresponding difference)
A1A1
N1
Note: Award A1 for correct quartiles, A1 for difference.

(c)
Time to complete puzzle in seconds Number of applicants
20 < t 30
10
30 < t 35
35 < t 40
40 < t 45
11
45 < t 50
14
50 < t 60
25
60 < t 80
25
Notes: Allow 1 on each entry provided total adds up to 100.
M1A1
[5]
n
(1.5 + 7.5)
2
n = 18
1.5 + 17d = 7.5
6
d =
17
450. 81 =
M1
A1
M1
A1
N0
[4]
372
451. Recognition of integration by parts

x3
x3 1
x 2 ln xdx = ln x
dx
3 x
3
M1
A1A1
x3
x2
= ln x
dx
3
3
x3
x3
= ln x
9
3
e
e3 e3
x 2 ln xdx =
1
9
3
A1

1
0

9
2e 3 + 1
=
A1
[5]
452. 5y2 + 10xy
dy
4x = 0
dx
A1A1A1
Note: Award A1A1 for correct differentiation of 5xy2.

A1 for correct differentiation of 2x2 and 18.
At the point (1, 2), 20 + 20
dy
4=0
dx
dy
4
=
dx
5
(A1)
Gradient of normal =
5
4
Equation of normal y 2 =
5
5 8
x +
4
4 4
5
3
y = x+
4
4
A1
5
(x 1)
4
M1
y=
(4y = 5x + 3)
A1
[7]
453. (a)
sin x
cos x
dy cos 2 x + sin 2 x
=
dx
cos 2 x
1
=
cos 2 x
= sec2x
y=
M1A1
A1
AG
373
(b)
y = arctan x
x = tan y
dx
= sec2 y
dy
(M1)
A1
EITHER
dx
= 1 + tan2 y
dy
= 1 + x2
dy
1
=
dx 1 + x 2
(A1)
A1
AG
OR
dy
1
= cos2 y
=
2
dx sec y
(A1)
A1
1
=
2
1+ x
= 1
1+ x 2
AG
[7]
454. (a)
(b)
(c)
1, 2, 3, 4
A1
P(Y = 1) =
2
5
A1
P(Y = 2) =
3 2 3
=
5 4 10
A1
P(Y = 3) =
3 2 2 1
=
5 4 3 5
A1
P(Y = 4) =
3 2 1 2 1
=
5 4 3 2 10
A1
E(Y) = 1
2
3
1
1
+ 2 + 3 + 4
5
10
5
10
M1
=2
A1
374
[7]
455. (a)
Area of hexagon = 6
=
(b)
1
x x sin 60
2
3 3x 2
2
M1
AG
Let the height of the box be h

3 3hx 2
Volume =
= 90
2
60
Hence h =
3x 2
M1
A1
Surface area, A = 3 3 x2 + 6hx

360 1
x
= 3 3x 2 +
3
dA
360 2
= 6 3x
x
dx
3
M1
A1
A1
dA
= 0
dx
6 3x 3 =
360
M1
x3 = 20
x = 3 20
2
d A
dx
=6 3+
AG
720 x
which is positive when x =
20 , and hence gives a minimum value.
R1
[8]
375
456.
BC = c b
CA = a c
a (c b) = 0
and b (a c) = 0
ac=ab
and a b = b c
ac=bc
bcac=0
c (b a) = 0
OC is perpendicular to AB , as b a.
M1
M1
A1
A1
M1
A1
AG
[6]
457. (a)
A2
Note: Award A1 for shape.
A1 for scales given on each axis.
376
(b)
A5
Asymptotes x = 0, x = , x =
2
3

Max ,1, Min , 1
4
4
Note: Award A1 for shape
A2 for asymptotes, A1 for one error, A0 otherwise.
A1 for max.
A1 for min.
(c)
(d)
sin x cos x
+
cos x sin x
sin 2 x + cos 2 x
sin x cos x
1
1
sin 2 x
2
2 csc 2x
tanx + cot x
M1
A1
A1
AG
tan 2x + cot 2x 2 csc 4x

3
Max is at , 2
2
A1A1

Min is at , 2
8
A1A1
(M1)
377
(e)
csc 2x = 1.5 tan x 0.5

1
1
3
1
tan x + cot x = tan x
2
2
2
2
tan x + cot x = 3 tan x 1
1
2 tan x
1=0
tan x
2 tan2 x tan x 1 = 0
(2 tan x + 1)(tan x 1) = 0
1
tan x = or 1
2
x=
4
M1
M1
A1
M1
A1
A1
Note: Award A0 for answer in degrees or if more than one value given for x.
[21]
458. (a)
Let n = 1
1
cos sin cos sin

=
LHS =
sin cos sin cos
cos 1 sin 1 cos sin
=
RHS =
sin 1 cos 1 sin cos
Hence true for n = 1
Assume true for n = k
k
cos sin
cos k
=
sin cos
sin k
Result for k + 1 is
sin k
cos k
M1A1
M1
A1
M1
k +1
cos sin
cos k sin k cos sin
sin cos
sin k cos k sin cos
cos k cos sin k sin cos k sin sin k cos
=
sin k cos + cos k sin sin k sin + cos k cos
cos(k + 1) sin(k + 1)
=
sin(k + 1) cos(k + 1)
Hence if true for k, true for k + 1. However, result is true for k = 1.
Hence proved by induction.
A1
A1
A1
R1
378
(b)
cos
sin
sin
1
=
2
cos
cos + sin 2
cos
sin
sin
cos
M1A1A1
Note: Award M1 for any recognition that the inverse is required.

cos sin
1
.
A1 for
and A1 for
2
2
cos + sin
sin cos
cos sin
=
sin cos
cos( ) sin( ) cos
=
Now
sin( ) cos( ) sin
Hence true.
A1
sin
cos
A1
AG
[14]
459. (a)
1
(1 i) 4
z=
Let 1 i = r(cos + i sin )
r= 2
=
4
A1
A1
1

4
z = 2 cos + isin
4
4
M1
1

4
= 2 cos + 2n + i sin + 2n
4
1
n
n
= 2 8 cos +
+ i sin +
16 2
16 2
M1

= 2 8 cos + i sin
16
16
Note: Award M1 above for this line if the candidate has forgotten to
add 2 and no other solution given.
=
1
28
7
7
cos + i sin
16
16
1
28
15
15
cos
+ i sin

16
16
1
8
2
9
9
cos + i sin
16
16
A2
Note: Award A1 for 2 correct answers. Accept any equivalent form.

(b)
379
A2
Note: Award A1 for roots being shown equidistant from the origin
and one in each quadrant.
A1 for correct angular positions. It is not necessary to
see written evidence of angle, but must agree with the diagram.
(c)
z2
=
z1
1
28
15
15
cos
+ i sin

16
16
1
28
7
7
cos + i sin
16
16
= cos + i sin
2
2
=i
( a = 0, b = 1)
M1A1
(A1)
A1
N2
[12]
460. (a)
(b)
(c)
(x 1)(x4 + x3 + x2 + x + 1)
= x5 + x4 + x3 + x2 + x x4 x3 x2 x 1
= x5 1
b is a root
f(b) = 0
b5 = 1
b5 1 = 0
(b 1)(b4 + b3 + b2 + b + 1) = 0
b1
1 + b + b2 + b3 + b4 = 0 as shown.
(i)
u + v = b4 + b3 + b2 + b = 1
uv = (b + b4)(b2 + b3) = b3 + b4 + b6 + b7
Now b5 = 1
(M1)
A1
M1
A1
R1
AG
A1
A1
(A1)
380
Hence uv = b3 + b4 + b + b2 = 1
Hence u + v = uv = 1
(ii)
(u v)2 = (u2 + v2) 2uv

= ((u + v)2 2uv) 2uv (= (u + v)2 4uv)
Given u v > 0
uv=
A1
AG
(M1)
(M1)A1
(u + v) 2 4uv
(1) 2 4(1)
=
=
1+ 4
5
A1
AG
Note: Award A0 unless an indicator is given that u v = 5 is invalid.

[13]
461.
sin B sin 35
=
6.5
4
B = 68.8 or 111
C = 76.2 or 33.8 (accept 34)
AB
BC
=
sinC sinA
AB
4
=
sin76.2 sin 35
AB = 6.77 cm
AB
4
=
sin33.8 sin 35
AB = 3.88cm (accept 3.90)
M1
A1A1
A1
(M1)
A1
A1
[7]
381
462. 2 1.05n1 > 500

log 250
n1>
log 1.05
n 1 > 113.1675...
n = 115
u115 = 521
M1
M1
A1
(A1)
A1
N5
Note: Accept graphical solution with appropriate sketch.

[5]
463. (a)
2.5
1.5
( x + 1) 3
dx = 0.4625 (= 0.463)
60
(b)
E(X) =
(c)
x( x + 1) 3
dx = 2.31
60
( x + 1)
dx = 0.5
60
M1A1
M1A1
M1
( x + 1) 4
= 0.5
240 1
m = 2.41
(A1)
A1
[7]
464. a b = abcos
1 3

a b = 2 2 = 7 + 3m
3 m

a = 14 b = 13 + m 2
(M1)
A1
A1
a b cos = 14 13 + m 2 cos 30
7 + 3m = 14 13 + m 2 cos 30
m = 2.27, m = 25.7
A1
A1A1
[6]
382
465. (a)
(b)
1 2 3 k
3 1 2 4
5 0 7 5
R1 2 R2
5 0 7 k 8
4
3 1 2
5 0 7
5
R1 + R3
0 0 0 k 3
4
3 1 2
5 0 7
5
Hence no solutions if k
M1
(A1)
(A1)
,k3
Two planes meet in a line and the third plane is parallel to that line.
A1
A1
[5]
466. (a)
A1
Note: Award A1 for shape.
x intercepts 0.354, 1.36, 2.59, 2.95
A2
Note: Award A1 for three correct, A0 otherwise.
maximum = (1.57, 0.352) = ,0.352

2
minimum = (1, 0.640) and (2.77, 0.0129)
A1
A1
383
(b)
0 < x < 0.354, 1.36 < x < 2.59, 2.95 < x < 4
A2
Note: Award A1 if two correct regions given.

[7]
467. (a)
X ~ Po(3.2)
P(X = 4) =
e 3.2 3.2 4
4!
= 0.178
(b)
(c)
A1
(i)
Var(Y) = E(Y2) E2(Y)

m = 5.5 m2
m = 1.90 (or m = 2.90 which is invalid)
(M1)
A1
A1
(ii)
Y ~ Po(1.90)
e 1.901.903
P(Y = 3) =
3!
= 0.171
(M1)
Required probability = 0.171 0.178 = 0.0304 (accept 0.0305)
A1
(M1)A1
[8]
384
468. y = ln (1 + e 2 x )
3
EITHER
2
e 2 x
dy
3
=
dx 1
(1 + e 2 x )
3
dy 2e 2 x
=
dx 1 + e 2 x
1
ey = (1 + e2x)
3
Now e2x = 3ey 1
dy 2(3e y 1)
=
dx 1 + 3e y 1
2
= y (3e y 1)
3e
2
= (3 e y )
3
2 y
= (e 3)
3
M1A1
A1
M1
A1
A1
A1
AG
OR
1
(1 + e2x)
3
dy
2
ey
= e 2 x
dx
3
Now e2x = 3ey 1
dy
2
ey
= (3e y 1)
dx
3
dy
2 y
= e (3e y 1)
dx
3
2
= (3 + ey)
3
2
= (ey 3)
3
ey =
M1A1
M1A1
(A1)
(A1)
(A1)
AG
Note: Only two of the three (A1) marks may be implied.

[7]
385
469. Let the number of mosquitoes be y.

dy
= ky
dt
1
dy = kdt
y
ln y = kt + c
y = ekt+c
y = Aekt
when t = 0, y = 500 000 A = 500 000
y = 500 000ekt
when t = 5, y = 400 000
400 000 = 500 000e5k
4
= ekt
5
4
5k = ln
5
1 4
k = ln (= 0.0446)
5 5
250 000 = 500 000ekt
1
= ekt
2
1
ln = kt
2
5
1
ln = 15.5 years
t=
4 2
ln
5
M1
M1
A1
A1
M1
A1
M1
A1
[8]
470. (a)
(b)
x = 3 + 2m
y=2m
z = 7 + 2m
A1
x = 1 + 4n
y=4n
z=2+n
A1
3 + 2m = 1 + 4n 2m 4n = 2(i)
2 m = 4 n m n = 2(ii)
7 + 2m = 2 + n 2m n = 5(iii)
(iii) (ii) m = 3
n = 1
Substitute in (i), 6 + 4 = 2. Hence lines intersect.
Point of intersection A is (3, 5, 1)
M1
A1
A1
R1
A1
386
1

2 1 2 = 6

4 1 1 2
M1A1
1 3 1

r 6 = 2 6
2 7 2

(M1)
(c)
1

r 6 = 29
2

x + 6y + 2z = 29
A1
Note: Award M1A0 if answer is not in Cartesian form.

(d)
(e)
x = 8 + 3
y = 3 + 8
z = 2
Substitute in equation of plane.
8 + 3 18 + 48 + 4 = 29
55 = 55
=1
Coordinates of B are (5, 5, 2)
Coordinates of C are 4, 5,
2
4
1

r = 5 + 6

3
2

2
(M1)
M1
A1
A1
(A1)
M1A1
x

Note: Award M1A0 unless candidate writes r = or y =
z

[18]
471. (a)
X ~ N(231, 1.52)
P(X < 228) = 0.0228
(M1)A1
Note: Accept 0.0227.
387
(b)
(i)
(ii)
X ~ N(, 1.52)
P(X < 228) = 0.002
228
= 2.878...
1.5
= 232 grams
X ~ N(231, 2)
228 231
= 2.878...
= 1.04 grams
(c)
X ~ B(100, 0.002)
P(X 1) = 0.982...
P(X 2) = 1 P(X 1) = 0.0174
M1A1
A1
N3
M1A1
A1
N3
(M1)
(A1)
A1
[11]
472. (a)
65
= 15 ways
2
5 4
Girls can be chosen in
= 10 ways
2
Total = 15 10 = 150 ways
Boys can be chosen in
(b)
Number of ways = 5 4 = 20
(c)
20 2
=
150 15
(A1)
(A1)
A1
(M1)A1
A1
388
(d)
METHOD 1
1
2
; P(A) =
5
5
P(T or A but not both) = P(T) P(A) + P(T) P(A)
1 3 4 2 11
= + =
5 5 5 5 25
P(T) =
A1
M1A1
A1
METHOD 2
5
Number of selections including Fred = 5 = 50
2
4
Number of selections including Tim but not Anna = = 6
2
Number of selections including Anna but not Tim = 4 4 = 16
A1
A1
Note: Both statements are needed to award A1.

P(T or A but not both) =
6 + 16 11
=
50
25
M1A1
[10]
473. (a)
(b)
x
For x 9 x 2 , 3 x 3 and for 2arcsin , 3 x 3
3
D is 3 x 3
V=
x
x 9 x + 2 arcsin dx
3
M1A1
= 181
A1
(c)
dy
= (9 x 2 ) 2
dx
1
x2
(9 x
x2
= (9 x 2 ) 2
(9
2
(d)
1
2 2
x )
1
)2
2
3
M1A1
x2
1
9
+
(9
A1
1
2 2
x )
9 x x +2
(9 x
A1
1
)2
11 2 x 2
A1
9 x2
A1
2.8
A1
11 2 x 2
dx = x 9 x 2 + 2 arcsin
3p
9 x2
M1
389
p
p
+ p 9 p 2 + 2 arcsin
3
3
p
= 2 p 9 p 2 + 4 arcsin
3
= p 9 p 2 + 2 arcsin
(e)
A1
AG
11 2p2 = 0
11
p = 2.35
2
M1
A1
Note: Award A0 for p = 2.35.
(f)
(i)
f(x) =
=
(9 x
1
)2
3
)2
36 x + 4 x 3 + 11x 2 x 3
(9 x
=
3
)2
x(2 x 2 25)
(9
(4 x) + x(11 2 x )(9 x )
9 x2
4 x(9 x 2 ) + x(11 2 x 2 )
(9 x
3
x2 ) 2
1
2
M1A1
A1
A1
AG
390
(ii)
EITHER
When 0 < x < 3, f(x) < 0. When 3 < x < 0, f(x) > 0.
A1
OR
f(0) = 0
A1
THEN
Hence f(x) changes sign through x = 0, giving a point of inflexion. R1
EITHER
x=
25
is outside the domain of f.
2
R1
25
is not a root of f(x) = 0.
2
R1
OR
x=
[21]
474. (a)
from the sample, the probability of a brown egg is

0 7 + 1 32 + ... 360
=
= 0.4
6 150
900
p = 0.4
A1
AG
391
(b)
if the data can be modelled by a binomial distribution with p = 0.4,

the expected frequencies of boxes are given in the table
Number of brown eggs
5, 6
Number of boxes
32
35
50
22
41.5
20.7
6.1
Number of boxes
7.0 28.0 46.7
A3
Notes: Deduct one mark for each error or omission.
Accept any rounding to at least one decimal place.
null hypothesis: the distribution is binomial
alternative hypothesis: the distribution is not binomial
for a chi-squared test the last two columns should be combined
A1
A1
R1
Number of brown eggs
Number of boxes
32
35
50
22
41.5
20.7
5.5
0.6
Number of boxes
7.0 28.0 46.7
(7 7) 2 (32 28) 2
+ ... = 6.05 (Accept 6.06)
+
7
28
degrees of freedom = 4
we conclude that the farmers claim can be justified
2
calc
=
(M1)A1
A1
A1
R1
[12]
475. (a)
(b)
n = 7, sample mean = 35
( x 35) 2
2
s n 1 =
= 322
6
(A1)
(M1)A1
null hypothesis H0 : = 42.3

A1
alternative hypothesis H1 : < 42.3
A1
using one-sided t-test
42.3 35
t calc = 7
= 1.076
(M1)(A1)
322
with 6 degrees of freedom, tcrit = 1.440 > 1.076
(or p-value = 0.162 > 0.1)
A1
we conclude that there is no justification for cutting down the cedar trees R1
N0
Note: FT on their t or p-value.

[9]
392
476. (a)
the distribution is NB(3, 0.09)
24
the probability is 0.9122 0.093 = 0.0253
2
(b)
(M1)(A1)
(M1)(A1)A1
P (Heating increased on nth day)

n 1
0.91n3 0.093
(M1)(A1)(A1)
2
by trial and error n = 23 gives the maximum probability

(M1)A3
(neighbouring values: 0.02551 (n = 22); 0.02554 (n = 23); 0.02545 (n = 24))
[12]
477. (a)
f(x) is even (symmetrical about the origin)

E(X) = 0
Var(X) = E(X2) =
0.005
100 x 2 dx
0.005
(M1)
A1
(M1)(A1)
= 8.33 106 accept 0.83! 10 5 or

120 000
A1
(b)
rounding errors to 2 decimal places are uniformly distributed

and lie within the interval 0.005 x < 0.005.
this defines X
R1
R1
AG
(c)
(i)
(ii)
(iii)
using the symbol y to denote the error in the sum of 20

real numbers each rounded to 2 decimal places
0.1 < y (= 20 x) < 0.1
Y N(20 0, 20 8.3! 106) = N(0, 0.00016! )
P(|Y| > 0.01) = 2(1 P(Y < 0.01))
0.01
= 21 P Z <
0.0129
= 0.44 to 2 decimal places

it is assumed that the errors in rounding the 20 numbers
are independent
and, by the central limit theorem, the sum of the errors
can be modelled approximately by a normal distribution
A1
(M1)(A1)
(M1)(A1)
A1
N4
R1
R1
[15]
393
478. (a)
(b)
(c)
E ~ Po(2)
M1
2 2 e 2
P(E < 3) = e2 + 2e2 +
= 0.677
2!
A1
E + G ~ Po(10)
P(E + G > 12) = 1 P(E + G 12) = 0.208
2
E ~ Po , G ~ Po(1)
3
5
E + G = Po
3
P(G = 2E + G = 2)
P(G = 2) P( E = 0)
=
P( E + G = 2)
=
0.1839 0.5134
0.2623
M1A1
A1
M1
M1
A1
(A1)(A1)(A1)
Note: Award these A1 marks independently of the second M1.
as the exact answer.

= 0.360 accept 0.36 or
25
A1
[12]
479. (a)
(b)
by inspection, or otherwise,
A = {2, 3, 5, 7, 11, 13}
B = {0, 2}
C = {0, 1}
D = {1, 0, 1, 2, 3}
A1
A1
A1
A1
(i)
true
n(B) + n(B C) = 2 + 3 = 5 = n(D)
A1
R1
(ii)
false
D\B = {1, 1, 3} A
A1
R1
(iii)
false
B A = {0}
A1
R1
394
(iv)
true
n(B C) = n{1, 2} = 2
A1
R1
[12]
480. (a)
the Cayley table is

1 0 1
1 0 1 0
0 1 0 1
1 0 1 0
M1A2
Notes: Award M1 for setting up a Cayley table with labels.

Deduct A1 for each error or omission.
(b)
(i)
closed
because all entries in table belong to {1, 0, 1}
A1
R1
(ii)
not commutative
A1
because the Cayley table is not symmetric, or counter-example givenR1
(iii)
not associative
for example because
0 (1 0) = 0 1 = 1
but
(0 1) 0 = 1 0 = 1
or alternative counter example
A1
M1
A1
[10]
481. (a)
the following two calculations show the required result

1
=x
F F(x) =
1
x
G G(x) = 1 (1 x) = x
M1A1A1
395
(b)
part (a) shows that the identity function defined by I (x) = x

belongs to S
the two compositions of F and G are:
1
;
1 x
1 x 1
G F(x) = 1
=
x
x
the final element is
1
x
G F G(x) = 1
=
1 x x 1
F G(x) =
482. (a)
not a group
A1
(M1)A1
(M1)A1
(M1)A1
[10]
A1
EITHER
subtraction is not associative on
(or give counter-example)
R1
OR
there is a right-identity, 0, but it is not a left-identity
R1
the set forms a group

the closure is a consequence of the following
relation (and the closure of itself):
z1z2=z1z2
the set contains the identity 1
that inverses exist follows from the relation
z1=z1
for non-zero complex numbers
A1
(c)
not a group
for example, only the identity element 1 has an inverse
A1
R1
(d)
the set forms a group

3m + 1 3s + 1 9ms + 3s + 3m + 1 3(3ms + s + m) + 1
=
=
3n + 1 3t + 1
9nt + 3n + 3t + 1
3(3nt + n + t ) + 1
shows closure
the identity 1 corresponds to m = n = 0
an inverse corresponds to interchanging the parameters m and n
A1
(b)
R1
R1
R1
M1R1
R1
R1
[13]
396
483. (a)
(b)
(c)
(i)
f1 g1(k) = k + 4
Range(f 1 g1) =
M1
A1
(ii)
f3 g2(k) = 0
Range(f3 g2) = {0}
M1
A1
the equation to solve is

k k + 4 = 2k
the positive solution is k = 2
the negative solution is k = 1
the equation factorizes: (m + n)(m n) = p
for p = 1, the possible factors over are m + n = 1, m n = 1
with solutions (1, 0) and (1, 0)
for p = 2, the possible factors over are
m + n = 1, 2; m n = 2, 1
there are no solutions over
M1A1
A1
A1
(M1)
(M1)(A1)
A1
M1A1
A1
[15]
397
484. (a)
EITHER
use the substitution y = vx
dv
x + v = v +1
dx
dx
dv =
x
by integration
y
v=
= lnx + c
x
M1A1
A1
OR
the equation can be rearranged as first order linear
dy 1
y =1
dx x
the integrating factor I is
M1
x dx
1
x
multiplying by I gives
d 1 1
y =
dx x x
1
y = ln x + c
x
e
= e ln x =
A1
A1
THEN
the condition gives c = 1
so the solution is y = x (ln x 1)
(b)
(i)
(ii)
f (x) = ln x 1 + 1 = ln x
1
f (x) =
x
1
f (x) = 2
x
the Taylor series about x = 1 starts
( x 1) 2
( x 1) 3
f(x) f(1) + f(1)(x 1) + f(1)
+ f (1)
2!
3!
( x 1) 2 ( x 1) 3
= 1 +
2!
3!
M1A1
AG
A1
A1
A1
(M1)
A1A1A1
[12]
398
485. (a)
(i)
the integrand is non-singular on the domain if p > 1

with the latter assumed, consider
R
1
1 R1
1
dx =
dx
1 x( x + p)
p 1 x x+ p
x
, p 0
ln
x + p 1
this evaluates to
1
R
1
ln
,p0
ln
p R+ p
1 + p
1
=
p
A1
M1
1
ln(1 + p )
p
R
because
1 as R
R+ p
hence the integral is convergent
(ii)
M1A1
the given series is
A1
R1
AG
f (n), f (n) = n(n 0.5)
M1
n =1
the integral test and p = 0.5 in (i) establishes the

convergence of the series
(b)
(i)
as we have a series of positive terms we can apply the

comparison test, limit form
1
comparing with
2
n =1 n
sin
n(n + 3)
lim
=1
n
1
n2
as sin for small
n2
and
1
n(n + 3)
(so as the limit (of 1) is finite and non-zero, both series
exhibit the same behavior)
1
converges, so this series converges
2
n =1 n
R1
M1
M1A1
R1
R1
R1
399
(ii)
the general term is

1
n(n + 1)
1
>
n(n + 1)
1
(n + 1)(n + 1)
1
1
=
(n + 1)(n + 1) n + 1
the harmonic series diverges
so by the comparison test so does the given series
A1
M1
A1
R1
R1
[19]
486. (a)
(i)
f(x) = (1 + ax)(1 + bx)1

= (1 + ax)(1 bx + ...(1)nbnxn + ...
it follows that
cn = (1)nbn + (1)n1 abn1
= (b)
(ii)
(b)
(c)
R=
n1
(a b)
1
b
to agree up to quadratic terms requires

1
1 = b + a,
= b2 ab
2
1
from which a = b =
2
1 + 0.5 x
1 0.5 x
1
putting x =
3
1
1 +
1
6 7
3
e
=
1 5
1
6
ex
M1A1
M1A1
AG
A1
M1A1A1
A1
A1
M1
A1
[12]
400
487. (a)
(b)
this separable equation has general solution

sec2 y dy = cos x dx
tan y = sin x + c
the condition gives
tan = sin + c c = 1
4
the solution is tan y = 1 + sin x
y = arctan (1 + sin x)
(M1)(A1)
A1
M1
A1
AG
the limit cannot exist unless a = arctan 1 + sin = arctan 2

R1A1
2
in that case the limit can be evaluated using lHopitals rule (twice)
limit is
(arctan(1 + sin x))
y
lim
= lim
M1A1
x
x
2 x
2
2 2 x
2
2
where y is the solution of the differential equation

the numerator has zero limit (from the factor cos x in the differential equation)
so required limit is
y
M1A1
lim =
2
x
R1
finally,
y = sin x cos2 y 2 cos x cos y sin y y(x)
1
since cos y =
2
5
y =
at x =
5
2
the required limit is
M1A1
A1
A1
1
10
A1
[17]
488. (a)
the relevant powers of 16 are 16, 256 and 4096

then
51966 = 12 4096 remainder 2814
2814 = 10 256 remainder 254
254 = 15 16 remainder 14
the hexadecimal number is CAFE
M1A1
A1
A1
Note: CAFE is produced using a standard notation, accept explained

alternative notations.
401
(b)
(i)
(ii)
(iii)
(c)
using the Euclidean Algorithm

901 = 612 + 289
612 = 2 289 + 34
289 = 8 34 + 17
gcd(901, 612) = 17
(M1)
(A1)
working backwards
17 = 289 8 34
= 289 8 (612 2 289)
= 17 (901 612) 8 612
= 17 901 25 612
so p = 17, q = 25
(M1)
a particular solution is
s = 5p = 85, t = 5q = 125
the general solution is
s = 85 + 36, t = 125 + 53
by inspection the solution satisfying all conditions is
( = 2), s = 13, t = 19
(i)
the congruence is equivalent to 9x = 3 + 18

this has no solutions as 9 does not divide the RHS
(ii)
the congruence is equivalent to 3x = 1 + 5, (3x 1(mod5))

one solution is x = 2, so the general solution
is x = 2 + 5n (x 2 (mod 5))
A1
A1A1
(A1)
M1A1
A1
(A1)
R1
A1
M1A1
[19]
402
489. (a)
(b)
Kruskals Algorithm gives the following edges

CD (4)
AD (5)
EF (7)
EA (8)
BC (11)
FG (12)
M1A1
A1
A1
length of the spanning tree is 47
A1
for Dijkstras Algorithm there are three things associated with a node:
order; distance from the initial node as a permanent or temporary node
M1
N0
A4
Note: Deduct A1 for each error or omission.
the shortest path is AFBCD
the length is 26
A1
A1
N0
[12]
403
490. (a)
457128 = 2 228 564

228 564 = 2 114 282
114 282 = 2 57141
57141 = 3 19047
19 047 = 3 6349
6349 = 7 907
M1A1
trial division by 11, 13, 17, 19, 23 and 29 shows that 907 is prime
therefore 457128 = 23 32 7 907
(b)
(c)
we require the least integer such that 2 2 1010

taking logs twice gives
2n ln 2 106 ln 10
10 6 ln 10
n ln 2 ln
ln 2
= 6 ln 10 + ln ln 10 ln ln 2
n 21.7
least n is 22
R1
A1
by a corollary to Fermats Last Theorem

511 5 (mod 11) and 1711 17 (mod 11)
511 + 1711 5 + 17 0 (mod 11)
this combined with the evenness of LHS implies 25 | 511 + 1711
M1M1
(A1)
A1
M1A1
A1
R1AG
[12]
491. (a)
(i)
(ii)
Eulers relation is
e = v 2 + f v 1, as f 1
M1A1
G is a tree no cycles f = 1
R1R1
404
(b)
the result from (a) (ii) gives

e=k+2+1+11=k+3
for a tree we also have
2e = sum of degrees
2k + 6 = k + 4 + 3 + 4 = k + 11
hence k = 5
M1A1
A1
A2
(c)
(i)
v 1 = 5 < 6 = e by (a) (ii)

G cannot be a tree
M1A1
AG
(ii)
A1
(d)
take any vertex in the tree and colour it black

colour all adjacent vertices white
colour all vertices adjacent to a white vertex black
continue this procedure until all vertices are coloured
which must happen since the graph is connected
as the tree contains no cycles, no vertex can be both black
and white and the graph is proved to be bipartite
M1
M1
R1
R1
[17]
405
492. EITHER
4 ln 2 3 ln 22 = ln k
4 ln 2 6 ln 2 = ln k
2 ln 2 = ln k
ln 22 = ln k
k=4
M1
(M1)
(A1)
M1
A1
OR
ln 24 ln 43 = ln k
24
ln 3 = ln k1
4
24 1
=
43 k
k=
43
2
64
=4
16
M1
M1A1
A1
A1
[5]
493. log3(x + 17) 2 = log3 2x

log3(x + 17) log3 2x = 2
x + 17
log 3
=2
2x
x + 17
=9
2x
x + 17 = 18x
17 = 17x
x=1
M1A1
M1A1
A1
[5]
494. 22x+2 10 2x + 4 = 0
y = 2x
4y2 10y + 4 = 0
2y2 5y + 2 = 0
By factorisation or using the quadratic formula
1
y=
y=2
2
1
2x =
2x = 2
2
x = 1
x=1
M1A1
(M1)
A1
A1A1
[6]
495. a2 + 2iab b2 = 3 + 4i
406
Equate real and imaginary parts

a2 b2 = 3, 2ab = 4
2
Since b =
a
4
a2 2 = 3
a
4
a 3a2 4 = 0
Using factorisation or the quadratic formula
a = 2
b = 1
3 + 4i = 2 + i, 2 i
(M1)
A1
(M1)
A1
(M1)
A1A1
[7]
496. 2 + i is a root 2 i is a root

[x (2 + i)] [x (2 i)] are factors
= x2 (2 i) x (2 + i) x + (2 + i)(2 i)
= x2 2 x + ix 2 x ix + (4 + 1)
= x2 4x + 5
Hence x 2 is a factor 2 is a root
R1
M1
(A1)
A1
R1
[5]
497. 5zz* + 10 = (6 18i)z*

Let z = a + ib
5 10 + 10 = (6 18i)(a bi) (= 6a 6bi 18ai 18b)
6a 18b = 60 and 6b + 18a = 0
a = 1 and b = 3
z = 1 3i
M1
M1A1
(M1)
A1A1
A1
[7]
407
498. 8i = 8e
i + 2 n
2
(M1)
For n = 0
1
(8i) 3 = 2e
(M1)
+ 2i sin
6
6
3 +i
= 2 cos
A1
A1
For n = 1
1
5
5
+ 2i sin
6
6
= 3 +i
(8i) 3 = 2 cos
M1
A1
For n = 2
1
(8i) 3 = 2 cos
3
3
+ 2i sin
2
2
= 2i
M1
A1
[8]
499. iz1 + 2z2 = 3 z2 =
1
3
iz 1 +
2
2
z1 + (1 i)z2 = 4
3
1
z 1 + (1 i) iz1 + = 4
2
2
1
3 1
3
z 1 iz 1 + + i 2 z 1 i = 4
2
2 2
2
1
1
5 3
z 1 iz 1 = + i
2
2
2 2
z1 iz1 = 5 + 3i
M1A1
A1
408
EITHER
Let z1 = x + iy
x + iy ix i2y = 5 + 3i
x+y=5
x + y = 3
2y = 8
y = 4 x = 1 i.e. z1 = 1 + 4i
1
3
i(1 + 4i) +
2
2
1
3
z2 = i 2i 2 +
2
2
7 1
z2 = i
2 2
z2 =
(M1)
M1
A1A1
M1
A1
OR
5 + 3i
1 i
(5 + 3i)(1 + i) 5 + 8i 3
z1 =
=
(1 i)(1 + i)
2
z1 = 1 + 4i
1
3
z2 = i(1 + 4i) +
2
2
1
3
z2 = i 2i 2 +
2
2
7 1
z2 = i
2 2
z1 =
M1
M1A1
A1
M1
A1
[9]
500. METHOD 1
20 + 10bi = (1 bi)(7 + 9i)
20 + 10bi = (7 + 9b) + (9 + 7b)i
(M1)
A1A1
(M1)
EITHER
7 + 9b = 20
b=3
(M1)A1
OR
10b = 9 + 7b
3b = 9
b=3
(M1)A1
METHOD 2
409
(2 + bi)(1 + bi) 7 + 9i
=
(1 bi)(1 + bi)
10
2 b 2 + 3bi
7 + 9i
10
1+ b
2 b2
7
=
Equation A
2
10
1+ b
3b
9
Equation B
=
2
10
1+ b
2
From equation A
20 10b2 = 7 7b2
3b2 = 27
b = 3
From equation B
30b = 9 + 9b2
3b2 10b + 3 = 0
By factorisation or using the quadratic formula
1
b=
or 3
3
Since 3 is the common solution to both equations b = 3
(M1)
A1
(M1)
A1
A1
R1
[6]
501. METHOD 1
since b > 0
arg(b + i) = 30
1
= tan 30
b
b= 3
(M1)
A1
M1A1
A2
N2
METHOD 2
arg(b + i)2 = 60 arg(b2 1 + 2bi) = 60
2b
= tan 60 = 3
2
(b 1)
3b 2 2b 3 = 0
( 3b + 1)(b 3 ) = 0
since b > 0
b= 3
M1
M1A1
A1
(M1)
A1
N2
[6]
502.
410
A1A1
Note: Award A1 for each graph.
2x = 1 x x =
x <
1
3
1
3
M1A1
A1
[5]
503. Attempting to find f (2) = 8 + 12 + 2a + b

= 2a + b + 20
Attempting to find f (1) = 1 + 3 a + b
=2a+b
Equating 2a + 20 = 2 a A1
a = 6
(M1)
A1
(M1)
A1
A1
N2
[6]
504. (a)
f : x ! ex f1 : x ! ln x
f1(3) = ln 3
g : x ! x + 2 g1 : x ! x 2
g1(3) = 1
f1(3) g1(3) = ln3
A1
A1
A1
N1
411
(b)
EITHER
f g(x) = f(x + 2) = ex+2
ex+2 = 3 x + 2 = ln3
x = ln 3 2
A1
M1
A1
N0
A1
M1
A1
N0
OR
f g(x) = ex+2
f g1(x) = ln (x) 2
f g1(3) = ln (3) 2
x = ln 3 2
[6]
505. 2 sin x cos x 2 cos x = 0

cos x (2 sin x 2 ) = 0
2
2
3
x= ,
4 4
cos x = 0
x=
sin x =
(M1)
(A1)
A1
A1A1A1
[6]
506. (a)
sin B =
5
13
12
13
(b)
cos B =
(c)
sin 2B = 2sin B cos B

5
12
=2
13
13
120
=
169
A1
A1
(M1)
A1
412
(d)
cos2B = 2cos2 B 1
144
= 2
1
169
119
=
169
(M1)
A1
[6]
507. Using tan 2 =
2 tan
2 tan
1 tan 2
3
1 tan 4
3 tan2 + 8 tan 3 = 0
Using factorisation or the quadratic formula
1
tan =
or 3
3
2
(M1)
A1
(M1)
A1A1
[5]
508. (a)
(b)
4(1 2s2) 3s
+6=0
s3
4s2 8s4 + 6s2 3 = 0
8s4 10s2 + 3 = 0
Attempt to factorise or use the quadratic formula
1
3
sin2 x =
or sin2 x =
2
4
2
3
sin x =
x = or x =
2
4
4
3
2
sin x =
x = or x =
2
3
3
Note: Penalise A1 if extraneous solutions given.
M1A1
A1
AG
(M1)
(A1)
A1A1
A1A1
[9]
509. (a)
(b)
sinx cos cosx sin = k sin x cos + k cos x sin

tan x cos sin = k tan x cos + k sin
(k + 1) sin (k + 1)
=
tan
tan x =
(k 1) cos (k 1)
3
sin 210
tan x = 2
1
cos 210
2
(M1)
M1
A1
(M1)
413
Now sin 210 = sin 30 =
1
3
and cos 210 = cos 30 =
2
2
1
2 = 3 2 = 3 = 3
tan x =
2
3
3
3
2
x = 60, 240
A1A1
A1
A1A1
[9]
510. 2 tan2 5 sec 10 = 0

Using 1 + tan2 = sec2 , 2(sec2 1) 5 sec 10 = 0
2 sec2 5 sec 12 = 0
Solving the equation e.g. (2 sec + 3)(sec 4) = 0
3
sec = or sec = 4
2
in second quadrant sec is negative
3
sec =
2
(M1)
A1
(M1)
A1
(R1)
A1
N3
[6]
5 8
9 8
9 5
1
+2
4 6
7 6
7 4
= 3(30 32) 1(54 56) + 2(36 35)
= 3 (2) 1 (2) + 2(1)
= 6 + 2 + 2 (= 2)
511. det A = 3
M1
(A1)(A1)(A1)
A1
[5]
414
1 2 1 2
512. A2 =
k 1 k 1
0
1 + 2 k
=
2k + 1
0
M1
A2
Note: Award A2 for 4 correct, A1 for 2 or 3 correct.

1 + 2k = 0
k=
1
2
M1
A1
[5]
6
2 1 2 1 7
513. M2 =
3 4 3 4 18 19
6 12 6
7

+ kI = 0

18 19 18 24
5 0
+ kI = 0

0 5
k =5
514. For multiplying (I X)(I + X + X2)

= I2 + IX + IX2 XI X2 X3 = I + X + X2 X X2 X3
= I X3
=I
AB = I A1 = B
(I X) (I + X + X2) = I (I X)1 = I + X + X2
M1A1
(M1)
(A1)
A1
[5]
M1
(A1)(A1)
A1
A1
(R1)
AG
N0
[6]
515. EITHER
Let s be the distance from the origin to a point on the line, then
s2 = (1 )2 + (2 3)2 + 4
= 102 14 + 9
d( s 2 )
= 20 14
d
d( s 2 )
7
For minimum
= 0, =
d
10
(M1)
A1
A1
A1
415
OR
The position vector for the point nearest to the origin is perpendicular to
the direction of the line. At that point:
1 1

2 3 3 = 0
2 0

Therefore, 10 7 = 0
7
Therefore, =
10
(M1)A1
A1
A1
THEN
3
1
,y=
10
10
3 1
The point is , , 2 .
10 10
x=
(A1)(A1)
N3
[6]
516. X ~ Po ()
P(X = 10) = 2P(X = 9)
e 10 2e 9
=
10!
9!
10! 2
=
= 10 2 = 20
9!
E(X) = 20
(M1)
A1A1
A1
A1
[5]
416
517. P(A B) = P(A) + P(B) P(A B)

2 4 5
1
+ =
=
12 12 12 12
M1
A1
M1A1
7
P( A B ) 12 7
=
=
P(A/B) =
8
P( B )
8
12
M1A1
[6]
518. Probability =
=
C 2 6 C1
9
C3
3 6 3! 6! 3 6 6 3
=
=
9!
9 8 7 14
M1A1A1A1
A1
[5]
417
519. (a)
Lines on graph
100 students score 40 marks or fewer.
(b)
Identifying 200 and 600

Lines on graph.
a = 55, b = 75
(M1)
A1
N2
A1
(M1)
A1A1 N1N1
[6]
520. (a)
(b)
Using P(X = x) = 1
k 1 + k 2 + k 3 + k 4 + k 5 = 15k = 1
1
k=
15
Using E(X) = xP(X = x)
1
2
3
4
5
+ 1 + 2 + 3 + 4
=0
15
15
15
15
15
8 2
= 2 , 2.67
3 3
(M1)
M1A1
AG
N0
(M1)
A1
A1
N2
[6]
521. (a)
Using the chain rule f(x) = 2 cos 5 x 5

2
(M1)
418
= 10 cos 5x
2
(b)
f(x) =
=
A1
N2
f ( x)dx
cos 5 x + c
5
2
Substituting to find c, f = cos 5 + c = 1

5
2
2 2
2
2 7
c = 1 + cos 2 = 1 + =
5
5 5
2
7
f(x) = cos 5 x +
5
2 5
522. Attempting to differentiate implicitly

dy
dy
+ 2 y 2 + 4 xy
=0
3x2y + 2xy2 = 2 6 xy + 3 x 2
dx
dy
Substituting x = 1 and y = 2
dy
dy
+88
=0
12 + 3
dx
dx
dy
dy
4
5
=4
=
dx
dx
5
5
Gradient of normal is
4
A1
M1
(A1)
A1
N2
[6]
(M1)
A1
(M1)
A1
A1
A1
N3
[6]
419
523.
dy
dy
y 2 = 1, x
= y 2 +1
dx
dx
Separating variables
dy
dx
=
2
y +1 x
arctan y = ln x + c
y = 0, x = 2 arctan 0 = ln 2 + c
ln 2 = c
x
arctan y = ln x ln 2 = ln
2
x
y = tan ln
2
x
(M1)
A1
A1A1
(A1)
A1
N3
[6]
524. (a)
A1A1A1
Note: Award A1 for correct shape, A1 for points of intersection
and A1 for symmetry.
420
(b)
A = 2 ( x x 2 )dx
0
M1
x2 x3
= 2
3 0
2
1 1
= 2
2 3
1
=
square units
3
A1
(A1)
A1
[7]
525. (a)
a=
2s
2
s +1
dv
a= v
ds
dv
2s
v
= 2
ds s + 1
2s
vdv =
ds
2
s +1
v2
= lns2 + 1 + k
2
Note: Do not penalize if k is missing.
When s = 1, v = 2
2 = ln 2 + k
k = 2 ln 2
v2
s 2 +1
= ln s 2 + 1 + 2 ln 2 = ln
+ 2
2
2
M1
M1
A1A1
M1
A1
A1
421
(b)
EITHER
v2
26
= ln
+2
2
2
v2 = 2 ln13+ 4
v = 2 ln 13 + 4
M1
A1
OR
v2
= ln26+ 2 ln 2
2
v2 = 2 ln26+ 4 2 ln 2
v=
2 ln 26 + 4 2 ln 2
M1
A1
[9]
526. xey = x2 + y2
dy
dy
e y + xe y
= 2x + 2 y
dx
dx
dy
(1, 0) fits 1+
=2+0
dx
dy
=1
dx
Equation of tangent is y = x + c
(1, 0) fits c = 1
y=x1
M1A1A1A1A1
A1
A1
[7]
422
2(ln( x 2))
x2
1
( x 2)
2 ln( x 2) 1
x2
f(x) =
( x 2) 2
2 2 ln( x 2)
=
( x 2) 2
f(x) = 0 for point of inflexion
2 2 ln(x 2) = 0
ln (x 2) = 1
x2=e
x=e+2
f(x) = (ln(e + 2 2))2 = (ln e)2 = 1
( coordinates are (e + 2, 1))
527. f(x) =
M1A1
M1A1
A1
(M1)
A1
A1
A1
[9]
528. EITHER
(ln x) 3
dx
1
x
y = (ln x)4
M2
A1
(lnx) 3
1
dx = (ln x) 4
1
x
4
1
1
= [1 0] =
4
4
e
1
A1
A1
OR
Let u = ln x
du 1
=
dx x
When x = 1, u = 0 and when x = e, u = 1
u
0
du
M1
A1
A1
A1
1
1
u4 =
4 0 4
A1
[5]
423
529. 4 x2 0 for 0 x 2
and 4 x2 0 for 2 x 4
I=
(4 x 2 )dx +
( x 2 4)dx
A1
A1
M1A1
x3
x3
= 4 x + 4 x
3 0 3
2
8 64
8
16 + 8 (= 16)
= 8 +
3 3
3
A1A1
A1
[7]
530. x = 2 sin
x2 = 4 sin2
4 x2 = 4 4 sin2
= 4(1 sin2 )
= 4 cos2
4 x 2 = 2 cos
dx
= 2 cos
d
M1
When x = 1, 2 sin = 1
1
sin =
2
=
6
When x =
3 , 2 sin = 3
sin =
3
2
Let I =
I=
I=
A1
A1
4 x 2 dx
3
2 cos
6
4 3 cos 2
6
2 cos d
Now cos2 =
I =2
A1
1
(cos 2 + 1)
2
3
cos 2
6
A1
+ 1d
M1A1
424
1
3
I = 2 sin 2 +
2
M1A1
2 1

1
I = 2 sin
+ 2 sin +
3 3 2
3 6
2
3 2
3
I=
+
=
2
3
2 3 3
531. (a)
(b)
OP =
a 2 + (a 2 5) 2
(M1)
A1
[11]
M1
a 2 + a 4 10a 2 + 25
A1
a 4 9a 2 + 25
AG
EITHER
a 4 9a 2 + 25
s2 = a4 9a2 + 25
ds 2
= 4a3 18a = 0
da
ds 2
= 0 for minimum
da
2a(2a2 9) = 0
9
a2 =
2
3
3 2
a=
=
2
2
Let s =
M1A1
(M1)
A1A1
425
OR
1
s = (a 4 9a 2 + 25) 2
1
ds 1 4
= (a 9a 2 + 25) 2 (4a 3 18a )
da 2
ds
= 0 for a minimum
da
4a3 18a = 0
2a(2a2 9) = 0
9
a2 =
2
3
3 2
a=
=
2
2
M1A1
(M1)
A1A1
[7]
532. EITHER
4
0
sin x
cos x
dx =
4
0
sin x(cos)
1
2 dx
(M1)
4
cos 2 x
=
2 0
= 2 cos x
= 2 cos
(M1)A1A1
4
0
+ 2 cos 0
4
A1A1
= 2 24
A1
426
OR
Let u = cos x
du
= sin x
dx
1
when x = , u =
4
2
when x = 0, u = 1
4
0
sin x
cos x
dx =
(M1)
(M1)
A1
A1
1
2
1
2
du =
1
2
1
2 du
(M1)
2
= 2u 2
A1
= 2 24
+
2
1
24
A1
[7]
533. Substituting u = x + 2 u 2 = x, du = dx
(u 2) 3
x
d
x
=
du
( x + 2) 2
u2
u 3 6u 2 + 12u 8
du
u2
12
udu + (6)du +
du 8u 2 du
u
u
6u + 12 ln u 8u1 + c
2
( x + 2) 2
8
=
6( x + 2) + 12 ln x + 2 +
+c
2
x+2
534. (a)
(M1)
A1
A1
A1
A1
A1
[6]
Let p = 2, 8 + 4 10 2 = 0
M1
Since this fits p = 2 is a solution.
R1
N0
427
(b)
(c)
(d)
p3 + p2 5p 2 = (p 2)(p2 + ap + b)
= p3 + ap2 + bp 2p2 2ap 2b
= p3 + p2(a 2) + p(b 2a) 2b
M1A1
Equate constants 2 = 2b
b=1
A1
Equate coefficients of p2 a 2 = 1
a=3
A1
p2 + 3p + 1 = 0
3 9 4 3 5
p=
=
2
2
(i)
(ii)
A1
Geometric sequence: 1, p, p2 , p3
A1
(1 + 2p) + (1 + 3p) = p2 + p3
p3 + p2 5p 2 = 0
M1A1
A1
3 5
2
R1
The sum to infinity of a geometric series exists if p < 1.
R1
3+ 5
is the only such number.
2
A1
Hence, p =
(iv)
A1A1
Arithmetic sequence: 1, 1 + p, 1 + 2p, 1 + 3p
Therefore, from part (i), p = 2, p =
(iii)
M1
The sum of the first 20 terms of the arithmetic series can

be found by applying the sum formula
S20 = 10(2a + 19d) = 10(2 + 19 p)
5 3
= 265 + 95 5
So, S20 = 10 2 + 19
2
M1A1
A1A1A1
[22]
428
535. Let f(n) = 5n + 9n + 2 and let Pn be the proposition that f(n) is divisible by 4.
Then f(1) = 16
So P1 is true
Let Pn be true for n = k, i.e. f(k) is divisible by 4
A1
A1
M1
Consider f (k + 1) = 5k+1 + 9k+1 + 2

= 5k(4 + 1) + 9k(8 + 1) + 2
= f(k) + 4(5k + 2 9k)
Both terms are divisible by 4 so f(k + 1) is divisible by 4.
Pk true Pk+1 true
Since P1 is true, Pn is proved true by mathematical induction for n
M1
A1
A1
R1
R1
R1
N0
[9]
536. (a)
(b)
(c)
1 2i
e
z = 2 i
e
1 i
z= e
2
A1
1
2
z< 1
z =
Using S =
S =
(d)
(M1)
N2
A2
AG
a
1 r
e i
1
1 e i
2
(M1)
A1
N2
e i
cis
(M1)
=
1 i
1
1 e
1 cis
2
2
cos + i sin
(A1)
1
1 (cos + i sin )
2
1
1
Also S = ei + e 2i + e 3i + ...
2
4
1
1
= cis + cis2 + cis3 + ...
(M1)
2
4
1
1
1
1
S = cos + cos 2 + cos 3 + ... + i sin + sin 2 + sin 3 + ... A1

2
4
2
4
(i)
S =
(ii)
Taking real parts,
429
1
1
cos
+
i
sin
cos + cos 2 + cos 3 + ... = Re

1
2
4
1 (cos + i sin )
2
1
1
1 cos + i sin
(cos + i sin )
2
2
= Re
1
1
1
1
1 cos i sin 1 cos + i sin

2
2
2
2
1
1
cos cos 2 sin 2
2
2
=
2
1
1
2
1 cos + sin
4
2
cos
2
=
1
1 cos + (sin 2 + cos 2 )
4
(2 cos 1) 2
4(2 cos 1)
=
=
(4 4 cos + 1) 4 2(5 4 cos )
4 cos 2
=
5 4 cos
537. (a)
2 4 16
= 1 i 3
2
1 + i 3 = re i r = 2
z=
3 2
=
1
3
i
1 i 3 = re r = 2
= arctan
3
2
=
1
3
= arctan
= 2e
2
3
2
i
2e 3
A1
M1
A1
A1
A1
A1AG
N0
[25]
M1
A1
A1
A1
A1
A1
430
(b)
A1A1
(c)
cos n + i sin n = (cos + i sin )n

Let n = 1
Left hand side = cos 1 + i sin 1 = cos + i sin
Right hand side = (cos + i sin )1 = cos + i sin
Hence true for n = 1
Assume true for n = k
cos k + i sin k = (cos + i sin )k
cos(k + 1) + i sin(k + 1) = (cos + i sin )k(cos + i sin )
= (cos k + i sin k)(cos + i sin )
= cos k cos sin k sin + i(cos k sin + sin k cos)
= cos(k + 1) + i sin(k + 1)
Hence if true for n = k, true for n = k + 1
However if it is true for n = 1
true for n = 2 etc.
hence proved by induction
M1A1
M1
M1A1
A1
A1
R1
(d)
i
3
8e i2
3
=
=
2
e
4
i
2
3
4e
4
4
+ 2i sin
= 2 cos
3
3
2
i 3
= 2
= 1 i 3
2
2
(e)
a3 = 8ei2
3 = 8ei2
Since e2 and e2 are the same 3 = 3
A1
(M1)
A1A1
A1
A1
R1
431
(f)
EITHER
= 1 + i 3
= 1 i 3
* = 1 i 3
* = 1 + i 3
A1
* = (1 + i 3 ) (1 + i 3 ) = 1 2 i 3 3 = 2 2 i 3
M1A1
* = (1 i 3 )(1 i 3 ) = 1 + 2 i 3 3 = 2 + 2 i 3
* + * = 4
A1
A1
OR
Since * = and * =
* = 2e
2
3
2
i
2e 3
* =
2e
2
3
= 4e
2
i
2e 3
4
3
4
i
4e 3
4
i 4
i
* + * = 4 e 3 + e 3
4
4
4
4
+ i sin
+ cos
i sin
= 4 cos
3
3
3
3
4
1
= 8 = 4
= 8 cos
3
2
(g)
i2
M1A1
A1
A1
A1
n = 2 n e 3
This is real when n is a multiple of 3
i.e. n = 3N where N +
M1A1
R1
[31]
538. (a)
(x + 2) = (x 2) + x 2(x 2) xcos120
x2 + 4x + 4 = x2 4x + 4 + x2 + x2 2x
0 = 2x2 10x
0 = x(x 5)
x=5
(b)
Area =
1
5 3 sin 120
2
(M1)
M1A1
(M1)
A1
A1
M1A1
432
1
3
15
2
2
15 3
=
4
=
(c)
3
2
15 3 1
3 3
= 5 7 sin B sin B =
4
2
14
5 3
Similarly sin C =
14
15 3
sin A + sin B + sin C =
14
A1
AG
sin A =
M1A1
A1
A1
[13]
539. (a)
M1
(M1)
M1
When a = 1 the augmented matrix is
Hence the system is inconsistent a 1
A1
R1
433
(b)
When a 1, (a 1)z = 9 a2
(a + 1)z = a2 9
a2 9
z =
a +1
1
a2 9
2y z = 0 y = z =
2
2(a + 1)
x = 3y + z =
3(a 2 9) 2(a 2 9) 9 a 2
+
=
2(a + 1)
2(a + 1)
2(a + 1)
M1A1
M1A1
M1A1
9 a2 a2 9 a2 9
when a 1
The unique solution is
,
,
2(a + 1) 2(a + 1) a + 1
(c)
540. (a)
(b)
2a=1 a=1
8 8 8
The solution is , , or (2, 2, 4)
4 4 2
AB = i 3j + k, BC = i + j
i
j k
AB BC = 1 3 1
1
Area of ABC =
A1
[13]
A1A1
M1
= i + j + 2k
(c)
M1
A1
1
i + j + 2k
2
1
1+1+ 4
2
6
=
2
M1A1
(d)
A normal to the plane is given by n = AB BC = i + j + 2k

Therefore, the equation of the plane is of the form x + y + 2z = g
and since the plane contains A, then 1 + 2 + 2 = g g = 3.
Hence, an equation of the plane is x + y + 2z = 3.
A1
(M1)
M1
A1
434
(e)
Vector n above is parallel to the required line.

Therefore, x = 2 t
y=1+t
z = 6 + 2t
(f)
A1
A1
A1
x=2t
y=1+t
z = 6 + 2t
x + y + 2z = 3
2 + t 1 + t 12 + 4t = 3
15 + 6t = 3
6t = 18
t=3
Point of intersection (1, 2, 0)
Distance =
(h)
Unit vector in the direction of n is e =
1
6
A1
A1
3 2 + 3 2 + 6 2 = 54
(g)
M1A1
(M1)A1
1
n
n
(i + j + 2k)
(M1)
A1
Note: e is also acceptable.

(i)
Point of intersection of L and P is (1, 2, 0).

3

DE = 3
6

3

EF = 3
6

coordinates of F are (4, 5, 6)
(M1)A1
M1
A1
[25]
435
541. (a)
(b)
L1 : x = 2 + ; y = 2 + 3; z = 3 +
L2 : x = 2 + ; y = 3 + 4; z = 4 + 2
At the point of intersection
2+=2+
(1)
2 + 3 = 3 + 4 (2)
3 + = 4 + 2
(3)
From (1), =
Substituting in (2), 2 + 3 = 3 + 4
= = 1
We need to show that these values satisfy (3).
They do because LHS = RHS = 2; therefore the lines intersect.
So P is (1, 1, 2).
The normal to is normal to both lines. It is therefore given by
the vector product of the two direction vectors.
i j k
Therefore, normal vector is given by 1 3 1

1 4 2
= 2i j + k
The Cartesian equation of is 2x y + z = 2 + 1 + 2
i.e. 2x y + z = 5
(A1)
(A1)
(M1)
A1
A1
(M1)
R1
A1
N3
M1A1
A2
(M1)
A1
N2
436
(c)
3 5
The midpoint M of [PQ] is 2, , .
2 2
The direction of MS is the same as the normal to , i.e. 2i j + k
The coordinates of a general point R on MS are therefore
3
5
2 + 2 , , +
2
2
5
1
It follows that PR = (1 + 2)i + j + + k

2
2
At S, length of PR is 3, i.e.
2
M1A1
(R1)
(M1)
A1A1A1
(M1)
5
1
(1 + 2)2 + + + = 9
2
2
25
1
1 + 4 + 42 +
5 + 2 +
+ + 2 = 9
4
4
6
4
1
=
2
Substituting these values,
the possible positions of S are (3, 1, 3) and (1, 2, 2)
62 =
A1
(A1)
A1
A1
(M1)
A1A1
N2
[29]
542. (a)
Using
f ( x)dx = 1
0
dx
=1
4 x2
(M1)
A1
k arcsin = 1
20
1
k arcsin arcsin(0) = 1
2
k
=1
6
6
k=
A1
A1
A1
437
(b)
E(X) =
xdx
4 x2
Let u = 4 x2
du
= 2 x
dx
When x = 0, u = 4
When x = 1, u = 3
6 1 3 du
E(X) =
2 4 1
u2
1
6 2
= u

M1
(M1)
A1
A1
A1
M1
A1
4
6
(2 3)
AG
438
(c)
The median m satisfies

6 m dx
1
=
0
2
2
4 x
M1A1
1
x
arcsin 2 = 2
0
A1
m
arcsin =
2 12
m = 2 sin
12
We need to determine whether 2 sin
A1
A1
1
> or <
12
2
Consider the graph of y = sin x
M1
1
is concave downwards and sin =
2
6 2
1
>
it follows by inspection that sin
R1
12 4
1
>
hence m = 2 sin
R1
12 2
Since the graph of y = sin x or 0 x
[20]
543. (a)
2 1
P(RR) =
5 4
1
=
10
(M1)
A1
N2
439
(b)
(c)
4
3
2
=
4 + n 3 + n 15
Forming equation 12 15 = 2(4 + n) (3 + n)
12 + 7n + n2 = 90
n2 + 7n 78 = 0
n=6
P(RR) =
EITHER
1
2
P( B )
P(A) =
3
3
P(RR) = P(A RR) + P(B RR)
1 1 2 2
= +
3 10 3 15
11
=
90
A1
(M1)
A1
A1
AG
N0
A1
(M1)
A1
N2
OR
A1
1 1 2 2
P(RR) = +
3 10 3 15
11
=
90
M1
A1
N2
440
(d)
P(1or 6) = P(A)
P( A RR
P(ARR) =
P( RR)
1 1
3 10

=
11
90
3
=
11
M1
(M1)
M1
A1
N2
[13]
544. (a)
(i)
18(x 1) = 0 x = 1
A1
(ii)
vertical asymptote: x = 0
horizontal asymptote: y = 0
A1
A1
(iii)
18(2 x) = 0 x = 2
36(2 3)
9
f(2) =
= < 0 hence it is a maximum point
3
2
2
9
When x = 2, f(x) =
2
9
f (x) has a maximum at 2,
2
(iv)
f(x) is concave up when f(x) > 0

36(x 3) > 0 x > 3
M1A1
R1
A1
M1
A1
441
(b)
A1A1A1A1A1
Note: Award A1 for shape, A1 for maximum, A1 for
x-intercept, A1 for horizontal asymptote and A1 for
vertical asymptote.
[14]
x
545. (a)
(i)
Attempting to use quotient rule f(x) =

f(x) =
1 ln x
x2
1
x 2 (1 ln x)2 x
x
f(x) =
x4
2 ln x 3
f(x) =
x3
Stationary point where f(x) = 0
i.e. ln x = 1 , (so x = e)
f(e) < 0 so maximum.
(ii)
Exact coordinates x = e, y =
1
e
1
ln x 1
x
x2
(M1)
A1
(M1)
A1
M1
A1
R1AG
N0
A1A1
N2
442
(iii)
Solving f(0) = 0
3
ln x =
2
x=
(b)
Area =
M1
(A1)
3
e2
A1
ln x
dx
x
N2
A1
EITHER
Finding the integral by substitution/inspection
1
u = ln x, du = dx
x
2
(ln x) 2
u
=
udu =
2
2
(ln x) 2
1
2
2
Area =
= (ln 5) (ln 1)
2 1 2
1
Area = (ln 5) 2
2
(M1)
M1A1
A1
A1
N2
OR
Finding the integral I by parts
1
1
u = ln x, dv = du = , v = ln x
x
x
1
I = uv udv = (ln x) 2 ln x dx = (ln x) 2 I
x
2
(ln x)
2 I = (ln x) 2 I =
2
(ln x) 2
1
2
2
Area =
= (ln 5) (ln 1)
2 1 2
1
Area = (ln 5) 2
2
(M1)
M1
A1
A1
A1
N2
[18]
546. (a)
(b)
ln e22x = ln2ex
2 2x = ln(2ex)
= ln 2 x
x = 2 ln 2
e2
x = ln e 2 ln 2 = ln
M1
(A1)
(A1)
A1
dy
= 2e 2 2 x + 2e x
dx
M1A1
443
dy
= 0 for a minimum point
dx
2e22x + 2ex = 0
e22x = ex
2 2x = x
x=2
y = e2 2e2 = e2
( minimum point is (2, e2))
(M1)
(A1)
(A1)
A1
A1
(c)
A1A1A1
(d)
2 distinct roots provided e2 < k < 0
A1A1
[16]
547. (a)
(b)
2 xe x x 2 e x 2 x x 2
=
e 2x
e x
For a maximum f(x) = 0

2x x2 = 0
giving x = 0 or 2
( 2 2 x )e x e x ( 2 x x 2 ) x 2 4 x + 2
=
f(x) =
e 2x
ex
f(0) = 2 > 0 minimum

2
f(2) = 2 < 0 maximum
e
4
Maximum value = 2
e
f(x) =
For a point of inflexion,

x 2 4x + 2
=0
f(x) =
ex
4 16 8
giving x =
2
M1A1
(M1)
A1A1
M1A1
R1
R1
A1
M1
(A1)
444
=2
(c)
x
0
A1
e x dx = x 2 e x
1
0
] + 2 e
= e1 2e1 2[e ]
= e 1 2 xe x
1
0
+ 2 xe x dx
M1A1
dx
A1M1A1
x 1
0
= 3e
2e
A1A1
1
+ 2 (= 2 5e )
A1
[21]
548. (a)
(b)
(c)
5000(1.063)n
A1
N1
Value = $ 5000(1.063)5 (= $ 6786.3511)

= $ 6790 to 3 s.f. (accept $ 6786, or $ 6786.35)
A1
N1
A1
N1
(M1)
(A1)
A1
N3
(M1)
(A1)
A1
N3
(i)
5000(1.063)n >10 000 (or (1 .063)n > 2)
(ii)
Attempting to solve the above inequality n log (1.063) > log 2

n > 11.345...
12 years
Note: Candidates are likely to use TABLE or LIST on a GDC to

find n. A good way of communicating this is suggested below.
Let y = 1.063x
When x = 11, y = 1.9582, when x = 12, y = 2.0816
x = 12 i.e. 12 years
[6]
445
549. METHOD 1
Graph of f (x) g(x)
M1
A1A1A1
Note: Award A1 for each branch.
x < 1 or 4 < x 14
A1A1
N3
Note: Each value and inequality sign must be correct.

METHOD 2
x+4 x2
0
x +1 x 4
x 2 16 x 2 + x + 2
0
( x + 1)( x 4)
x 14
0
( x + 1)( x 4)
Critical value of x = 14
Other critical values x = 1 and x = 4
x < 1 or 4 < x 14
M1
A1
A1
A1
A1A1
N3
Note: Each value and inequality sign must be correct.

[6]
550. (a)
0.1 0.4 0.1
A = 0.7 0.2 0.3

1.2 0.2 0.8
A2
N2
446
(b)
(c)
551. (a)
x
1

1
For attempting to calculate y = A 2
z
3

x = 1.2, y = 0.6, z = 1.6 (so the point is (1.2, 0.6, 1.6))
M1
(1.2, 0.6, 1.6) lies on x + y + z = d

d = 3.4
4

Finding correct vectors AB = 3
1

AB = 26
N2
A1
N1
[6]
3

AC = 1
1

A1A1
Substituting correctly in scalar product AB AC = 4(3) + 3(1) 1(1)

= 10
(b)
A2
AC = 11
A1
AG
N0
(A1)(A1)
C =
Attempting to use scalar product formula, cos BA
= 0.591 (to 3 s.f.)
C = 126
BA
10
26 11
M1
A1
A1
N3
[8]
552. P(X > 90) = 0.15 and P(X < 40) = 0.12
Finding standardized values 1.036, 1.175
90
40
,1.175 =
Setting up the equations 1.036 =
= 66.6, = 22.6
(M1)
A1A1
(M1)
A1A1 N2N2
[6]
447
553. (a)
30
Total number of ways of selecting 4 from 30 =
4
12 18
Number of ways of choosing 2B 2G =
2 2
(M1)
(M1)
12 18

2 2
P(2B or 2G) =
= 0.368
30

4
(b)
12
Number of ways of choosing 4B = , choosing 4G =
4
12 18
+
4 4
P(4B or 4G) =
30

4
= 0.130
A1
18

4
N2
A1
(M1)
A1
N2
[6]
554. (a)
(b)
(c)
P(3 X 5) = P(X 5) P(X 2)

= 0.547
(M1)
A1
N2
P(X 3) = 1 P(X 2)
= 0.762
(M1)
A1
N2
P(3 X 5X 3) =
P(3 X 5) 0.547
=
P( X 3) 0.762
= 0.718
(M1)
A1
N2
[6]
448
555.
(a)
(b)
(c)
Using the cosine rule (a2 = b2 + c2 2bc cos A)

Substituting correctly
BC2 = 652 + 1042 2 (65) (104) cos 60
= 4225 + 10 816 6760 = 8281
BC = 91m
1
bc sin A
2
1
Substituting correctly, area = (65) (104) sin 60
2
= 1690 3 (accept p = 1690)
Finding the area using =
(i)
1
Smaller area A1 = (65) (x)sin 30
2
65x
=
4
1
Larger area A2 = (104) (x) sin 30
2
= 26x
(M1)
A1
A1
N2
(M1)
A1
A1
N2
(M1)A1
AG
N0
M1
A1
N1
449
(ii)
(d)
Using A1 + A2 = A
65 x
+ 26 x = 1690 3
Substituting
4
169 x
= 1690 3
Simplifying
4
4 1690 3
Solving x =
169
x = 40 3 (accept q = 40)
Using sin rule in ADB and ACD

BD
65
BD
sin 30
Substituting correctly
=
=
B
B
sin30 sinAD
65 sin AD
DC
104
DC
sin 30
and
=
C
sin30 sin ADC
104 sin AD
B + AD
C = 180
Since AD
B = sinAD
C
It follows that sin AD
BD DC
BD 65
=
=
65 104
DC 104
BD 5
=
DC 8
(M1)
A1
A1
A1
N1
(M1)
A1
A1
R1
R1
A1
AG
N0
[20]
556. (a)
A2
(b)
Mode = 2
A1
450
(c)
Mean =
1
6
x f ( x)dx
(M1)
( x 2 + x 4 )dx
A1
Using E (X) =
1 x3 x5
= +
6 3
5 0
68
=
(1.51)
45
(d)
(A1)
A1
The median m satisfies
1
6
( x + x 3 )dx =
1
2
m2 m4
+
=3
2
4
m4 + 2m2 12 = 0
2 4 + 48
m2 =
= 2.60555...
2
m = 1.61
N2
M1A1
(A1)
(A1)
A1
N3
[12]
557. (a)
(i)
1
Number of 6s obtained is B10, .
6
5
Prob (at least 2) = 1
6
= 0.515
(ii)
10
(M1)
9
5 1
10
6 6
(A1)
A1
We require the first 4 throws not to be 6s followed by a 6 on

the 5th throw.
N3
(M1)
5 1
Prob =
6 6
= 0.0804
(iii)
(A1)
A1
If he throws his third 6 on the Xth throw, X has a negative

binomial distribution.
9
11 5 1
P(X = 12) =
2 6 6
= 0.0493
N3
(R1)
(M1)(A1)
A1
N4
451
n 1
(b)
1
5
Probability of 1st six on nth throw =
6
6
This is a decreasing function so most likely throw is the first.
M1
A1
N1
[12]
558. (a)
540
(= 0.45)
1200
(i)
Estimated proportion =
(ii)
Estimated standard error =
(M1)A1
544 660
M1A1
1200 3
= 0.0144
(iii)
A1
95 % confidence limits are
540
544 660
1.96
1200
1200 3
N1
(M1)(A1)
= 0.45 1.96 0.0144

The 95 % confidence interval is [0.422, 0.478]
(b)
N2
(A1)
A1
EITHER
The sample needs to be random.
R2
OR
We can approximate a binomial distribution by a normal distribution.
R2
N4
[11]
559. (a)
The values are

Child
difference
1.5
0.6
0.3
0.2
2.0
0.6
1.5
0.1
0.5
0.4
A2
(b)
(i)
H 0 : 1 = 2
H1 : 1 < 2
A1A1
452
(ii)
EITHER
d = 6.5 : d2 = 9.77
9.77 6.5 2
9
90
= 0. 6161111
6.5
10
t=
0.6161111
10
= 2.62
2 =
(M1)(A1)
A1
(M1)
A1
A1
A1
OR
p = 0.0139
A7
THEN
Insufficient evidence to support the teachers belief that
puzzle 2 takes longer than puzzle 1.
R1
R1
[13]
560. (a)
E(X) =
1
,
2
12
E(Z) =
E( X
Var( X ) =
1
12
n)6
A1A1
(M1)
i =1
= 12
1
6
2
A1
=0
AG
N0
12
Var(Z) =
Var( X
n)
(M1)
i =1
= 12
(b)
1
12
A1
=1
AG
Since n is reasonably large,

the central limit theorem ensures that Z is approximately normal.
R1
R1
N0
453
(c)
(i)
Range of values of z Observed frequency
Expected
frequency
(, 2)
16
11.35
(A1)
[2, 1)
66
68.00
(A1)
[1, 0)
180
170.65
(A1)
[0, 1)
155
170.65
(A1)
[1, 2)
65
68.00
(A1)
[2, )
18
11.35
(A1)
(16 11.35) 2
+ ...
11.35
= 7.94
We conclude that the data fit the N(0, 1) distribution.
at the 5% level of significance
2 =
(ii)
(a)
(b)
(M1)
A1
A1
A1
R1
A1
Type I error concluding that the data do not fit

N(0, 1) when in fact they do.
R2
Type II error concluding that data fit N(0, 1) when

in fact they do not.
R2
[24]
561. AB = (A\B) (B\A)

= (A B) (B A)
= ((A B) B) ((A B) A)
= ((A B) (B B)) ((A A) (B A))
= ((A B) U) (U (B A))
= (A B) (A B)
= (A B) (A B)
M1A1
M1A1
A1
A1
Note: Illustration using a Venn diagram is not a proof

[6]
454
562. (a)
(b)
ab
(a*b)*c =
*c
a+b
abc
= a+b
ab
+c
a+b
abc
=
ab + ac + bc
bc
a * (b * c) = a *
b+c
abc
= a+b
bc
a+
b+c
abc
=
ab + ac + bc
(a * b)* c = a * (b * c)
so * is associative.
(M1)
A1
A1
(M1)
A1
A1
R1
AG
Suppose e is an identity element, then e*a = a*e = a

ea
=a
e+a
ea = ea + a
ea cancels on both sides so there is no solution for e.
i.e. no identity element
(M1)
A1
M1
R1
AG
[11]
563. (a)
(i)
(a)
(b)
f is an increasing function
so it is injective.
A1
Let f(n) = 1 (or any other appropriate value)
M1
Then 5n + 4 = 1, n =
3
, which is not in the domain
5
f is not surjective.
A1
455
(ii)
1 2 x x + 2 y
=
g(x,y) = (x + 2y, 3x 5y) so

3 5 y 3 5 y
METHOD 1
(a)
(b)
Let g(x, y) = g(s, t) so (x + 2y, 3x 5y) = (s + 2t, 3s 5t)

x + 2y = s + 2t, 3x 5y = 3s 5t
y = t and x = s (x, y) = (s, t)
g is injective.
M1
M1
A1
Let (u, v) be an element of the codomain.

x + 2y = u, 3x 5y = v
M1
3u v
Then 11y = 3u + v, so y =
A1
11
5u + 2v
and 11x = 5u + 2v, so x =
A1
11
5u + 2v 3u v
,
Since
is in the domain then g is surjective.
11
11
METHOD 2
(a)
(b)
1 2 x 1 2 s
=

3 5 y 3 5 t
x s
1 2
= since det
0,
y t
3 5
(x, y) = (s, t)
g is injective.
Let (u, v) be an element of the codomain.
1 2 x u
=
3 5 y v
M1
A1
A1
M1
x 1 2 u
=

y 3 5 v
x 1 5 2 u
=

y 11 3 1 v
A1
A1
5u + 2v 3u v
,
Since
is in the domain then g is surjective. R1
11
11
(iii)
5 x + 2 y 3x y
,
g1(x, y) =
11
11
A2
456
(b)
564. (a)
g f is surjective, so for every z there exists x A

such that
(g f)(x) = z (ie g(f(x)) = z)
Let y = f(x) B.
For every z there exists y B such that g (y) = z.
g is surjective.
(i)
(ii)
(b)
(i)
(ii)
det T = x(x) (x + 2)(x 5)

= x2 x2 + 3x + 10
1 = 2x2 + 3x + 10
0 = 2x2 3x 9
0 = (2x + 3)(x 3)
3
x = or x = 3
2
3
a = 3, b =
2
5
3
1 0
A 2 =
A =
2 3
0 1
R1
R1
R1
AG
[16]
M1
A1
(A1)
AG
N0
A1A1
N2
A1
3 5
A3 =
A1
3
2
1 0
(= I)
A4 =
A1
0 1
A2 is self-inverse
A1
A3 = A1.
A1
2
3
the set {A, A , A , I} is closed under matrix multiplication;
has an identity I; is associative and each element has an inverse.
Therefore it is a group.
R1AG
N0
[11]
457
565. (a)
x1x = e H.
x R x R is reflexive
xR y x1y H
(x1y) 1 H
x1y (x1y)1 = e
so (x1y)1 = y1x
y 1 x H yRx R is symmetric
M1
R1
A1
A1
R1
x R y and y R z x 1 y H and y 1 z H
(x1y)(y1z) H since H is closed.

x1(yy1)z H
x1z H
xRz R is transitive.
R is an equivalence relation.
(b)
(c)
p3 = q2 = e
qp2 = (qp)p
= (p2q)p
= p2(qp)
= p2(p2q)
= p3(pq)
= pq
A1
R1
AG
qp = p2q
A1
A1
A1
AG
H = {e, p2q}
y R pq y 1 pq = e pq = y
1
A1
A1
or y pq = p q pq = yp q
pq2 = yp2q2
p = yp2
p2 = yp3
p2 = y
The equivalence class is {p2, pq}
A1
A1
A1
A1
[16]
458
sin x x
x sin x
cos x 1
lim f ( x) = lim
x 0
x 0 sin x + x cos x
sin x
= lim
x 0 2 cos x x sin x
=0
566. Let f(x) =
(M1)
A1A1
A1A1
A1
N2
[6]
567. For p > 1,
is
xp
positive for x 1, and decreasing for x 1.
1
dx = lim
1
L 1 x
L (1 p ) x
1
1
1
= lim
L (1 p ) L p 1
1 p
1
=
p 1
The convergence of this integral ensures the convergence of the series
using the integral test.
lim
A1A1
(M1)
A1
A1
R1AG
N0
[6]
568. (a)
(i)
y = ln (1 + sin x)
cos x
y =
1 + sin x
1
y =
1 + sin x
cos x
y(3) =
(1 + sin x) 2
y(4) =
(ii)
A1
A1
A1
sin x(1 + sin x) 2 2(1 + sin x) cos 2 x

(1 + sin x) 4
y(0) = 0; y(0) = 1
y(0) = 1; y(3)(0) = 1; y(4)(0) = 2
ln(1 + sin x) = x
1 2 1 3 1 4
x + x x + ...
2
6
12
(M1)A1
A1A1
A1A1
A1
AG
N0
459
(b)
(i)
(ii)
ln(1 sin x) = ln(1 + sin(x))

1
1
1
= x x 2 x 3 x 4 + ...
2
6
12
(M1)
ln(1 + sin x) + ln(1 sin x) = ln(1 sin2 x)

= ln cos2 x
(M1)
A1
1 4
x + ...
6
1
1
ln cos x = x 2 x 4 + ...
2
12
So ln cos2 x = x2
(iii)
Differentiating,
d
1
(ln cos x) =
( sin x)
dx
cos x
= tan x
1 3
x + ...
3
Note: No term in x4 since tan(x) = tan x
tan x = x +
x4
+ ...
tan( x )
3
=
ln cos x
x2 x4
+ ...
2 12
x4
1+
+ ...
3
=
1 x2

+ ...
2 12
2 as x 0
tan( x 2 )
= 2
so lim
x 0 ln cos x
(c)
A1
N2
A1
A1
N2
(M1)
A1
A2
N3
x2 +
(M1)
A1
A1
A1
N3
[24]
460
569. (a)
dy
xy
= 1
dx
4 x2
x
dy/dx
h dy/dx
0.25
0.25
1.25
0.9206349206 0.2301587302
A2
0.5
1.48015873
0.8026455027 0.2006613757
A2
0.75 1.680820106 0.6332756132 0.1583189033
A2
1.839139009
A1
To two decimal places, when x = 1, y = 1.84.
(b)
(i)
Integrating factor = e
= e
=
A1
A1
4 x2
4 x
N0
(M1)
A1
4 x 2 dx
1
2
ln( 4 x )
2
It follows that
(ii)
A2
d
y
dx 4 x 2
1
4 x2
x
= arcsin + C
2
1
=C
2
x 1
4 x 2 arcsin +
2 2
(M1)
A1A1
Putting x = 0, y = 1,
A1
Therefore, y =
A2
N0
A1
N1
When x = 1, y = 1.77.
461
(c)
A2
dy
Since
is decreasing the value of y is over-estimated at each step.
dx
R1A1
[24]
570. (a)
10201 = a 84 + b 83 + c 82 + d 8 + e
= 4096a + 512b + 64c + 8 d + e a = 2
= 10201 2 4096 = 2009 = 512b + 64c + 8d + e b = 3
2009 3 512 = 473 = 64c + 8d + e c = 7
473 7 64 = 25 = 8d + e d = 3 and e = 1
10201 = 23731 (base 8)
M1
A1
A2
(b)
8n 1 (mod 7) for positive integer n

A1
Consider the octal number
unun1...u1u0 = un + un1 + u1 + u0 (mod 7)
(M1)
from which it follows that an octal number is divisible by 7 if and only if A1
the sum if the digits is divisible by 7.
R1
Hence 10201 a + b + c + d + e (mod 7)
A1
(c)
10201 2 + 3 + 7 + 3 + 1 2 (mod 7)
N2
A2
[11]
571. (a)
Let p1, ..., pn be the set of primes that divide either a or b

2
Then a = p1 p 2 ... p n and b = p1 p 2 ... p n
M1
A1A1
Hence ab = p11 + 1 p 2 2 + 2 ... p n n + n

Furthermore min{j, j} + max{j, j} = j + j for j = 1,2,...,n
A1
A1
Hence ab = p1min{1 , 1 }+ max{1 , 1 } ... p nmin{ n , n }+ max{ n , n }

ab = gcd(a,b) lcm(a,b)
A1
AG
462
(b)
gcd(a,b)a and gcd(a,b)b

Hence gcd(a,b)a + b
so that gcd(a,b)gcd(a,a + b)
*
Also gcd(a,a + b)a and gcd(a,b)a + b
Hence gcd(a,a + b)b
so that gcd(a,a + b)gcd(a,b)
**
From * and ** : gcd(a,b) = gcd(a,a + b)
A1
A1
A1
A1
A1
A1
A1AG
[13]
572. 67101 2101 (mod 65)

26 1 (mod 65)
2101 (26)16 25
(1)16 32 (mod 65)
32 (mod 65)
remainder is 32
A1
(M1)
A1
A1
A1
A1
N2
[6]
573. x 1(mod 3) x = 3k + 1
Choose k such that 3k + 1 2 (mod 5)
With Euclids algorithm or otherwise we find
k 7 + 5h
Choose h such that 22 + 15k 3 (mod 7)
With Euclids algorithm or otherwise
k 2 + 7j
Hence x = 22 + 15(2 + 7j) = 52 + 105j
A1
M1
A1
M1
A1
A1
N3
[6]
574. (a)
(b)
H is not planar because if it were then e < 2v 4

But here e = 9 and v = 6
And hence the inequality is not satisfied
So H is not planar
N0
Deleting the edge connecting A with D we can draw the graph as below
which shows that it is planar.

(c)
M1
A1
A1
AG
M1A1
A1
The adjacency matrix can also be written as:
463
A B C D E F
A 0 0 0 1 1 1
B 0 0 0 1 1 1
C 0 0 0 1 1 1
D 1 1 1 0 0 0
E 1 1 1 0 0 0
F 1 1 1 0 0 0
Hence with a suitable permutation of the last three rows and
of the last three columns the general case can be reduced to part (b).
Any subgraph of H (excluding H itself) is planar.
M1A1
R1A1
AG
[10]
575. (a)
(b)
Starting from vertex A there are 4 choices. From the next vertex there
are three choices, etc
M1R1
So the number of Hamiltonian cycles is 4! = 24.
A1
(i)
(ii)
(c)
(d)
Start (for instance) at B, using Prims algorithm

Then D is the nearest vertex
Next E is the nearest vertex
Finally C is the nearest vertex
So a minimum spanning tree is B D E C
M1
A1
A lower bound for the travelling salesman problem is then

obtained by adding the weights of AB and AE to the weight
of the minimum
spanning tree (ie 20)
A lower bound is then 20 + 7 + 6 = 33
A minimum spanning tree for G would be
N1
A1
N1
M1
A1
A1
N1
of weight 26 A1
Thus an upper bound is given by 26 2 = 52
A1
Eliminating C from G a minimum spanning tree is E A B D

of weight 18
Adding BC to CE(18 + 9 + 7) gives a lower bound of 34 > 33
So 33 not the best lower bound.
M1
A1
A1
AG
N0
[14]
464

Markscheme MHL

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Markscheme MHL

Uploaded by

Copyright:

Available Formats

1.

P(A B) = P(A) + P(B) = 0.7

P(A B) = P(A) + P(B) P(A B)

P(A B) = P(A) + P(B) P(A B)

Note: Award A1 for two correct equations.

IB Questionbank Mathematics Higher Level 3rd edition

Note: 13 + 9 + 5 + 1 3 7 11 > 0 N = 7 or equivalent

Note: Only award the A1 and R1 if working indicates that they

IB Questionbank Mathematics Higher Level 3rd edition

Note: Award M1 for use of double angle formulae.

R is rabbit with the disease

IB Questionbank Mathematics Higher Level 3rd edition

P(P) = P(R P) + P(R P)

0.001 0.99 + 0.01 0.99 0.01089

attempting to integrate by parts

Note: Award A1 even if limits are absent.

IB Questionbank Mathematics Higher Level 3rd edition

Attempt at implicit differentiation

IB Questionbank Mathematics Higher Level 3rd edition

Note: Equations must be seen to award these marks.

Note: Award A1 for correct x-coordinate and A1 for correct y-coordinate.

Note: Accept row vectors.

IB Questionbank Mathematics Higher Level 3rd edition

Note: If attempt to solve by a system of equations:

1(5 + ) + 2(3 + 2) + 2(7 + 2) = 7

IB Questionbank Mathematics Higher Level 3rd edition

= 19i 20j + 16k

which is smaller than 6

f(x) > 0 when x < e and f(x) < 0 when x > e

Note: Accept argument using correct second derivative.

IB Questionbank Mathematics Higher Level 3rd edition

Note: May be seen in part (a).

since f(x) < 0 when x <

IB Questionbank Mathematics Higher Level 3rd edition

all real values

(cos + i sin )3 = cos3 + 3cos2 (i sin ) + 3 cos (isin )2 + (isin )3 (M1)

IB Questionbank Mathematics Higher Level 3rd edition

from De Moivres theorem

Note: Do not award marks if part (a) is not used.

cos 5 + cos 3 + cos

IB Questionbank Mathematics Higher Level 3rd edition

since max value of cosine angle

g(x) = 4 + 6(x 3) (x 3)2 (= 31 + 12x x2)

Note: Accept any alternative form that is correct.

IB Questionbank Mathematics Higher Level 3rd edition

IB Questionbank Mathematics Higher Level 3rd edition

kx( x + 1)(2 x)dx = 1

Note: Allow degrees at this stage.

Note: Allow FT for final A1.

IB Questionbank Mathematics Higher Level 3rd edition

Note: Condone absence of vector notation in (a).

IB Questionbank Mathematics Higher Level 3rd edition

IB Questionbank Mathematics Higher Level 3rd edition

since ln is undefined for the second solution

Note: The R1 may be gained by an appropriate comment earlier.

IB Questionbank Mathematics Higher Level 3rd edition

Note: Award M1 for multiplication of probabilities with decreasing

Note: Award M1 for an expression of this form containing three combinations.

P(9th selected is 4th defective player3 defective in first 8) =

P(9th selected is 4th defective player) =

IB Questionbank Mathematics Higher Level 3rd edition

u1 = a + 2d, u1r = a + 3d and u1r2 = a + 6d

arithmetic 16th term a + 15d =