2023-24 HKDSE MOCK EXAMINATION

MATHEMATICS EXTENDED PART MODULE 2 (ALGEBRA AND CALCULUS) MARKING SCHEME

General Marking Instructions

1. It is very important that all teachers should adhere as closely as possible to the marking scheme. In many
cases, however, students will have obtained a correct answer by an alternative method not specified in the
marking scheme. In general, a correct answer merits all the marks allocated to that part, unless a particular
method has been specified in the question. Teachers should be patient in marking alternative solutions not
specified in the marking scheme.

2. In the marking scheme, marks are classified into the following three categories:
‘M’ marks awarded for correct methods being used;
‘A’ marks awarded for the accuracy of the answers;
Marks without ‘M’ or ‘A’ awarded for correctly completing a proof or arriving
at an answer given in a question.
In a question consisting of several parts each depending on the previous parts, ‘M’ marks should be awarded
to steps or methods correctly deduced from previous answers, even if these answers are erroneous. However,
‘A’ marks for the corresponding answers should NOT be awarded (unless otherwise specified).

3. For the convenience of teachers, the marking scheme was written as detailed as possible. However, it is still
likely that students would not present their solution in the same explicit manner, e.g. some steps would either
be omitted or stated implicitly. In such cases, teachers should exercise their discretion in marking students’
work. In general, marks for a certain step should be awarded if students’ solution indicated that the relevant
concept/technique had been used.

4. In marking students’ work, the benefit of doubt should be given in the students’ favour.

5. In the marking scheme, ‘r.t.’ stands for ‘accepting answers which can be rounded off to’ and ‘f.t.’ stands for
‘follow through’. Steps which can be skipped are shaded whereas alternative answers are enclosed with
rectangles .

6. Unless otherwise specified in the question, numerical answers not given in exact values should not be accepted.

2024-ME-MATH-EP-M2-1 1 © DataMaths Co., Ltd.

Section A

Solution Marks Remarks

1. (a) f(1 + h) – f(1) = 1+ h e 1+h
–e
= e( 1 + h eh − 1) 1
f (1 + h) − f (1)
(b) f ' (1) = lim 1M
h →0 h

= lim
( )
 e 1 + he h − 1 1 + he h + 1 
 
h →0 h 1 + h e h + 1  1M

e[(1 + h)e2h − 1]
= lim
h →0 h( 1 + heh + 1)
(e2h + he2h − 1)
= e lim
h →0 h( 1 + heh + 1)
 e 2h − 1 2 e 2h 
= e lim  lim + lim  Withhold 1M if this step is
 h → 0 2h h → 0 1 + he + 1
h h → 0 1 + he + 1 
h 1M
skipped.
 2 1
= e 1 + 
 2 2
3
= e 1A
2 (5)

2. (4 + 3x)2 = 16 + 24x + 9x2

n(n − 1) 2 n(n − 1)(n − 2) 3
(1 – 5x)n = 1 − 5nx + 25 x − 125 x + ... 1M
2 6
Coeff. of x2 = 9 – 120n + 200n(n – 1) = 1929 1M
 200n2 – 320n + 9 = 1929
200n2 – 320n – 1920 = 0
5n2 – 8n – 48 = 0
(5n + 12)(n – 4) = 0
12
n = 4 or − (rejected) 1A
5
43 4 3 2
Coeff. of x3 = 9(–20) + 24  25  – 16 125  1M
2 6
= –180 + 3600 – 8000
= –4580 1A (5)

2024-ME-MATH-EP-M2-2 2 © DataMaths Co., Ltd.

 Solution Marks Remarks
sin  cos 
3. (a) L.H.S. = −
1 + tan  1 − tan 
sin  − sin  tan  − cos  − cos  tan 
= 1M
1 − tan 2 
sin 
2
sin  − − cos  − sin 
= cos 
sin 2 
1−
cos 2 
sin 2  + cos 2 
−
= cos 
cos 2  − sin 2 
cos 2 
− cos  cos 
= OR
cos  − sin 2 
2
sin  − cos 2 
2

