1(a)

(b)(i) y = g(x) y = g2(x)

(b)(ii) 1 1
∫g (x) dx = .
2013
0 2

2(a)
( )
n
1− x 2 + x 4 − + −1 x 2n is a geometric sequence with first term 1 and common ratio
(i)
− x2 .
( ) ⎞⎠ 1+ (−1) x
⎛ 1− −x 2 n+1
n 2n+2
⎝
( )
n
∴1− x + x − + −1 x =
2 4 2n
=
1− ( −x )
2
2
1+ x
(a) Integrating the relation above from 0 to 1,
1 1 + ( −1) x
(ii) 1
n 2n+2

∫0 1 − x + x − L + ( −1) x dx = ∫0 1 + x 2 dx
2 4 n 2n

( −1) x 2 n + 2
n
1 1 n 1 x
2n+2
π n 1 x
2n+2
dx = ⎣ tan x ⎦ + ( −1) ∫ dx = + ( −1) ∫
1
Sn = ∫ + ⎡ −1
⎤ dx.
0 1 + x2 1 + x2 0 0 1 + x2 4 0 1 + x2

(a) From (a)(ii) we have

(iii) π n 1 x
2n+2
π 1 x
2n+2
1 x
2n+2
Sn − = ( −1) ∫
4 ∫0 1 + x 2 ∫0 1 + x 2 dx
dx ⇒ S n − = dx ≤
4 0 1 + x2

Since 1 + x 2 ≥ 1,
π 1 1
Sn − ≤ ∫ x 2 n + 2 dx = .
4 0 2n + 3

RI 2013 9824/01/S/13
 (b) 1
π sin(2n + 1)x
1
π sin(2n −1)x
(i) I n − I n−1 = ∫
4
dx − ∫ 4 dx
0 sin x 0 sin x
1
π sin(2n + 1)x − sin(2n −1)x
= ∫4 dx
0 sin x
1
π 2cos(2nx)sin x
= ∫4 dx
0 sin x
2 π /4 1 ⎛ nπ ⎞
= ⎡⎣sin 2nx ⎤⎦ = sin ⎜ ⎟ .
2n 0 n ⎝ 2⎠

(b) 1
πsin11x
(ii) ∫0
4
sin x
dx = I5
Using the relation above,
1 ⎛5 ⎞ 1 ⎛4 ⎞ 1 ⎛3 ⎞
I 5 − I 4 = sin ⎜ π ⎟ I 4 − I 3 = sin ⎜ π ⎟ I 3 − I 2 = sin ⎜ π ⎟
5 ⎝ 2 ⎠, 4 ⎝ 2 ⎠, 3 ⎝ 2 ⎠,
1 ⎛2 ⎞ 1 ⎛1 ⎞
I 2 − I1 = sin ⎜ π ⎟ I1 − I 0 = sin ⎜ π ⎟
2 ⎝ 2 ⎠, 1 ⎝2 ⎠
Summing all, we have
1 ⎛5 ⎞ 1 ⎛4 ⎞ 1 ⎛3 ⎞ 1 ⎛2 ⎞ 1 ⎛1 ⎞
I 5 − I 0 = sin ⎜ π ⎟ + sin ⎜ π ⎟ + sin ⎜ π ⎟ + sin ⎜ π ⎟ + sin ⎜ π ⎟
5 ⎝2 ⎠ 4 ⎝2 ⎠ 3 ⎝2 ⎠ 2 ⎝2 ⎠ 1 ⎝2 ⎠
1 1 1 1 1 π
I 5 = (1) + (0) + (−1) + (0) + (1) +
5 4 3 2 1 4
π 13
= + .
4 15

3(i)

1
Since the area of the rectangles is greater than the area under the graph of y =
x

∫
n+1
1 1 1 1 dx
between 1 and n + 1, + + + ... + > .
1 2 3 n 1 x
(ii) 1 2
Sketch of y = sin x and y = ax. From the graph, largest a = = .
π
2
π

RI 2013 9824/01/S/13
 (iii) 1 1 1 1 2 ⎛1 1 1 1⎞
