You are on page 1of 34

ACJC 2013 JC2 H2 Mathematics REVISION SET G

COMPLETE SOLUTIONS
Part I

FUNCTIONS
1 (i)





Since R
f
= (0, 2] _
+
= D
g
, gf exists.

Method 1 (mapping method)

(1, 1) (0, 2] (, ln 2] = Range of gf

Method 2 (graphical method)
gf(x) =
( )
2
ln 2 1 x , 1 < x < 1







Range of gf = (, ln 2]


1 (ii) A translation of 1 unit along the positive x-axis [so y = f(x 1)]
followed by a scaling of factor
1
2
along the x-axis. [so y = f(2x 1)]

OR, A scaling of factor
1
2
along the x-axis [so y = f(2x)]
followed by a translation of
1
2
unit along the positive x-axis. [y = f(2{x
1
2
})]

Note the different values for translation depending whether you scale or translate first.

2 (i)


(ii)
Greatest value of k is 2

( ) ( )
( )
2 2
2
2 2
e e 2 ln( )
2 ln( ) 2 ln( )
Since 2, 2 ln( )
x x
y y x y
x y x y
x x y
+ +
= = + =
+ = =
s =

This gives
1
f : 2 ln( ), , 1 x x x x

e s

1 1
y
x
2
y = f(x)
f g
1
1
y
x
ln2
y = gf(x)
2 (iii)









2 (iv)
( 1
g
f
, 2 and R D

= = (


1
1
g
f
Since , gf exists. R D


_

( ( | )
1
f
1 1 1
g
gf f gf
, 1 , 2 0, D D R


(
= = = (


3 (i)
(ii)
1 2
let
2
x
y
x



( )
1
2 1 2
2 1 2
1 2
2
1 2
f : , 2
2
xy y x
x y y
y
x
y
x
x x
x

=
+ = +
+
=
+
+
>
+



3 (iii)
( ) ,
g
R = ( ) , 2
f
D =
Since ( ) ( ) , , 2
g f
R D = . = , fgdoes not exist

( ) 2,
f
R = ( ) 3,
g
D =
Since ( ) ( ) 2, 3,
f g
R D = _ = , gf exists

( )
1 2 1 2 1 2 3 6 5
gf g ln 3 ln ln , 2
2 2 2 2
x x x x x
x x
x x x x
+ | | | | | | | |
= = + = = <
| | | |

\ . \ . \ . \ .




x
y
O








(0, 1/2)
(1/2, 0)
O
4






































5 (a)
(i)
1
2
1
f '( ) ( 1) sin
1
x x x
x

| |
= + +
|

\ .

For
1
0
2
x s s , f '( ) 0 f ( ) x x > is a strictly increasing function
f is a one-one function the inverse function f
-1
exists.

Let f
-1
(1) = x, then f(x) = 1
( )
1 1
1
( 1)sin 1 1 ( 1)sin 0
1 0 or sin 0
1 (rejected since 0) or 0
x x x x
x x
x x x

+ + = + =
+ = =
= > =

1
f (1) 0

=

(ii) At ( )
1
1
0, f '(0) 1 sin 0 1 and f (0) 1
1 0
x y

| |
= = + = = =
|

\ .

Equation of tangent to the curve y = f(x) at x = 0 is y = x +1

At x = 1, using symmetric property of the curve of f and f
-1
along y = x,
equation of tangent to the curve y = f
-1
(x) at x = 1: x = y +1 y = x 1

5 (b) Range of g = [11, 5]








6 (i) Range of f is {y e : y 3}

(ii) The line y = k (k 3) cuts the graph only once, so the function f is one-one.
Hence f
-1
exists.

Let 4 sec y x = +

1
sec 4
cos
x y
x
= =

-1 1
1
f : cos ( ) , 3
4
x x
x




(iii) Graph is shown on the right.



(iv) Using GC,
x = 2.14 (3 sf) or x = 2.99 (3 sf)


7
(a)
1
1 1
f
f
f is one-one f exists. R D ff exists.


=
(b) (i)
( )
2
gh : ln 2 2 , 0 x x x x + >

gh
R [0, ) =


7 (b) (ii) Domain of g
-1
g = Domain of g = [1, )
and y = g
-1
g(x) = x
Domain of gg
-1
= Domain of g
-1
= Range of g = [0, )
and y = gg
-1
(x) = x
x
11
5 y=g(x)
0
(, 3)
x =



(3, )
y =
2
t



(iii) x 1

8 (a)






(b)



(c)
( )
2
1
Let 2 1 2. Then 2 2 1
1 1
Since 1, 2
2 2
1 1
f : 2, 7
2 2
y x y x
x x y
x x x

= + =
< = +
+ >


( ) = , 7
f
R , ( ) = , 1
g
D . Since
g f
D R _ , gf exists.
( ) ( ) ( ) ( )
f g
, 1 7, ln 7 , a +



Domain is x > 1 and range is y > 0 1 a = 1 a = 2

9 (a)
(i)
2
f ( ) 2 f '( ) 2 0 x x x x x = + + = + = min. point at
2
x

=
Inverse of f exists when 2 4
2

> s
Alternatively, by completing the square,
2
2
2
f ( ) 2 2
2 4
x x x x

| |
= + + = + +
|
\ .

Inverse of f exists when 2 4.
2

> s
(ii) ( )
2
2
Let 4 2 2 2. Then 2 2 y x x x x y = + = = +

1
f : 2 2, 2 x x x

+ >


x
y
x
O
(1, 0)
(1,1) (0, 1)
g( ) y x =
1
g ( ) y x

=
1
g g( ) y x

=
8
6
4
2
-2
-4
-6
-8
-15 -10 -5 5 10 15
x a =
1 a
( ) g y x =
9 (b)
(i)
2
2
2
g( ) 1 1
2 4
k k
x x kx x
| |
= + + = + +
|
\ .

2
R 1 ,
4
g
k
|
=
|
.

g h
hg exists if R D _
2
2
Thus, 1 0
4
4 0
k
k
k
>
>
2 < < 2


(ii)
g
3
For 1, R ,
4
k
|
= =
|

.

3
( , ) , [4, )
4
|

|

.


hg
R [4, ) =

Alternatively,
hg
R [4, ) =




10
(i) ( )
2
f
x
x
x
=


( )
( ) ( )
( )
1
2 2 2
'
3 2 2
2
1
2
2
f 0
x x x x
x
x
x

| |

|
\ .
= = >



f is an increasing function f(x) increases as x increases.

(ii) domain of
1
f

=range of f =( ) , 0 .

( )
( )
2
2 2 2
2 2 2
2
2
1
1
x
y
x
y x x
x y y
y
x
y

=
+ =
=
+

Since 0, x < < 0 y < . Therefore,
2
1
y
x
y

=
+
.

1
2
f ( )
1
x
x
x

=
+
, for 0. x <
(iii)
( )
1 1
2
f f ( )
1 1
x
x
x


=
+ +


( )
( )( )
( )( )
2
2
0.5
0.5
1 1 0.5
4 5 0
4 5 1 0

=
+ +
=
+ =

Since 0, >
5
4
=

Alternatively,
( )
1 1
1
f f ( 0.5) 0.5
f ( 0.5) f 0.5

=
=


( )
( )
( )
( )
( )( )
2 2
2
0.5 0.5
1 0.5 0.5
4 5 0
4 5 1 0




=
+
=
+ =

Since 0, >
5
4
=

11 (i)

(ii)









(iii)
f
R ( , 4 ] a a b = +

2
1
Let f ( ) . Then
1
Since ,
2
f ( ) , 4
b b
x y a y x
x y a
b
x x
y a
b
x a x a b
x a

= + = =

s =

= < s +



( ) ( )
2
1
2
g( ) gf f
b
x x
b
x a

= =
| |

\ .
g( ) , 4 x ab bx a x a b = < s +


12

(i) Least value of k = 1.5
(ii) Let
2
2 3 y x x =


2
1 25
2( )
4 8
y x =


1 8 25
4 16
y
x
+
=

1
1 8 25
f ( ) , 0
4 16
x
x x

+
= + >
(iii)
2
2 3 x x x =


1 7
2
x
+
=

13
Let (1 )
x
y a e

= +


( )
1
ln 1
x
y
a
y
e
a
x

=
=

h
1
(x) = ( ) ln 1
x
a
and
1
D R ( , 2 ]
h
h
a a

= =


0
D R ( , 2 ]
h h
a a
+
= =


Since
1
h ( ) y x

= can be obtained by reflecting h( ) y x = about the line y = x, the


point of intersection of h( ) y x = and
1
h ( ) y x

= is at y = x = b.


0 0
(1 ) d (1 ) d
b b
x y
a e x a e y I

+ = + =
} }
.


Area bounded by
1
h( ), h ( ) y x y x

= = and the axes



2
0 0
(1 ) d (1 ) d ( ) 2
b b
x y
a e x a e y b b I b

= + + + =
} }


Alternatively, Area OAB =
2 2

0 0
0
h( ) d d
2 2
b
b b
x b
x x x x I I
(
= =
(

} }

Since h( ) y x = and
1
h ( ) y x

= are symmetrical about y x = ,


Area OAB = Area OBC =
2
2
b
I .


Area bounded by
1
h( ), h ( ) y x y x

= = and the axes


2
2
2 2
2
b
I I b
| |
= =
|
\ .


14 (i)

h( ) y x =
1
h ( ) y x

=
( , ) B b b
O
(0, 2 ) A a
(2 , 0) C a
y a =
y x =
x a =
14


15
(i) ( ) fh x exist ( ) | )
h f
, 2, R D _ _ least 2 =