cos 
=
1 − 2 cos 2 
= R.H.S. 1
sin( +  ) cos( +  )
(b) − = 2cos
1 + tan  1 − tan 
OR
sin( +  ) cos( +  )
− = 2cos − sin  − cos 
1 + tan( +  ) 1 − tan( +  ) − = 2 cos 
1 + tan  1 − tan 
cos( +  )  sin  cos 
= 2cos by (a) 
1 − 2 cos 2 ( +  ) 1M − −  = 2 cos 
 1 + tan  1 − tan  
− cos 
= 2cos 1A
1 − 2 cos 2 
cos + 2cos (1 − 2cos2  ) = 0 OR
1
cos (3 − 4cos2  ) = 0 1M cos = 0 or 1 − 2 cos 2  = −
2
3 3
 cos  = 0 (rejected), − (rejected) or
2 2
 
= or − 1A
6 6 (6)

2024-ME-MATH-EP-M2-3 3 © DataMaths Co., Ltd.

 Solution Marks Remarks
4. (a) d 
dx 
(
ln x + x 2 + 1 
 )
1  1 −
1

=  1 + ( x 2 + 1) 2  2 x 
x + x 2 + 1  2  1M
1 x +1 + x
2
= 
x + x +1 2
x2 + 1
1
=
x2 + 1 1A
(b)
 (
y = sin ln x + x 2 + 1 
 )
dy
dx 
 (
= cos ln x + x 2 + 1  ln

d
 dx  ) (x + x2 + 1 )


=
1
x2 + 1
cos ln x + x 2 + 1
 ( ) 1M

d2 y
dx 2
=
1 
x 2 + 1 
 − sin ln x + x 2 + 1 
 ( 1 

 x 2 + 1  )
( )   − 1 ( x 2 + 1) − 2  2 x 
3
+ cos ln x + x 2 + 1
   2  1M

− sin ln ( x + x + 1 )
2
(
cos ln x + x 2 + 1  )
=   + −x  
x2 + 1 ( x + 1)
2
x2 + 1
−y − x dy Substitute either y or y’ to
= + 2 1M
x + 1 x + 1 dx
2 eliminate sine or cosine.
d2 y dy
(1 + x 2 ) 2 = − y − x
dx dx
2
d y d y
(1 + x 2 ) 2 + x + y = 0 1
dx dx (6)
Alternative method

(
y = sin ln x + x 2 + 1 
  )
dy
dx  (
= cos ln x + x 2 + 1  ln x + x 2 + 1 
d
 dx   ) ( )
=
1
x +1
2
cos ln x + x 2 + 1 
  ( ) 1M
2
 dy   
( x 2 + 1)  = cos 2 ln x + x 2 + 1 
 dx    
2
 dy   
( x 2 + 1)  = 1 − sin 2 ln x + x 2 + 1 
 dx    
= 1 − y2 1M

 dy  d y 
2
 dy   dy 
2
2 x  + ( x 2 + 1)  2  2  = −2 y 
 dx   dx  dx   dx  1M

 dy   d2 y 
x  + ( x 2 + 1) 2  = − y
 dx   dx 
d2 y dy
(1 + x 2 ) 2
+x +y=0 1
dx dx

2024-ME-MATH-EP-M2-4 4 © DataMaths Co., Ltd.

 Alternative method

(
Let u = ln x + x 2 + 1 )
du 1 d 2u −x
From (a), = , =
dx x +1
2 dx 2 3
( x 2 + 1) 2 1M
y = sin u
dy du
= cos u
dx dx
dy
2
d2 y d 2 u du dx d u − y  du 
2
du
= cos u + ( − sin u ) =  
1M
dx 2 dx 2 dx dx du dx 2  dx 
dx
dy dy
−x
− x y y
= dx − 2 = 2 dx − 2 1M
1 3
x +1 x +1 x +1
( x 2 + 1) 2
x +1
2