sin + sin + sin + ... + sin > ⎜ + + + ... + ⎟
1 2 3 n π ⎝1 2 3 n⎠
2 n+1 dx 2
> ∫ = ln(n +1)
π 1 x π
1 1 1 2
Hence the series sin + sin + sin + ... diverges as ln(n +1) → ∞ when n → ∞ .
1 2 3 π
1 1 1
For k = 2, the series sin k + sin k + sin k + ... converge as it is always increasing
1 2 3
and less than 2.
1 1 1 1 1
For k > 2, the series sin k + sin k + sin k + ... converge as sin k < sin 2 .
1 2 3 i i

4 x2 − a2 a2
y= 2 = 1+ 2
x − 2a 2 x − 2a 2
dy 2a 2 x
=− 2
dx ( x − 2a 2 ) 2
( p 2 − 2a 2 )2
Gradient of normal at x = p is .
2a 2 p
Let c be the y-intercept of the normal. Then,
p 2 − a 2 ( p 2 − 2a 2 )2 p 2 − a 2 ( p 2 − 2a 2 )2
= p + c ⇒ c = −
p 2 − 2a 2 2a 2 p p 2 − 2a 2 2a 2
⎛ ( p 2 − 2a 2 ) ⎞
2
p 2
− a 2
Thus, the normal cuts the y-axis at ⎜ 0, 2 − ⎟.
⎜ p − 2a 2 2a 2 ⎟
⎝ ⎠
(i) ⎛ ( p 2 − 2a 2 ) ⎞
2
p 2
− a 2
Note that the centre of the circle D is ⎜ 0, 2 − ⎟ . The circle touches
⎜ p − 2a 2 2a 2 ⎟
⎝ ⎠
⎛ 1⎞
⎜ 0, ⎟ . So, the radius of the circle is
⎝ 2⎠
( ) ( )
2 2
p2 − a2 p 2 − 2a 2 1 p2 p 2 − 2a 2
− − = − .
p 2 − 2a 2 2a 2 (
2 2 p 2 − 2a 2 ) 2a 2
⎛ p2 − a2 ⎞
The circle also touches ⎜ p, 2 2 ⎟
.
⎝ p − 2a ⎠
RI 2013 9824/01/S/13
 2 2

p − a 2 ⎜ p 2 − a 2 ( p − 2a ) ⎟ ⎟ ⎜ ( p 2 − 2a 2 ) ⎞
⎛ 2 ⎛ 2 2 2 ⎞⎞ ⎛ 2

⎜ p2 ⎟
p + 2
2
− − = −
⎜ p − 2a 2 ⎜ p 2 − 2a 2 2 a 2
⎟ ⎟ ⎜ 2 ( p 2 − 2a 2 ) 2 a 2
⎟
So, ⎝ ⎝ ⎠⎠ ⎝ ⎠
2
(p − 2a 2 ) ⎛ ( p 2 − 2a 2 ) ⎞
2 4 2

⎜ p2 ⎟
⇒ p2 + = −
4a 4 ⎜ 2 ( p 2 − 2a 2 ) 2a 2 ⎟
⎝ ⎠
(ii) Simplifying the equation found in (i), we obtain
1 1
( p 2 − 2a 2 ) 2 = a 2 ⇒ p 2 = 2a 2 ± a
2 2
1
In order for the circle to touch the 3 branches of C, p > 2a . So, p 2 = 2a 2 + a.
2
⎛ ( ) ⎞
2
p2 − a2 p 2 − 2a 2
⎜
Centre of circle is 0, 2 − ⎟ = ⎛ 0, 2a + 3 ⎞
⎜ p − 2a 2 2a 2 ⎟ ⎜⎝ 4⎠
⎟
⎝ ⎠
( )
2
p2 p 2 − 2a 2 1
Radius of circle is = − = 2a +
(
2 p 2 − 2a 2 )
2a 2 4
2 2
⎛ 3⎞ ⎛ 1⎞
So, the Cartesian equation of D is x + ⎜ y − 2a − ⎟ = ⎜ 2a + ⎟
2

⎝ 4⎠ ⎝ 4⎠