(ii) For ( )
1
g x

, let ( ) ln y x =
y y
x e x e = =
( )
1
g
x
x e x

= e

(iii)


16 (i)








(ii)




(iii)
Since any horizontal line, y = k (k 1) cuts the graph of f only once, f is 1-1.
f
1
exists.
( )
5 4
f 1
1 1
x
x
x x

= = +

. Let
4 4
1 1
1 1
y x
x y
= + =

.
( )
1
4 4
f 1 1 , \ {1}
1 1
x x
x x

= = + e


f
1
= f .

( ) ( ) ( ) ( ) ( ) ( )
51 50 2 1
f 4 = f f 4 =f 4 f f f
5 4 1

1 4 3
x x x

( = =

= =



( ) ( )
2
2
g 2 4 = 2 1 2 2 x x x x = + + + + > +
For fg to be defined, R
g
_ D
f
= \ {1} 2 + > 1 > 3.
) ( | )
g f
7
2, 2 , , 1
3

|
+
|


.








y =0
x =0
17 (a)
(i)








(ii)







(iii)









(iv)
( )
1
f ( ) 2tan 2 x x x

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

3 3
2 2
x < <
2 2
2 2
3 1 1 4
0 1 1 4 4 1 1 4
4 4
1 4 1 4
x x
x x
s < s + < < s < s
+ +

Since
2
4
1 4
1 4x
< s
+
, we have
2
4
1 0
1 4x
<
+
giving
'
f ( ) 0 x <
So f ( ) x decreases when x increases (shown).