d2 y dy
(1 + x 2 ) 2
+x +y=0 1
dx dx

2024-ME-MATH-EP-M2-5 5 © DataMaths Co., Ltd.

 Solution Marks Remarks
5. (a) x = 1 and y = 4 1A for both correct

(b) y
x=1

(−1, c)
4 y=4

O x
a b

1A for shape
1A for asymptotes
3A 1A for all correct
(c) y2 = f(x) can be plotted only when f(x)  0.
 x  a or x  b. 1A
For the above range, 0  f(x)  c.
 y2  c
− cy c 1A (6)

2024-ME-MATH-EP-M2-6 6 © DataMaths Co., Ltd.

 Solution Marks Remarks
6. (a) x 2
( y − 2) 2
+ =1
9 4
9
x 2 = 9 − ( y − 2) 2
4
h
V=  0
x 2 dy

h
2

9
= 9 − 4 ( y − 2)  dy
0   1M

h
 3 
=  9 y − ( y − 2)3 
 4 0

 3 3 
=  9h − (h − 2)3 + (−2)3 
 4 4 
3
= 12h − (h3 − 6h 2 + 12h − 8) − 8
4  

3
= ( − h3 + 6h 2 )
4
3 2
= h (6 − h) 1
4
dV 3 dh
(b) = (12h − 3h 2 )
dt 4 dt
9 dh
1= ( 4h − h 2 ) 1M
4 dt OR
dh 4
= (4h − h 2 ) −1
dt 9
dh 4
d dh 4 = (4 − 4 + 4h − h 2 ) −1
=  −(4h − h 2 ) −2  (4 − 2h)  dt 9
dh dt 9   1M
8(h − 2) =
4
=
9 (4h − h 2 ) 2 9  4 − (2 − h) 2 

d dh (for completing the square)

Put h = 2, = 0.
dh dt
0<h<2 h=2 2<h<3
d dh
dh dt − 0 +
dh 1M 4 – (2 – h)2 is maximum
 is minimum when h = 2. dh
dt when h = 2. is
dt
dh minimum when h = 2.
The maximum value of does not occur at h = 2.
dt
The claim is disagreed. 1A (6) f.t.

2024-ME-MATH-EP-M2-7 7 © DataMaths Co., Ltd.

 Solution Marks Remarks
1 2 −2
7. (a)  = 2 a −3
5 10 −2a
= − 2a 2 − 30 − 40 + 10a + 30 + 8a 1M
= − 2a 2 + 18a − 40
= −2(a − 4)(a − 5)
Since (E) has a unique solution,   0.
−2(a − 4)(a − 5)  0 1M
a  4 and a  5. 1A
a is any real number except 4 and 5.
(a < 4 or 4 < a < 5, or a > 5)
(b) If (E) has infinitely many solutions,  = 0.
When a = 4:
1 2 −2 2  1 2 −2 2 
   
 2 4 −3 5  ~ 0 0 1 1 
 5 10 −8 b  0 0 2 b − 10
1M
 z = 1, 2z = b – 10
b = 12 1A
Let y = t, x = 4 – 2t. 4−t
The solution set of (E) is {(4 – 2t, t, 1) : t  R} 1A OR (t, , 1)
2
When a = 5:
1 2 −2 2  1 2 −2 2 
   
 2 5 −3 6  ~ 0 1 1 2 
 5 10 −10 b  0 0 0 b − 10
 0 = b – 10,
b = 10 1A
y + z = 2, x + 2y − 2z = 2
Let z = t, y = 2 – t, x = 4t – 2
The solution set of (E) is {(4t – 2, 2 − t, t): t  R} 1A (8) OR (6 – 4t, t, 2 − t)

2024-ME-MATH-EP-M2-8 8 © DataMaths Co., Ltd.

 Solution Marks Remarks