5(a)(i) ⎛ 7⎞ ⎛ 12⎞
Number of ways passing through A = ⎜ ⎟ ⎜ ⎟ = 32340.
⎝ 3⎠ ⎝ 6 ⎠
(a)(ii) ⎛ 12⎞ ⎛ 6⎞
Number of ways using the path BC = ⎜ ⎟ ⎜ ⎟ = 15840 .
⎝ 5 ⎠ ⎝ 3⎠
⎛ 7 ⎞⎛ 5 ⎞⎛ 6 ⎞
Number of ways passing through A and BC = ⎜ ⎟⎜ ⎟⎜ ⎟ = 7000
⎝ 3 ⎠⎝ 2 ⎠⎝ 3 ⎠
Thus total number of ways not passing through A and BC is =
⎛19 ⎞
⎜ ⎟ − 32340 − 15840 + 7000 = 51198.
⎝10 ⎠
(b)(i) ⎛ 9⎞
Number of ways = ⎜ ⎟ = 36 .
⎝ 2⎠
(b)(ii) Number of ways = 310 = 59049.
(c) ⎛ 10⎞
If the labeled Tupperware has r buns (0 ≤ r ≤10). There are ⎜ ⎟ ways to choose the
⎝r ⎠
r buns. Then we have to find the number of ways to distribute 10 – r buns into 2
identical boxes, which is 29 – r for 0 ≤ r ≤ 9 and 1 way for r = 10.
9
⎛10 ⎞
Hence total number of ways = ∑ ⎜ ⎟ 29− r + 1 = 29525.
r =0 ⎝ r ⎠

(d) Number of ways to distribute 7 kaya buns into 3 identical Tupperware = P(7, 1) + P(7,
2) + P(7, 3). For P(7, 1) the partition is essentially (7, 0, 0). There are 2 ways to add 1
butter bun. For P(7, 2) the partitions are (6, 1, 0), (5, 2, 0) and (4, 3, 0). For each of
the 3 partitions, there are 3 ways to add 1 butter bun. For P(7, 3) the partitions are (5,
1, 1), (4, 2, 1), (3, 3, 1) and (3, 2, 2). Except for the 2nd partition which allows 3
different ways to add 1 butter bun, each of the other 3 partitions only allows 2 distinct
ways. Thus total number of ways = 2 + 9 + 2 + 3 + 2 + 2 = 20.

RI 2013 9824/01/S/13
 6(i) a1 = 0, a2 = 1, a3 = 2.
(ii) Consider the 1st house. If it is delivered the letter which belongs to house k, consider
the kth house. There are 2 cases. If it is delivered the letter of the 1st house, then there
are an−2 ways to deliver the other letters. If it is delivered the letter of another house
(not the 1st’s), then there are an−1 ways to do so. Since k can take on any value except
1, there are n – 1 such possibilities for the letter to the 1st house. Hence by MP and
AP, we have an = (n −1)[an−1 + an−2 ] .
(iii) a10 = 1334961.
(iv) This is because there are (n – k)! permutations left after i1, i2 ,..., ik are fixed.
(v) By the Principle of Inclusion and Exclusion, we have the number of ways =
n
⎛n⎞
∑ k +1
⎜ ⎟(−1) ( n − k )!
k =1 ⎝ k ⎠
n
n!
= ∑ (−1) k +1 (n − k )!
k =1 k !(n − k )!
⎛ 1 1 (−1) n −1 ⎞
= n !⎜1 − + − ... + ⎟.
⎝ 2! 3! n! ⎠
(vi) Hence
⎛ 1 1 (−1)n−1 ⎞
an = n!− n!⎜ 1 − + −... +
⎝ 2! 3! n! ⎟⎠
⎛1 1 1 1 (−1)n ⎞
= n!⎜ − + − + ... +
⎝ 0! 1! 2! 3! n! ⎟⎠
an 1 1 1 1 (−1)n
⇒ = − + − + ... +
n! 0! 1! 2! 3! n!
∞ n ∞ n
x (−1)
Since e x = ∑ , e −1 = ∑
n=0 n! n=0 n!
an ⎛1 1 1 1 (−1)n ⎞ 1
lim = lim ⎜ − + − + ... + = .
n→∞ n! n→∞ ⎝ 0! 1! 2! 3! n! ⎟⎠ e
This means that for sufficiently large n, the probability that no letter gets to the
correct house is 1/e.