f
3 2 3 2
,
2 3 2 3
R
t t
| |
= +
|
|
\ .
or ( 1.23, 1.23)
For ff to exist,
f f
R D _
3 2 3 2
,
2 3 2 3
f
R
t t
| |
= +
|
|
\ .
or
f
( 1.23,1.23) R =
3 3
,
2 2
f
D
| |
=
|
|
\ .
or
g
( 0.866, 0.866) R =
f f
R D . . This means that ff does not exist.

Let ( )
1
2tan 2 y x x

=
Then, after reflection, ( )
1
2tan 2 x y y

=

17 (b)
2
h( ) 2 x x = +
( ) ( )
2
4 2 2
gh 2 5 1 4 x x x x = + = +
( ) ( )
2
2
g 2 2 3 4 x x
(
+ = + +


( ) ( )
2
g 3 4 x x = +

Alternatively,
2
h( ) 2 x x = + and
( ) ( ) ( ) ( )
2 2
4 2 2 2 2 2 2
gh 2 5 2 4 4 2 5 2 6 2 13 x x x x x x x x = + = + + = + + +
( )
2
g 6 13 x x x = +

18 (a)
(ii) If ( ) ( )
1
f f o o

= , then ( ) f o o = (intersection at y = x)
( )
2
2 4 o o + =
( )
2
4 4 4 o o o + + =

2 2
4 4 4 0 3 0 o o o o o + + = + =
2
3 0 o o = (shown)


18 (a) (i)

Include the line y = x (in dashes) to show symmetry, and label the equation of the
line. Label the two end-points (2, 4) and (4, 2) and label the equation of both curves.

18 (b) Maximum value of k = 7

(i) Let
2
1
( 7) 4
y
x
=



2
1
( 7) 4 x
y
= ( )
2 1
7 4 x
y
= +
1
7 4 x
y
= +
x ( )
1 1
7 4 or 7 4 rejected 7 x
y y
= + + + s

1
1 1
g : 7 4 , , , 0
4
x x x x
x

+ e s > or
1
g
1
D ( , ] (0, )
4

=

(ii)
gf
1
R 0,
5
| (
=

(
\

Method 1 By mapping, (0, 2] f (, 4] g
1
0,
5
| (

(
\
R
gf
=
1
0,
5
| (

(
\
.
Method 2 By using the graph of y = gf(x) with (, 2] as domain to get
R
gf
=
1
0,
5
| (

(
\
.

19


19
(iii)


20
fg(x) = gf(x) f( ) 2 ln( + x ) = g( ) 2 ln( + x )
ln [ ) 2 ln( + x + 2 ] = ln [ ) 2 ln( + x + 2 ] ) 2 ln( + x = ) 2 ln( + x










y = ) 2 ln( + x y = ) 2 ln( + x

Consider ) 2 ln( ) 2 ln( + = + x x

2
1
) 2 (
+
= +
x
x 1 ) 2 )( 2 ( = + x x 1 4
2
= x
3
2
= x 3 = x (reject 3 = x )
Hence for fg(x) = gf(x), 0 > x or 3 = x

g(x) = ) 2 ln( + x
Note that both 1 = x and 1 = x are in the domain of g.
Clearly 1 = 1, but g(1) = g(1) = ln3.
Therefore, function g is not 1-1 and inverse of function of g cannot be formed.
Greatest a = 0.

Let y = g(x) = ) 2 ln( + x .
Since 0 s x , y = ) 2 ln( + x
y
e x = + 2
y
e x = 2
y
e y =

2 ) ( g
1

Hence
x
e x

2 : g
1
, ) , 2 [ln e x










GRAPHING TECHNIQUES
1. DHS 2011/P1/Q7
(i)












(ii)














(b)




















O
x
x = 1
y =

y =

y




O
x = 2
x
y
2
x
y






O

y
O
x

y = 2


2. HCI 2011/P1/Q10

a(i)














(ii)
























b(i)





















The curve ( )
2
2
1 1
y
x
h
| |
+ =
|
\ .
is an ellipse with centre at (1, 0). The horizontal
distance from its centre is 1 and its vertical distance from its centre is |h|.
The curve
2
3( 1) 1 y x = + is the part of the curve in (i) that lies above the x-axis.














From observation, if 1(i.e. 1) h h = = , there will be exactly one point of
intersection. In order for the curves to intersect at two points, 1 or 1 h h < > .















2
2
3( 1) y x =
3( 1) y x =
( ) 1,1

( ) 1, 1

x
y
3
3
( ) 1,1

( ) 1, 0

x
y
O
O




x
y
1
O
1
|h|
3( 1) y x =
3( 1) y x =








b(ii)




















3. NYJC 2011/P1/Q5
(i)
( )
( )
2
f ( )
c b ad d
ax bx c
x ax b ad
x d x d

+ +
= = + +
+ +

a = 1, d = 2 b ad = 1 b = 1
(ii)
( )
( )
2
2 2
f ( ) 1 f ' 1
2
2
c c
x x x
x
x
+ +
= + =
+
+
.
If the graph of f ( ) y x = has turning points, then
( )
2
2
1 0
2
c
x
+
=
+

( )
( )
2
2
2
1 2 2 2 2
2
c
x c x c
x
+
= + = + = +
+

Since there are no turning points, 2 c < .
(iii)















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

( )
( )
2
2
1
1
2
x x
x x
+ +

=
+
and sketch the curve
2
1
y
x

= onto the graph of f ( ) y x = .


There are no points of intersection of the two graphs. number of roots = 0



x
y

1 O
(0, 0.5)
(0.268, 0.464)
(3.73,6.46)
y = x 1
x = 2

x
y

4. PJC 2011/P1/Q10(a)(b)
(a)(i)











(a)(ii)










Let ( )
2 2
4 4
h
4 4 1 (2 1)
x
x x x
= =
+ + +
.
Before C, ( )
( ) ( )
2 2
4 4
h
1 2 2 1
y x
x x
= = =
+ (


Let ( )
( )
2
4
p
1 2
x
x
=


Before B,
( )
2 2
4 4
p
2
1
1 2
2
x
y
x x
| |
= = =
|
\ . ( | |

|
(
\ .

Let ( )
( )
2
4
g
1
x
x
=


Before A, ( ) ( )
( )
2 2
4 4
f =g 1
1 1
y x x
x
x
= + = =
+ (


Note : If you do not want to complete the square for the denominator, then the
working is shown below.
Let ( )
2
4
h
4 4 1
x
x x
=
+ +
.
Before C, ( )
( ) ( )
2 2
4 4
h
4 4 1
4 4 1
y x
x x
x x
= = =
+
+ +

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

O
(3, 1/3)

1






O 1 1



Before B,
2 2
4 4
p
2 2 1
4 4 1
2 2
x
y
x x
x x
| |
= = =
|
+
\ .
| | | |
+
| |
\ . \ .

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

Before A, ( ) ( )
( ) ( )
2 2
4 4
f =g 1
1 2 1 1
y x x
x
x x
= + = =
+ + +



5. RJC 2011/P1/Q10
(i)

( )
3 2
1
39 399 ,
10
y x x x = + so
( ) ( )( )
2
d 3 3
26 133 7 19 .
d 10 10
y
x x x x
x
= + =
Thus
d
0
d
y
x
= when 7 x = or 19, x = and the stationary points are ( ) 7,122.5 and
( ) 19, 36.1 .
( )
2
2
d 3
13 ,
d 5
y
x
x
= so
2
2
d
0
d
y
x
< at ( ) 7,122.5 and
2
2
d
0
d
y
x
> at ( ) 19, 36.1 .
Thus ( ) 7,122.5 is a maximum point and ( ) 19, 36.1 is a minimum point.

(ii)




x
y
O



(iii)


(iv)

The volume of water in the vase when the depth is , h , V is given by
( )
3 2
0
39 399 d ,
10
h
V x x x x
t
+ =
}
so
( ) ( )
3 2 3 2
0
d
39 399 d 39 399 .
10
d
1 d d 0
h
x x x x h h
V
h
h
h
t t (
+ = +


=
( }

Since
d d d
,
d d d
V V h
t h t
= we have
( )
( )
3 2
3 2 39 399
39 399
10
d 10 100 d d
.
d d d h h h
h h
h V V
t h t
h
t
t +
+
= = =
When 19 h = we get
d 100
0.0882
d 361
h
t t
= = (3 s.f.).

6. RVHS 2011/P1/Q10
(i) vertical asymptote at 1 0 x x c = + = when 1 x = so 1 c =
2
5
1
ax bx
y
x
+
=


( )( ) ( )( )
( )
( )
( )
2
2
2 2
1 2 5 1
2 5
1 1
x ax b ax bx
ax ax b
dy
dx
x x
+ +
+
= =


Since there is a turning point on the y-axis, we have 0
dy
dx
= when 0 x =
( )
2
2 5 0 ax ax b + = when 0 x = ( ) 0 0 5 0 5 b b + + = =
(ii)
2
5 5
1
ax x
y
x
+
=


C has no x-intercept
2
5 5
0
1
ax x
x
+
=

has no real roots


2
5 5 0 ax x + = has no real roots ( )
2
5 4 5 0 a <
25 20 0 a + <
5
4
a < (shown)

x
y
O




(iii)
2
5 5
5
1 1
ax x a
y ax a
x x
+
= = + + +


( )
( )
2
2
2 5 5
1
ax ax
dy
dx
x
+
=

2
0 2 0 0 or 2 ax ax x x = = = =

















(iv) Add the line 1 y ax = + . It has the same gradient as the oblique asymptote of C, but
with a smaller y-intercept.
Solving for intersection between C and 1 y ax = + :
( )( )
( )
5 1 4 0 4 1
1 1
4
4 4 4 4
4
a a
ax a ax a a x a
x x
x ax a a a x x
a
+ + + = + + + = + =

+ = + = =
+

Hence set of values of x is
4
: 1 or
4
x x , x x
a

e < >
`
+
)
R .
(v)


















O
x
y







y
O


x


7. TJC 2011/P1/Q11
(a)















(b)(i) Horizontal asymptote: y = 0
Vertical asymptotes: x = 0, x = 3
(ii)
( ) ( )( )
2
2 2
3 2 3
d
d ( 3)
x x x p x
y
x x x
+ + +
=
+

( ) ( )
2 2
2 2
3 2 3 2 3
( 3)
x x x x px p
x x
+ + + +
=
+


2
2 2
2 3
( 3)
x px p
x x

=
+
= 0
2
2 2
2 3
0
( 3)
x px p
x x

=
+
2
2 3 0 x px p + + =
Since C has two stationary points, discriminant > 0
2
4 12 0 p p >
( ) 3 0 p p >
0 or 3 p p < > (shown)
(iii)





















1 3 5 7
2
x
y
O
x = 1 x = 7
y = 0

y = 0
x = 0
x = 3
( 6, )


( 2, 1)
(4, 0)
y
x


O
8. VJC 2011/P1/Q13






EQUATIONS and INEQUALITIES
1. HCI 2011/P1/Q1
1 Let x , y and z be the number of red, blue and green matchsticks respectively.
( )
( )
( )
88 1
6 6 0 2
6
4 6 2 0 3
3 6 4
x y z
z
x y x y z
y z x
x y z
+ + =
+ = + =
| |
+ = =
|
\ .

Solving the inequality, 16 x = , 24 y = and 48 z =
Number of blue matchsticks = 24

2. MJC 2011/P1/Q6(b)
(b)












Let ( )
2
f x ax bx c = + + substitute
13
1,
2
| |
|
\ .
and
1
2,
2
| |

|
\ .
into ( ) f y x = to obtain:
( )
13
...... 1
2
a b c + + = ( )
1
4 2 ...... 2
2
a b c + =
( )
3 2
1
1
2
0
0
3 2
19 19
d
6 6
ax bx
cx
ax bx c x
+ +
+ + = =
(
}
(

( )
19
...... 3
3 2 6
a b
c + + =
Using G.C. to solve equations (1), (2) and (3):
1
2, 4,
2
a b c = = =
Therefore equation of the curve is
2
1
2 4
2
y x x = + +
3. NJC 2011/P1/Q1
3 Let $x, $y, and $z be the sales price of a bottle of soy sauce, oyster sauce and chilli
sauce respectively.
600 400 350 3990
450 320 250 3051
400 360 280 3164
x y z
x y z
x y z
+ + =
+ + =
+ + =

From GC, x = 2.50, y = 4.30, z = 2.20.
Revenue collected per week from the Shop and Spend supermarket
= ( ) ( ) ( ) 300 2.50 220 4.30 180 2.20 $2092 + + =


4. HCI 2011/P1/Q3
4
( )( )
2
2 15 1
5 1 2
x x
x x

s
+


5 2.4031 or 1 10.403 5 2.40 or 1 10.4 x x x x < s < s < s < s

ALTERNATIVELY (using analytical method)
( )( )
2 2
2
2 15 1 8 25
0
5 1 2 4 5
x x x x
x x x x

s s
+ +

Roots to
2
8 25 0 x x = are 2.4031 and 10.403.
Roots to
2
4 5 0 x x + = are 1 and 5.



5 2.4031 or 1 10.4031
5 2.40 or 1 10.4
x x
x x
< s < s
< s < s

Replace by 2 x x +

( ) ( )
( )( )
( )( )
2
2
2 2 2 15
1
2 5 1 2 2
2 15 1
7 1 2
x x
x x
x x
x x
+ +
s
+ + +
+
s
+ +

5 2 2.4031 or 1 2 10.4031
7 4.40 or 1 8.40
x x
x x
< + s < + s
< s < s




5
2.4031
1
10.4031
+ + +
5. JJC 2011/P1/Q2










From GC, x-coordinate of Points of Intersections:
1
4
and
1
4
2

Solution:
1 1
or 4
4 2
x x < >
Alternatively
9
3 2 1 5, Ans:
2
3 2 1 5, Ans: No Soln
1
3 2 1 5, Ans:
4
7
3 2 1 5, Ans:
2
x x x x
x x x
x x x x
x x x x
+ > + >
+ + > +
+ + > + <
+ > + <

Solution:


6. RJC 2011/P1/Q1
6(a)














From the graph, x >
1
4
.
1 1
or 4
4 2
x x < >
y
4
x 0
y = x + 5

y
x
O
1
4

y = 2x
y = x
6(b)


2
2
( 1)( 3)
0
( 2)
Since ( 2) 0 for all ,
( 1)( 3) 0, 2
1 3, 2
x x
x
x x
x x x
x x

<

> e
< =
< < =


OR
2
4
2
( 1)( 3)
0
( 2)
Multiply both sides by( 2) ,
( 1)( 3)( 2) 0
1 3, 2
x x
x
x
x x x
x x

<

<
< < =





7. TJC 2011/P1/Q2















To find intersection point, 2 ( 2 ) x a x a + = =>
3
a
x =
From the graph, for 2 2 x a x a < + ,
3
a
x >
Replace x by x and let a = 2 in the above inequality,
( ) 2(2) 2( ) 2 x x < + becomes 4 2 2 x x + <
Thus
2 2
3 3
x x > <
1 3
x
1 3
2
x
2 3
2a
x
y
2a



O
a
SEQUENCES and SERIES
1
( ) ( ) ( )
( )
( )
( )
( )
2 2 2
2 1 1 2
1 1
1 1
2 2 4 2 4 4 ... 4 2 1 ... 2
2 2
4 4 1 4 4 1
1 1
2 2 3 ( 1)
2 4 1 2 6
n n n
r r n n n
r n r n r n
n n n n
r r n n n
n
n n n n
+
= = =
+ +
= = + + + + + + +

+
= + = +



2 Required sum
( ) 1 2 3 100 = + + + + ( ) 7 17 27 77 87 97 + + + + + + ( ) 70 71 72 77 78 79 77 + + + + + + +
100 10 10
((1 100) (7 97) (70 79) 77
2 2 2
= + + + + 3862 =

3 First Method
5
(1 )
93
1
a r
r

----- (1) and


3 5
(1 )
744
1
ar r
r

------ (2)
Divide (2) by (1):
3
744
93
r = 2 r =
Substitute 2 r = into (1) to obtain 3 a =
Thus
8
9
768 u ar = = .

Second Method
Observe that ( )
3
4 5 6 7 8 1 2 3 4 5
u u u u u r u u u u u + + + + = + + + +
Thus,
3
93 744 r =
3
744/ 93 8 r = = 2 r =

From
5
1 2 3 4 5
(1 )
93
1
a r
u u u u u
r

+ + + + = =


substitute 2 r =
5
93(1 2)
3
1 2
a

= =


8
9
768 u ar = =
4(i)
( )
2
2
1
1
2 2
r r
r
r
+
+

2 2
1 1
2 2 1
2 2
r r
r r r
+ +
+ +
=
2
1
2 1
2
r
r r
+

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


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



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

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


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

= +

( ) 2
1 1
2
2
2
1
2
1
1 ( 1)
2 2 1
n
n
n
(

+

= +


( )
2
1 1
2 2
1 ( 1)
1
2 2
n
n
n +
(
= +

2
1
( 1) 1
1
2 2
n n
n
+
+
=
5(i)
1
81
1
u
S
r

= =

---------------(1) and
( )
4
1
4
1
80
1
u r
S
r

= =

---------(2)
Substituting (1) into (2),
( )
4 4
80
81 1 80 1
81
r r = =
4
1

81
r =
1

3
r = .
Check by substituting into (1):
when
1

3
r = ,
1
4
81 108 100
3
u
| |
= = >
|
\ .
.
when
1

3
r = ,
1
2
81 54 100
3
u
| |
= = <
|
\ .
.
Hence
1

3
r = and
1
108 u = . Therefore
1
1
108
3
n
n
u

| |
=
|
\ .
.

5(ii)
3 4 5 n
u u u u + + + + is a GP with 2 n terms, first term
2
2
3
1
108 12
3
u ar
| |
= = =
|
\ .
, and
common ratio
1
3
.
Hence
2
2
3 4 5
1
12 1
3
1
9 1 .
1 3
1
3
n
n
n
u u u u

(
| |
(
|
(
\ .
(
| |

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


|
\ .

9 and 2 p q = =

6(a)


AP: first term, 1100 a = ; common difference, 2.7 d =
Let the nth be the first negative term.
( ) ( )( ) 0 1 0 1100 1 2.7 0
408.407
n
T a n d n
n
< + < + <
>

409 n =
( ) ( )( )
409
1 1100 408 2.7 1.6 T a n d = + = + =
Sum of all positive terms, ( ) ( )( )
408
408
2 1100 408 1 2.7 224624.4
2
S ( = + =


6(b)
(i)




(ii)
( ) 7
2
n
n
S c n =
( ) ( ) ( )
1
1 7 14
7 7 1
2 2 2
n n n
n n c n
U S S c n c n

+
= = =
( )
1
7 14 1
7 14 14
7
2 2 2
n n
c n
c n
U U
+
+ +
+
= = =
6(c)
(i)







1 1 1 1 1 1 1
1, , , , , , ,..., ,...
3 3 9 9 9 9 729

2 2 2 2 6
1 1 1 1 1 1 1
1, , , , , , ,..., ,...
3 3 3 3 3 3 3

m = 1 + 2 + 4 + 8 + 16 + 32 + 1 = 64
Sum of m terms, S
m







(ii)


6
2
1
3
1 1 1 1 1 1 1 2 4 8 1 1 538
1 ... 1 ... 2
2
3 3 9 9 9 9 729 3 9 27 729 729 729
1
3
| |
| |

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



1 1 1 1 1 1 2 4 8 1
1 ... 1 ... 3
2
3 3 9 9 9 9 3 9 27
1
3
S

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


7(i) 2 2 2
4 5 ( 2) 4 5 ( 2) 1 n n n n + = + + =
7(ii)
2 2
3
2 2
3
2 2
2 2
2 2
1 4 5
1 ( 2) 1
3 1 1 1
4 1 2 1
5 1 3 1





N
n
N
n
n n n
n n
=
=
| |
+ +
|
\ .
| |
= + +
|
\ .
= + +
+ + +
+ + +

2 2
2 2
2 2
2 2
( 2) 1 ( 4) 1
( 1) 1 ( 3) 1
1 ( 2) 1
1 ( 1) 1 5 2



N N
N N
N N
N N
+ + +
+ + +
+ + +
= + + +

7(iii)
2 2
2 2
2 2
1 ( 1) 1 5 3
2 1 ( 1) 2( 1) 1 (since >1)
( 1) ( 1 1) 1 (since >0)
2 1
N N
N N N N N
N N N N N
N
+ + +
< + + + + +
= + + + = + +
= +

8(a)
Since
1
2 u = , 2
n
u = for all n
+
e , i.e.
2
2 2
2
2 1
a + +
=
+

6 6 a + = 6 36 a + = 30 a =
8(b)
(i) 0 a =
2
1 1
2
1
1
u u
u
u
+
=
+

For
2
u to be defined,

2
1 1
0 u u + > and
1
1 u =
( )
1 1
1 0 u u + >

1 1
1 or 0 u u s >


Since
1
1 u = ,
1 1
1 or 0 u u < >
(ii) As n ,
n
u o and
1 n
u o
+
,

2
1
o o
o
o
+
=
+

( )
2
1 o o o o + = +
( )
2
2 2
1 o o o o + = +
( ) ( )
2
2
1 1 0 o o o o + + =

( )( )
2
1 1 0 o o o o + + + =

( )( )
2
1 1 4 1 1
0 or 1
2
1 5
2
o o o

= = =

=

Since 0.618 o ~ ,
1 5
2
o
+
=

9(i) On the 31
st
Oct 2012 (at the end of 1
st
month), the amount John owes the bank
( )( ) $ 10000 1.05 x = (

or ( ) ( ) $ 10000 1.05 1.05 x = (


9(ii) At the end of 2
nd
month, the amount John owes the bank
( ) ( ) ( ) $ 10000 1.05 1.05 1.05 x x = (


( ) ( ) ( )
2 2
$ 10000 1.05 1.05 1.05 x x
(
=


At the end of 3
rd
month, the amount John owes the bank
( ) ( ) ( ) ( )
2 2
$ 10000 1.05 1.05 1.05 1.05 x x x
(
=


( ) ( ) ( ) ( )
3 3 2
$ 10000 1.05 1.05 1.05 1.05 x x x
(
=



At the end of nth month, the amount John owes the bank
( ) ( ) ( ) ( )
2
$ 10000 1.05 1.05 1.05 1.05
n n
x x x
(
=


( )
( )
1.05 1.05 1
$ 10000 1.05
1.05 1
n
n
x
(

( =

(

( ) ( )
$ 10000 1.05 21 1.05 1
n
n
x
(
=


9(iii) Let x = 500
For the loan to be repaid fully, ( ) ( )( )
10000 1.05 21 500 1.05 1 0
n
n
s
Using GC,
when n = 62, amount John owed the bank = 203.10
when n = 63, amount John owed the bank = 311.70
the number of complete months required is 63.
10(i)


1
1
sin and sin
6 6
n n
n n
r r
OC OC
t t
+
+
= =

1
1
1 1
1 1
Therefore and
2 2
2 and 2
n n
n n
n n n n
r r
OC OC
OC r OC r
+
+
+ +
= =
= =


1 1
1 1 1 1
Observe that =
1
2 2 3 (shown)
3
n n n n
n n n n n n n n
OC r r OC
r r r r r r r r
+ +
+ + + +
+ +
+ + = = =

10(ii)
2 2
1 1
1 1
and
2 2
n n n n
A r A r t t
+ +
= =
2
2
2
1
1 1
2
1
1 1
2
1
3 9
2
n
n n
n n
n
r
A r
A r
r
+
+ +
| |
| |
= = = =
| |
\ .
\ .
t
t
which is independent of n
{ }
n
A follows a geometric progression.
Area of the first semicircle =
2
1
1
2
r t
Sum to infinity of the areas of semicircles =
2 2
2
1 1
2 1
1
1 1
9 9 1
2 2
. (shown)
1 8
8 2 16
1
9 9
r r
r
r
t t
t
t = = =


10(iii)
From diagram, we can deduce that
1
n
n
S

+ total area of the semicircles = area of the sector + area of the triangle


=
( )
2
1 1 1
1 2 1
tan
2 3 2 3
r r r
t t | | | |
+
| |
\ . \ .
=
2 2
1 1
1 3
3 2
r r t +
1
n
n
S

=
2 2
1 1
1 3
3 2
r r t + total area of semicircles
=
2
2 1
1
3
3 2
r
r
t
+
2
1
9
16
r t
=
2
1
3 11
2 48
r
t
| |

|
|
\ .
(Answer)

MATHEMATICAL INDUCTION

1.

[YJC 2011 PRELIM P1 Q2b]
Let
n
P be the statement
2
n
u n n = + , 0. n >
Consider 0 n = . LHS =
0
0 u = (given)
RHS =
2
0 0 0 + = = LHS

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

Need to show
1 k
P
+
is true, i.e.
( ) ( )
2
1
1 1
k
u k k
+
= + + +
( )
( ) ( )
( ) ( )
( ) ( )
1
2
2
2
LHS 2 1
2 1
2 1 1
1 1 RHS (Shown)
k k
u u k
k k k
k k k
k k
+
= = + +
= + + +
= + + + +
= + + + =

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

2.

[IJC 2011 PRELIM P1 Q6]
Let P
n
be the statement
( )( )( ) ( )( )( ) ( )( )( ) ( )( )( ) ( )( )
1 1 1 1 1 1
, 1
3 4 5 4 5 6 5 6 7 2 3 4 24 2 3 4
n
n n n n n
+ + + + = >
+ + + + +
.

Consider n =1. LHS =
( )( )( )
1 1
3 4 5 60
=
RHS =
( )( )
1 1 1
24 2 4 5 60
= = LHS
P
1
is true.

Assume that P
k
is true for some 1 k > ,
i.e.
( )( )( ) ( )( )( ) ( )( )( ) ( )( )( ) ( )( )
1 1 1 1 1 1
3 4 5 4 5 6 5 6 7 2 3 4 24 2 3 4 k k k k k
+ + + + =
+ + + + +


Need to prove P
k + 1
is true,
i.e.
( )( )( ) ( )( )( ) ( )( )( ) ( )( )( ) ( )( )
1 1 1 1 1 1
3 4 5 4 5 6 5 6 7 3 4 5 24 2 4 5 k k k k k
+ + + + =
+ + + + +


LHS =
( )( )( ) ( )( )( ) ( )( )( ) ( )( )( )
1 1 1 1
3 4 5 4 5 6 5 6 7 3 4 5 k k k
+ + + +
+ + +

=
( )( ) ( )( )( )
1 1 1
24 2 3 4 3 4 5 k k k k k
+
+ + + + +

=
( )( )( )
( )
1 1
5 2
24 2 3 4 5
k
k k k
+
+ + +

=
( )( )
1 1
24 2 4 5 k k

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

3.(i)

[TJC 2011 PRELIM P1 Q4]
2 3 4
1 1 1 1 2 2 1 3
2(1) 2 2 3(2) 3 3 4(3) 4
S S S = = = + = = + =
(ii) 1
n
n
S
n

= , n > 2
(iii)
Let P
n
be the statement
1
n
n
S
n

= where n
+
e , n > 2.
When n = 2, LHS =
2
1
2
S = from (i) RHS =
2 1 1
2 2

= = LHS
P
2
is true.
Assume P
k
be true for some k
+
e , k > 2, i.e.
1
k
k
S
k

= .

Need to prove that P
k+1
is true.
LHS =
1
1
2 2
1 1 1

( 1) ( 1) ( 1)
k k
k
r r
S
r r r r k k
+
+
= =
= = +
+



2
1 1
=
( 1)
( 1)( 1) 1
( 1)
( 1) 1
( 1) 1 1
k
k k k
k k
k k
k k k
k k k k

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

Since P
2
is true and P
k
is true P
k +1
is true, by the method of mathematical induction, P
n

is true for all n
+
e , n > 2.

As n ,
1 1
1
n
n
S
n n

= = 1 . Thus
( )
2
1
1
r
r r

converges to 1.

4. [NYJC 2011 PRELIM P2 Q3b]
Let
n
P be the statement
1
1
1
n
r
n
r r
=
=
+

for all n
+
e

When n = 1, LHS =
1
1
1
= and RHS = 1 = LHS.
1
P is true.
Assume
k
P is true for some k
+
e , ie
1
1
1
k
r
k
r r
=
=
+

.

We need to show
1 k
P
+
is true, ie
1
1
1
1
1
k
r
k
r r
+
=
= +
+


LHS =
1
1 1
1 1 1
1 1 1
k k
r r
r r r r k k
+
= =
= +
+ + + +



( )
1 1
1
1 1
k k k
k
k k k k
+ + +
= + =
+ + + +


( )
1 1
1 1
1 RHS
1 1
k k k
k k k
k
k k k k
+ + +
+ + +
= = = + =
+ + + +

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

1 1 1
1 1 1
1 2
n n n
r r r
r r r r r
= = =
> =
+ +


1 1
1 1
2
2
n n
r r
n n
r r
= =
< <



Hence A = 2

5.(i) [DH 2011 PRELIM P2 Q4b]
1 1
1 3
,
( 1)( 2) 2
n n
u u u
n n
+
= + =
+ +

n
n
u
1 n
u
+

1
3
2

5
3

2
5
3

7
4

3
7
4

9
5

4
9
5



(ii)
Conjecture:
2 1
for .
1
n
n
u n
n
+
+
= e
+

(iii)

Let P
n
be the proposition
2 1
for .
1
n
n
u n
n
+
+
= e
+

When n = 1, LHS =
1
3
2
u =
RHS =
2 1 3
1 1 2
+
=
+
= LHS
P
1
is true.
Assume P
k
is true for some , i.e. k
+
e
2 1
1
k
k
u
k
+
=
+
.
We want to show that P
k+1
is also true, i.e.
( )
( )
1
2 1 1 2 3
1 1 2
k
k k
u
k k
+
+ + +
= =
+ + +

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


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


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


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

=
2 3
2
k
k
+
+
= RHS

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

6.

[VJC 2011 PRELIM P1 Q3]

7. [NJC 2011 PRELIM P1 Q3]
| |
1 2 3 4 2 2 2 2 2 2
1 2 1 1
2 2 2 2 2 2 2 2
2 2 2 2 2 2
1
3 3 4 3 4 5
2 2 2 2
3 4 .... ( 1) 2 3 4 .... ( 1)
( 1)!
n n n
n
u u u u
u
n n
n
+

= = = =

= = =
+ +
+


Let P
n
be the statement
| |
1
2
2
( 1)!
n
n
u
n
+
=
+
, for all
+
Z e n .
When 1 = n : LHS:
1
1 u = RHS:
2
2
2
1
(2!)
= = LHS
P
1
is true.

Assume that P
k
is true for some
+
Z e k

i.e.
| |
1
2
2
( 1)!
k
k
u
k
+
=
+
.

Need to prove that P
k+1
is true.
| |
| |
1
1 2 2
2
( 1) 1
2
2 2 2
LHS
( 2)
( 2) ( 1)!
2
RHS
( 2)!
k
k
k
k
u
u
k
k k
k
+
+
+ +

= = =
+
+ +
= =
+


Since P
1
is true, and P
k
is true P
k+1
is true, P
n
is true for all
+
Z e n .

8. [RI(JC) 2011 PRELIM P1 Q3]
Let
n
P be the statement
2
1
1 1
( 1) ( 1) 1
! !
n
r n
r
r r n
r n
=
+ + +
=

, n
+
e .
When n = 1, LHS =
2
1 1 1
( 1) 3
1!
+ +
= , RHS =
1 1
( 1) 1 3
1!
+
= = LHS

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

.

Need to prove
1 + k
P

is true i.e.
2 1
1
1
1 ( 1) 1
( 1) ( 1) 1
! ( 1)!
k
r k
r
r r k
r k
+
+
=
+ + + +
=
+



2 1
1
2 2
1
1
2
1
2
1
2 2
1
1
1
( 1)
!
1 ( 1) ( 1) 1
( 1) ( 1)
! ( 1)!
1 ( 1) ( 2)
( 1) 1 ( 1)
! ( 1)!
( 1) ( 2) 1
( 1) 1
( 1)! !
( 1) ( 2) ( 1)
( 1) 1
( 1)!
(
( 1)
k
r
r
k
r k
r
k k
k
k
k
r r
LHS
r
r r k k
r k
k k k
k k
k k k
k k
k k k
k
+
=
+
=
+
+
+
+
+ +
=
+ + + + + +
= +
+
+ + + +
= +
+
(
+ + + +
=
(
+

(
+ + + +
=
(
+

=

2)
1
( 1)!
k
RHS
k
( +
=
(
+


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

The series converges as
1
( 1) 0
!
n
n
n
+


when n , which implies
1
( 1) 1 1
!
n
n
n
+

when n . Hence the sum to infinity is 1 .

You might also like