8. (a) For n = 1,
L.H.S. = sin cos 2
1
R.H.S. = (sin 3 − sin )
2
1 3 −  3 + 
=  2 sin cos
2 2 2
= sin cos 2
= L.H.S.
The statement is true for n = 1. 1
Assume the statement is true for n = m, i.e.,
m
1
sin   cos 2k = sin(2m + 1) − sin   1M
k =1 2
For n = m + 1,
1
R.H.S. = sin(2m + 3) − sin  
2
m +1
L.H.S. = sin   cos 2k
k =1
m
= sin   cos 2k + sin  cos 2(m + 1)
k =1

1 1
= sin(2m + 1) − sin   + sin(2m + 3) + sin(−2m − 1)  1M + 1M
2 2
1
= sin(2m + 1) − sin  + sin(2m + 3) − sin(2m + 1) 
2
1
= sin(2m + 3) − sin  
2
= R.H.S.
The statement is also true for n = m + 1. By mathematical
induction, the statement is true for all positive integers n. 1
 n
 n k 1 n k
(b) Take  = , sin   cos 2k = sin  cos =  cos .
6 k =1 6 k =1 3 2 k =1 3
By (a),
1 n k 1   
 cos 3 = 2 sin(2n + 1) 6 − sin 6 
2 k =1
1M
n
k  1
 cos 3
= sin(2n + 1) −
6 2
k =1

 
R.H.S. is the greatest when (2n + 1) = 2N + , where N
6 2
is a positive integer.
 
(2n + 1) = 2N +
6 2 1M
2n + 1 = 12 N + 3
n = 6N + 1
Given n > 2024
2024 − 1
N>
6
1
= 337
6
The required integer = 6  338 + 1
= 2029 1A (8)

2024-ME-MATH-EP-M2-9 9 © DataMaths Co., Ltd.

Section B

Solution Marks Remarks

9. (a) ( x − 1) 3
f (x) =
( x + 1) 2
( x + 1) 2  3( x − 1) 2 − ( x − 1)3  2( x + 1) 1M
f ’(x) =
( x + 1) 4
( x + 1)( x − 1) 2 3( x + 1) − 2( x − 1) 
=
( x + 1) 4
( x − 1) 2 ( x + 5)
= 1
( x + 1) 3
f ’’(x) =
 
( x + 1) 3 2( x − 1)( x + 5) + ( x − 1) 2 − ( x − 1) 2 ( x + 5)  3( x + 1) 2
( x + 1) 6
3( x + 1)( x − 1)( x + 3) − 3( x − 1) 2 ( x + 5)
=
( x + 1) 4
3( x − 1)( x 2 + 4 x + 3 − x 2 − 4 x + 5)
=
( x + 1) 4
24( x − 1)
= 1A
( x + 1) 4
(b) When f ’(x) = 0, x = 1 or −5.
x (−, −5) −5 (−5, −1) −1 (−1,1) 1 (1, ) 1M
f (x) +ve 0 −ve undef +ve 0 +ve
27
The only extreme point is a maximum point at (−5, − ). 1A
2
f ’’(1) = 0
x (−1, 1) 1 (1, )
1M
f (x) −ve 0 +ve
The only point of inflexion is (1, 0). 1A
(c)(i) 1
Slope of L = f’(3) = .
2
Equation of L:
1
y−
2=1
x−3 2
1
x – 2y – 2 = 0 OR y = x − 1
2 1A
(ii) ( x − 1) 3
f (x) =
( x + 1) 2
For 1 < x < 3, since (x – 1)3 > 0, f(x) > 0.
G lies above the x- axis on (1, 3). 1
L is tangent to G at x = 3. The slopes of L and G are equal OR
at x = 3. ( x − 1)3 x − 2
24( x − 1) −
For 1 < x < 3, since f ’’(x) = > 0, the slope of G is ( x + 1) 2 2
( x + 1) 4
2( x − 1)3 − ( x − 2)( x + 1) 2
less than the slope of L for 1 < x < 3. G lies above L on =
(1,3). 2( x + 1) 2
1
x( x − 3) 2
= > 0 for 1 < x < 3.
2( x + 1) 2