7(i) dP 3P 2 P
= 6P − = 6 P(1 − ) . Therefore, carrying capacity is 400.
dt 200 400
(ii) dP
For population to be strictly increasing, > 0 ⇒ 0 < P < 400
dt

dP
For population to be strictly decreasing, < 0 ⇒ P > 400
dt

(iii) dP 3P 2 P
= 6P − = 6P(1− )
dt 200 400

∫ ∫
1
dP = 6 dt
⎛ P ⎞
P ⎜1 − ⎟
⎝ 400 ⎠

RI 2013 9824/01/S/13
 By partial fractions, we have

∫ ∫
⎛1 1 ⎞
⎜⎝ P + 400(1− P
) ⎟⎠
dP = 6 dt
400

⎛ P ⎞
ln P − ln ⎜ 1− = 6t + c
⎝ 400 ⎟⎠
⎛ P ⎞
ln ⎜ P ⎟
= 6t + c
⎝ 1− 400 ⎠

P
= e6t+c = Ae6t
1− 400
P

where A is a non-zero constant. Solving for P we get

⎛ A 6t ⎞ 400Ae6t
P ⎜ 1+ e = Ae ⇒ P =
6t

⎝ 400 ⎟⎠ 400 + Ae6t

400 A 400e6t
At t=0 and P = 200, 200 = ⇒ A = 400.∴ P =
400 + A 1 + e6t
(iv)

dP 3P 2
f ( P) = = 6P −
dt 200
3P
f '( P) = 6 − =0
100
P = 200
dP 3(200) 2
∴ = 1200 − = 600
dt 200

Thus, the maximum number of animals to be infected to ensure the survival

is 600 per week.
(v) Assume the maximum infection rate which is 600 per week,
dP
If P0 = 1000, < 0 , the population of animals will decrease to an equilibrium value
dt
of 200 in a finite amount of time.

8(a) dx
−r is the damping force. It is present due to air resistance and other forces acting
dt
on the spring system.

RI 2013 9824/01/S/13
(b) From characteristic equation, one has m2 + rm + 25 = 0 . For over-damping to occur,
discriminant = r 2 − 4(25) > 0 ⇒ r > 10
(c) (i) When r = 6 , characteristic equation is m + 6m + 25 = 0
2

⇒ m = −3 ± 4i
x = e−3t ( A cos 4t + B sin 4t ) where A and B are arbitrary constants.

(c) (ii) When t = 0 ,

x = e0 ( A + 0) = 3 ⇒ A = 3
dx
= e −3t (−12sin 4t + 4 B cos 4t ) − 3e −3t (3cos 4t + B sin 4t )
dt
= e −3t (−12sin 4t − 9 cos 4t + 4 B cos 4t − 3B sin 4t )
When t = 0 ,
dx
= e0 (0 − 9 + 4 B) = 0
dt
9
⇒B=
4
9
So x = e −3t (3cos 4t + sin 4t )
4
2
9 3
= e −3t 32 + cos ( 4t − α ) where tan α =
4 4
15 15
= e −3t cos ( 4t − α ) ≤ since e −3t ≤ 1 and cos ( 4t − α ) ≤ 1 for t > 0
4 4
(c) (iii) The mass moves up and down with oscillations of reducing amplitude until it comes
to rest.

9(i) Here f(x, y) = y . Thus y(h) = 1+ hy(0) = 1+ h . B1

(ii) Euler’s method will take the form yn+1 = yn + hyn = (1+ h) yn . B1
Hence yn = (1+ h) n y0 = (1+ h) n . B1

(iii) Solving the differential equation we have y = Aex. Using the initial condition M1
we have A = 1 and thus y = ex. A1
We have y(1) = e.
Hence we want to find the least n such that
(1 + h)n − e
< 0.01
e
Since nh = 1, we have equivalently
n
⎛ 1⎞
⎜⎝ 1 + ⎟⎠ − e M1
n
< 0.01
e

From the GC, least n = 50. A1

Note: For n = 49, % error is 1.002%, for n = 50, % error is 0.982%.
(iv) The n will be smaller as the Improved Euler method converges to e faster. B1

RI 2013 9824/01/S/13