2012 SH1 H2 Math CT Revison Package Solutions

National Junior College Mathematics Department 2012
2012 H2 Maths Revision Package (Solutions) Page 1

National Junior College
2012 H2 Mathematics (Senior High 1)
Solutions for Common Test Revision Package

Topics in Revision Package (Solutions):

1. Binomial Expansion
2. Sequences and Series
3. Arithmetic and Geometric Progressions
4. Mathematical Induction
5. System of Linear Equations and Inequalities
6. Functions
7. Curve Sketching
8. Conics
and

NJC SH1 H2 Math Term 3 common test papers for 2009, 2010 and 2011.

Topic 1. Binomial Expansions (Suggested Solutions)
1.
( )
1
2
1 1
1
2
2 2
2
2 2
1 1
1
1 2 2
4 4 1 = 4 1 ...
4 2 4 2! 4
= 2 1 ... = 2 ...
8 128 4 64
x x x
x
x x x x
| | | |
| |
| | | | | |
\ .
| = + + +
| | |
| \ . \ . \ .
|
\ .
| | | |
| |
+ +
| | |
\ .
\ . \ .

For expansion to be valid, 1 4
4
x
x < <

1 1 1
2 2 2
2
1 100 1 99 3
4 11
25 25 25 5
1
1
3 1 1 25
25
11 2 2
5 4 64 100 40000
5 1 1
11 2 3.317
3 100 40000
| | | | | |
= = =
| | |
\ . \ . \ .
| |
|
\ .
~ =
| |
~ ~
|
\ .

2.
( ) ( ) ( )
1
1
1
1
2
1
1
2
2
1
1
2
2
2
4 2 2 4 = 2 2 1 4 1
2 2 4
= 1 2 1
2 4
1 1
( 1)( 2) 1 2 2
= 1 ( 1) ... 2 1
2 2! 2 2 4
x x
x x x
x
x x
x x x
| | | |
+ = + + + +
| |
+
\ . \ .
| | | |
+ +
| |
\ . \ .
| ||
|
| |
| | | |
\ .\
+ + + + +
|
| |
|
\ . \ .
\ .
2
2 2
2
...
2! 4
= 1 ... 2 1 ...
2 4 8 128
3 17
1
4 64
x
x x x x
x x
| | |
| |
| |
.
| +
|
| \ .
|
\ .
| | | |
+ + + +
| |
\ . \ .
~ +

For expansion to be valid, 1 and 1 2 and 4 2
2 4
x x
x x x < < < < <

3.
2
2 2
2 2
2
2 2
1 2 1
2 3 1 A B C
( 1)( 1) 1 1
2 3 1 A( 1) (B C)( 1)
1, A 2
0, C 3
1, A 2, C 3, B 0
2 3 1 2 3
( 1)( 1) 1 1
= 2( 1) 3(1 )
=
x x x
x x x x
x x x x x
x
x
x
x x
x x x x
x x

+ +
= +
+ +
+ = + + +
= =
= =
= = = =
+
= +
+ +
+ +
1 2 1
2 2 2 2
2 3 4 2 4
2(1 ) 3(1 )
( 1)( 2) ( 1)( 2)
= 2 1 ( 1)( ) ( ) ... 3 1 ( 1) ( ) ...
2! 2!
= 2(1 ...) 3(1 ...)

x x
x x x x
x x x x x x

+ +
| | | |
+ + + + + + +
| |
\ . \ .
+ + + + + + + +
2 3 4 2 4
2 3 4
2008 2008 2(1004)
2008 2008
2008
= 2 2 2 2 2 3 3 3 ...
1 2 5 2
Term in 2( ) 3( )
= 2 3
=
Coefficient
x x x x x x
x x x x
x x x
x x
x
+ + +
~ +
= +
+
2008
of 1 x =

4.
1
1
2
1
1 1
2
2
2
1 2
(1 2 ) (2 3 )
2 3
3
= (1 2 ) (2) (1 )
2
1 1
1 1 3 ( 1)( 2) 3 2 2
= 1 (2 ) (2 ) ... 1 ( 1) ...
2 2 2! 2 2! 2
1 1
= 1
2 2
x
x x
x
x x
x x x x
x x

+
= + +
+
+ +
| | | || |
| | |
| |
| | | |
\ .\ .
| + + + + + +
|
| |
|
| \ . \ .
\ .
|
\ .
+
2 2
3 9
... 1 ...
2 4
x x
| || |
+ + +
| |
\ .\ .

2 2 2
2
2
1 3 9 3 1
= 1 ...
2 2 4 2 2
1 1 1
= 1 ...
2 2 4
1 1 1

2 4 8
x x x x x
x x
x x
| |
+ + +
|
\ .
| |
+ +
|
\ .
~ +

For expansion to be valid,

3 1 2 1
2 1 and 1 and
2 2 3 2
x x x x x < < < < <

5.
2
2 2
2 2
4 10 19
(2 3)( 1) 2 3 1
4 10 19 ( 1) ( )(2 3)
3 13
, 13 4
2 4
0, 19 3 5
1, 13 8 ( 5)( 1) 0
x x A Bx C
x x x x
x x A x Bx C x
x A A
x A C C
x B B
+ +
= +
+ +
+ = + + +
= = =
= = =
= = + =

2
2 2
4 10 19 4 5
(2 3)( 1) 2 3 1
x x
x x x x
+
=
+ +

( )
( )
2
2
1 2 1
1
1
2
2 3 2
2 3
4 10 19
(2 3)( 1)
4(2 3) 5( 1)
2
4 3 1 5 1
3
4 2 ( 1)( 2) 2 ( 1)( 2)( 3) 2
1 ( 1)( ) )( ) )( ) ... 5 1 ( 1) ...
3 3 2! 3 3! 3
4 2 2 2
1 ...
3 3 3 3
x x
x x
x x
x x
x x x x
x x x

+
= +
| | | |
= +
| |
\ . \ .
| |
= + + + + + +
|
\ .
| |
| | | |
= + + + +
|
| |
|
\ . \ .
\ .
2
2 3
5(1 ...)
19 8 119 32
...
3 9 27 81
x
x x x
+
= + +

For expansion to be valid,
2
2 3
1 and 1 and 1 1
3 2
x x x x x < < < < <


2
19
When 0,
3
d 8 238 32
d 9 27 27
d 8
When 0,
d 9
8 19
Equation of tangent is .
9 3
x y
y
x x
x
y
x
x
y x
= =
~ +
= ~
=

6.
1
2 3
2 2 3
1 1 1 1 1
1 1 2
1 1 1 1 1
1 1 ...
2! 3!
1 1 1 1 1
1 1 2
1 1 1
1 ..
2! 3!
n
n n n n n
n n n n n
n n n n n
n n n
| || | | || || |

| | | | |
| | | | | | | |
\ .\ . \ .\ .\ .
= + + + +
| | | |
\ . \ . \ . \ .
| || | | || || |

| | | | |
| | | | | |
\ .\ . \ .\ .\ .
= + +
| | |
\ . \ . \ .
2 4 3 4 2
2 4 3 4
2 3
.
1 1 1 1 1 1 1 1 1
1 3 2 ...
2 2 6
1 1 1 1 1 2 1
1 ...
2 2 6
1 1 1 1
1
2 6
n n n n n n
n n n n
n n
| |
| | | | | | | | | | | |
= + + +
|
| | | | | |
|
\ . \ . \ . \ . \ . \ .
\ .
| | | | | | | |
= + +
| | | |
\ . \ . \ . \ .
| | | |
= +
| |
\ . \ .
4
1
...
n
| |
+
|
\ .

Thus the first three non-zero terms are
2 3
1 1 1
1
2 n n
| | | |

| |
\ . \ .

Term in
4
1
n
| |
|
\ .
is
4
1 1
6 n
| |
|
\ .

n = 10, ( )
1
2 3 4
1
10
10
1 1 1 1 1 1
1 0.9 1 0.98952
10 10 2 10 6 10
| | | | | | | |
= ~ + ~
| | | |
\ . \ . \ . \ .

Topic 2. Sequences and Series (Suggested Solutions)
1.
( )
10 10 10 10
2 2
0 0 0 0
2 5 2 5
r r r r
r r r r
= = = =
=

( )( )( ) ( )( )
10 10
2 2
1 1
0 2 0 5 11
1 1
10 11 21 2 10 11 55
6 2
220
r r
r r
= =
| | | |
= + +
| |
\ . \ .
| |
=
|
\ .
=

2.
Given
1
2
2
2 2
n
r n
r
r n
=
+
=

(i)
10 10
1 1
1 1
1
2 2 2
r r
r r
r r

= =
=

10
10 2
2 2
2
509
128
+ | |
=
|
\ .
=

(ii)
2
3 1 1
2 2 2
r r r
r r r
r r r

= = =
=

1 2
1
1 2
lim
2 2 2
2
lim 2 1
2
2 1
1
n
r
n
r
n
n
r
n
| | | |
= +
| |
\ . \ .
+ | |
=
|
\ .
=
=

(iii)
( )
( ) 1 1 1
2 1 2
1 1
1
2 2
r r
r r
r
r

+ + +
= + =
+
=

( )
2
1
1
2 2
1
2
4
0.5
r
r
r
=
=
=
=

3.
(i)
3 3 3 3 3
= 1 2 3 ... 99 100 A + + + + +
( ) ( )
100
3
1
2 2 1
100 100 1
4
25502500
r
r
=
=
= +
=

(ii)
3 3 3 3 3
= 2 4 6 ... 98 100 B + + + + +

( )
( ) ( )
50
3
1
2 2
2
1
8 50 50 1
4
13005000
r =
| |
= +
|
\ .
=

Hence,
3 3 3 3 3
1 3 5 ... 97 99 A B + + + + + =
3 3 3 3 3 3 3
100 99 98 97 ... 3 2 1 ( ) 2 507500 B A B B A + + + = = =
4.
( ) ( )
5 4 3 2 5 4 3 2
4 2

5 10 10 5 1 5 10 10 5 1
10 20 2
(shown)
LHS
r r r r r r r r r r
r r
RHS
= + + + + + + +
= + +
=