2024-ME-MATH-EP-M2-10 10 © DataMaths Co., Ltd.

 (iii) 1
(3, )
2
(1, 0) G

(2, 0)

3 ( x − 1)3 1 1
The shaded area = 1 ( x + 1) 2
dx −  1
2 2 1M
4 (t − 2) 3

1
= 2
dt −
(put t = x + 1) 1M
2 t 4
4 12 8 1
=  (t − 6 + − 2 )dt −
2 t t 4
4
1 8 1
=  t 2 − 6t + 12 ln t +  −
 2 t 2 4
33
= 12 ln 2 − square units 1A
4 (13)
Alternative method
3 ( x − 1)3 1 1
The shaded area = 1 ( x + 1)2 dx − 2 1 2 1M
3  12( x + 1) − 8 

1
= x − 5 +  dx −
1
 ( x + 1) 2
 4 1M
3  8 

12 1
= x − 5 + − 2
dx −
1
 x + 1 ( x + 1)  4
3
 x2 8  1
=  − 5 x + 12 ln( x + 1) +  −
 2 x + 1  4
1
33
= 12 ln 2 − square units 1A
4

2024-ME-MATH-EP-M2-11 11 © DataMaths Co., Ltd.

 Solution Marks Remarks
x d x
0 tf (t )dt = x + f ( x) and
dx 0
tf (t )dt = xf ( x)
10. (a) 2
Given

 xf ( x) = 2 x + f '( x) 1M
d  1
- x2  1
- x2  1 
1
- x2
 f ( x )e 2 = f ( x )e 2  −  2x  + f '( x)e 2
dx    2  1M
1
- x2
= e 2 f '( x) − xf ( x)
1 2
f '( x) − 2 x − f '( x)
- x
=e 2

1 2
- x
= −2 xe 2
1
(b) From (a),
1 2 1 2
- x - x
f ( x )e 2 =  −2 xe 2 dx

1 2
- x 1 2
=  2e 2 d( − x )
2
1 2
- x
= 2e 2 +C 1M
x
0 tf (t )dt = x + f ( x)
2

0
Put x = 0, 0 tf (t )dt = 0 + f (0) . 1M
 f(0) = 0
0=2+C
C = −2
1 2 1 2
- x - x
f ( x )e 2 = 2e 2 −2
1 1
- x2 x2
f ( x) = (2e 2 − 2)e 2
1
x2 1
= 2 − 2e 2
x Accept
0 tf (t )dt = x + f ( x)
2
(c) (i)
1 1  1 2 
 2 x − 2 xe 2 x dx
1
  xf ( x)dx = 1 + f (1)
0
2 0
xf ( x)dx = 
0 



1 1
= 1 + 2 − 2e 2  x 
1 2
=  x 2 − 2e 2 
  0
1
= 3 − 2e 2
1
1A
= 3 − 2e 2
1
1 n 1 x2
(ii)
0 x f ( x)dx =  x n (2 − 2e 2 )dx
0
1
 x n +1  1 n −1
1 2
x
= 2
 n + 1

0
− 2 0
x d(e 2 )

1
2  x 
1 2
1
1 2
x
= − 2  x n −1e 2  + 2 e 2 d(x n −1 ) 1M
n +1  
0
0
1
2 1 f ( x)
= − 2e 2 + 2 (1 − )d(x n −1 ) 1M
n +1 0 2

1
2 1 1
= − 2e 2 + 2  x n −1  −  f ( x)d(x n −1 )
n +1 0 0

2024-ME-MATH-EP-M2-12 12 © DataMaths Co., Ltd.

 1
2 1
= − 2e 2 + 2 − (n − 1)  x n − 2 f ( x)dx
n +1 0

4 + 2n
1
1
= − 2e 2 − (n − 1)  x n − 2 f ( x)dx 1
1+ n 0

1
1 4+6 1
 
(iii)
x 3f ( x)dx = − 2e 2 − 2 x f ( x)dx 1M
0 1+ 3 0
1
5
= − 2e 2 − 2(3 − 2 e )
2
1
7
= 2e 2 − 1A
2 (12)

