Académique Documents
Professionnel Documents
Culture Documents
Paper 1
S/N Solutions
1 Let un = an 3 + bn 2 + cn + d
3 2
a (1) + b (1) + c (1) + d = 63
u1 = 63 :
a + b + c + d = 63 − (1)
3 2
a ( 2 ) + b ( 2 ) + c (2) + d = 116
u2 = 116 :
8a + 4b + 2c + d = 116 − (2)
3 2
a ( 3) + b ( 3) + c(3) + d = 171
u3 = 171 :
27a + 9b + 3c + d = 171 − (3)
3 2
a ( 4 ) + b ( 4 ) + c (4) + d = 234
u4 = 234 :
64a + 16b + 4c + d = 234 − (4)
Using the GC APPL to solve (1), (2), (3), (4) simultaneously, we get:
a = 1, b = −5, c = 61, d = 6
un = n3 − 5n 2 + 61n + 6
3 2
Hence u50 = ( 50 ) − 5 ( 50 ) + 61 ( 50 ) + 6 = 115556
2 1− x 2
≤ x −1 , x ≠
2 − 3x 3
1− x
+1− x ≤ 0
2 − 3x
1 − x + (1 − x )(2 − 3 x )
≤0
2 − 3x
(1 − x)(1 + 2 − 3 x )
≤0
2 − 3x
(1 − x)(3 − 3 x )
≤0
2 − 3x
3(1 − x) 2
≤0
2 − 3x
3(1 − x ) 2 (2 − 3 x) ≤ 0
2 1
3
2
x>
3
2
Hence, to solve 1 − x 2 ≤ x 2 − 1 .
2 − 3x
2
Replace x by x ,
8 1 3 8
= 3 2 + 6 x + 2 3 2 x 2
+ 2 3x 2
x 2 2 x
24 48
= 2 + 6 x + 3x2 +
x x
= 3 x + 6 x + 48 x + 24 x −2
2 −1
dC
= 6 x + 6 − 48 x −2 − 48 x −3 = 0
dx
dC
=0
dx
6 x + 6 − 48 x −2 − 48 x −3 = 0
6 x 4 + 6 x 3 − 48 x − 48 = 0
6 x 3 ( x + 1) − 48( x + 1) = 0
(6 x 3 − 48)( x + 1) = 0
6 x 3 = 48 or x = −1( rejected )
x=2
2 −1 −2
C = 3 ( 2 ) + 6 ( 2 ) + 48 ( 2 ) + 24 ( 2 )
= 12 + 12 + 24 + 6
= 54
SAJC H2 Mathematics Prelim Solutions Page 2 of 10
Minimum cost C is $54.
d 2C −3 −4
2
= 6 + 96 ( 2 ) + 144 ( 2 ) > 0
dx
4(a) w2 = 3 + 4i
Let w = x + iy
( x + iy ) 2 = 3 + 4i
x 2 + 2 xyi − y 2 = 3 + 4i
x 2 − y 2 = 3 ----- (1)
2 xy = 4 ----- (2)
2
From eq (2): y =
x
2
2
Sub into eq (1): x − = 3 ⇒ x 4 − 3 x 2 − 4 = 0
2
x
Solving, we get x = ±2 , y = ±1
Hence w = ± (2 + i )
Let z 4 = −16
(b)
z 4 = 16eiπ
z 4 = 16ei (π + 2 kπ )
1 i (π + 2 k π )
z = 2e 4 , k = −2, −1, 0,1
iπ i 34π −i 34π −i π4
z = 2e 4 , 2e , 2e , 2e
Im(z)
z2 z1
2
π
4 Re(z)
O
z3 z4
5(a)
(i) Let y = x 2 − 3
x = ± y+3
Since x ≤ 0 , x = − y + 3
f −1 : x a − x + 3 , x ≥ −3
0 x
y = f-1f(x) y = f-1(x)
(iii) gf −1 ( x ) = g ( − x + 3) = −2 x + 3 + 4
(ii) y
12
3–
x
-6 0 6 12
6(i) −π π
≤t ≤
2 2
The only axes intercept is at (0,0).
7(i) 2x + 4 y − z = 8
x + 2z = 6
From G.C, x = 6 – 2z, y = –1 + 1.25z, z = z
6 −2
vector equation of l: r = −1 + λ 1.25 , λ ∈
0
1
x
(ii) uuur
OF1 = y
z
F1 is on π1 ⇒ 2x + 4y – z = 8 --- (1)
8(i) Let the height ascended by the athlete and robot after n pulls be An and Rn
respectively.
n
(iii) 2× [ 2 x + (n − 1)(−0.02)]
2
= 2nx − 0.02n(n − 1)
16
Robot will reach the top after = 40 pulls.
0.4
Athlete must reach top by 39th pull.
−1
9(i) dy e tan x
=
dx 1 + x 2
−1
dy e tan x
∫ dx ∫ 1 + x 2 dx
d x =
−1
∴ y = e tan x
+C
When x = 0, y = 1 ⇒ 1 = e0 + C ⇒ C = 0
−1
Thus y = e tan x
−1
(ii) dy e tan x y
= 2
=
dx 1 + x 1 + x2
dy
(
⇒ 1 + x2
dx
)
=y
Differentiating w.r.t. x,
d2 y dy dy
(1 + x2 ) dx 2
+ 2x =
dx dx
2
(
⇒ 1 + x2 ) ddxy + (2 x − 1) ddyx = 0
2
Differentiating w.r.t. x,
d3 y d2 y d2 y dy
(1 + x2
dx 3 )
+ 2 x
dx 2
+ (2 x − 1)
dx 2
+2
dx
=0
d3 y d2 y dy
⇒ 1 + x2( dx 3
+ (4 )
x − 1)
dx 2
+ 2
dx
=0
When x = 0, y = 1 (given)
dy d2 y d3 y
= 1, 2 = 1, 3 = −1
dx dx dx
Thus Maclaurin series is
1 1
y = 1 + x + x 2 − x3 + L
2 6
tan −1 x
(iv) e −1
2
= e tan x (1 + x) −2
(a) (1 + x)
1 1
2 6
(
= 1 + x + x 2 − x 3 + ... 1 − 2 x + 3 x 2 + ... )
3
= 1 − x + x 2 + ...
2
(b) 2 x + tan −1 x 2 x tan −1 x
e =e e
(2 x) 2 1 1
= 1 + 2 x + + ... 1 + x + x 2 − x 3 + ...
2! 2 6
9 2
= 1 + 3x + x + ...
2
n
10(a) Let P(n) be the statement ∑ ( r !× r ) = ( n + 1)! − 1, for all n ∈
r =1
+
Proving P(1)
1
LHS = ∑ ( r !× r ) = 1
r =1
RHS = (1 + 1) !− 1 = 1
∴ P(1) is true
∑ ( r !× r ) = ∑ ( r !× r ) + ( k + 1)!× ( k + 1)
r =1 r =1
= ( k + 1) ! − 1 + ( k + 1) ! × ( k + 1)
+
by Mathematical Induction, P(n) is true for all n ∈
1
π 4sin θ
∫ 0
4
sin θ + cos θ
dθ
π π
= 2[θ ]04 − 2[ln(sin θ + cos θ )]04
π π
= − ln 2 (or − 2 ln 2)
2 2
(b)(i) 2t A B
2
= +
(t + 1) (t + 1) (t + 1)2
Solving, we have A = 2, B = –2
(ii) Using substitution t = 2 x − 1 ,
t 2 +1
x= ,
2
dt 1 1
= =
dx 2x −1 t
When x =1, t = 1
x = 5, t = 3
Hence
5 3
1 1
∫1 x + 2 x − 1 d x = ∫1 t 2 +1 + t (t ) dt
( )
2
3
2t
=∫ 2
dt
1
t + 2t + 1
3
2t
=∫ dt
1
(t + 1) 2
3
1 1
= 2∫ ( − ) dt from b(i )
1
t + 1 (t + 1)2
1 3
= 2[ln(t + 1) + ]1
t +1
1
= 2 ln 2 −
2