By method of difference,
( ) ( )
( ) ( )
( ) ( )
( ) ( )
( )
5 5
1
5 5
5 5
5 5
5 5
5 5
5 5
5
5
5 4 3 2
1 1
2 0
3 1
4 2
...
1 3
2
1 1
1 1
2 5 10 10 5
n
r
r r
n n
n n
n n
n n
n n n n n
=
(
+

=
+
+
+
+
+
+ +
= + +
= + + + +

We also have,
( ) ( )
( )
( )( )( )
( ) ( )( )
( )
( )
( )( )
5 5
1
4 2
1
4
1
4
1
5 4 3 2
4 3 2 2
4 3 2
3 2
1 1
10 20 2
1
10 20 1 2 1 2
6
Thus,
10
10
2 5 10 10 5 1 2 1 2
3
1
6 15 30 30 15 20 30 10 6
3
1
6 15 10 1
3
1
1 6 9 1
3
1
3
n
r
n
r
n
r
n
r
r r
r r
r n n n n
r
n n n n n n n n n
n n n n n n n
n n n n
n n n n n
n
=
=
=
=
(
+

= + +
| |
= + + + +
|
\ .
= + + + + + +
= + + + +
= + +
= + + +
=
( )( )( )
2 2
1 2 1 3 3 5 (shown), where ( ) 3 3 5 n n n n F n n n + + + = +

5.
( ) ( )( )
( )( ) ( ) ( )
( )( ) ( )( )
( )( ) ( )( )
( )( ) ( )
( ) ( ) ( ) ( )
( )( )
3
3

1
1 1 2
2 3
3 4 4 5
3 4
4 5 5 6
4 5
5 6 6 7
...
2 1
1 1
1
1 1 2
1
6 1 2
N
n
n
N
n
u
n n
n n n n
N N
N N N N
N N
N N N N
N
N N
=
=
(
=
(
+ + +

=
+
+
+

+
+
+
+ + +
=
+ +

Since
( ) ( )( )
( )( )
( )( ) ( )( )
1 2
1 2
1 1 2 1 2 1 2
n n n
n n n
n n n n n n n n n n
+

= =
+ + + + + + +
,
( )( )( ) ( )( )( ) ( )( )( )
( )( )
( ) ( )( )
( )( )
3
3
1 2 3
...
3 4 5 4 5 6 5 6 7
2
lim
1 2
1
lim
1 1 2
1
lim
6 1 2
1
6
N
N
n
N
N
n
N
n
n n n
n n
n n n n
N
N N
+ + +
=
+ +
(
=
(
+ + +

(
=
(
+ +

=

6.
(i) Let P
n
be the statement u
n
=
n
( ) n + 1
2
for all positive integers of n.
Consider P
1
LHS = u
1
=
1
4
RHS =
1
(1 + 1)
2 =
1
4

Therefore P
1
is true.
Assume that P
k
is true for some positive integer k. i.e. u
k
=
k
( ) k + 1
2

Consider P
k + 1
: Need to prove that
( )
1 2
1
2
k
k
u
k
+
+
=
+

u
k + 1
= u
k

k
2
+ k 1
( ) k + 2
2
( ) k + 1
2

u
k + 1
=
k
( ) k + 1
2

k
2
+ k 1
( ) k + 2
2
( ) k + 1
2

u
k + 1
=
1
( ) k + 1
2
( ) k + 2
2{ } k( ) k + 2
2
k
2
k + 1
u
k + 1
=
1
( ) k + 1
2
( ) k + 2
2{ } k
3
+ 3k
2
+ 3k + 1
u
k + 1
=
1
( ) k + 1
2
( ) k + 2
2( ) k + 1
3

u
k + 1
=
k + 1
( ) k + 2
2

P
k + 1
is true.
Since P
1
is true, and P
k
is true

P
k + 1
is true, by Mathematical Induction, P
n
is true
for all positive integers of n.
7.
(a) As , n
1
, .
n n
x k x k
+
So

2
2
6
6
6 0
( 3)( 2) 0
3 or 2 (rejected since cannot converge to a negative number)
n
k k
k k
k k
k k
k x
= +
= +
=
+ =
=

(b)
(i) Sketch the graphs of 6 y x = + and x y = .

Case 1: k x
n
> . From the graphs,
1 n
x k
+
> .
Hence 0 > k x
n

and
1
0
n
x k
+
> .
1
( )( ) 0
n n
x k x k
+
> .

Case 2: k x
n
< . From the graphs,
1 n
x k
+
< .
Hence 0 < k x
n
and
1
0
n
x k
+
< .
1
( )( ) 0
n n
x k x k
+
> .
Hence, if , k x
n
= then
1
( )( ) 0
n n
x k x k
+
> . (shown)

6 y x = +

x

y = x

x
n
x
n+1
x
n+1
k

k

y

0

y

6 y x = +

x

y = x

x
n
x
n+1
x
n+1
k

k

0

(ii) If , k x
n
= then
1
( )( )
n n
x k x k
+
=
( )
6 3 ( 3)
n n
x x +
( )
2
6 9 ( 3)
( 3)
0
6 3 6 3
n n
n
n n
x x
x
x x
+

= = >
+ + + +

(shown)
8.
(a) Using the G.C., by plotting
2
=
x
y e and = y x as follows,

we obtain 0.159, a = 3.146 = b

(b)

1
Suppose the limit is . As , , .
n n
l n x l x l
+

2 2
1
lim lim
x l
n
n
n n
x e l e

+

= =
.
Since l is a solution to the equation
2
,
x
x e

= or (shown) l a l b = =

Consider the curve with equation
2
.
x
y x e

= This curve has x-intercepts a and b.
Now since
2
,
l
l e

=
2
0,
l
l e

= i.e. l is a solution to the equation
2
0,
x
x e

=

or (shown) l a l b = =

(c)(i)

From the graph above, if ,
n
x a < then
1
.
n n
x x a
+
< <

(ii)

From the graphs of y = x and
2
=
x
y e , if ,
n
a x b < < then
1 n n
a x x
+
< < .

= y x

a
b

x

y

0
n
x

1 + n
x

1 + n
x

2
=
x
y e

= y x
a
b

x

y

0

1 + n
x
1 + n
x
n
x

2
=
x
y e
(iii)

From the graphs of y = x and
2 x
y e

= , if ,
n
x b > then
1
.
n n
b x x
+
< <

(d) Case1:

n
x a < . In this case,
1 2 3
...
n n n n
x x x x a
+ + +
< < < < < , so the terms of the
sequence increase and become closer and closer to a.

Case2:

n
x a = . In this case,
1 2 3
...
n n n n
x x x x a
+ + +
= = = = = , so all the terms are equal
to the constant a and so converges to a.

Case3:

n
a x b < < . In this case,
1 2 3
...
n n n n
x x x x a
+ + +
> > > > > , so the terms of the
sequence decrease and become closer and closer to a.

Hence, if ,
n
x b < , then the sequence converges to 0.159 = a

(e) If ,
n
x b = then
1 2 3
...
n n n n
x x x x b
+ + +
= = = = = , so all the terms are equal to the
constant b and so converges to b.

= y x

a

b

x

y

0

n
x

1 + n
x

1 + n
x

2
=
x
y e

Topic 3. Arithmetic and Geometric Progressions (Suggested Solutions)
1.
(i)
1 n n n
T S S

=
,
2 n >
( )
1
1 2
1
2 1
1
1
1
2 2
5 5
5 5
2 2
5 5
2
5 2
5
2
3
5
n n
n n
n n
n n
n
n
n
| | | |
=
| |
\ . \ .
=
=
| |
=
|
\ .

1 1
1 1
2
3 3
5
T S

| |
= = =
|
\ .

1
2
3
5
n
n
T

| |
=
|
\ .
,
1 n >

1
1
2
3
2 5
5
2
3
5
n
n
n
n
T
T
+
| |
|
\ .
= =
| |
|
\ .

The series is a geometric series with common ratio
2
5
.
(ii) Since -1 < common ratio =
2
5
< 1, this series converges.
Sum to infinity =
3
5
2
1
5
=

2.
The given geometric progression is 8(1 + r + r
2
+ . . . ) (A)
and the reciprocal series is
8
1
(1 +
r
1
+
2
1
r
+ . . . ) (B)
The sum of the first 10 terms of series (A) is
r
r
1
) 1 ( 8
10

and the sum of the first 10 terms of series (B) is
r
r
1
1
1
1
8
1
10
|
.
|
\
|

.
Sum of (A) =
8
1
x sum of (B)
r
r
1
) 1 ( 8
10
=
(
(
(
(
|
.
|
\
|

r
r
1
1
1
1
8
1
8
1
10
=
2
8
1
(
(
) 1 (
1
9
10
r r
r
=
2
8
1
(
(
) 1 (
1
9
10
r r
r

9
r =
3
8
1
=
9
2
1
(as -1 < r < 1) r =
2
1
.
Sum of the first 7 terms of series (A) is
)
2
1
( 1
)
2
1
( 1 8
7
|
.
|
\
|

=
6
7
2
) 1 2 ( 8
=
8
) 1 2 (
7
.
Sum of the first 7 terms of series (B) is
( )
) 2 1 (
2 1
8
1
7
=
8
) 1 2 (
7
.

3.
(i) Total number of elements in the first n sets is 1 + 2 + 3 + + n =
( 1)
2
n n +

Last number in the nth set is 3(1 + 2 + 3 + + n) =
3 ( 1)
2
n n +

(ii) The first number in the set A
n
is the last element in the set A
n -1
+ 3

which is
2
3 ( 1) 3 3 6
3
2 2
n n n n +
+ =

The sum of all the elements in the set A
n
is
2 2 2
3 3 6 3 ( 1) 6 6 3 ( 1)
2 2 2 2 2 2
n n n n n n n n n | | | | + + + +
+ = =
| |
\ . \ .

4.
( )( )
( )
2
2 2
2 2
2
1 1
( 1)
1 1 ...
2!
( 1)
1
2!
n
x x
n n
x nx x
n n
nx x x
a bx cx
+ +
| |
= + + + +
|
\ .
= + + +
= + +

( )
( )( )
2
2
2
1
1 1 1
2
3 1
1 1
2 2
5 1
2 0
2 2
5 4 0
4 1 0
b a c b
n n n n
n n n
n n
n n
n n
=
= +
= +
+ =
+ =
=

1 n = or 4 n =

5.
U
n
= (4
2n+1
4) (4
2n-1
4)
= 4(4
2n
) -
1
4
(4
2n
)
=
15
4
(4
2n
) (shown)

(i) U
1
+ U
3
+ U
5
+ + U
2n-3
+ U
2n-1

=
15
4
(4
2
) +
15
4
(4
6
) +
15
4
(4
10
) + +
15
4
(4
4n-2
)
=
15
4
(4
2
)
4
4
(4 ) 1
4 1
n
(
(

= 15(4)
4
4 1
255
n
(
(

=
4
17
(4
4n
-1 )

(ii) ln(U
1
) + ln(U
2
) + ln(U
3
) + + ln(U
n
)
= ln
2
15
(4 )
4
(
(

+ ln
4
15
(4 )
4
(
(

+ ln
6
15
(4 )
4
(
(

+ + ln
2
15
(4 )
4
n
(
(

= (ln
15
4
+ 2 ln4) + (ln
15
4
+ 4 ln4) + + (ln
15
4
+ 2n ln4)
= n ln
15
4
+
2
n
(2 ln4 + 2n ln4)
= n ln15 + n
2
ln4
6.
(i)
1
1 1
ln( ) ln( ) ln
n
n n n n
n
a
b b a a
a
+
+ +
| |
= =
|
\ .
.
Since
n
a is a geometric progression, thus
1 n
n
a
r
a
+
= for all n
+
e .
Thus
1
ln( )
n n
r b b
+
= for all n
+
e . Thus
n
b is an arithmetic progression with
common difference ln( ) r .

(ii) Since
n
b is an arithmetic progression
1
1 1
1
1 1
1
1
( )
2
1
[ln( ) ln( )]
2
1
ln( )
2
N
n N
n
N
N
N
b b b
N
a a
N
aa
+
+
=
+
+
+
= +
+
= +
+
=

(iii) Since ( )
1
1 2 1
1
ln
N
n N
n
b a a a
+
+
=
=
, thus
( )
1
1 2 1
1
1
1
2
1
1
exp ln( )
exp
2
N
N n
n
N
N
N
a a a b
N
a
aa
a
+
+
=
+
+
+
| |

|
\ .
+ | |
=
|
\ .
=
=

7.

(i) Amount owed before interest is added at end of nth year
1
12(1000)
n
u

= (as $12000
is paid for 1 yr)
Thus amt owed with interested added
1
1.03( 12000)
n n
u u

=
(ii)
1
2
2 2
2
(200000 12000)1.03
((200000 12000)1.03 12000)1.03
200000(1.03 ) 12000(1.03) 12000(1.03 )

200000(1.03 ) 12000(1.03 1.03 ... 1.03 )
1.03(1.03 1)
1.03 (200000) 12000
0.03
1.03 (200000)
n n
n
n
n
n
u
u
u
=
=
=
= + + +
(
=
(

= 412000(1.03 ) 412000
412000 212000(1.03 )
n
n
+
=

(iii) 0 when 23
n
u n < =
(Use GC, Sequence mode) or
412000 212000(1.03 ) 0
212000(1.03 ) 412000
412
1.03
212
412
lg
212
22.48
lg1.03
least 23
n
n
n
n
n
<
>
>
> =
=

Needs 23 years
(iv)
Total interest paid
22
16
0.03
0.03(277247.491)
8317.42
r
r
u
=
=
=
=

15
15
412000 212000(1.03 ) 81710.90768 u = =
Penalty =
15
0.05 4085.55 u =
As total interest paid is greater than
penalty,
its to Johns benefit to terminate his loan
early.

8.
30 a = , 5 d =
(i) T
7
= 6 30 6(5) 30 30 1 a d hr + = + = + =
(ii) S
7
=
( )
7
30 60
2
+
=
( )
7
90
2

= 315min = 5 15min hr
(iii) S
n
=
( ) ( ) 2 30 1 5
2
n
n + (

=
| | 60 5 5
2
n
n +
=
| | 55 5
2
n
n + = 60 60
( )
5
11 60 60
2
n
n + =
2
11 1440 n n + =
( )
2
11 11 4 1440
2
n
+
=
=
11 5881
2

= 32.84
Betty will need 33 lessons to complete 60 hours of lessons.

9.
The mass of sand spread by the gardener follows an AP with first term 5 and
common difference 2.

(i) Mass of sand he has spread by the end of the n th day,
[2(5) ( 1)(2)] (8 2 ) (4 )
2 2
n
n n
S n n n n = + = + = + .

(ii) We are finding the least integer n such that
(4 ) 1500
n
S n n = + >
2
4 1500 0 n n + >
40.8 n s (rejected since n
+
e ) or 36.8 n >

Alt :
From the GC, when
2
2
36, 4 1500 60
37, 4 1500 17
n n n
n n n
= + =
= + =

Hence minimum number of days required for him to spread the 1500 kg of sand is
37.

The mass of sand spread by the gardeners neighbour follows a GP with first term 75
and common ratio 0.95.
(iii) Mass of sand he has spread by the end of the n th day,
75(1 0.95 )
1500(1 0.95 )
1 0.95
n
n
n
S

= =
.

(iv) Since
75
1500
1 0.95
S
= =
, which is the mass of sand to be spread, the neighbour

will never complete his task with the approach taken.

Topic 4. Mathematical Induction (Suggested Solutions)

1.
Let P
n
be the statement
0
( )! ( 1)!
! !( 1)
n
r
m r m n
r n m
=
+ + +
=
+
for all integers 0 n > .

When 0 n = ,

!
LHS !
0!
( 1)!
RHS !
0!( 1)
m
m
m
m
m
= =
+
= =
+

Therefore P
0
is true.
Assume that P
k
is true for some 0 k > . i.e.
0
( )! ( 1)!
! !( 1)
k
r
m r m k
r k m
=
+ + +
=
+
.

1
0 0
( )! ( )! ( 1)!
! ! ( 1)!
( 1)! ( 1)!
!( 1) ( 1)!
( 1)! 1 1
( 1) ! ( 1)!
( 1)! 2
( 1) ( 1)!
( 2)!
( 1)!( 1)
k k
r r
m r m r m k
r r k
m k m k
k m k
m k m
m k k
m k m k
m k
m k
k m
+
= =
+ + + +
= +
+
+ + + +
= +
+ +
+ + ( +
= +
(
+ +

+ + ( + +
=
(
+ +

+ +
=
+ +

Therefore P
k+1
is true.
Since P
0
is true and P
k
is true implies P
k+1
is true, by MI, P
n
is true for all
0 n > .

20
5
20 4
0 0
( 2 )! 7! 8! 22!
5! 6! 20! !
( 2 )! ( 2 )!
! !
( 2 20 1)! ( 2 4 1)!
20!3! 4!3!
3472
r
r r
r
r
r r
r r
=
= =
+
+ + + =
+ +
=
+ + + +
=
=

2.
(i)
1
1
1
u
=

2
2
1 1 1
3
1 2 3
u
u
= = =
+


3
3
1
1 1
3
7
1
7
2
3
u
u
= = =
+

4
4
1
1 1
7
15
1
15
2
7
u
u
= = =
+

5
5
1
1 1
15
31
1
31
2
15
u
u
= = =
+

(ii)
1 1
2 1
2 1
n
n
n
n
u
u
= =

(iii) Let P
n
be the statement
1
2 1
n
n
u =

When 1 n = ,
1
1
1
1
2 1
u = =

Therefore P
1
is true.
Assume that P
k
1
2 1
k
k
u =

( )
1
1
1
2 1
1
2
2
2 1
1
1 2 2 1
1
2 1
k
k
k
k
k
k
k
u
u
u
+
+
= =
+
+
=
+
=

Therefore P
k+1
is true.
Since P
1
is true and P
k
is true implies P
k+1
is true, by MI, P
n
is true for all 1 n > .
3.
(i)
1
2 2
2(1) 1 3
1 (1 1) 4
u
+
= =
+

2
2 2
2(2) 1 5
2 (2 1) 36
u
+
= =
+

3
2 2
2(3) 1 7
3 (3 1) 144
u
+
= =
+

4
2 2
2(4) 1 9
4 (4 1) 400
u
+
= =
+

1 2 3 4
1 1 1 1
3 8 15 24
, , ,
4 9 16 25
r r r r
r r r r
u u u u
= = = =
= = = =

(ii) Conjecture:
2 2
2 2
1
( 1) 1 2
( 1) ( 1)
n
r
r
n n n
u
n n
=
+ +
= =
+ +


Let P
n
be the statement
2
2
1
2
( 1)
n
r
r
n n
u
n
=
+
=
+

When 1 n = ,
2 1
2
1
1 2(1) 3
(1 1) 4
r
r
u
=
+
= =
+
.
1
3
4
u = .
Therefore P
1
is true.

Assume that P
k
2
2
1
2
( 1)
k
r
r
k k
u
k
=
+
=
+

( )
2 1
2 2 2
1
2 2
2 2
4 3 2
2 2
3
2 2
2
2 2
2 2( 1) 1
( 1) ( 1) ( 2)
2 ( 2) 2 3
( 1) ( 2)
6 12 10 3
( 1) ( 2)
( 1) ( 3)
( 1) ( 2)
( 1)( 3) ( 1) 2( 1)
( 2) ( 2)
k
r
r
k k k
u
k k k
k k k k
k k
k k k k
k k
k k
k k
k k k k
k k
+
=
+ + +
= +
+ + +
+ + + +
=
+ +
+ + + +
=
+ +
+ +
=
+ +
+ + + + +
= =
+ +

Therefore P
k+1
is true.
Since P
1
is true and P
k
is true implies P
k+1
is true, by MI, P
n
(iii)
1
1
r
r
u
=
=

4.
(i)
1
1
3
u =

2
1 4
1
2
3 3
1 8
4
3
3 3
u
+
= = =

3
2 6
1
3
4 4
2 10
5
3
4 4
u
+
= = =

4
3 8
1
4
5 5
3 12
6
3
5 5
u
+
= = =

5
4 10
1
5
6 6
4 14
7
3
6 6
u
+
= = =

(ii) Conjecture:
2
n
n
u
n
=
+

(iii) Let P
n
be the statement
2
n
n
u
n
=
+
When 1 n = ,
1
1 1
1 2 3
u = =
+

Therefore P
1
is true.
Assume that P
k
2
k
k
u
k
=
+

1
1
3
1
2
3
2
2
3 6
1
3
k
k
k
u
u
u
k
k
k
k
k k
k k
k
k
+
+
=
+
+
=
+
+ +
=
+
+
=
+

Therefore P
k+1
is true.
Since P
1
is true and P
k
is true implies P
k+1
is true, by MI, P
n
5.
Let P
n
be the statement
( )( )
1
2
1 2
n
r
r
r r r
=
=
+ +

( )( ) 1 2
n
n n + +
for all positive integers n.
Let n =1,
LHS =
( )( )
2 1 1
1 2 3 6
=
RHS =
( )( )
1 1
1 1 1 2 6
=
+ +

P
1
is true.
Assume P
k
is true for some k
+
e .
ie.
( )( )
1
2
1 2
k
r
r
r r r
=
=
+ +
( )( ) 1 2
k
k k + +

1
1
2
2 2 1
( 1)( 2) ( 1)( 2) ( 1)( 2)( 3)
( 3) (1 )
( 1)( 2)( 3)
2 1
( 1)( 2)( 3)
1
( 2)( 3)
k
r
r k k
r r r k k k k k
k k k
k k k
k k
k k k
k
k k
+
=

= +
+ + + + + + +
+ +
=
+ + +
+ +
=
+ + +
+
=
+ +

Since P
1
is true, P
k
is true implies P
k+1
is true, by mathematical induction, P
n
is true
for all n
+
e .

( )( ) ( )( ) ( )( ) ( )( )
( )( )
( )( )
( )( ) ( )( )
( )( ) ( )( )
( )( )
3
3
2
1 1
1 2 3 2
........
3 4 5 4 5 6 5 6 7 1 2
2
1 2
2
1 2
2 2
1 2 1 2
2
1 2 2 1 2 2
1
6 1 2
n
r
n
r
n
r r
n
n n n
r
r r r
r
r r r
r r
r r r r r r
n
n n
n
n n
=
=
= =
+ + +
+ +
=
+ +
=
+ +
(

=
(
+ + + +

(
=
(
+ + + +

=
+ +

6.
(i) Let P
n
be the statement
2
1
1
,
4 1 2 1
n
r
n
r n
=
=
+
for n
+
eZ .
Then for P
1
:
LHS =
1 1
4 1 3
=
, RHS =
1 1
2 1 3
=
+

P
1
is true.
Assume that P
k
is true for some k
+
eZ . i.e.
2
1
1

4 1 2 1
k
r
k
r k
=
=
+
.

1
2 2 2
1 1
2
1 1 1

4 1 4 1 4( 1) 1
1
2 1 4 8 3
1
2 1 (2 1)(2 3)
(2 3) 1
(2 1)(2 3)
(2 1)( 1)
(2 1)(2 3)
1
2 3
k k
r r
r r k
k
k k k
k
k k k
k k
k k
k k
k k
k
k
+
= =
= +
+
= +
+ + +
= +
+ + +
+ +
=
+ +
+ +
=
+ +
+
=
+

Since P
1
is true, P
k
is true implies P
k+1
n
is true
for all n
+
e .
(ii)
2
1
1 1 1

4 1 2 1 2 2(2 1)
n
r
n
r n n
=
= =
+ +

1
0
(2 1) n

+
as n , therefore the series is convergent.
OR
2
2 1 1
1
1 1

4 1 2 1 2
n n
n
n
r
n n
n
r n
+
=
= = =
+ +

1
1 1
2 2
n
+
as n , therefore the series is convergent.
(iii)
2
2 2
3 2
2
(4 1)( 1)
1
4 1 4 1
4 4 (1 )
4 1
k k r r
r
r r
r r r k
r
+
+ =

+ +
=

Comparing the co-efficient of the constant term, 1 3 k + = 2 k =
Then,
( )
3 2
2 2
1 1
2
3 2
4 4 3 2
1
4 1 4r 1
2 1
2 1 2
2 2
2 1 2
2 ( 1)
2 1 2
2 3
2(2 1)
n n
r r
r r r
r
r
n n
n n
n
n n n n
n
n n n
n
n n n
n
= =
+ (
= +
(

| |
= + +
|
+
\ .
+
= +
+
= +
+
+
=
+

7.
(i) Using the recurrence relation,
2 1
3 2 1 x x =
( )
2 1
1 1
2 1
3 3
x x = =
( )
3 2
1 1
2 1
3 9
x x = =
( )
4 3
1 11
2 1
3 27
x x = =
Therefore ( )
1
1 2
1
3 3
x + = ,
( )
2
2
1 4 2
1
3 9 3
x
| |
+ = =
|
\ .
,
( )
3
3
1 8 2
1
3 27 3
x
| |
+ = =
|
\ .
,
( )
4
4
1 16 2
1
3 81 3
x
| |
+ = =
|
\ .
.
(ii) We therefore conjecture that
( )
1
1
3
n
x + =
2
3
n
| |
|
\ .

2
3 1
3
n
n
x
| |
=
|
\ .
for all n = 1, 2, 3, .
(iii) Let P
n
denotes the statement
2
3 1
3
n
n
x
| |
=
|
\ .
for all n = 1, 2, 3, .
For n = 1, LHS = x
1
= 1
RHS =
2
3 1
3
| |
|
\ .
= 1 = LHS
So P
1
is true.
Assume P
k
is true for some k = 1, 2, 3, .
That is,
2
3 1
3
k
k
x
| |
=
|
\ .

To prove that P
k+1
is true. That is to prove
1
1
2
3 1
3
k
k
x
+
+
| |
=
|
\ .
.
For n = k + 1, LHS = ( )
1
1
2 1
3
k k
x x
+
=
=
1 2
2 3 1 1
3 3
k
(
| |
(
`
|
\ . (

)

=
1 2
2 3 3
3 3
k
(
| |
(
`
|
\ . (

)

=
1
2
3 1
3
k+
| |

|
\ .
= RHS. Hence P
k+1
is true.
Since P
1
is true and P
k
is true P
k+1
n
is
true for all positive integers n.
(iv) lim
n
n
x
=
2
lim 3 1 1
3
n
n
(
| |
( =
|
\ . (

8.
(i)
1
2
2
2
1
u = =
2
2 2 2
2 4(2) 1 2
2
2 (2 1) 2 2
u

= + = =

3
2 2 2
1 2 4(3) 2 2
2 3 (3 1) 9 3
u

= + = =

4
2 2 2
2 2 4(4) 1 2
9 4 (4 1) 8 4
u

= + = =

2
2
n
u
n
=

(ii) Let
n
P be the statement
2
2
n
u
n
= for all n
+
e .

When n = 1,
1
2
2
2
1
u = =
Therefore
1
P is true.

Assume
k
P is true for some k
+
e .
i.e.
2
2
k
u
k
=

Want to show
1 k
P
+
is true, i.e. want to show
( )
1
2
2
1
k
u
k
+
=
+

( )
( )
( )
( )
( )
( )
1
2
2
2 2
2
2
2
2
2
2
2
2
2 4 1
1
2 4 2
1
2 1 4 2
1
2
1
2
( 1)
k k
k
u u
k k
k
k
k k
k k
k k
k
k k
k
+
+
= +
+

= +
+
+
=
+
=
+
=
+

Therefore
k
P true
1 k
P
+
true.

Since
1
P true and
k
P true
1 k
P
+
true, by mathematical induction,
n
P is true for all
n
+
e .

(iii)
( )
1
2 2
3 3
3 2
4 3
5 4
1 2
1
2
2
2 4
( 1)
...
...
1
2
N N
n n
n n
N N
N N
N
n
u u
n n
u u
u u
u u
u u
u u
u u
k
N
= =

=
+
+
+
+
+
+
=
=

Topic 5. System of Linear Equations and Inequalities (Suggested Solutions)

1.
Let x, y, z be the number of banana cakes, walnut cakes and pandan cakes
respectively.
0.5 0.2 0.25 19.5
0.5 0.75 57.5
10 20 5 950
x y z
x y z
x y z
+ + =
+ + =
+ + =

Solving using GC, 15, 35, 20. x y z = = =
Zikai must have sold 15 Set As and 20 Set Bs.
Hence , Zikai raised a total of 15 25 20 20 $775 + = .
2.
Let x be the selling price of the Notebook (NB), y be the selling price of Home
Theatre System (HTS) and z be the selling price of Television set (TV) .
7545
0.9 0.95 0.95 7068.35
0.8 0.75 0.9 6341.5
x y z
x y z
x y z
+ + =
+ + =
+ + =

Using GC to solve the simultaneous equations,
x=1988 y = 1668 z =3889

Amount ABS Bank credit card holder have to pay
0.4($1988) 0.5($1668) 0.7($3889) $4351.50 + + =
3.
c bx ax
dx
dy
d cx bx ax y
+ + =
+ + + =
2 3
2
2 3

0 ) 1 )( 2 ( ) 1 )( 3 (
1 ) 1 ( ) 1 ( ) 1 (
7 ) 1 ( ) 1 ( ) 1 (
4 ) 2 ( ) 4 ( ) 8 (
= + +
= + + +
= + + +
= + + +
c b a
d c b a
d c b a
d c b a

Using GC to solve the simultaneous equations,
a = 1, b = 1, c = -5, d = 2

Equation of curve: y = x
3
+ x
2
- 5x + 2
4.
Let the unit digit be z.
Let the tenth digit be y.
Let the hundredth digit be x.
15 (1) x y z + + =
(100 10 ) (100 10 ) 594
99 99 594 (2)
x y z z y x
x z
+ + + + =
=

4 5
4 5 (3)
y z x
x y z
+ = +
+ + =

Using GC to solve the equations simultaneously,
8, 5, 2 x y z = = = .
Thus the number is 852.
5.
(i)
1 2
170 x x =

2 3
80 x x =

3 4
200 x x =
1 4
290 x x =
(ii) Using GC,

1
290 x k = + ,
2
120 x k = + ,
3
200 x k = + ,
4
x k = , where k e .
(iii)
4
150 x =
Therefore,
1
440 x = ,
2
270 x = ,
3
350 x =
6.
Let a, b, c, and d denote the percentages allocated to Execution, Style, Impact and
Content respectively.
Then
2
1.5
0
2 0
1
1
. 0
00
5
a b
b c
d a
a b c d
a b
b c
a d
=
=
=
=
=
=
+ + + =

Therefore, using GC,
25, 25, 12.5, 37.5 a b c d = = = =
Execution has 25%, Style has 25%, Impact has 12.5% and Content has 37.5%.
7.
(i) ( ) 9 e > + + = + + x x x x all for 0 3 1 4 2
2 2

(ii)
x x
x 1
4 2
s
+

( )
( )
0 2
0 2
0 4 2
0
2
4 2
2
2
< <
< +
> + +
s
+
+ +
x
x x
x x
x x
x x

-2 0
+
+
_
(iii)
e 1
e 4 2 e
x
x x
s
+

( )
0 e e 2
2 e 0
x x
x
+
< <
<

Since e 0
x
> , no values of x satisfy this inequality (no solutions)

8.
( )( )
( )( )( )
2
2
8
1 0, 2
2
8 2
0
2
3 2
0
2
3 2 2 0
x
x
x
x x
x
x x
x
x x x
< =
+
<
+
<
+ <

2 or 2 3
But 0 for all , 2 3
2 3 or 2 3
(Ans.) 2 3 or 3 2
x x
x x x
x x
x x
< < <
> < <
< < < <
< < < <

9.
Method 1: Graphical

The x-coordinates for the intersection points are -2.30, -1, 1.39
2.30 or 1 1.39 x x < < <

Method 2: Algebraic
3 2 3 2
1 2 3 2 2 4 1 0
0.227 1.39 or 3.16
x x x x x x x
x x
> + + <
< < <

3 2
3 2
2
1 ( 2 3 2)
2 2 3 0
( 1)( 3) 0
2.3 or 1 1.30
2.30 or 1 1.39
x x x x
x x x
x x x
x x
x x
< +
+ <
+ + <
< < <
< < <

Replace by |x|, 1.39 1.39 x < <

- + - +
-2 2 3
x
10.
( )( ) ( )
( )( )
( )( )( )
( ) ( )( )
( )
( )( )
2
2
2
2 1
, , 3
2 1 3 2
2
0
2 1 3
2 3 2 1
0
2 3
3 6 6 2 1 3 0
Since 6 4 3 6 0
3 6 6 0 for all real values of .
2 1 3 0
1 1
3 (reject = as , 3)
2 2
1
3
2
x x
x x
x x
x x
x x
x x x x
x x
x x x x
x x x
x x
x x x
x
s = =

+ s

+
s

+ s
<
+ >
s
s s = =
< <

(i)
2 2
2 2
2
2
2
2 1 3
Let
2
2 1 3
1 1
Hence, 3 3
2 2
2 2
3 or 3
2 2
x x
x x
y x
y y
y y
y x
x x
s

=
s

< < < <
< < < <

(ii)
( ) ( )
2
2 3 1
Let 2 (i.e. 2)
2 2 2
2 2 3 1 2
2
2 1 3
1 1
Hence, 3 2 3
2 2
3
1
2
x x
x x
x z z x
z z
z z
z z
z z
z x
z
+
s
+
= = +
+
s
+
s

< < < + <
< <

x
y
y=3
y=0.5
y=x^2

11.
1 1
lg , 0,
2 1 2
x x x
x
> > =

Using a G.C, the coordinates of the
points of intersections are
A(0.0691, 1.16) and B(2.08, 0.317)

Thus,
0 0.0691 or 0.5 2.08 x x < < < <

lg
2
1 1
Let (i.e. )
1
1
lg
1
2
1
lg
2 1
Hence,
0 0.0691 or 0.5 2.08
1 1
0 0.0691 or 0.5 2.08
0.481 2 or 14.5
x
x
x
x u
u x
u
u
u
u
u
u u
x x
x x
>
= =
| |
<
|
\ .
<
< < < <

< < < <
< < >

x
y
A
B
y=1/x
y=0.0691
y=0.5
y=2.08
14.5
y=0
2 0.481
Topic 6. Functions (Suggested Solutions)

1.
(i) Largest value of 2 a =

2
2
( 2) 3
3 ( 2)
2 3
2 3 (since 2)
y x
y x
x y
x y x
=
+ =
= +
= + s

1
f ( ) 2 3, 3 x x x
= + >

(ii)
From the graph, we can see that
f ( ) y x = and
1
f ( ) y x
= intersect on
the line y x = . Therefore to find the
solution to
1
f ( ) f ( ) x x
= , we can
solve f ( ) x x = instead.

2
2
f ( )
( 2) 3
5 1 0
5 21 5 21
or
2 2
(rejected since 2)
x x
x x
x x
x
x
=
=
+ =
+
=
s

(iii) For
1
gh to exist, we need
1
h g
R D 0,
2
t |
_ =
|
.
.
Since | )
h
R 0, = ,
1
h
R 0,
2
t |
=
|
.
.
Therefore required
1
h
D , 0
2
t
| (
=
(
\
.
2
1
gh ( ) cos x x ( =

, , 0
2
x
t
| (
e
(
\

2.
(i) For fg to exist, we need
g f
R D _ .

2 2
g( ) 2 1 ( 1) 2 x x x x = + = +
Therefore | )
g
R 2, = .
Therefore 2 k > .

(ii) Since | )
g
R 2, = , | )
fg
R ln( 1), k =
Therefore 4 k = .

3.
(i) ( |
f
R 3, 4 =
(ii)
( |
| )
f
g
f g
R 3, 4
D 0,
Since R D , gf exists
=
=
_

(iii) gf is obtained from f by
1. the reflection of f in the x-axis
2. the translation of 4 units in the positive direction of the y-axis.
(iv) | )
gf
R 0,1 =
(v) For fg to exist,
g f
R D _ .

( |
( |
g
f
R , 4
D , 0
=
=

Greatest value of k is 0.
Corresponding | )
g
D 4, =

4.
(i) The minimum value of
| |
e
x
is
0
e 1 = , therefore
f
R [2, ) = .

g
D =
Since
f g
R D _ , gf exists.
(ii) | ) | )
g f
f f gf
D R 2, R 1, = = =
| )
gf
R 1, =
(iii)
| 1|
f (1) e 1
f ( 1) e 1
e 1
f (1)
= +
= +
= +
=

Since f is not one-one,
1
f
does not exist.

(iv) Minimum value of k is 0.

Let f ( ).
e 1 (for 0)
x
y x
y x
=
= + >

1
ln( 1)
f ( ) ln( 1), 1
x y
x x x
=
= >

5.
(i)
f
25
R ,
12
| (
=
(
\
and
( )
g
D ,3 =

Since
f g
R D _ , gf
exists.
(ii)
( )
2
gf : ln 3 5 3 , x x x x
+
+ e


( )
g f
25 11
0, , ln ,
12 12
| ( |

|
(
\ .

(iii) The least value of a is
5
6
.
Let y = f(x).

2
2
2
2
2
5 3
5
3
3
5 25
3
6 12
5 1 25
6 3 12
5 25 12
6 36
y x x
y x x
y x
x y
y
x
=
| |
=
|
\ .
(
| |
= +
(
|
\ .
(

| | | |
=
| |
\ . \ .
| |
=
|
\ .

( )
1
25 12 5 25 12 5 5
reject
36 6 36 6 6
25 12 5 25
f ,
36 6 12
y y
x x x
x
x x
| |

= + = + >
|
\ .
= + s

(iv) ( ) ( )
( )
( )
1
2
2
f f
f
5 3
3 4 0
3 4 0
5 4
0 (reject ) or
6 3
x x
x x
x x x
x x
x x
x x x
=
=
=
=
=
= > =

6.
(i)

(ii) Every horizontal line y k = ,
f
R k e intersects the curve f ( ) y x = exactly once.
Therefore f is one-one and
1
f
exists.

3 4 10
3
2 2
x
y
x x
= =
+ +

10
3
2
10
2
3
y
x
x
y
=
+
=

1
10
f ( ) 2, 3
3
x x
x
= =

(iii) ( )
g
f
R 0,
D \ { 2}
=
=

Since
g f
R D _ , fg exists.

3e 4
fg( ) ,
e 2
x
x
x x
= e
+

( )
fg
R 2,3 =
(iv)

1
gg ( ) y x
=
O
y
x
Topic 7. Curve Sketching (Suggested Solutions)

1. (i)
( ) ( )
( )
2
9( 1)
(3 )
3 9 1
3 9 9 0
x
y
x x
yx x x
yx y x
+
=
= +
+ =

For no real values of x, discriminant 0 <

( ) ( )( )
2
2
2
3 9 4 9 0
9 90 81 0
10 9 0
1 9
y y
y y
y y
y
<
+ <
+ <
< <

Hence, y cannot lie between 1 and 9.
(ii)

2.
(i) y =
2
( 2)
1
x
x

=
2
4 4
1
x x
x
+

=
1
3
1
x
x
+

Asymptotes: x = 1 and y = x 3
(ii)
d
d
y
x
= 0
2
1
1
( 1) x
= 0
2
( 1) x = 1
x = 0 or x = 2
(iii)
2
2
( 2) ( 1)
( 2)
1
x x k x
x k
x x
=

Sketch y
k
x
=

For k > 0, there are 3 intersection points
(A,B,C) there are 3 real roots

For k < 0, there is only 1 intersection
point (D) only 1 real root.

3.
(i) Axial intercepts: 0,
a
b
| |
|
\ .

(ii) y =
2
x a
x b
+
+

=
2
a b
x b
x b
+
+
+

Asymptotes: x b = and y x b =
(iii)
2
2
1 0
( )
dy a b
dx x b
+
= =
+

2
x b a b + = +
2
x b a b = +

4.
(i)
2
x
y
x a
=

2
2
( )
0
y x a x
x yx ay
=
+ =

For real x ,
2
( ) 4(1)( ) 0 y ay >
( 4 ) 0 y y a >
0 y s or 4 y a >
(ii)
2
x
y
x a
=

=
2
a
x a
x a
+ +

Asymptotes: x a = and y x a = +

When 0, 0 x y = =
d
0
d
y
x
=
2
2
1 0
( )
a
x a
x a a
=
=

0 x = or 2 x a =

(iii)

2
| | x m x a =
2
2
| |
x
m
x a
x
m
x a
=

Consider y =
2
x
x a
and y = m
From the graph, for the equation
2
x m x a = to have exactly 3 distinct real roots, m = 4a

5.
(i)
2
ax bx c
y
x d
+ +
=
+

=
2
( )
c bd ad
ax b ad
x d
+
+ +
+

1, a = 1 d =
3 3 1 4 b ad b = = + =

(ii)

3
3
1
c
y x
x
= + +
+

d
0
d
y
x
=
2
3
1 0
( 1)
c
x

=
+

1 3 x c + =
For curve to have 2 stationary points, 3 0 c > , i.e. 3 c >
1 3 x c = + or 1 3 x c =

(iii)
When 4 c =
1
3
1
y x
x
= + +
+

6. (i)
1
2 2
(1 2 ) 1
1 (2 1)
1
2 1
t
x
t
x t t
x t x
x
t
x
+
=
= +
= +
=
+

1
1 2
1 25 2 1 2 2 4 1 2 1
1 1 2 1 1 2
1
2 1
4 1
2
x
x x x x
y
x t x x x
x
x
y
x
| |
+
|
+ + + +
\ .
= = = =
+ + + | |
|
+
\ .
=
+

(ii)
4 1 9
4
2 2
x
y
x x
= =
+ +

Asymptotes 2 x = and 4 y =

When 0 x = ,
1
2
y =
When 0 y = ,
1
4
x =

(iii)

2
4 1 4( 2) ( 2) x x a x = + + +
4 1
4 ( 2)
2
x
a x
x

= + +
+

Consider y = 4 ( 2) a x + +
which is a line passing through point (-2,4), with gradient a.

for equation
2
4 1 4( 2) ( 2) x x a x = + + + to have no real roots, the line
y = 4 ( 2) a x + + does not intersect C.
Thus 0 a >

7.
Vertical asymptote is x = 0
d = 0
2
2
( )
ax bx c
f x
x
+ + +
=
=
2 c
ax b
x
+
+ +
Oblique asymptote is 1 y x =
1 a = , 1 b =
(i)
2
1
c
y x
x
+
= +
2
2
d 2
1 0
d
2
y c
x x
x c
+
= =
= +

Since the graph has no stationary points, there are no real roots to the equation
2
2 x c = +

2 0 c + < 2 c <

(ii) If 1 c =
1
1 y x
x
= +
Asymptotes: 0 x = and
1 y x =
2
d 1
0 1 0
d
y
x x
= =
1 x =
1, x = y = 1
1, x = y = 3

From the graph, there are
2 intersection points
(A,B) between C
1
and C
2.

8.
(i) By long division,
2
2 2
1 2 4
2 ( 2)
x
y x
x x
= = +
+ +

Oblique asymptote:
2
1 2
y x

= , Vertical asymptote:
2
x
=

(ii)

2
2
d 2 (2 ) ( )
0
d (2 )
y x x x
x x

+
= =
+

4
0 or x x
= = (Exactly 2 points shown)

(iii)

(iv)
( )
2 2
2 2 2
1 2
2
2 2
2 2
x x
x x x
x x

+ +
+ +
> >
+ +

2 2 2
2
2
2 2
x x x
x x

+
+ >
+ +

( )
2
2
2
2 2
x x
x
x x

+
+ >
+ +

2
2
2
x
x
x

>
+

When
2
2
2
x
x
x

=
+
,
2
(2 )(2 ) x x x = +

2 2
4 ( ) x x =
2 2
(1 ) 4 x + =
2
2
1
x
=
+

Sketching the
graph of
2 y x = on the
same diagram,

For
2
2
2
x
x
x

>
+
,
2 2
2 2 2
the solution is or
1 1
x x

< s >
+ +
.

Topic 8. Conics (Suggested Solutions)

1.
(i)
( )
1
6
2
9
2
2
2
2
=
+
+
x y

x-axis intercepts: (8, 0), (4, 0)
y-axis intercepts: (0, 8.49), (0, 8.49)

(ii)
1
2 3
36 9 4
2
2
2
2
2 2
=
=
y x
y x

Asymptotes: x y
3
2
=
Vertices: (3, 0), (3, 0)

2.
Substituting the points (1, 1) , (5, 1) and (0,1.5) into the equation, we obtain the
three equations respectively:

34 a b c + = ----------(1)
25 154 a b c + = ----------(2)
1.5 9 b c + = ----------(3)

By G.C., we obtain 5 a = , 8 b = and 21 c = .

Thus, the equation of hyperbola is
2 2
5 30 4 8 21 0 x x y y + = .
By completing the square, we obtain
2 2
5( 3) 4( 1) 20 x y + = .
( ) ( )
2 2
2 2
3 1
1
5 2 ( )
x y +
=
Hence, the hyperbola is centred at (3, 1) with oblique asymptotes
5
2
5 3
1
2
y x = and
3
2
5 5
1
2
y x = + .

3.
(i) Given 16 q = .
( )
( )
( )
( )
( )
2 2
2 2
2
2
2
2
2
2
2
2
2
2 2
6 16 8 1 0
1 1
3 3 16 1 0
4 4
1
3 16 9
4
1
3 16 3
4
1
3
4
1
3
3
4
x x y y
x y
x y
x y
y
x
+ + + =
(
| |
(
+ + + =
(
|

\ .
(

| |
+ + =
|
\ .
| |
+ + =
|
\ .
| |
|
+
\ .
+ =

(ii) The graph formed will be a hyperbola.
y = -1
x = 3
(3, -1)
5
2
5 3
1
2
y x =
3
2
5 5
1
2
y x = +
(5,-1) (1,-1)
x
5 17
2 2
y x =
y
( )
1
3,
4

x

y

4.
(i) For
2 2
t t
u < < ,
1 sin 1
2 sin 2 2
2 2
a a a
a x a
u
u
< <
< + < +
< < +

0 cos 1
0 3cos 3
0 3 y
u
u
< s
< s
< s

(ii) Since
2 2
sin cos 1 u u + = ,

( )
2
2
2 2
2
1
3
x
y
a
+ =
Alternative answer (Method 2): Not recommended!
1
1
1 1
1
1
2
sin 2 sin (1)
3cos cos (2)
3
Therefore, (1) (2),
2
sin cos
3
2
3cossin
sin cos 2
3
x
x a
a
y
y
x y
a
x
OR y
a
y
OR x a
u u
u u
| |
= + =
|
\ .
= =
=
| |
=
|
\ .
| |
=
|
\ .
| |
= +
|
\ .

For 0 2 a < < , Curve C is a half-
ellipse with centre (2,0) and x-
intercepts ( ) 2 , 0 a .

2-a 2+a (2,0)
(2,3)
5.
(i)
( )
1
16 4
1
:
2 2
1
=
y x
C
Vertex : (1, 0), (3, 0)
Asymptotes : ( ) 2 1 y x =

1
1 2
:
2
+
=
x
x
y C
Axial intercepts : (0, 1), (0.5, 0)
Asymptotes : y = 2, x = 1

(ii)
( )
( )
( ) ( ) ( )
2 2 4
2
2
2
2
1 16 1 2 1 4
16
1
1 2
1 4
1
16
1
1 2
4
1
= +
=
|
.
|
\
|
+

=
|
.
|
\
|
x x x
x
x
x
x
x
x

(iii) 1.02, 3.55
6. (i)

y=(2x-3)/(x+1)
x^2/4+y^2/2=1
y=2
x=-1
-3
1.5 -2
2
sqrt(2)
-sqrt(2)

(ii)
2 2
1
4 2
x y
+ =
2 2
2 4 x y + =
2 2
2 4 y x =
2
2
2 3
2 4
1
x
x
x
| |
=
|
+
\ .

2 2 2
2(2 3) ( 1) (4 ) x x x = + (shown)

(iii) 0.483 x = or 1.95 x =
NJC 2009 SH1 H2 Math Term 3 Common Test

1.

Let P, C and B be the weight of pork, chicken and beef Mrs
Low bought respectively.

+ 12 P C B + =
--- (1)
14 9 +11 124.03 10.17 134.20 P C B + = + = --- (2)

Since Mrs Low bought at least 3.5kg of each type of meat, she
must have bought less than 6kg of pork.

14 0.85 9 + 0.90 11 124.03 P C B + =
14 7.65 + 9.9 124.03 P C B + = ---
(3)

1 1 1 12
14 9 11 134.2
14 7.65 9.9 124.03
P
C
B
| || | | |
| | |
=
| | |
| | |
\ .\ . \ .

Using GC, 3.8; 4.6; =3.6 P C B = =

Mrs Low bought 3.8kg of pork, 4.6kg of chicken and 3.6kg of
beef at the supermarket.

2(i)

By cover-up rule,
( )( ) ( ) ( )
6 2 2
1 1 2 1 1 2
x
x x x x

+ +


2(ii)

( )( ) ( )( ) ( ) ( )
( ) ( )
( ) ( )
1 1
2 2
2 2
2
2
1 6 1 2 2
1 1 2 6 1 1 2 6 1 1 2
1
1 1 2
3
1
1 ... 1 2 4 ...
3
1
1 ... 1 2 4 ...
3
1
3 3 ...
3
...
x x
x x x x x x
x x
x x x x
x x x x
x x
x x

( (
= =
( (
+ + +
( (

(
= +

(
= + + + + +

( = + + + + +

( = +

= +

For expansion to be valid, 1 x < and 2 1 x <
1
2
x <

3(a)

3(b)

( )
( )
( )
( )
1
2
3
2
1
1
1 2
2
1
2
tan
d 1 1
tan
d 1
tan
1
2 1
x
x
x
x x x x x
x
x
x x
| |
| |
| | | |
| (
= + |
| |
|
|
+
\ . \ .
\ .
\ .
=
+

1
e
y x y
x
+ +
=

Taking ln on both sides, we get

( 1)ln y x x y + = +

Differentiate implicit wrt x, we get


( )
d 1 d
ln 1
d d
d 1
ln 1 1
d
d 1
d (ln 1)
y y y
x
x x x
y y
x
x x
y x y
x x x
+
+ = +
+
=

=

4(a)

( )
( )
( )( )
( )( )
( )( )
2
2
2
2
2 3
2 3
2 3 0
2 3 2 3 0
3 3 3 0
3 1 0
x x
x x
x x
x x x x
x x
x x
> +
> +
+ >
+ + >
+ >
+ + <

Solving we get 3 1 x < < .

Alternative: Graphical Approach

From the graph, 3 1 x < <

2 3 y x = +
3
1
y x =

4(b)
( ) ( )
( )
2
4 1 3
0
1 2
x x
x
+ +
s
,
1
2
x =
( ) ( )( )
2
4 1 3 1 2 0
1 1
3 or or
4 2
x x x
x x x
+ + s
s = >

( ) ( )
( )
( ) ( )
( )
2
2
1
2
2 1 2 3
0
1 2
4 2 1 2 3
0
1 2 2
x x
x
x x
x
+
+
+ +
s
(
+ +

s
(

Replacing x with 2
x
,

1 1
2 3 (rej.) or 2 (rej.) or 2
4 2
x x x
s = >

1 x >

5(i)

| |
( )
1
3 3(2 1) (2 1)
3 3
2 1 2 1 (2 1)(2 1)
3 (4 4)
(2 1)(2 1)
4( 1) 3
(shown)
(2 1)(2 1)
r
r r
r
r
r r
r r r r
r
r r
r
r r
+
+
=
+ +
=
+
=
+

5(ii)

5(iii)

1 1
1
1
2
3 2
4 3
1
1
1
3 ( 1) 1 3 .4( 1)
(2 1)(2 1) 4 (2 1)(2 1)
1 3 3
4 2 1 2 1
1 3 3
4 3 1
3 3
5 3
3 3
7 5
...
3 3
2 1 2 3
3 3
2 1 2 1
1 3
3
4 2 1
r r N N
r r
r r N
r
N N
N N
N
r r
r r r r
r r
N N
N N
N
= =
+
=
+
+

=
+ +
(
=
(
+

|
=
\
+
+
+
+

|
+
|
+
.
| |
=
|
+
. \

10 10 2
3 1 1
11 3
11 3
3 7
3 ( 1) 3 ( 1) 3 ( 1)
(2 1)(2 1) (2 1)(2 1) (2 1)(2 1)
1 3 1 3
3 3
4 2(10) 1 4 2(2) 1
1 3 3
4 21 5
3 3 1
4 7 5
2108 (to nearest whole number)
r r r
r r r
r r r
r r r r r r
= = =

=
+ + +
| | | |
=
| |
+ +
\ . \ .
| |
=
|
\ .
| |
=
|
\ .
=


6(i)

6(ii)

2
2
2
3
2
4
2
5
5 3 25
3 2 6
7 25 49
5 6 6
9 49 81
7 6 6
11 81 121
9 6 6
u
u
u
u
| | | |
= =
| |
\ . \ .
| | | |
= =
| |
\ . \ .
| | | |
= =
| |
\ . \ .
| | | |
= =
| |
\ . \ .

Conjecture:
( )
2
2 1
6
n
n
u
+
=
Let P
n
be the statement
2
(2 1)
6
n
n
u
+
= for n
+
e .
When 1 n = , LHS of P
1
=
1
3
2
u =
RHS of P
1
=
2
3 3
6 2
=
Therefore P
1
is true.
Assume that P
k
is true for some k
+
e . ie.
( )
2
2 1
6
k
k
u
+
=

Consider P
k+1
:
RHS of P
k+1
=
( )
2
2 3
6
k +

LHS of P
k+1
=
1 k
u
+

=
2 2
2 2
2 3 2 3 (2 1) (2 3)
2 1 2 1 6 6
k
k k k k
u
k k
+ + + + | | | |
= =
| |
+ +
\ . \ .

= RHS of P
k+1


Thus, P
k
is true P
k+1
is also true

Since P
1
is true and P
k
is true P
k+1
is also true, by
Mathematical Induction, P
n
is true for all n
+
e .

7(a)

7(b)

The instalment plan is a GP with common ratio 1.03 r = .
Let a be the amount of the first instalment.

Total amount that he needs to pay

$30000 $(65 48) $33120 = + =
Therefore,
( )
( )
48
1.03 1
33120
1.03 1
a
>
317.22 a > .

Min a = $318 (nearest dollar)

The instalment plan is an AP with common difference 30 d =
and first term = 200.
Let n be the number of months that is needed to pay off the
loan.

Total amount that he needs to pay

( ) $30000 $65 $ 30000 65 n n = + = +

( ) ( )( )
2
2
2
2 200 1 30 30000 65
2
200 15 15 65 30000
15 120 30000 0
8 2000 0
n
n n
n n n n
n n
n n
+ > + (

+ > +
+ >
+ >

Consider
2
8 2000 0 n n + = , we get n = 48.90 or 40.90 .

Hence,

48.90 (rej.) or 40.90 n n s >

Least number of months = 41 (whole number required).

Alternative: Use graphical solution.

40.90 48.90

8.

(a)(i)

(a)(ii)

Graph of y = f(x) Graph of y = g(x)

f(1.5) = 4.25 = f(2.5)

Thus, f is not 1-1. Hence f does not have an inverse.

( )
2
h : 3 2 5 x x ,
| (
, x a e
In order to have the same range and be 1-1, a = 2.

We have: ( )
2
h : 3 2 5 x x ,
| (
, 2 xe

Let ( )
2
3 2 5 y x =

5 5
2 2
3 3
y y
x x
+ +
= =

5
2
3
y
x
+
= , (since 2 x s )
Thus,
-1
5
h : 2
3
x
x
+
,
| ) 5, xe

(3, 2)
(2, 5)
x
y
(4, k)
x
y

(b)
For fg to exists,
| ( ( )
g f
R , , 3 D k = _ = .
Largest integer value of k = 2.

Hence, ( ) g 2 4 x x = .
( )
( ) ( )
( )
2
fg f 2 4 3 2 4 2 5
3 4 5 3 17
x x x
x x
= =
= =

( ) fg 3 17 x x = , xe , 4 x >

| ) ( | | )
g f
4, , 2 5, Thus,
| )
fg
R 5, = .


9(i)

9(ii)

9(iii)

A(1, 3)
x = 3
B (0, 0)
C (2, 0)
x
2 y =
y
x = 3
B (0, 0)
C (2, 0)
x
y
y = 2
y = 2
C (2, 0) B (2, 0)
A (0, 3)
x
2 y =
y
x = 4

10(i)

10
(ii)(a)

( )
2
3 d 3
1 d
1
a y a
y ax a a
x x
x

= + + =

For stationary points,
d
0
d
y
x
= .
( )
( )
2
2
3
1
3
1
a
a
x
a
x
a
=

If C has two stationary points,
3
0
a
a
>
( 3) 0
0 or 3
a a
a a
>
< >

Alternative: Find discriminant > 0

cos 1 x r u = +
1
cos
x
r
u

=
sin 2 y r u =
2
sin
y
r
u
+
=

1 y x =
-

( 1, 2)

-

(3, 6)
1
3
x
y

10
(ii)(b)

Given that
2 2
sin cos 1 u u + = , we have

( ) ( )
2 2
2 2
2
1 2
1
1 2
x y
r r
x y r
+ | | | |
+ =
| |
\ . \ .
+ + =

Q is a circle centre at (1, 2) , radius r.

When r = 3, we get ( ) ( )
2 2
2
1 2 3 x y + + = .

To have Q intersect C, we need to increase the value of r.
Since p is an integer, we increase r by whole number values.

Plotting Q on C for various values of r using the graphing
calculator, we will find that Q will not intersect C for 4 r s ,
but Q will intersect C at 4 points for 5 r > .
Hence, smallest value of p = 5.


1 Method 1: Graphical

The x coordinates for the intersection points are 2.30, 1, 1.39 .
2.30 or 1 1.39 x x < < < .

Method 2: Algebraic

3 2
3 2
( 1) 2 3 2
2 4 1 0
x x x x
x x x
> +
+ <

0.227 1.39 x => < < or 3.16 x <

3 2
3 2
2
( 1) ( 2 3 2)
2 2 3 0
( 1)( 3) 0
x x x x
x x x
x x x
< +
+ <
+ + <

2.3 x => < or 1 1.30 x < <

2.30 or 1 1.39 x x < < <

Replace x by x .
2.30 1 1.39 x NA x < < <
1.39 1.39 1.39 x x < < <
2. Let x, y and z be the number of banana cakes, walnut cakes and pandan cakes
respectively.
0.5 0.2 0.25 19.5
0.5 0.75 57.5
10 20 5 950
x y z
x y z
x y z
+ + =
+ + =
+ + =

Solving using GC, 15 x = , 35 y = and 20 z = .
Glenda must have sold 15 Set As and 20 Set Bs.
Therefore, Glenda raised a total of 15 25 20 20 $775 + = .
3. (i) Method 1: Partial
Fractions
( )( )
( )
( )( )
( )
( )( )
1 1
2
2
2 2
1
2 3 2 3
3 2
5 5
2 3
3 2
1 1
10 2 15 3
1 2
3
1 1 ...
10 2 2! 2
1 2
2
1 1 ...
15 3 2! 3
3 3 3 2 2 2
... ...
10 20 40 15 45 135
x A B
x x x x
x x
x x
x x
x x
x x x x

+
= +
+ +
= +
+
| | | |
= +
| |
\ . \ .
| |

| | | |
= + + +
|
| |
|
\ . \ .
\ .
| |

| | | |
+ + +
|
| |
|
\ . \ .
\ .
| |
= + + + + + +
|
\ .
2
1 7 13
...
6 36 216
x x
| |
|
\ .
= + + +

Method 2: Direct Expansion
( )( )
( )( ) ( )
( )
( ) ( )
( )( )
( )
( )( )
( )
1 1
1 1
2
2
2
2
1
2 3
1 2 3
1 1
1 1 1
2 2 3 3
1 2
1
1 1 1 ...
6 2 2! 2
1 2
1 1 ...
3 2! 3
1 1 7
1 1 ...
6 6 36
1 7 13
...
6 36 216
x
x x
x x x
x x
x
x x
x
x x
x x x
x x

+
+
= + +
| | | |
= + +
| |
\ . \ .
| |

| | | |
= + + + +
|
| |
|
\ . \ .
\ .
| |

| | | |
+ + +
|
| |
|
\ . \ .
\ .
| |
= + + + +
|
\ .
= + + +

3.(ii)
Range of validity is the intersection of 1, and 1
2 3
x x
< < , which is 2 x < .

4. (a)
1 2 1 2
4
1 2
4 1 2
1
ln cos ( ) ln[cos ( )]
2
2
d 1
1

d 2 cos ( )

1 [cos ( )]
y x x
x
y
x
x x
x
x x

= =
(
(
( =
(
(

4. (b)
2 2
4 3 1 0
d d
2 4 4 6 0
d d
d
(6 4 ) 4 2
d
d 2
d 3 2
x xy y
y y
x x y y
x x
y
y x y x
x
y y x
x y x
+ + =
+ =
=

2 2
2
2
Tangent parallel to -axis 3 2 0
3
2
Sub into (1),
3
2 2
4 ( ) 3( ) 1 0
3 3
3 3
2 3

3
2 3
Thus, the exact coordinates are ( 3,
x
y y x y
x
y
x x
x x
x x
y
= =
=
+ + =
= =
=
2 3
) and ( 3, ).
3 3

5 (i)
2
3(3) 2 7 x = =
3
3(7) 2 19 x = =
4
3(19) 2 55 x = =
5
3(55) 2 163 x = =

5(ii) Considering

1
2
2
3
3
4
4
5
1 1 2
1 6 2 3
1 18 2 3
1 54 2 3
1 162 2 3
n
x x
x
x
x
x
=
= =
= =
= =
= =

1 1
1 2(3 ) 1 2(3 )
n n
n n
x x

= = +
Conjecture:
1
1 2(3 )
n
n
x

= +

5(iii)
Let P
n
be the statement
1
1 2(3 )
n
n
x

= + , n
+
e .
When n = 1,
LHS =
1
3 x = (given)
RHS = ) 1 ( 2 1+ = 3
1
P is true.

Assume P
k
is true for some k
+
e ,
i.e.
1
1 2(3 )
k
k
x

= +

When n = k + 1,
1
3 2
k k
x x
+
=

1
3[1 2(3 )] 2
k
= +
3 2(3 ) 2
k
= +
1 2(3 )
k
= +
P
k
is true
1
P
k+
is also true.
Since
1
P is true and P
k
is true
1
P
k+
is also true, by Mathematical
Induction, P
n
is true for all n
+
e .
6(a)(i)

6(a)(ii)

Note: The y-intercept can be anywhere along the y-axis.
x
C( - 3,1)
O
y
( ) f y x =
D( -7, 0)
B (-1,
1
2
)
x
y
D(3,1)
C(1, 1
2
)
O
( )
1
f 2 1 1
y
x
=
+

-1
B(0,
2
3
)
A( 1,-1)
6(b)

Equations of asymptotes:
( )
y b b
y x a
x a a a
= =

7(i)
( ) ( )
3 6 9
1 2 3
2
... 1700
... 1700 where 3 and 9 1
2 8 1 9 1700
2
9 7 3400 0
19.839 (NA 0) or 19.052
least 20
least 60
n
k r
u u u u
w w w w n k w r
k
k
k k
k k k
k
n
+ + + + >
+ + + + > = =
+ > (

+ >
< > >
=
=

7(ii)
( ) ( )
1
3 1 3 1 1
3
1
e
e
e
e
non-zero constant
r
r
r r
r
r
u
u
a
v
v
a
a
a
| |
|
\ .
=
| |
|
\ .
| |
=
|
\ .
| |
=
|
\ .
=

Hence ,... , ,
3 2 1
v v v forms a geometric sequence.
x
O
y
2a
a
-19.839 19.052
For sum to infinity to exist,
3
1 e.
e
a
a
| |
< <
|
\ .

2
3
1
2
3 3
2
e
1
e
e
e
e
r
r
a
v
a
a
a
k a
=
| |
|
\ .
=
| |
|
\ .
=

8 (i)
2 2
2 1 1 x ax a
y x a
a x a x
+
= = + +

.

Asymptotes: and y x a x a = + = .
8(ii)
( )
( )
2
2
2
2
2
1
d 1
1 0
d
1
a
y x a
a x
y a
x
a x
a x a
= + +
= + =
=

If no stationary points,
2
1 0
1 or 1.
a
a a
<
> <

8(iii)
x
y
-7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7
-3
-2
-1
0
1
2
3

2 x =
2 y x = +
3.73 0.268
2
4 1
2
x x
y
x
+
=

0.5
8(iv)
x
y
-14 -12 -10 -8 -6 -4 -2 0 2 4 6 8 10 12 14 16 18
-10
-5
0
5
10

When
1 11
0,
3 9
y t x = = = .
From the graph, there are two intersection points between C and D.
9(a)(i)
2
2
2
2 2 2
( 1) 1
2
1
( 1) ( 1)(2 1) 1 2 (2 )
6 2
( 1) ( 1)(2 1) 1 ( 1)(2 )
6
2( 1) ( 1)(2 1) 1
6
2 ( 1)(2 1) 3
6
n
n n n
r
r r r
n r
n r r
n n
n n n n n
n
n n n n n n
n
n n n
n
n n n
=
= = =
+ +
=
| | | |
= + + +
| |
\ . \ .
= + + + +
= + + +
= + + +

9(a)(ii)
2
3
3 2
3
2 2 3
2
( 1) 1
1 1 1
2 ( ) 3
3 2 6
2 1 1 1 3

3 2 6
n
n
r
n r
S
n
n
n n n
n
n n n n
=
+ +
=
| |
= + + +
|
\ .
= +

2 2 3
2 1 1 1 3
lim
3 2 6
1
=
3
n
S
n n n n

= +

2
2 1, 3 1 x t y t = + =
11
9

2
4 1
2
x x
y
x
+
=

9(b)(i)
2
2
!( 1) ( 1)!
!( 1 )
!(1 )
r r r r
r r r r
r r
+
=
= +

| |
2
1
1
!(1 )
!( 1) ( 1)!
1!(0) 2!(1) 2!(1) 3!(2) ... !( 1) ( 1)!( )
( 1)!
n
n
r
r
r r
r r r r
n n n n
n n
=
=
+
= +
= + + + +
= +

9(b)(ii)
2 2
1 1
1 1
1
( 1)! !(1 ) ( )!( 1)
( )!( 1)( 1) ( 1)!( 1)
( 1)!( 1) ( 1)!
n n
n n
n
r r
r r
r
n n r r r r
r r r r r
r r n n
= =
= =
=
+ = + >
= + = +
+ < +

10(a)(i)
2
2, 1 1
f ( )
1
, 1 4
x x
x
x
x
+ < s
=

< s

10(a)(ii)
Any horizontal line, y = k, where 1< k < 2, cuts the graph more than once.
This implies that f is not 1-1 and thus f
-1
does not exist.
Alternatively,
1
4
-1
1
x
y
O
f ( ) y x =
2
Since
1 1 7
f f
2 2 4
| | | |
= =
| |
\ . \ .
, f is not 1-1 and thus f
-1
does not exist
10(a)(iii)
a = 0
-1 -1
1
1 1 1
f
f f f
1
[ , 2]
4
D D R = = =

10(b)(i)

R
g
= (, ), D
h
= (1,)
g h
R D _ , hg does not exist.

10(b)(ii)
For R
g
D
h
, R
g
= D
h
= (1,)
2
g( ) ln( 1) 1 x x = =
1
1 1.17 (to 3 s.f.) x e
= + =

Hence, maximal domain of g = (1.17,)
( )
2
2
hg( ) h ln( 1)
1
2
ln( 1) 1
x x
x
=
=
+
, x > 1.17,
hg h
R R ( , 2) = =

x
y
2
y = g(x)
1 O
0.25 O
2
-1
1 1
f f ( ) y x x = =
x
y
1
(a)
(i)
Since
24
6,
4
= divide the population in intervals of 6 in the order in which
the students are numbered (i.e. first interval Students 1 to 6, second
interval Students 7 to 12, last interval students 19 to 24)
Randomly select the first student by
- writing the numbers 1 to 6 on slips of papers, fold them and put them
in a box. Shake the box thoroughly and pick a slip of paper from the
box.
- Use a random number generator, such as using randInt in the TI84
Plus Graphing Calculator as follows:

Let n be the number generated from the random selection. Select the
student numbered n and every 6
th
student after that until a sample of size
4 is formed i.e. the sample is the collection of all students corresponding
to the numbers n, n + 6, n + 12, n + 18.

OR
Randomly select a number between 1 and 24 and pick the student
corresponding to that number as the first student. Then select every 6
th

student after that until a sample of size 4 is obtained. If the first number
chosen is not from 1 to 6, the selection will have to be cycled back to the
front until enough students are obtained.
1
(a)
(ii)
Divide the population into the strata: girls and boys. The numbers for the
strata are:
Girls Boys
18 6
4. John

Hence the sample is to consist of
18
4 3 girls
24
= and
6
4 1 boy
24
=

Randomly select 3 girls and 1 boy from all the girls and all the boys in the
class respectively to form the sample of size 4.

1
(b)

Possible Answers:

Stratified sampling is more appropriate because it takes into account
potential differences in opinions between girls and boys, and hence the
sample will be more likely to be representative of the population.

OR

Stratified sampling is more appropriate because if systematic sampling is
used and the students numbered 1, 2 or 3 is selected as the first student,
the resulting sample will contain only girls, which will not be
representative of the population.

OR

Systematic sampling is more appropriate because if stratified sampling is
used, only 1 boy will be selected. This will result in a higher probability of
bias being introduced, and the sample may not be representative of the
population.

2

2
For all real values of , 2 0, + > x x x k

( ) ( )( )
2
2
4 0
2 4 1 0
4 4 0
1
b ac
k
k
k
<
<
<
>

2
2
2 2
0
2 3
x x
x x
+
>


2
2 2
0
( 1)(2 3)
+
>
+
x x
x x

( ) From earlier part, since 2 1 k = >
,
2
2 2 0 x x + >
.

( )( ) 1 2 3 0 x x + >

3
1 or
2
< > x x

OR
3
1 ,
2
< > x x

3
(i)
( )( )
2
2 2
4 12
2 4 4 2
x x Ax B C
x x x x
+ +
= +
+ +

( )( ) ( )
2 2
4 12 4 2 x x Ax B x C x + = + + +
Let x = 4,
72 18 4 C C = =

Let x = 0,
12 4 2 1 B C B = + =

Let x = 1,
15 3 3 3 0 = + + = A B C A

( )( )
2
2 2
4 12 1 4
2 4 4 2
x x
x x x x
+
= +
+ +

(ii)
( )( )
( )
2
2 2
1
1
2
1 1
4 12 1 4
2 4 4 2
2 1 4 4 1
2 4

+
= +
+ +
| |
| |
= + +
| |
\ .
\ .
x x
x x x x
x x

2
2
1 ( 1)( 2)
1 ( 1) 1 ( 1) ...
2 2 4 2! 4
| | | | | |
= + + + + +
| | |
\ . \ .
\ .
x x x

2
3 3
...
2 4 16
= + +
x
x

OR
( )( )
( )( ) ( )
2
1
1
2 2
2
4 12
4 12 4 2
4 2
x x
x x x x
x x

+
= + +
+

For expansion of
1
2
1
2
x

| |
+
|
\ .
to be valid,
2
1 2 2
2
x
x < < < .

For expansion of
1
1
4
x

| |
|
\ .
to be valid, 1 4 4
4
x
x < < < .

Thus 2 2 x < < .

(iii)
From the expansion,
d 1 3
...
d 4 8
= +
y
x
x

Hence, when x = 0,
2
3 1 3 3
(0) (0) ...
2 4 16 2
= + + = y
d 1 3 1
(0) ...
d 4 8 4
= + =
y
x

Hence, equation of tangent to the curve
( )( )
2
2
4 12
4 2
x x
y
x x
+
=
+
is
3
2 4
x
y = + .

4(i) Let the limit of the sequence be k.
Then as n ,
n
u k and
1 +

n
u k . Therefore
( )
4 1
2 2
3
= + k k

Since k is a solution to the equation
( )
4 1
2 2,
3
x x = + k = a or k = b.
Using the G.C., by sketching the graphs of ( )
4 1
2 2
3
y x = + and y x =
and finding points of intersection, the possible values of k are 2 and 3.44
(to 3 s.f.)

4
(ii)

For , < < a x b the graph of
4
1
( 2) 2
3
y x = + lies below the graph
of y x = and above the line y = a. Hence if , < <
n
a u b
4
1
( 2) 2
3
< + <
n n
a u u

1
(shown)
n n
a u u
+
< <
4
(iii)

If
1
, < < a u b then

2 1
(using part (ii)) < < a u u
3 2
< < a u u
4 3
< < a u u

Hence
1 2 3
... ... , > > > > > >
n
u u u u a so the terms of the sequence
decrease and become closer and closer to a. Therefore the sequence
converges to the limit a = 2.
5
(a)
Since the curve cuts the y-axis at 6 y = , 6 d = .
The curve cuts the x-axis at 2 x = .
n
u

4
1
( 2) 2
3
n
u +
x

y x =

a

y

O

4
1
( 2) 2
3
y x = +
b
n
u

a

0 8 4 2 6 8 4 2 6 (1) a b c a b c = + + + + + =
The curve has a minimum turning point at 3 x = i.e.
d
0
d
y
x
= at 3 x = .
2
d
3 2 27 6 0 ---(2)
d
y
ax bx c a b c
x
= + + + + =
It is also given that the line 5 4 y x = is parallel to the tangent of the
curve at 1 x = .
d
4 3 2 4 ---(3)
d
y
a b c
x
= + + =

By use of graphing calculator to solving the system of 3 linear equations,
1, 5 and 3 a b c = = =

3 2
5 3 6 y x x x = + +
(b) (1) Translate 1 unit towards negative y-axis direction.
Followed by either
(2) Reflect about y-axis.
OR
(3) Scaling of factor
1
2
along x-axis.
Steps (1), (2) and (3) in any order.

6
(a)

( ) ( )
( )
( )
( )
( )
( )
2 2
1 1
1
1 1 1
2
2 2
ln e ln ln e
ln 2
ln 2
1
ln1 ln 2 ln3 ln 2
2
ln !
ln !
k k
r k r k
r r
k
r
k k k
r r r
r r
r r k
r r k
k k
k k
k k k k
k k

= =
=
= = =
= +
= +
= +
+
= + + + + +
= + +
= +

(b)
1
2
3
1
2
2
3
3
4
u
u
u
=
=
=

1
n
n
u
n
=
+

Let
n
P be the statement ,
1
n
n
u
n
=
+
for 0 n > .
When 0 n = ,
0
LHS 0 u = = .

0
RHS 0
0 1
= =
+
.
Therefore
0
P is true.
Assume that
k
P is true for some 0 k > , i.e. .
1
k
k
u
k
=
+

( ) ( ) ( )
( )( )
( )
( ) ( )
( ) ( )
( )
( ) ( )
1
2
2
1
1 1 1
1
1 1 2
2 1
1 2
2 1
1 2
1
1 2
1
.
2
k k
u u
k k
k
k k k
k k
k k
k k
k k
k
k k
k
k
+
= +
+ + +
= +
+ + +
+ +
=
+ +
+ +
=
+ +
+
=
+ +
+
=
+

Since
0
P is true and
k
P is true implies
1 k
P
+
is true, hence by Mathematical
Induction,
n
P is true for all 0 n > .

7
(i)

r = 0.981
(ii) As yield of a palm oil, y, depends primarily on the amount of rainfall, x, in
the growing season, x is the independent variable, use the regression line
y on x.

y = 7.41977 + 1.11537x.

As y = 6.52 is within the data range and r = 0.981 is very close to 1,
indicates a strong positive linear relationship between x and y, the
estimate is reliable.
(iii) r remains unchanged.
(iv) y = 7.210354 + 1.097551x (1) and
x = 6.820560 + 0.876225y(2)
Now (1) and (2) intersect at ( x , y )
Substitute (1) into (2),
( )
( )
6.820560 0.876225 7.210354 1.097551
0.502667566 / 0.038298375 13.1250364
13.1250364
7.210354 1.097551 13.1250364 7.1950428
x x
x
x
y
= + +
= =
=
= + =

Let the eight pair of x and y be (a, b).
12.3 13.7 14.5 11.2 13.2 14.1 12
8
91
13.1250364
8
14.0002912 14.0 (to 3 sf)
a
x
a
a
+ + + + + + +
=
+
=
= ~

6.25 8.02 8.42 5.27 7.21 8.71 5.68
8
49.56
7.1950428
8
8.0003424 8.00 (to 3 sf)
b
y
b
b
+ + + + + + +
=
+
=
= ~

8(i)

( ) ( )
( )
( ) ( )
( )
( )( ) ( )
( ) ( ) ( )( ) ( )
( )
( )( ) ( )
( )( ) ( )
1 1
1
1
1 1 2 1
1 1
1 1 1 2
1 2
(shown)
1 2
n n n n
n
b b n m a n m a
n m n m
n n n m n n n m
n n n m n n n m
n m n
n n n n m
m
ma
n n n n m
+ +
= + + +
+ + +
=
+ + + + + +
=
+ + + + +
+
=
+ + +
= =
+ + +

(ii)
( )
1
1 1
1 2
2 3
3 4
2 1
1
1
1

1

N N
n n n
n n
N N
N N
N N
a b b
m
b b
b b
b b
m
b b
b b
b b
+
= =

+
=
(
(
+
(
( +
(
=
(
(
+
(
+
(
(
+

( )
( ) ( )
( )
( ) ( )
( )
( )( ) ( )
( ) ( ) ( )( ) ( )
( )( )( ) ( )
( )
1 1
1 1
1
1
1 1
1 1
1
1 2 1 1 2 1
1 1 1
1 2 1 2
1 1 1(2)(3)
! 1(2)(3) 1 2
1 1 !
! !
N
N
b b
m
m a N m a
m
m N m
m m N N N m
m m N N N m
N
m m N N N N m
N
m m N m
+
+
=
= + + + (

( + + +
=
(
+ + + + +

(
=
(
+ + +

(
=
(
+ + +

| |
=
|
|
+
\ .


( )( )( )
( ) ( )
( )
( )
4
4
3
1 1
1 1 1 1
4.5.6.7 5.6.7.8 6.7.8.9 1 2 3
(Let 3)
1 1 ! 1 1 3!
lim
3 3! 3 ! 3 3! 3 3 !
1 1 1 1 3!
3 3! 3 3! 3 3 !
3!
3 6!
1
360
n
n
n
n n
n n
N
n n n n
a m
a a
N
N
= =
+ + + =
+ + +
= =
=
( | | | |
=
( | |
| |
+ +
(
\ . \ .
| |
| |
=
|
|
|
+
\ .
\ .
=
=

9
(a)
( ) ( )
2
2
2
1
5 9
1 5 1 9 7 15
n
n
S n n
S n n n n
= +
= + = +

( ) ( )
( )
( ) ( )
2 2
1
1
1
2 1 1
5 9 7 15 2 6, 2
2 1 6 2 4
Then 2, 2
Then 2 2 6 2 1 5 9 7 2
n n n
n
n n
u S S n n n n n n
u n n
u u n
u u S
+
+
= = + + = >
= + =
= >
= = + = = (

Therefore the sequence is not an arithmetic progression.

OR

( ) ( )
( ) ( )
( ) ( )
2
2
1
2
2
2
3
5 9
1 5 1 9 5
2 5 2 9 3
3 5 3 9 3
n
S n n
S
S
S
= +
= + =
= + =
= + =

So
1 1
2 2 1
3 3 2
5
2
0
u S
u S S
u S S
= =
= =
= =
3 2
2 1
Then 0 ( 2) 2
and 2 5 7
u u
u u
= =
= =

2 1 3 2
Since , the sequence is not an arithmetic progression. u u u u =

(b)
(i)

Total number of operation hours by Machine A

( )( )
5
8 24 12 1 0.9
1 0.9
9435.1104

=
=

Total number of operation hours by Machine B
( ) ( )
5
7.5 24 12 4 0.5
2
9360
= +
=

Total number of operation hours for both machines in 5 years
9435.1104 9360
18795.1104
18795 (shown)
= +
=
~

(ii)
Let
A
T and
B
T be the daily operation hours of Machine A and B in year n
respectively.
Then 0
A B
T T <
i.e.
( ) ( )( ) ( )
( )
1
1
8 0.9 7.5 1 0.5 0
8 0.9 8 0.5 0
n
n
n
n
+ <
+ <


Using G.C., we have the following sketch of
( )
1
8 0.9 8 0.5
x
y x
= + :

From sketch above, for 0
A B
T T < , 2.9 9.4 x < < .
Therefore, Machine Bs daily operation hours will exceed that of Machine
A in the 3
rd
to 9
th
year.

Maintenance Cost Profit
( ) ( ) ( )( )
( )
1
1
30000 1 5000 35 8 24 12 0.9
25000 5000 80640 0.9
n
n
n
n
= +
= +

Using GC Math Solver, the solution for
( )
1
25000 5000 80640 0.9 0
x
x

+ = is 5.277.
When n = 5, Maintenance Cost Profit < 0
When n = 6, Maintenance Cost Profit > 0
Thus n = 5.
y
x
O
( )
1
8 0.9 8 0.5
x
y n
= +

2.9 9.4
10
(i)

C has a vertical asymptote at 0 x = . 0 (ans) r =
2
2 2 2
2
2
( )
2
2
px q
y
x
p x pqx q
x
q
p x pq
x
+
=
+ +
=
= + +

As x ,
2
0
q
x
.
2
2 y p x pq + .
Oblique asymptote:
2
2 y p x pq = +
Comparing coefficient of x:
2
9 3 or 3 (rejected is non-negative constant) p p p = =
constant: 2
2 6
pq q
p

= = = (shown)
(ii)
2
9
36
y x
x
= + +

2
2
d
9
d 36
y
x x
=
To find stationary point(s):
d
0
d
y
x
=

2
2
2 2
9 0
36
324
18
x
x
x
=
=
=

For
18
x

= ,
2
9 2
18
36
18
y

| |
= + + =
|
| |
\ .
|
\ .
.
For
18
x

= ,
2
9 0
18
36
18
y

| |
= + + =
|
| |
\ .

|
\ .
.

2 2
2 3
d
d 18
y
x x
=

For
18
x

= , ( )
2 2 2
3 2
d 18
0
d
18
18
y
x

= = >
| |
|
\ .
.
, 2
18

| |
|
\ .
is minimum point.
For
18
x

= , ( )
2 2 2
3 2
d 18
0
d
18
18
y
x

= = <
| |
|
\ .
.
, 0
18
| |

|
\ .
is maximum point.

(iii) For 18 = , vertical asymptote at 0 x = ,
Oblique asymptote: 9 18 y x = + ,
Stationary points at ( ) 1, 0 and ( ) 1, 36 .
No y-intercept. x-intercept at ( ) 1, 0 .

9 18 y x = +
( ) 1, 36
( ) 1, 0

1
sin 1 sin
x
x a
a
u u

= + = ,
18
cos 18 cos
y
y a
a
u u

= + =
Using trigonometric identity,

( ) ( )
2 2
2 2
2 2
2
1 18
sin cos 1 1
1 18 (ans)
x y
a a
x y a
u u
| | | |
+ = + =
| |
\ . \ .
+ =

For C and D intersect more than once,

Note that D is a circle with centre at (1, 18) and radius a unit.
least integer value of 19 a = (ans)

11
(i)

Turning point of
( )
2
f 2 3 x x x = +
is at ( 1,4).
1 k =

( )
2
f 2 3 x x x = +
( )
2
2 3 x x = + +
( )
2
2 1 1 3 x x = + + +
( )
2
1 1 3 x
(
= + +

( )
2
1 4 x = + +

Let ( )
2
1 4 y x = + +
( )
2
1 4 x y + =
1 4 or 4 x y y + =
4 1 or 4 1 (rejected since 1) x y y x = <

( ) ( ) -1
1
f
f
f 1 4 , 4 D R x x x
= < =
( ) f y x =
(ii)
Let
1
1
h
2
m
| |
=
|
\ .

Then
( )
1
h
2
m =

( ) ( )
2
1
h 1
2
m m m m = =

Using G.C. (PlySmlt2 in Apps) to solve
3 2
1
0
2
m m m + =
,
1
0.403 or 1.45 (rejected 1 ) or
3
1
0.855(rejected 1 )
3
m x
x
= < <
< <

0.403 (to 3 s.f.) m=

(iii)
h
5
R 1,
27
| |
=
|
\ .

( )
g
D 2, =
Since
h g
R D _ , composite function gh exists.

( ) ( ) ( )
( )
2
3 2
gh g 1
ln 2
x x x x
x x x
=
= +

gh h
1
D D ,1
3
| |
= =
|
\ .

Using mapping,
h
D
1
,1
3
| |
|
\ .
mapping under h
h
R
5
1,
27
| |
|
\ .
mapping under g

gh
R


59
Range of gh = 0, ln
27
| |
|
\ .

Alternatively,

( ) g y x =

( ) gh = y x
59
ln
27

2012 SH1 H2 Math CT Revison Package Solutions

Încărcat de

Informații document

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

2012 SH1 H2 Math CT Revison Package Solutions

Încărcat de

Drepturi de autor:

Formate disponibile

National Junior College Mathematics Department 2012

2012 H2 Maths Revision Package (Solutions) Page 1

, which is the mass of sand to be spread, the neighbour

for all integers 0 n > .

for all integers 1 n > .

for all integers 1 n > .

< < < <

does not exist.

= = (Exactly 2 points shown)

S-ar putea să vă placă și