2024-ME-MATH-EP-M2-13 13 © DataMaths Co., Ltd.

 Solution Marks Remarks
11. (a)(i) det Q = −  0
 Q-1 exists. 1
(ii) 1  −1 −1
Q-1 =  
−  0  
1 1 1 
=   1A
  0 − 
 3 
1  1   −1   1 1 
-1
QPQ =      0 − 
 0 −1 
 0 2 − 3 
1  1   2 − 3 
=    1M
 0 −1 0 − (2 − 3) 
 0 
=   1A
 0 2 − 3 
(iii)  0 
P = Q-1  Q
 0 2 − 3

n
0 
Pn = Q-1   Q 1M
 0 2 − 3 
 n 0 
= Q-1 
 0 (2 − 3) 
n
Q
 
 h =  n , k = (2 − 3)n 1A
1  1 
3  2 − 1  5
Let  = . P =  2
1
(b)(i) = =R
2    2  1M
 0 1− 3   0 −2 
 n
0 
Rn = Q-1 
 0 (2 − 3) n 
Q
 
 1  n

1 1   0  1 
1
= 2  2   2
 0 − 1      1M
 2  0
1
(2  − 3) n   0 −1
 2 
  1 n  1 
 2 2   0  1
=   2   2 
 0 −1  n  0 −1
 0 (−2)  
  1 n +1 1 
n
 2 2     
=   2  2 
 0 −1  
 0 −(−2)n 
  1 n 1
n −1

 + (−2)n +1 
=   2   
2 
  1A
 0 (−2) n

(ii) R + R2 + R3 + … + R10
=
 1 2 10 1
0
1
9

 1   1  1   + ... +   
  + 
 2   2  + ... +   2 2 
 2
+(−2) 2 + (−2)3 + ... + (−2)11  1M
 
 (−2)1 + (−2) 2 + ... + (−2)10 
 0

2024-ME-MATH-EP-M2-14 14 © DataMaths Co., Ltd.

  1 1 
  1  1 − 210 1 − 210 (−2)10 − 1 
  + 4 
  2  1− 1 1 −
1 −2 − 1 
=
 2 2 
 
 (−2) − 1 
10
0 (−2)   1M
 −2 − 1 
 1023 1023 
− 1364 
=  1024 512
 
 0 682 
 1023 1   1023 697345 
−1362  1024 − 512 
=  1024 512  OR
    1A
 0 682   0 682  (12)

2024-ME-MATH-EP-M2-15 15 © DataMaths Co., Ltd.

 Solution Marks Remarks
i j k
12. (a) OA  OB = 1 2 − 1
1M
−1 0 2
= 4i − j + 2k 1A Accept any multiple of this.
(b) Let OC = xi + yj + zk
 OC ⊥ OA  OB , OC • (OA  OB) = 0 .
(xi + yj + zk) • (4i − j + 2k) = 0 1M
4x – y + 2z = 0 --- (1) OR
1 1 1
OM = OA = (i + 2j – k) MC = OC − OM = OC − OA
2 2 2
1 1
MC = OC − OM = ( x − )i + ( y − 1) j + ( z + )k  MC ⊥ OA , MC • OA = 0 .
2 2 1M
 1 
 MC ⊥ OA , MC • OA = 0 .  OC − OA  • OA = 0
 2 
 1 1 
( x − 2 )i + ( y − 1) j + ( z + 2 )k  • (i + 2 j − k ) = 0 1 2
 
1M OC • OA = OA
2
x + 2y – z = 3 --- (2) 1A x + 2y – z = 3
1 1 1
ON = OB = (–i + 2k) NC = OC − ON = OC − OB
2 2 2
1 NC ⊥ OB NC • OB = 0 .
NC = OC − ON = ( x + )i + yj + ( z − 1)k ,
2  1 
 NC ⊥ OB , NC • OB = 0 .  OC − OB  • OB = 0
 2 
 1 
( x + 2 )i + yj + ( z − 1)k  • (−i + 2k ) = 0
1 2
  OC • OB = OB
2
5
x – 2z = − --- (3) x – 2z = −
5
2 2
Solving (1), (2) and (3),
 
4 − 1 2   x   0 
1 2 − 1   y  =  3 
    
1 0 − 2  z  − 5 
 2
 1
  − 
 −4 1 −2   0   14 
T
 x
 y  = − 1  −2 −10 −1  3  =  15 
  21      7 
 z   −3 6 9   5   
 −   17  Accept using any other method
 2 
 14  to solve the simultaneous
equations.
1 15 17
Position vector of C = − i + j+ k 1A
14 7 14
Alternative Method
Let OC = a ( i + 2 j − k ) + b ( −i + 2k ) for some a, b  R
= (a – b)i + 2aj+ (– a + 2b)k 1M

MC ⊥ OA , MC • OA = 0 .
 1 1 
(a − b − 2 )i + (2a − 1) j + (−a + 2b + 2 )k  • (i + 2 j − k ) = 0
1M+1M
 

 2a – b = 1 --- (1) 1A

2024-ME-MATH-EP-M2-16 16 © DataMaths Co., Ltd.

 NC ⊥ OB , NC • OB = 0 .
 1 
(a − b + 2 )i + 2aj + (−a + 2b − 1)k  • (−i + 2k ) = 0
 
5
 –3a + 5b = --- (2)
2
Solving (1) and (2)
15 8
a= ,b=
14 7
1 15 17
OC = − i + j + k 1A
14 7 14
1 1
(c)(i) OL = (OA + OB) = j + k
2 2
LP = OP − OL
1
= (3i + 4j +5k) – (j + k)
2
9
= 3i + 3j + k
2
3
= 3(i + j + k)
2
3
Let LQ =  (i + j + k )
2
CQ = CL + LQ = OL − OC + LQ
1 1 15 17 3
= ( j + k ) − (− i + j + k) + (i + j + k )
2 14 7 14 2
1 8 3 5
= ( + )i + ( − ) j + (  − )k 1M
14 7 2 7
CQ ⊥ LQ , CQ • LQ = 0
 1 8 3 5 3
( + 14 ) + ( − 7 ) + ( 2  − 7 ) 2  = 0
 
60
=
119
137 76 5
CQ = i− j+ k 1
238 119 119
Alternative method
1 1
OL = (OA + OB) = j + k
2 2
LP = OP − OL
1
= (3i + 4j +5k) – (j + k)
2
9
= 3i + 3j + k
2
3
= 3(i + j + k)
2
CL = OL − OC
1  1 15 17 
= j+ k −− i + j+ k 
2  14 7 14 
1
= ( i − 16 j − 10k )
14

CQ ⊥ LQ
CL • PL = LQ LP

CQ = CL + LQ

2024-ME-MATH-EP-M2-17 17 © DataMaths Co., Ltd.

 CL • PL
= CL + LP
| LP|2
1 3
1 ( i − 16 j − 10k ) • 3(i + j + k )
= ( i − 16 j − 10k ) − 14 2 3(i + j + 3 k )
14 3 3 2
3(i + j + k ) • 3(i + j + k ) 1M
2 2
137 76 5
= i− j+ k 1
238 119 119

(ii) The height of the pyramid

OR
CQ • (OA  OB)
= OA  OB CQ • (OA  OB)
(OA  OB) • (OA  OB) =
1M OA  OB
137 76 10 137 76 10
4 + + 4 + +
= 238 119 119 (4i − j + 2k ) = 238 119 119
16 + 1 + 4 16 + 1 + 4
120
= 21
120 833
= 21 1A
833
1 1
(iii) Area of OAB = OA  OB = 21 1M
2 2
1 1 120
Volume of pyramid OABQ =  21  21
3 2 833
60
= 1A
119 (13)

2024-ME-MATH-EP-M2-18 18 © DataMaths Co., Ltd.