2013 HCI C1 Block Test H2 Mathematics Revision Package Solutions

2013HCIC1BlockTestH2MathematicsRevisionPackageSolutions
1
2013HCIC1BlockTest
H2Mathematics
RevisionPackage
Solutions
Topic PageNo.
1. BinomialExpansion . 2
2. SequencesandSeries . 12
3. GraphingTechniques . 42
4. Functions . 55
5. Inequalities&Equations . 69


2
1
BinomialExpansion

1. 2010/C1/BT/DHS/Q4
( )( )
( ) ( ) | |
( )( ) ( )
( )
( )
( )
( )
( )
( )
( )
1

2
1

2
1
1

1
2
2
1
2
1
2
1
2
2
2
2 2
2
3 1
2 2
2!
1
1
1 1 2
1 2 1 2
2 1
3
2
3
2
1
2
1 2 ...
2 1 1 ...
2 1 ...
2 1 ...
x
x x
x
x x
x x
x x x
x x x
x x x x
x
| |

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

= + + +
= + + +
= + +

1 1
2 2
2 1 x x < < <

( )
2
2
1
1
2
1
1
2
1
2
1
2
2 1 ...
1
1
7
2 1
7 1
7
8
99
7
2
98 9
14
8 2 7 99
2
7 3 98
8 99
2 7 2
21 98
297
7 (shown)
112
x
x
x
+
+
+
~
+
= + +
| |
| |
+ |
|
|
\ .
\ .
| |
~
|
\ .
| |
~
|
\ .
| |
~
|
\ .
~


3
2. 2010/C1/BT/MJC/Q1
(i)
1
2
1
(1 3 )
1 3
x
x

= +
+

1 3 1 3 5
1 2 2 2 2 2
2 3
1 (3 ) (3 ) (3 ) ...
2 2! 3!
3 27 135
2 3
1 ...
2 8 16
x x x
x x x
| | | || |

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

(ii) By substituting
1
7
x =
2 3
1 3 1 27 1 135 1
1
2 7 8 7 16 7 1
1 3( )
7
1 7177
5488 4
7
7 7177
2 5488
7177
7
2744
| | | | | |
~ +
| | |
\ . \ . \ .
+
~
~
~

(iii) Note that expansion of
1
1 3x +
is valid for
1 1
3 3
x < < .
It is not suitable to use 2 x = , since 2 x =

falls outside the validity range.

3. 2010/C1/BT/CJC/Q8
(i) By cover-up rule, A = 1
) )( 1 3 ( ) 1 ( 3 5 2
2 2
C Bx x x x x + + + = +
Equate coefficient of 1 3 1 2 :
2
= + = B B x
Equate constant term: C = 1 3 2 = C
1
2
1 3
1
) 1 )( 1 3 (
3 5 2
) (
2 2
2
+
+
+
=
+
+
=
x
x
x x x
x x
x f
1 2 1
) 1 )( 2 ( ) 3 1 ( ) (

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

2
7 4 3 x x + + ~
(ii) Expansion is valid for 1 1 3
2
< < x x
expansion is valid for
3
1
3
1
< < x
(iii) Term in
n n n n
x x x ) ( ) 1 ( 2 ) 3 (
2 2 2
+ =
Coefficient of
n n n
x ) 1 ( 2 3
2 2
+ =


4
4. 2010/C1/BT/TJC/Q4
( )
1
1
1
2 3
2 3
2 3
2 2 1
2
1 ( 1)( 2) ( 1)( 2)( 3)
1 ( 1) .......
2 2 2! 2 3! 2
1
1 .......
2 2 4 8
hx
hx
hx hx hx
h h h
x x x

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

The expansion is valid for
2 2 2
1 | | i.e.
2
hx
x x
h h h
< < < <
By observing the pattern, the coefficient of x
r
=
1
1 ( 1)
( 1)
2 2 2
r
r r
r
r
h h
+
| |
=
|
\ .

5. 2011/C1/BT/AJC/Q12
(i) Let
( )
( )
2 2
7
( 1) ( 2) 1 2
1
x A B C
x x x x
x
+ +
+ +

( )( ) ( ) ( )
2
7 1 2 2 1 x A x x B x C x + + + +
Solving, we get A = 1, B = 2, C = 1
Hence
( )
( )
2 2
7 1 2 1
( 1) ( 2) 1 2
1
x
x x x x
x

+ +
+ +
(i)

( ) ( )
1
1 2
2
7 1
1 2 1 1
( 1) ( 2) 2 2
x x
x x
x x
| |
+ + +
|
+
\ .

2
2 2
1
1 ... 2 1 2 3 ... 1 ...
2 2 2
x x
x x x x
(
| |
( ( + + + + + + + + + +
(
|

\ .
(

2
7 19 57
...
2 4 8
x x + + +

(ii) The expansions are valid if | x | < 1 AND
2
| |
x
< 1 | x | < 1.
(iii) | g(x) f(x) | < 0.005
Using graphical method, sketch the graph of
y =
2
2
7 19 57 7
2 4 8 ( 1) ( 2)
x
x x
x x
+ +
+
0.005
we want to find x such that y < 0.
From the graph, 0.0852 < x < 0.0796.

-0.0852 0.0796

5
6. 2011/C1/BT/CJC/Q5
(i)
3
2
1
x
x
+

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

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

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

( ) ( )
2
2
3
1 1 1 1
1 1
1 1 3 3 3 3
2 1 ... 1 ...
3 2 2! 2 3 2!
x x
x x
( ( | || | | || |

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

2 2
3
2
2 1 1
6 36 3 9
x x x x
( (
~ + + +
( (

2 2 2
3
2
2 1
3 9 6 18 36
x x x x x
(
~ + + + +
(

2
3
2 1
2 4
x x | |
~ + +
|
\ .

(ii) 1
2
<
x
and 1 < x
2 < x and 1 < x
2 2 < < x and 1 1 < < x
1 1 < < x
(iii) Since x = 3 is outside the range of validity, Brian made an unacceptable estimate.
(iv) When
3
1
= x ,
3
3
4
3
5
3
4
5
=
3
3
5
4
1
=
(
(
|
.
|
\
|
+
|
.
|
\
|
+ ~
2
3
3
1
4
1
3
1
2
1
1 2
72 . 1
18
31
36
31
2
36
1
6
1
1 2 4 5
3 3 3
= =
|
.
|
\
|
=
(
+ ~
The value of x is closer to zero.


6
7. 2011/C1/BT/NJC/Q3
(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
4 12 1 4
2 4 4 2
x x
x x x x
+
= +
+ +

( )
1
1
2
1 1
2 1 4 4 1
2 4
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
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 = + .

7
8. 2011/C1/BT/RVHS/Q7
2 3
f ( )
(1 )(4 )
1 2
(by cover up rule)
1 4
x
x
x x
x x
=
+
=
+

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

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

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

2
1 9 31
......
2 8 32
x x = + +
Checking, we have
0 1 2
1 9 31
, ,
2 8 32
c c c = = =
Thus,
0 1 2
11
32
c c c + + = .
(ii) By inspection, we have ( ) ( )
2 1
1 1 1
1 1
2 4 2
r r
r r
r
c
+
| | | |
= =
| |
\ . \ .
.
(iii) For the expansion to be valid, 1 and 1
4
x
x < < implies 1 ie 1 1 x x < < < .


8
9. 2011/C1/BT/SRJC/Q7
(i)
( )( )
4 10
Let f( )
2 1 2 3 2 1 2 3
x A B
x
x x x x
+
= +
+ +

( ) ( ) 4 10 2 3 2 1 x A x B x + + +
Comparing coefficients of x and constant term,
2 2 4,
3 10
A B
A B
+ =
=

3, 1 A B = =
( )( )
4 10 3 1
f( )
2 1 2 3 2 1 2 3
x
x
x x x x
+
=
+ +

(ii) ( ) ( )
1 1
f( ) 3 2 1 2 3 x x x

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

| |
= +
|
\ .

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

(

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

( ) ( ) ( ) ( )
( )
1 2 2 3 3
1 2 3
2 3
3 1 2 2 2 ... 2 ...
1 2 2 2 2
1 ... 1 ...
3 3 3 3 3
n n
n
n
n
x x x x
x x x x
(
= + + + + + +

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

2 3 2 3
1 2 4 8
3 6 12 24 ... + ...
3 9 27 81
x x x x x x
(
(
= + + + +
(

2 3
10 52 328 1936
...
3 9 27 81
x x x = +

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

1 3
and
2 2
x x < <

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

The set of values of x is
1 1
:
2 2
x x

e < <
`
)

(iii) To show that the term in
n
x has coefficient ( )
1
3
n
n
p q
+
(
+

:
Method 1: Using Observation (Preferred Approach)
Coefficient of the term in
n
x
( )
( )
1 2
3 2 1
3 3
n
n
n
| | | |
= +
| |
\ . \ .

( ) ( )
1
1
3 2 2
3
n
n n
+
| |
= +
|
\ .


9
1
1
2 3
3
n
n
+
(
| |
= + (
|
\ .
(

( )
2 1
3 3
3 3
n
n ( | | | |
= +
| | (
\ . \ .

( )
1 2 1
3
3 3
n
n+ | | (
=
|
(
\ .
where
2 1
,
3 3
p q = =

Method 2: Using Formula
Coefficient of the term in
n
x
( )
( )( ) ( )
( )
( )( ) ( ) 1 2 ... 1 2 ...
1 2
3 2
! 3 ! 3
n
n
n n
x
x
n n

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

( ) ( )
1
1
3 2 2
3
n
n n
+
| |
= +
|
\ .

1
1
2 3
3
n
n
+
(
| |
= + (
|
\ .
(

( )
2 1
3 3
3 3
n
n ( | | | |
= +
| | (
\ . \ .

( )
1 2 1
3
3 3
n
n+ | | (
=
|
(
\ .
where
2 1
,
3 3
p q = =

Method 3: Using Simultaneous Equations
When 0 n = , ( )
0 1
0
10
3
3
p q
+
(
+ =

( )
10
3
3
q ( + =

10 1
3
3 3
q = =

When 1 n = , ( )
1 1
1
52
3
9
p q
+
(
+ =

( )
2 1 52
3
3 9
p
(
=
(

26 52
3 9
p
| |
=
|
\ .

52 3 2
9 26 3
p = =

Thus, Coefficient of the term in
n
x

( )
1 2 1
3
3 3
n
n+ | | (
=
|
(
\ .
where
2 1
,
3 3
p q = =

10
10. 2012/C1/BT/AJC/Q7
(i)
2
2 2
3
(2 3 ) 2 1
2
x
x

| |
+ = +
|
\ .

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

2
1 27
1 3 ...
4 4
x x
(
= + +
(

2
1 3 27
...
4 4 16
x x = + +
Validity range:
3 2 2 2
| | 1 | |
2 3 3 3
x x x < < < <
(ii) Given that x is small, the equation can be approximate to:
2
1 3 27 1 3
4 4 16 2 16
x x x + = +
2
27 20 1 0 x x + ~
Using GC to solve the equation,
0.0539 OR 0.687 x =
2 2
0.0539 (since )
3 3
x x = < <

11. 2012/C1/BT/CJC/Q1
1/3
1/3
2
2
2
(3 )
(a) (3 )(1 )
(1 )
1 4
1 3 3
(3 )[1 ...]
3 2!
1 2
(3 )(1 ...)
3 9
3 2 ...
x
x x
x
x x x
x x x
x x
= +
+
| || |

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

Expansion is valid for 1 < x < 1.

2
1/3
1/3
3
3
1
3
1 1 1
27
(i) When , 3 2( ) ( )
1
27 27 27
(1 )
27
80
2134
27

729
28
27
80 2134

729 9( 28)
3240
28
1067
x

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


11
2
1/3 1/3
2
2 2
2
(9 ) (3 )(3 )
(ii)
(1 ) (1 )
(3 )(3 2 )
9 6 3 3 2 ...
9 3
x x x
x x
x x x
x x x x
x x
+
=
+ +
~ + +
= + + +
~ +

2
3
(b)
1 1 1
3 (1 ) (1 )
When 1, 1
When 1, 2
x A B
x x x
x A x B x
x B
x A
+
= +
+
+ = + +
= =
= =

r r
r r r
x
x x x x x x
x x x
x
) 1 ( 2 of t Coefficien
...) ) 1 ( ... 1 ( ...) ... 1 ( 2
1
1
1
2
1
3
2 2
2
+ =
+ + + + + + + + =
+
+
+


12
2
SequencesandSeries

(A) Arithmetic and Geometric Progression

1. 2011/C1/BT/AJC/Q3
the sum of the first 50 terms is 625 less than the sum of the next 50 terms
S
50
+ 625 = S
100
- S
50

2 S
50
+ 625 = S
100

( ) ( )
50 100
2 2 49 625 2 99
2 2
a d a d
(
+ + = +
(

solving :
1
4
d =
( )
3
r
r
b a
= ( )
3
2
r
r
d
=
3
1
2
r
r
=
| |
|
\ .
=
( )
3
1
2
1
2
1
1 4
=

When a = 2,
S
n
> 62
1
2 2 ( 1) 62
2 4
n
n
| |
+ >
|
\ .

( ) 15 496 n n + >
( )( ) 16 31 0 n n + >
31 or 16 n n < >
Since n is a positive integer, least n = 17

-31 16

13
2. 2012/C1/BT/MJC/Q8
(i) Let the first term be and the common ratio be . a r

2
3 3
216
216
6
6
----------------------(1)
a ar ar
a r
ar
a
r
=
=
=
=

( )
2
2
3
2 3 0 ---------------------------(2)
ar ar ar a
ar ar a
=
+ =

Substituting (1) into (2),

( )( )
2
2
6
6 12 3 0
6 15 6 0
2 5 2 0
2 1 2 0
r
r
r r
r r
r r
+ =
+ =
+ =
=

1
1
or 2 (rej progression is decreasing and 0)
2
r r u = = >

From (1),
1
1
2
6
12 (Shown) u = =

(ii)
1
Since 1, the series is convergent.
2
r = <
1
2
12
Sum to infinity 24
1
= =

(iii)
2
6 u =

2 1
6 9 3 d u u = = =

( ) ( )( ) ( )
( )
2
2
1
2 9 1 3 1
2
21 3 2
3 21 2 0
3 21 2 0
n
S
n
n
n n
n n
n n
<
+ <
<
+ + <
>

( ) ( )
{ }
From G.C.,
0.0940 or 7.09 (3 s.f.)
Rej 1 8 since
set of possible values of : 8
n n
n n n
n n n
+
+
< >
> > e
= e >


14
3. 2012/C1/BT/ACJC/Q7
(i)
( )
2 2( 1)
1
3 3
3 1 (3 1)
2 2
n n
n n n
u S S

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

( )
( )
2
2 1
1
4
(3 )
3
4
3
3
n
n
n
n
u
u
=
= 9 which is a constant.
Therefore the sequence is a GP.

(ii)
1 3 5 2 1
...
n
u u u u

+ + + +
( ) ( ) ( )
( )
( )
2 2 1 2 6 10
4 4 4 4
= 3 3 3 ... 3
3 3 3 3
n
+ + + +
=
( )
4
2
4
4 3 1
3
3 3 1
n
(
(

=
( )
4
3
3 1
20
n

Therefore p = 3, q = 20

(iii) Common ratio =
1
1
9
< , therefore S
exists.
S
=
1
1
u
1
1-
9
=
( )
2
1
4
3
3
3
8
32
9
=

(iv)
11 12 13 30
ln ln ln ... ln u u u u + + + +
= | |
11 30
20
ln ln
2
u u +
=
22 60
20 4 4
ln .3 ln .3
2 3 3
( | | | |
+
| |
(
\ . \ .

= 907 ( to the nearest integer)


15
4. 2010/C1/BT/JJC/Q5(b)

H oH o
2
H o
3
H ..

n =1 n = 2 n = 3 n = 4
Distance: H, 2 H o ,
2
2 H o ,
3
2 H o

Total distance traveled before coming to rest
2 3
= 2 2 2 ... H H H H o o o + + + +
2
=
1
H
H
o
o
+

(1 ) 2
=
1
1
[Shown]
1
H H
H
o o
o
o
o
+
+
=

2 (1 )
After ( 1) bounce, distance travelled =
1
n
th
H
n H
o o
o
+ +

2(0.36)(20)(1 0.36 )
20
1 0.36
n
= +

20 22.5(1 0.36 )
n
= +
42.5 22.5(0.36 )
n
= [Shown]

Let 42.5 22.5(0.36 ) 42
0.5
0.36
22.5
3.8
n
n
n
>
s
>

The number of times the ball hit the surface = 4.


16
5. 2011/C1/BT/IJC/Q10
(i) Total price payable for 20 blocks of 10 minutes (200 minutes)
| |
20
$ 2(1.60) 19(0.05)
2
= + $41.5 (shown) =

(ii) Given that FLEXI follows a Geometric Progression,
8.10
common ratio 0.9
9.00
r = =
( )
7
8
9 0.9 4.30 u = =
Price payable for eighth block $4.30 =

(iii) For unlimited usage, total price payable under flexi
9
1 0.9
=

90 =

Hence total price payable under flex will never exceed $90.

(iv) Consider total price of FLEXI < total price of XTREME :
Let n be the least number of blocks such that
( )
| |
9 1 0.9
2(1.60) 0.05( 1)
1 0.9 2
n
n
n
< +

( ) | | 90 1 0.9 3.15 0.05 0
2
n
n
n + <
From GC,
Value of n

34 5.05 > 0
35 2.00 > 0
36 -1.13 < 0
The least number of 10 minute blocks is 36.

( ) | | 90 1 0.9 3.15 0.05
2
n
n
n +

17
6. 2012/C1/BT/CJC/Q3
(a) 4
4
1
2
1
3
2
+ + = n n S
n
n

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

n n S
n
n

4
15
4
3
2
1
3
2 1
+ =

n n
n

1
=
n n n
S S T

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

4
15
4
3
2
1
3 4
4
1
2
1
3
2 1 2
n n n n
n n

4
1
) 3 ( 2
1
+ =

n
n

Let ) 3 ( 2
1
=
n
n
U and
4
1
= n V
n

) 3 ( 2
2
1

=
n
n
U
4
5
1
=
n V
n

Then 3
) 3 ( 2
) 3 ( 2
2
1
1
= =

n
n
n
n
U
U
and 1
4
5
4
1
1
= + =

n n V V
n n
,
So U
n
and V
n
are terms of a G.P. and A.P. respectively.

(b)(i) Area of 1
st
triangle = 64000 ) 800 )( 160 (
2
1
=
Area of 2
nd
triangle = 16000 ) 400 )( 80 (
2
1
=
Area of 3
rd
triangle = 4000 ) 200 )( 40 (
2
1
=
G.P. with a = 64000 and r =
4
1

Area of n
th
triangle =
1
4
1
64000

|
.
|
\
|
n

(b)(ii) Total area of all n
th
triangles
=
1
64000 1
4
1
1
4
n
| |
| |
|
|
|
\ .
\ .
|
|
.
|
\
|
|
.
|
\
|
=
n
4
1
1
3
256000

84500
4
1
1
3
256000
>
|
|
.
|
\
|
|
.
|
\
|
n

009765625 . 0
4
1
s |
.
|
\
|
n

339 . 3 > n
Least no. of triangles required is 4.

(b)(iii)
64000 256000
1
3
1
4
S
= =


18
7. 2012/C1/BT/HCI/Q8
(i) The distance slipped follows an arithmetic progression with first term 30 cm and
common difference 1.2 cm.

Distance slipped = 30 ( 1)( 1.2) n +
30 ( 1)( 1.2) 0
26
n
n
+ =
=

Since once the distance slipped is 0, the frog will not slip anymore, the frog will not
slip from 26
th
move onwards.

(ii) Total distance hopped along the slope after 20 moves
=
20
1(1 0.9 )
1 0.9
=8.7842 m.

Total distance slipped along the slope after 20 moves
( )
20
2(0.3) 19( 0.012) 3.72 m.
2
= + =

Total distance covered along the slope after 20 moves
= 8.7842 3.72 5.06 m (3 s.f.) = (Answer)

(iii) If the total distance covered along the slope in the long run exceeds the slope distance
of the wedge, the frog will be able to reach the top of the wedge. Alternatively, we
can compare the total vertical distance covered with the height of the wedge.

Total distance hopped along the slope in the long run
=
1
1 0.9
= 10 m.

Total distance slipped along the slope for the first 26 or 25 moves [because the frog
will not slip from the 26
th
move]
( ) ( ) ( )
26
2 0.3 25 0.012 3.9
2
= + = m.

Total distance covered along the slope in the long run
= 10 3.9

Total vertical height attained in the long run
=( ) 10 3.9 sin 3.05
6
t
= m

Since the total vertical height attained in the long run by the frog (i.e. 3.05 m) is less
than the height of the wedge (i.e. 3.2 m), the frog will not reach the top in the long run.


19
8. 2011/C1/BT/MJC/Q2
(i)
0
T k = ,

1
T 0.85T 60
n n
= + , 1 n >
(ii)
1
T 0.85T 60
n n
= +
1
2
2
2 3 2
3
2 1
T 0.85 60
T 0.85(0.85 60) 60 0.85 60(1 0.85)
T 0.85(0.85 60(1 0.85)) 60 0.85 60(1 0.85 0.85 )
...
T 0.85 60(1 0.85 0.85 ... 0.85 )
1(1 0.85 )
0.85 60
1 0.85
0.85 400(1 0.85 )
0
n n
n
n
n
n n
k
k k
k k
k
k
k
= +
= + + = + +
= + + + = + + +
= + + + + +
= +
= +
= .85 ( 400) 400
n
k +

(iii) T 0.85 ( 400) 400
n
n
k = +

As , 0.85 0, T 400
n
n
n

9. 2012/C1/BT/JJC/Q8
Start of (n+1)th year, amount of money = +
n
x p
End of (n+1)th year, amount of money, ( )
1
1.05 50
+
= +
n n
x x p
where a = 1.05, b = 50.

| |
1
2 1
2
3 2
3 2 2
1.05 50
1.05( ) 50
1.05 (1.05 50) 50
1.05 1.05 1.05(50) (50)
1.05( ) 50
1.05 1.05 1.05 1.05 (50) 1.05(50) (50)
=
= +
= +
= +
= +
= + +
x p
x x p
p p
p p
x x p
p p p

( )
( )
( )
1 1 2
1 1 2
1.05 1.05 ... 1.05 1.05 (50) 1.05 (50) .... 50
1.05 1.05 ... 1.05 50(1.05 1.05 ... 1)
1.05 1 1.05
1 1.05
50
1 1.05 1 1.05
21 (1.05 1) 1000(1.05 1)
21 1000 1.05
n n n n
n
n n n n
n
n
n n
n
x p p p
p
p
p
p

= + + +
= + + + + + +
| |
| |
| =
|
|
\ .
\ .
=
=
( )
1

( )( )
25
21 1000 1.05 1 500000
10024.98
10025
p
p
p
>
>
=


20
(B) Sigma Notation and Method of Differences

10. 2011/C1/BT/NJC/Q6(a)
( ) ( )
2 2
1 1
ln e ln lne
k k
r k r k
r r
r r

= =
= +

( )
( )
( )
( )
( )
1
1 1 1
2
2 2
ln 2
ln 2
1
ln1 ln 2 ln3 ln 2
2
ln !
ln !
k
r
k k k
r r r
r r k
r r k
k k
k k
k k k k
k k
=
= = =
= +
= +
+
= + + + + +
= + +
= +

11. 2010/C1/BT/ACJC/Q2

( )
2
2
n
r o
r n
n
=

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

=
( 1)
(14 1)
6
n
n
+
+

12. 2012/C1/BT/CJC/Q5(a)
(i) ( )

= =
+ = |
.
|
\
|
+
N
r
N
r
r
r
r r
1
3
1
2
1 3
1
3

= =
+ =
N
r
N
r
r
1 1
3
1 3
N
N N
+ |
.
|
\
| +
=
2
2
) 1 (
3
(ii) 000 30
1
3
1
2
> |
.
|
\
|
+
=
N
r
r
r r
30000
2
) 1 (
3
2
> + |
.
|
\
| +
N
N N

Using GC,

N
N
N N
+ |
.
|
\
| +
2
2
) 1 (
3
13 24856
14 33089
15 43215

Therefore, the least value of N is 14.


21
13. 2010/C1/BT/MI/Q3
(i)
1
2
n
r
r
x
+
=
= ( )
3 1
1
2 3
2
1
2
2
r
n
r
r
=
(
| |
+
(
|
\ .
(

=
3 2
1
2
1 1
1
2 2
r
n
r
+
=
(
| | | |
+
(
| |
\ . \ .
(

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

=
3
2
4 7 10 3 1
1 1 1 1
...
2 2 2 2
n+
(
| | | | | | | |
+ + + +
(
| | | |
\ . \ . \ . \ .
(

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

(
(
(

=
3 1
1
28 8
n
| |
|
\ .

(ii) As n ,
1
8
n
0 and the series converges to a constant.
Value is
3
28
.

14. 2010/C1/BT/ACJC/Q8
1
1 1 1 1
( ) ( 1) ( )
2 2 1 2 3 (2 1)(2 3)
1
(1) (2) (2) (3) ..... ( ) ( 1)
(2 1)(2 3)
N
r
f r f r
r r r r
f f f f f N f N
r r
=
+ = =
+ + + +
= + + +
+ +

= f(1) - f(N+1)
=
1 1
6 2(2 3) N
+

91 90
22 21
90 20
1 1
1 1
(2 1)(2 1) (2 1)(2 3)
1 1
(2 1)(2 3) (2 1)(2 3)
1 1 1 1 1 1
2 3 2(90) 3 2 3 2(20) 3
70
7869
r r
r r
r r r r
r r r r
= =
= =
=
+ + +
=
+ + + +
| | | |
=
| |
+ +
\ . \ .
=


22
15. 2012/C1/BT/CJC/Q5(b)
(i)
)! 2 (
1 2
)! 2 (
1
)! 1 (
1
+
+
=
+
+ n
n
n n

)! 2 (
1
+
+
=
n
n
(shown)

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

=
|
|
.
|
\
|
+
+
=
n
r
r r
1
)! 2 (
1
)! 1 (
1
2

(
(
|
|
.
|
\
|
+
+
+
|
|
.
|
\
|
+
+
+
|
.
|
\
|
+
|
.
|
\
|
=
)! 2 (
1
)! 1 (
1
)! 1 (
1
!
1
! 4
1
! 3
1
! 3
1
! 2
1
2
n n
n n

|
|
.
|
\
|
+
=
)! 2 (
1
2
1
2
n

)! 2 (
2
1
+
=
n

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

+
+
=
+
+

= =
n
r
n
r
r
r
r
r

3
2
)! 2 (
2 2
1

+
+
=
=
n
r
r
r

3
2
)! 2 (
2
1
+
=
n

)! 2 (
2
3
1
+
=
n

3
1
)! 2 (
2 2
2
<
+
+
=
n
r
r
r
since 0
)! 2 (
2
>
+ n
for all values of n.


23
16. 2010/C1/BT/ CJC/Q3
(i) =
+
+
+
+ 3
2
2
1
1
1
n n n

) 3 )( 2 )( 1 (
) 1 )( 2 ( 2 ) 3 )( 1 ( ) 2 )( 3 (
+ + +
+ + + + + + +
n n n
n n n n n n

=
| |
) 3 )( 2 )( 1 (
2 3 2 3 4 6 5
2 2 2
+ + +
+ + + + + + +
n n n
n n n n n n

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

or use partial fractions by cover up rule
(ii)

= =
=
+ + +
+
N
r
N
r
n n n
n
1 1
) 3 )( 2 )( 1 (
5 3
(
+
+
+ 3
2
2
1
1
1
n n n

=
( )
]
) 3 (
2
) 2 (
1
) 1 (
1
) 2 (
2
) 1 (
1 1
1
2 1
) 1 (
1
...
6
2
5
1
4
1
5
2
4
1
3
1
4
2
3
1
2
1
[
+
+
+
+
+
+
+
+
+
+
+
+ +
+ +
+ +
N N N
N N N
N N N

=
) 2 (
1
) 3 (
2
6
7
+
N N

(iii)
6
7


24
17. 2012/C1/BT/NJC/Q9

( ) ( ) ( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( ) ( )
f ( ) f ( 1)
1 1
3 10 3 7 3 7 3 4
3 4 3 10

3 10 3 7 3 4
6
3 10 3 7 3 4
r r
r r r r
r r
r r r
r r r
+
=

=

=

(i)
( )( )( )
1
3
3 10 3 7 3 4
n
r
r r r
=

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

( ) ( )
( ) ( )
( ) ( )
( ) ( )
( ) ( )
( ) ( )
( )( )
( )( )
1
f 1 f 2
2
f 2 f 3
f 3 f 4
...
f 1 f
f f 1
1
f 1 f 1
2
1 1 1
2 28 3 7 3 4
1 1

56 2 3 7 3 4
n n
n n
n
n n
n n
=
+
+
+
+
+ + (
= + (

(
=
(

=

(ii)
3 3 3
...
8 11 14 11 14 17 50 53 56
+ + +

( )( )( )
( )( )( ) ( )( )( )
( )( ) ( )( )
20
6
20 5
1 1
3
3 10 3 7 3 4
3 3

3 10 3 7 3 4 3 10 3 7 3 4
1 1 1 1

56 2 53 56 56 2 8 11
45

8162
r
r r
r r r
r r r r r r
=
= =
=

=

( (
=
( (

=

(iii)
( )( )( )
1
1
3 10 3 7 3 4
n
r
r r r
=

( )( )
( )( )
1 1

168 6 3 7 3 4
1 1
for all 3 0 for all 3
168 6 3 7 3 4
n n
n n
n n
=

| |
< > > >
|
|

\ .


25
18. 2011/C1/BT/NJC/Q8
(i) ( ) ( )
1 1
1
n n n n
b b n m a n m a
+ +
= + + +

( )
( ) ( )
( )
( )( ) ( )
( ) ( ) ( )( ) ( )
( )
( )( ) ( )
( )( ) ( )
1
1 1 2 1
1 1
1 1 1 2
1 2
(shown)
1 2
n
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
N N
n n n
n n
a b b
m
+
= =
=

1 2
2 3
3 4
2 1
1
1

1

N N
N N
N N
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
+
+
=
= + + + (

( + + +
=
(
+ + + + +

(
=
(
+ + +

(
=
(
+ + +

| |
=
|
|
+
\ .


26
( )( ) ( )
( ) ( )
( )
( )
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
= =
+ + + =
+ + +
= =
=
( | | | |
=
( | |
| |
+ +
(
\ . \ .
| |
| |
=
|
|
|
+
\ .
\ .
=
=


27
19. 2012/C1/BT/RVHS/Q6
Let ( )
1
2 2 4
n
P Q
t t
+ = and ( )
1
2 4
P Q
t
=

Solving, and ( 1)
2 2
n
P Q n
t t
= = , where
2
t
u =

Hence,
1
2cos sin
2 4 4
N
n
nt t t
=
| | | |
| |
\ . \ .

1
sin sin( 1)
2 2
N
n
n n
t t
=
(
=
(

sin sin 0
2
sin sin
2
3
sin sin
2
......
( 1)
sin sin
2 2
N N
t
t
t
t
t
t t
=
+
+
+
Z e =
Z e = =
=
+
+
k k N
k k N
N
N
, 1 4 for , 1
, 3 4 for , 1
even for , 0
2
sin
t

The limit does not exist because the sum does not tend to a fixed value (but alternate
among 3 different values) as N increases.


28
(C) Recurrence Relation

20. 2012/C1/BT/RI/Q6
2
1 2
2 2
2
2
2 4
2
2
2 4
2
2 4
4
2 4
n
n n n
n n
n
n
x p
x x x
q
x q x p
q
q q
x p
q
q p q
x
q
+

=

=
| |

|
\ .
=
| | | | +

| |
\ . \ .
=

Since
4
4 0 p q + < , then
2
2 4
4
0 for all .
2 4
n n
q p q
x x
| | | | +
>
| |
\ . \ .

Thus,
2
2 4
1 2
4
2 4
0 for all .
n
n n n
q p q
x
x x x
q
+
| | | | +

| |
\ . \ .
= >
So,
1 2 3
, , , x x x is a strictly increasing sequence.

OR
2
1 2
2 2
2
n
n n n
n n
x p
x x x
q
x q x p
q
+

=

=

For
2 2
n n
x q x p = 0, since
discriminant =
2 2 4
( ) 4( ) 4 0 q p q p = + < and coefficient of
2
1 0,
n
x = >
equation has no real roots and curve
2 2
n n
y x q x p = has a minimum turning point
curve
2 2
n n
y x q x p = is above the x-axis for all real values of x
2 2
2 2
2
1 2
0 for all
Thus 0 as 0 for all
n n n
n n
n n n
x q x p x
x q x p
x x q x
q
+
>

= > >

So,
1 2 3
, , , x x x is a strictly increasing sequence.

29
21. 2012/C1/BT/TJC/Q3
(i) If the sequence converges, let its limit be l.
As n ,
n
x l and
1 n
x l
+

.

Thus,
( ) 3
1
l
l
l
l
=
+

i.e.,
2 2
3 l l l l + =

2
2 2 0 2 ( 1) 0 l l l l = =
Thus, l = 0 or l = 1. Thus, = 0 and = 1 (since < )

(ii) When x
1
= 7, it is an oscillating sequence that diverges.
When x
1
= 0.2, it is an increasing sequence that converges to 1.

(iii) For 0 < x < 1, we observe that the graph of y = f(x) is above the line y = x.
Thus, for any term in the sequence, x
n
, such that 0 < x
n
< 1, x
n
< f(x
n
) = x
n + 1
.

Since the maximum point of y = f(x) is (1, 1),
for any term in the sequence, x
n
, such that 0 < x
n
< 1, x
n
< f(x
n
) < 1.

Thus, continuing in such a manner,
0 < x
1
< x
2
< < x
n
< < 1,
The sequence is an increasing sequence that converges to 1.

22. 2011/C1/BT/DHS/Q11(a)
(a)(i) ( )
1
from 3 2
n n n
n u u u
+
= +

1
2
3
4
5
1 1 (given)
2 5
3 17
4 53
5 161
u
u
u
u
u
=
=
=
=
=

(a)(ii)
1
2
n
u
n
+

0
1
2
3
4
1 3
2 3
3 3
4 3
5 3

Conjecture :
1
1
3
2
n n
u

+
=
1
2(3 ) 1,
n
n
u n
+
= e
1
lim 2 lim(3 ) 1
n
n
n n
u

=
The limit does not exist. Sequence {
n
u } is divergent.

30
23. 2011/C1/BT/RI/Q4
(i)
3
2 1
4
3 2
1 1 1 3
1
2 2
1 1 2 1 7
3 2 6
x
x x
x
x x
= + = + =
= + = + =

(ii) Since
n
x o as n ,
1 n
x o
+
and
2 n
x o
+
as n .
Thus,
1 1 2
o o
o o o
= + =

2
2
2
o
o
=
=

Since
1
1 x = and
2
2 x = and
2
1
1 1
n
n n
x
x x
+
+
= + , then all the terms
n
x are positive.
Hence, 2. o =

24. 2010/C1/BT/CJC/Q7

From graph. The positive root o is 1.823

As , , ,
1
l x l x n
n n

+

0 ) 3 2 2 )( 1 (
0 3 5 2
0
2
3
2
5
2
3
2
5
2
3
2
5
2
3
2 2
= +
=
= = = + =
+ =
l l l
l l Also
l hence
l
l
l
l
l
l
o

The positive root is ) 7 1 (
2
1
+ = l =1.823=o
l x l x
l x
x l
x l
l x
l x
n n
n
n
n
n
n
< <
>
|
|
.
|
\
|
=
|
.
|
\
|
+ + =
+ +
+
1
2 2
1
2 2
1
0
If
2
3

2
3
2
5
2
3
2
5


31
25. 2010/C1/BT/DHS/Q10
(i)
1
, ( 1)
1
k
k
k
x N
x N
x
+
+
= >
+

1
2
As , , .
1
since 0
k k
k x l x l
l N
l
l
l N
l N l
+

+
=
+
=
= >

(ii)
2 2
1
1 1 1
k k k k k
k k k
k k k
x N x N x x N x
x x x
x x x
+
+ +
= = =
+ + +

(iii)
2
1
( 1) , 1
1 1
N x N
y x N
x x

= = + + >
+ +

(iv)
From the graph, if 0
k
x N < < ,
2
1 1
0 0
1
k
k k k k
k
N x
x x x x
x
+ +
> > >

+
(shown)
From the graph, if
k
x N > ,
2
1 1
0 0
1
k
k k k k
k
N x
x x x x
x
+ +
< < <

+
(shown)

O
x
y
N N
( 1) y x = +
1 x =
1
1
1
N

32
(D) Mathematical Induction

26. 2011/C1/BT/NJC/Q6(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 > .

33
27. 2010/C1/BT/CJC/Q6
(i)
7
2
6
1
6
6
1
4 1
6
4 1
1
1
2
=
|
.
|
\
|
|
.
|
\
|
+
=
+
=
u
u
u ,
8
3
7
2
6
7
2
4 1
6
4 1
2
2
3
=
|
.
|
\
|
|
.
|
\
|
+
=
+
=
u
u
u ,
,
9
4
8
3
6
8
3
4 1
6
4 1
3
3
4
=
|
.
|
\
|
|
.
|
\
|
+
=
+
=
u
u
u
2
1
9
4
6
9
4
4 1
6
4 1
4
4
5
=
|
.
|
\
|
|
.
|
\
|
+
=
+
=
u
u
u (=
10
5
)
(ii) Conjecture:
5 +
=
n
n
u
n
,
+
Z e n .
(iii) Let
n
P be the statement . ,
5
+
e
+
= Z n
n
n
u
n

For 1 n = ,
6
1
LHS
1
= = u (given)

6
1
5 1
1
RHS =
+
=
Since LHS = RHS,
1
P is true.
Assume that
k
P is true for some
+
eZ k , i.e.
5 +
=
k
k
u
k
.
To prove
1 k
P
+
is also true, i.e. .
6
1
5 ) 1 (
1
1
+
+
=
+ +
+
=
+
k
k
k
k
u
k

RHS
k
k
k
k
k
k
k k
k k
k
k
k
k
u
u
u
k
k
k
=
+
+
=
+
+
=
+
+
=
+
+ +
=
|
.
|
\
|
+
|
.
|
\
|
+
+
=
+
=
=
+
6
1
) 6 ( 5
) 1 ( 5
30 5
5 5
) 5 ( 6
4 5
5
6
5
4 1
6
4 1
LHS
1

true also true
1 +
k k
P P . Hence by Mathematical Induction,
n
P is true for all
+
eZ n .

(iv) As , n 1
n
u


34
28. 2010/C1/BT/IJC/Q5
(i)
1
2 2
2 1
( 1)
n n
n
u u
n n
+
=
+
and
1
1
4
u = .
2 3 4 5
1 1 1 1
, , ,
9 16 25 36
u u u u = = = = .
(ii)
2
1
( 1)
n
u
n
=
+

(iii) Let P
n
denote the statement
2
1
( 1)
n
u
n
=
+
, n e
+
.
For n = 1, LHS = u
1
= ;
RHS =
2
1 1
4
(1 1)
=
+
= LHS.
Thus P
1
is true.
Assume P
k
is true for some k e
+
. i.e.
2
1
( 1)
k
u
k
=
+

To prove that P
k+1
is true, i.e.
1
2
1
( 2)
k
u
k
+
=
+

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

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

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

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

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

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

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

2
1
( 2) k
=
+
=RHS
Thus P
k
is true P
k+1
is true.
Since P
1
is true and P
k
is true P
k+1
is true, by mathematical induction,
2
1
( 1)
n
u
n
=
+

for all n e
+
.


35
29. 2010/C1/BT/RVHS/Q6
(i)
1
u = 1 and
1
3 1, for 2
n n
u u n
= + > .
So,
2
3 1 1 4 u = + =
3
3 4 1 13 u = + =
4
3 13 1 40 u = + =
5
3 40 1 121 u = + =
(ii) Let
2
3
4, we have p 4 9 (1)
p
q
q
= + =
And
3
3
13, we have p 13 27 (2)
p
q
q
= + =
Solving p = 1, q = 2
Thus, a conjecture for
n
u is
3 1
2
n
.
(iii) Let P(n) denotes the proposition that
n
u =
3 1
2
n
, where n
+
e .
Then for P(1): LHS = 1 RHS =
1
3 1
1
2
=
Thus P(1) is true.
Assuming that P(k) is true, ie
3 1
2
k
k
u

= for some k
+
e , we will like to show that
P(k+1) is also true, ie
1
1
3 1
2
k
k
u
+
+

= .
Now, for P(k+1), by the recurrence relation:
1 1
1
3 1 3 3 2 3 1
3 1 3 1
2 2 2
k k k
k k
u u
+ +
+
| | +
= + = + = =
|
\ .

Thus P(k+1) is also true!
Since P(1) is true and P(k) is true implies P(k+1) is also true, by mathematical
induction, P(n) is true for all n
+
e .


36
30. 2011/C1/BT/DHS/Q11(b)

Let P( ) n denote the statement,
0
2 1 2 3
2 for 0,1, 2, 3,...
2 2
n
r n
r
r n
n
=
+
= =

Consider P(0) ,
0
2(0) 1
LHS 1
2

= =
( )
0
2 0 3
RHS 2 1
2
+
= =
Therefore, P(0) is true.
Assume that ( ) P k is true for some 0,1, 2, 3,... k =
i.e.,
0
2 1 2 3
2
2 2
k
r k
r
r k
=
+
=

Need to show that P( 1) k + is true,
i.e.,
( )
1
1 1
0
2 1 3
2 1 2 5
2 2
2 2 2
k
r k k
r
k
r k
+
+ +
=
+ +
+
= =

( )
1
1
0
2 1 1
2 1 2 3
LHS 2
2 2 2
k
r k k
r
k
r k
+
+
=
+
+
= = +
1
1 1
2 3 2 1
2
2 2
4 6 2 1 2 5
2 2 RHS
2 2
k k
k k
k k
k k k
+
+ +
+ +
= +
+ + (
= = =
(

Thus, P( ) k true P( 1) k + true.

Since P(0) is true, and P( ) k true P( 1) k + true, by mathematical induction, P( ) n is
true for all 0,1, 2, 3,... n =

0 0
0 0
1
1
2
1
2
2 1 2 3
2
2 2 2
2 1 2 3
2
2 2 2
2 3
2
2
2 4
4
2
1
1
n n
r r n
r r
n n
r r n
r r
n
n
n
r n
r n
n
n
= =
= =
+
+ | | | |
=
| |
\ . \ .
+ | | | |
= +
| |
\ . \ .
| |
+
|
= +
|
|
\ .
+
=


37
31. 2010/C1/BT/AJC/Q5
Let P
n
be the proposition that S
n
=
( )
( )
1
1
1 !
n
n
+
+

For n =1 , LHS = S
1
=
3
2

RHS =
1 3
1
2! 2
+ = = LHS P
1
is true .
Assume that P
k
is true for some k
+
e for n = k, that is, S
k
=
( )
( )
1
1
1 !
k
k
+
+

To prove for n = k+1, S
k+1
=
( )
( )
1
1
1
2 !
k
k
+
+
+
.
LHS = S
k+1
= S
k
+
( ) ( )
( )
1
1 3
2 !
k
k
k
+
+
+

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

= ( )
( ) ( )( )
( )
2 1 3
1 1
2 !
k
k k
k
| | + + +
+
|
|
+
\ .

= ( )
( )
1
1 1
2 !
k
k
| |
+
|
|
+
\ .
=
( )
( )
1
1
1
2 !
k
k
+
+
+
= RHS
Therefore P
k
is true P
k+1
is true
Since P
k
is true P
k+1
is true and P
1
is true , by MI , P
n
is true for all n e
+
.
Let r = k+2 :
( )
( )
2
9
1
1 !
r
n
r
r
r
=
=
( ) ( )
( )
2
2 2
7
1 2
1 !
k
n
k
k
k
+
=
+
+

=
( ) ( )
( )
2 2
7
1 2
1 !
k
n
k
k
k
=
+
+

= S
2n-2
S
6

( )
( )
( )
2 2 6
1 1
1 1
2 1 ! 7!
n
n
| |

= + + |
|
\ .
=
( )
1
2 1 ! n
1
7!
or
( )
2 2
( 1)
2 1 !
n
n
1
7!


38
32. 2012/C1/BT/CJC/Q6(b)

Let P
n
be the statement |
.
|
\
| +
=
=
4
1 2
3
1
4
1
3
1
1
n r
n
n
r
r
,
+
eZ n

When n = 1,
LHS = 0
3
1
1
1
=
= r
r
r

RHS

= 0
4
1
4
1
4
1 ) 1 ( 2
3
1
4
1
= = |
.
|
\
| +
= LHS
P
1
is true.

Assume P
k
is true for some
+
eZ k , i.e. |
.
|
\
| +
=
=
4
1 2
3
1
4
1
3
1
1
k r
k
k
r
r

Required to show P
k+1
is true, i.e. |
.
|
\
| +
=
+
+
=
4
3 2
3
1
4
1
3
1
1
1
1
k r
k
k
r
r

+
=
=
1
1
3
1
L.H.S.
k
r
r
r

1
1
3
1 ) 1 (
3
1
+
=
+
+ |
.
|
\
|
=

k
k
r
r
k r

1
3 4
1 2
3
1
4
1
+
+ |
.
|
\
| +
=
k k
k k

|
.
|
\
|

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

|
.
|
\
| +
=
+
4
4 3 6
3
1
4
1
1
k k
k

|
.
|
\
| +
=
+
4
3 2
3
1
4
1
1
k
k

= R.H.S.

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

= = =
=
n
r
n
r
r r
n
r
r
r r
1 1 1
3
1
3 3
1

|
.
|
\
|

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

=
3
1
1
3
1
1
3
1
3
1
n n
r
r
r

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

=
n
n
r
r
r
3
1
1
2
1
3
1


39
But |
.
|
\
| +
=
=
4
1 2
3
1
4
1
3
1
1
n r
n
n
r
r

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

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

|
.
|
\
| +
=
4
3 2
3
1
4
3 n
n
(shown)

For all
+
eZ n ,
|
.
|
\
| +
=
=
4
3 2
3
1
4
3
3
1
n r
n
n
r
r
4
3
<
(since 0
4
3 2
3
1
> |
.
|
\
| + n
n
,
4
3
4
3 2
3
1
4
3
< |
.
|
\
| +
n
n
)
|
.
|
\
|
+ + + = + + +
3 2 4 3 2
4
3
4
2
4
1
4
1
4
3
4
2
4
1

|
.
|
\
|
+ + + <
3 2
3
3
3
2
3
1
4
1

=
=
1
3 4
1
r
r
r

16
3
4
3
4
1
= |
.
|
\
|
< (shown)


40
33. 2010/C1/BT/DHS/Q8
(a)
2
1
1
2

3
r n
r
r
+
=
=

2
1
2 3
8 24 1
2
3
1
3
n
n
| |
|
(
| |
\ .
=
(
|
\ .
(

(b)

2
0
2 6 5
( 1)( 2)
n
r
r r
r r
=
+ +
+ +

( )
0
1 1
2
1 2
1 1
2
1 2
1 1
2
2 3
1 1
2
3 4

1 1
2
1
1 1
2
1 2
1
2 1 1
2
1
2 3
2
n
r
r r
n n
n n
n
n
n
n
=
(
= +
(
+ +

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

1
As , 0, 2 3
2
Thus series does not converge.
n n
n
+
+

(c) Let P
n
be the proposition
( ) ( )
1
1 1 1
2 ! 2 2 !
n
r
r r n
=
=
+ +
for all n
+
e

When n = 1, LHS of P
1
=
1 1
(1 2)1! 3
=
+

RHS of P
1
=
1 1 1
2 6 3
= = LHS of P
1

P
1
is true.

Assume P
k
is true for some , k
+
e

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

We want to show that then P
k+1
is also true, i.e.
( ) ( ) ( ) ( )
1
1
1 1 1 1 1
2 ! 2 2 3 ! 1 2 !
k
r
r r k k
+
=
= =
+ + + +

Consider P
k+1
, RHS of P
k+1
=
( )
1 1
2 3 ! k
+


41
+1
LHS of P
k
=
( )
1
1
1
2 !
k
r
r r
+
=
+

( )
1
1
1 1
2 ! ( 3)( 1)!
1 1 1
2 ( 2)! ( 3)( 1)!
1 1 1 1
2 ( 1)! 2 3
1 1 3 2
2 ( 1)! ( 2)( 3)
1 1 1
2 ( 1)! ( 2)( 3)
1 1
2 ( 3)!
RHS of P
k
r
k
r r k k
k k k
k k k
k k
k k k
k k k
k
=
+
= +
+ + +
= +
+ + +
(
=
(
+ + +

( +
=
(
+ + +

(
=
(
+ + +

=
+
=

P
k
is true 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.


42
3
GraphingTechniques

1. 2011/C1/BT/ACJC/Q6
(a) (i) k = 1
Oblique Asymptote is y = x + 9
(ii)

(b)
x
y
- 2 2 - 2 0 - 1 8 - 1 6 - 1 4 - 1 2 - 1 0 - 8 - 6 - 4 - 2 0 2 4 6 8 1 0 1 2 1 4 1 6 1 8 2 0 2 2
0
2
4
6
8
1 0
1 2
1 4
1 6
1 8
2 0
2 2

(x 1)
2
+ (y 10)
2
= 6
2
does not cut the curve C.
(x 1)
2
+ (y 10)
2
= 7
2
cuts the curve C at 4 points.
smallest value of r = 7.

2. 2011/C1/BT/MJC/Q3
(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
+ =
For 0 2 a < < , Curve C is a half-ellipse with centre (2,0)
and x-intercepts ( ) 2 , 0 a .

x
y
O
0 = x
|
.
|
\
|
4
1
, 2
|
.
|
\
|
16
1
, 4
0 = y
8 = x
( ) 0 , 1

(2,0)
O

x
y
2 a

2 a +

3
(2,3)

43

3. 2011/C1/BT/MJC/Q9
(a)

(b) The lines of symmetry are 0 y = and 1 x = .
A: Scaling by factor 2 parallel to the y-axis Replace y by
2
y | |
|
\ .

B: Reflection in the y-axis Replace x by x
C: Translation of 1 unit in the direction of the x-axis Replace x by ( ) 1 x
Equation of new curve:
2 2 2 2
3 3 y x x y = + =
The new curve is a circle with centre at the origin and radius 3 .

x = 1.5
y = 0
2
1,
3
| |
|
\ .
1
3,
2
| |
|
\ .
2
x
y
O
x = 0
y
x = 1.5
2
1,
3
| |
|
\ .
1
3,
2
| |
|
\ .
2
1,
2
3
| |
|
\ .
1
3,
2
| |
|
\ .
x = 0
y = 0
x
O
O
3

3

3

3

y
x

44
4. 2012/C1/BT/RI/Q4

5. 2012/C1/BT/HCI/Q5
(a)(i)
2 2
2 2
2 2
2 2
2
2 2 2
2 2 2 2
1
Replace by 1
( 1)
1
Replace by
2
( 1) ( 1) 2
1, i.e. 1
4
x y
a b
x x
x y
a b
y
y
y
x x y
a b a b
+ =
+ =
| |
|

\ .
+ = + =

2 2
2 2
Replace by 2
( 1) ( 2)
1
4
y y
x y
a b
+
+
+ =

Answer:
Translate the graph of the curve in the positive x-direction by 1 unit. (This step can be done
first or last.)
Then, scale graph of C
1
parallel to the y-axis with a factor of 2 followed by a translation in
the negative y-direction by 2 units.

Alternative:
y
1 x =
2 y =
O 2
x
1
( ) f y x =

45
( )
2 2
2 2
2 2
2 2
2
2
2 2
1
Replace by 1
( 1)
1
Replace by 1
1
( 1)
1
x y
a b
x x
x y
a b
y y
y
x
a b
+ =
+ =
+
+
+ =

2 2
2 2
2 2 2 2
2 2
2 2
Replace by
2
2
1
( 1) ( 1) 2 2
1, i.e. 1
( 1) ( 2)
i.e. 1
4
y
y
y y
x x
a b a b
x y
a b
+ | | | |
+
| |

\ . \ .
+ = + =
+
+ =

Translate the graph of the curve in the positive x-direction by 1 unit. (This step can be done
first or last.)
Then, translate the graph in the negative y-direction by 1 unit followed by a scaling parallel to
the y-axis with a factor of 2.

(a)(ii)
If C
2
is a circle,

2 2
4 2 ( and are both positive) a b a b a b = =

5(b)
2
2
2
3 5 6 0
3 9
6 5 0
2 4
3 15 5
5 (3 4 )
2 4 4
y y x
y x
y x x
+ + =
| |
+ + =
|
\ .
| |
= = +
|
\ .

2
3 5 3
(3 4 ) 0 3 4 0
2 4 4
y x x x
| |
= + > + s s
|
\ .

When
3 3
, .
4 2
x y = =
The curve is a parabola with vertex at
3 3
4, 2
| |
|
\ .
.
When y = 0,
6
.
5
x =


46

6. 2012/C1/BT/HCI/Q12 (modified)

(i) Method 1:
Since 1 y x = is an asymptote of C,
2
( 1)( 1) 1
1
1 1 1
A x x A x A
y x
x x x
+ + +
= + = =
+ + +

Compare the above expression with the equation of C
2 2
2 3
.
1
x ax a
y
x

=
+

Thus,
2 2 2
2 3 1 x ax a x A = + .
By comparing coefficient of x, 2 0 0 a a = =

Method 2:
2 2
2
2
2
( 2 1)
1 2 3

( 2 1) 3
( 2 1) 2 1
3 2 1
x a
x x ax a
x x
a x a
a x a
a a
+
+
+

+ +

By long division,
2
2 1 3
( 2 1)
1
a a
y x a
x
+
= + +
+

Oblique asymptote is ( 2 1) y x a = + . Compare ( 2 1) y x a = +

to the given
asymptote 1 y x = ,
2 1 1 0 a a = =

3 3
,
4 2
| |
|
\ .


47
(ii)
2 2 2
2 3
Since 0, .
1 1
x ax a x
a y
x x

= = =
+ +

Since
1
0 1
3
< < , by (i), we know that the curve has 2 stationary points. The curve has 2
asymptotes 1 and 1. x y x = = Intersection with axes: (0,0).

The stationary points (0,0) and (2, 4) can be found using GC.

(iii) Point of intersection of asymptotes ( 1 and 1 y x x = = ) is:
Substitute 1 x = into 1, y x =
we have 2 y = .
the point of intersection is ( 1, 2) .

When 1, 2 2 2 x y mx m m m = = + = + = .
i.e. the point of intersection (1, 2) lies on the line 2. y mx m = +
2 y mx m = + also passes through the point of intersection of the asymptotes of C.

2
2
2
( 1)( 2) 0
( 1)( 2)
2
1
x x mx m
x mx m x
x
mx m
x
+ + =
+ + =
+ =
+

No. of real roots to the given equation
2
( 1)( 2) 0 x x mx m + + =
= No. of intersection points between the curve
2
1
x
y
x
=
+
and the line 2 y mx m = + .
To sketch the line onto the graph in (iii), we need to realize that the line has gradient
m and passes through the point of intersection of the asymptotes.

2 = + y mx m

48

To get two intersection points, the line 2 y mx m = + must be steeper than the oblique
asymptote y = x 1.

Thus, m > 1. (answer)

7. 2011/C1/BT/RVHS/Q11
(i)
2
4 12 12 4
2
2 2
x x k k
y y x
x x
+
= = +

The asymptotes are 2 y x = , and 2 x = .

(ii) Substituting 0 k = into the equation gives

4
2
2
y x
x
=
,
(iii)

2
3 2
3 2
2
4 2 0
4 2
( 4 ) 2
4 1
2
x x x
x x x
x x x x
x x
x x
+ =
=
=
,
The above equation has 3 distinct roots.

( 1, 2)
point of intersection of
asymptotes

49
8. 2011/C1/BT/RVHS/Q12
(i)

(ii)

(iii)

9. 2012/C1/BT/SAJC/Q5

ai)


50
aii) aiii)

(b)
Undoing the transformation
Let
( )
( )
2
1
h
1
y x
x
= =
+

Undo C: Translation of one unit in the positive y direction.
( )
( )
( )
2
1
h 1 1 i
1
y x x
x
= + = + =
+

Undo B: Reflection about the y-axis.
( )
( )
( )
2
1
i 1 j
1
y x x
x
= = + =
+

Undo A: Translation of one unit in the negative x direction
( )
( ) ( )
( )
2 2
1 1
j 1 1 1 g
1 1
y x x
x
x
= + = + = + =
+ +

Alternative Method
Let the coordinate of the original curve g(x) be (x,y).
( ) ( ) ( ) ( ) , 1, ( 1), 1,
A B C
x y x y x y x y + +
2
2
2
1
1
[ ( 1) 1]
1
1
( )
1
1
y
x
y
x
y
x
=
+ +
= +
= +


51
10. 2012/C1/BT/SAJC/Q6
(i)
2
( ) x a
y
x b
+
=
+

Using the vertical asymptote: b = 2
Substitute (1,0) : a = 1

(ii)

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

Equation of oblique asymptote L is 4 y x =

(iii)
Using GC, coordinates of P = ( 5, 12)

(iv)

(v)
2
2
2
2 2 4 2
2 2 4 3 2 2
4 3 2 4 3 2 2
4 2
( 1)
25
2
( 2) ( 1) 25( 2) 0
( 4 4) ( 4 6 4 1) 25( 4 4) 0
4 4 4 6 4 1 25 100 100 0
2 15 104 99 0
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
(
+ =
(
+

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

Since the graphs of
2
( 1)
2
x
y
x
=
+
intersects the graph of
2 2
25 x y + = at exactly two
points, there are exactly two real roots for the given equation.

x
y

2 2
25 x y + = 5
2
( 1)
2
x
y
x
=
+

5 2 1 5

5

-
P
0

52
11. 2012/C1/BT/AJC/Q5

Manipulating the equation,
( )
2
2 e
x
x a =
Sketching the two curves on the same diagram,

As a varies, the curve ( )
2
2 y x a = will translate along the x-axis. In order for the equation
to have one +ve and -ve solution,
2
1 2 2 a < s (observe the y intercepts of the two graphs)
Since
2
2 2 a s for all real values of a,
2
2
2 1
1 0
( 1)( 1) 0
a
a
a a
>
<
+ <

1 1 a < <

x
y
O
(0, 2-a
2
)
( )
2
2 y x a =

(a, 2)
x
y
O
(0, 2-a
2
)
( )
2
2 y x a =

(a, 2)
OR
x
y
O
(0, 2-a
2
)
( )
2
2 y x a =

e
x
y =
(a, 2)
1

53
12. 2011/C1/BT/TJC/Q2
2 2
4 16 9 18 11 0 x x y y + =
( ) ( )
2 2
2
2 2
2 1
1
3 2
x y
+ =

x
( ) 2, 1
( ) 2, 1
2.49

y
C
1

( ) 1, 1 ( ) 5, 1
( ) 2, 3
0.598
4.60
0.491
y
x
( ) 2, 3
( ) 2, 3
( ) 2, 3
( ) 2, 3
( ) 5, 1
( ) 5, 1
2.49
2.49
C
2


54
13. 2011/C1/BT/TJC/Q8
(i) 2 x = , 1 x = , 1 x = , 0 y = .
(ii)

(iii) ( )( )
( )( )
2
2 2
2
3
3 2 1
2 1
x
x k x x k
x x
= =

The line y k = cuts the graph ( ) f y x = only once for 0 10.2 k s < .

(iv)

For
( )
f sin x p x o = to have more than 3 real roots, 0 p < .

y
x
1 x = 1 x = 2 x =
0
( ) 1.38,10.2 ( ) 1.38,10.2
2 x =
( )
f y x =
sin y p x o =
y
x
1 x = 1 x = 2 x =
0
( ) 1.38,10.2
( ) f y x =

55
4
Functions

1. 2010/C1/BT/AJC/Q12
(a) For gf to exists,
g
f
R D _
( )
f
R 0, = and
g
D = ,
g
f
R D _ . gf exists.
2 2
1 1
2
1
gf ( ) g
x x
x e e
x
(
= = =
(

2
1
gf ( ) , , 0
x
x e x x = e =
From the graph,
gf
R = ( ) 1,

(b)(i)
2 2
2 2
, 0
h( )
, 0
a x x a
x
a x a x
s s
=

< <
, where a is a positive constant.

Since any horizontal line y=k cuts the graph of h
at most once
h is one-one
-1
h exists

Graph of h( ) y x = is symmetric about the line y=x.
Reflection of h (i.e.
-1
h ) in the line y=x is the same graph (as h)

-1
h =h
(b)(ii) Since
-1
h =h,
5
2
h
a
| |
|
\ .
=(
-1
h h)(
-1
h h)h
2
a
| |
|
\ .
= h
2
a
| |
|
\ .
=
2
2 2
3 3
2 4 2
a
a a a
| |
= =
|
\ .

(b)(iii) Let d be the x-coordinate of the point of intersection.
2
2 2 2 2
2 2
a a
a d d d d = + = =
Alternative method:
At point of intersection:
2 2
x a x =
2 2 2
x a x =
2 2
2x a =
2
a
x =
a
a
-
-
0
y=k
y=x
y=h(x
a
d
d
0

56
2. 2010/C1/BT/ACJC/Q7
(i)
2
(2 1)
gf ( ) ,
x
x e x
= e
Since gf (0) = gf (1) = e, gf is not one-one.
Thus the function gf does not have an inverse.

Alternative Method
Since any horizontal line y k = , 1, k > cuts the graph of
gf ( ) y x = more than once, gf is not a one-one function.
Hence, the function gf does not have an inverse.

(ii) For gf to have an inverse, gf is one-one.
Restrict domain of gf to
1
{ : }
2
x x e s
Thus Largest k =
1
2

Let
2
(2 1) x
y e

=

2
ln (2 1)
2 1 ln
y x
x y
=
=

Since
1
2
x s , 2 1 ln x y =

1 ln
2
y
x

=
1
1 ln
(gf) ( )
2
x
x

=
Since
| ) 1
gf
(gf)
1, D R
= = ,
1
1 ln
(gf) : , [1, )
2
x
x x

e

3. 2010/C1/BT/CJC/Q12
(a)(i) From the graph, the range of the function is
{0 y < 4}{4 < y 5}
f(x) is a one-one function and thus f
1
exists.

(a)(ii) f
1
(x) = {
x
7 x

0 x < 4
4 < x 5

(b)(i) r
h
= {y e9} . d
g
= {x > 0}
(b)(ii) restrict the domain of h to x > 2 to give r
h
= { 0< y < }

x
O
y
1
gf ( ) y x =
1
2


57
4. 2010/C1/BT/DHS/Q6
(i) Any horizontal line y = a, a e cuts the graph of f
at most once.
f is one-one f
-1
exists.
1
Let
2
2 1
2 1 1 2
or
1 1
x
y
x
y xy x
y y
x
y y
=

=

1
2 1 1 2
f : or , 1
1 1
x x
x x
x x

>

-1
f
f
( D R (1, ] ) = =

(ii)
2
1 2 1 1 2 1
Use or or
2 1 2 1
3 1 0
3 5
2
3 5 3 5
(rej as 2)
2 2
x x x x
x x
x x x x
x x
x
x

= = =

+ =
=
+
= >

(iii)
f g
Since R ( 1, ) [ 1, ) D gf exists. = _ =
( )
( ) ( )
1
gf ( ) 3
gf 3 g 2 2ln 2
x
x
=
= = =

(Note: The alternative method of finding ( )
1
gf ( ) x
is too complex.)

5. 2010/C1/BT/JJC/Q8
(i)

(ii) Every horizontal line y = b where 0 2 b < s cuts the graph of g at only 1 point.
Hence g(x) is one-one. Thus
1
g
exists.
1
sin
2
Let 2sin(2 )
2
y
y x x
| |
|
\ .
= =
1 1
1
g ( ) sin , 0 2.
2 2
x
x x

| |
= < s
|
\ .

x
y = f(x)
5 0
2ln5
y
1
y
4
t

2
t

x
y = g(x)
2
0
y
x O
x = 2
y = 1
y a =

58
x
y
2
y = g(x)
1 O
(iii) Since
g f
(0, 2] (0, 5] R D = _ = , fg exists.
fg( ) f (2sin(2 )) = 2ln(2sin 2 )), .
4 2
x x x x
t t
= s <
R
fg
= ( , 2ln 2]

6. 2010/C1/BT/NJC/Q10
(a)(i)
2
2, 1 1
f ( )
1
, 1 4
x x
x
x
x
+ < s
=

< s

(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 1 7
f f
2 2 4
| | | |
= =
| |
\ . \ .

Since, f is not 1-1 and thus f
-1
does not exist

(a)(iii) a = 0
-1 -1
1
1 1 1
f
f f f
1
[ , 2]
4
D D R = = =

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

(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 , 1.17
ln( 1) 1
x x
x
x
=
= >
+

hg h
R R ( , 2) = =

1
4
-1
1
x
O
f ( ) y x =
2
y
y
-1
1 1
f f ( ) y x x = =
2
0.25 O
x

59
7. 2010/C1/BT/RVHS/Q9
(i) The function
2
: 4 5 f x x x is not one-to-one
in the domain 1 8 x s s as shown by the sketch.
There exists a horizontal line that cuts the graph of y = f(x)
more than once f is not one-one.
Thus f
1
does not exist.

(ii) Since the minimum of the curve y = f(x) is at x = 2,
the largest domain for which f
-1
exist is [2,8]
2
2
( ) = ( 2) 9
Then, ( 2) 9
2 9
Thus, 2 9 (sin ce [2, 8])
y f x x
x y
x y
x y x
=
= +
= +
= + + e

Note that for y = f(x), when x = 2, y = 9
and when x = 8, y = 27.
Hence,
1
: 2 9, 9 27 f x x x
+ + s s

(iii) , [0, )
g h
R D = =
Since
g h
R D . , hg does not exist.

(iv) [ln( 1), )
k
R p =
For hk to exist, [0, )
k h
R D _ = .
let ln(p 1) = 0, then p 1 = 1 p = 2
Thus, for hk to exist, the minimum value of p is 2.
k h
[2, ) [0, ) (0,
1
2
]
So, the range of hk is
hk
R = (0,
1
2
]

Alternatively:

k( )
ln( 1)
1
hk( )
1
1

1
x
x
x
e
e

=
+
=
+

1 1
.
( 1) 1 x x
= =
+

Thus, when x > 2, 0 < hk(x) s
1
2

So, the range of hk is
hk
R = (0,
1
2
]

60
8. 2010/C1/BT/TJC/20Q9
(i)(a)

(i)(b) Since R
f
= [0, 2] _ (, e) = D
g

gf exists

1 1
, [0, 2] [ln( 2),1]
2 2
e
(

(

Range of gf = [ ln(e 2), 1]

(ii) For
1
f
exists, f has to be one-one. Min value of c = 0.

9. VJC/2010/JC1/MYE/Q11

f g
x
y
y = x
2
2 0
1
2

1
2

y =f(x)
y =f
1
(x)
y
x
y =
2
0
1
2

1
2

y
x
y = g(x)
e
1
0
ln(e2)

61
10. 2011/C1/BT/AJC/Q11
(a) ( )
2
1
h
1
x a a x a x
a a
x a
= + = + =
+

7 2 2 2
1
h ( ) hh h h ( ) h( ) x x x a
x a
= = = +
since ( )
2
h x x =

(b) Restricted domain of f = ( | 1, 0

For 1 x to be defined, 1 x s
For
1
f g
to exist,
1
g g f
f
R D R R
_ _ .
But | )
f
R 0, =

Thus largest possible set | | 3,1 A = .
( )
1
1
2 1
f g( )
3 1
g( )
f g( )
g( ) 1
x
x
x
x
x
x
| |

=
|
|

\ .
=
+

1
f ( )
1
x
x
x
=
+
, 0 x >
Let
1 1
x y
y x
x y
= =
+ +
f( )
1
x
x
x
=
+

11. 2011/C1/BT/ DHS/Q8
(i) ( ) 1
1
3 3
3
f
f
Let 1 1 1 , D R y x x y x y

= + = = = =

( )
1
1
3
f : 1 , x x x
e
(ii) ( ) ( ) ( ) ( )
1 1 1
fg 7 0 fg 7 f g 7 x x x

+ = = =

( )
( ) ( ) ( ) ( ) ( )
( )
1
1
1 1
3
4
Let g .
f 7 f 7 1 7 2 g
g 2 e 2
w x
w w x
x

=
= = = = =
= =

(iii) ( ) ( ) ( )
( )
3
2 2
, e 2, , e 2 1
b b
b

+
By comparison,
( )
3
2
2
1
2
407
e 2 1
64
7
e 2
4
ln 4
ln 4 ln 2
2
b
b
b
+ =
=
= = =

y
x
O
1 y =
1
f y

= 1
f f y

=
( ) 1, 1
x
y
3 O 1
g( ) y x =
x
(b, e
-2b
2)
y = 2
y = g (x)
1
ln 2
y

62
12. 2011/C1/BT/MI/Q13
(a)(i) Since (0) (4) f f k = = and ( ) f x is a quadratic curve, f is not one-one.
Therefore
1
f

does not exist

(a)(ii)
2 2
( ) 4 ( 2) 4 b x x x k x k = + = +
Largest domain of b ( , 2] = , 2 a =
2
2
1
Let ( ),
( 2) 4
4 ( 2)
2 4
2 4
( ) 2 4, 2
y b x
y x k
y k x
x y k
x y k
b x x k x
=
= +
+ =
= +
= +
= + s

Domain of
1
b
[ 4, ) k =

(a)(iii) Since the graphs of b and
1
b
intersect at the point where

1
4
x = ,

1 1
4 4
b
| |
=
|
\ .

2
1 1 1
4
4 4 4
21

16
k
k
| | | |
+ =
| |
\ . \ .
=

(b)
2
2
1 1 1 2
( ) 2 , 1 gh x x
x x x x
| | | |
= = >
| |
\ . \ .

Sketch graph of ( ) y gh x = ,

(1) 1 gh = , [ 1, 0)
gh
R =

y = c
( ) y gh x =

63
13. 2011/C1/BT/NJC/Q11
(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
= < =

(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 =

( ) f y x =

64
(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 =
( ) g h = y x
59
ln
27


65
14. 2011/C1/BT/RI/P1/Q9
(i)

(ii) ( |
g
3, 4 R =

( )
2
2
2
3 4 6 18 13
fg 3
1 2 1
x x x
x
x x x
+ + + | |
= =
|
+ + +
\ .

(iii) Horizontal asymptote y = 6
(iv) Largest value of k is 2.
(v) ( )
2
2 1, 2 1 y x x y = + =

Since 2 x s 2 1 x y =

i.e. h
1
(x) = 2 1 x

1
h : 2 1, , 1. x x x x
e >

15. 2011/C1/BT/RVHS/Q10
(i)

Since there exists a line 3 y = such that it cuts the graph at more than 1 point.
f is not 1 1 function.
1
f
does not exist

(ii)
1
f
exists if 0 x s .
Thus greatest value of a = 0.
Let
2
e 1
x
y = +
2
1 e
x
y =
( )
2
ln 1 y x =
( ) ln 1 x y = (reject ( ) ln 1 x y = as 0 x s )
( ) ( )
1
f ln 1 x x
= ,
1
f
f
[2, ) D R
= =
y = f(x)
5
0 2 x
y
x O
2
( ) f y x =

66
(iii)
g f
( , 0] R D = . =
fg does not exist.

For gf to exist,
g
( , 0] R _ ,

( )
0 ln 2 x =
1 or 3 x =
Largest value of b = 1

( )
2
ln2 g f
[0,1] [ ln 2, 0] [2, e 1] +
( )
2
ln2
fg
[2, e 1] R = +

Alternatively,

16. 2011/C1/BT/VJC/Q7
(i) ( ) Let h y x ax b = = +

( )
( )
1
1
h
h
y b y b
x y
a a
x b
x
a

= =
=

(ii) ( ) ( )
1 2
2
h 2 g 2 3
b
a

= =

( )
( ) ( )
( )
( ) ( )
1 0
2 9 1
h 0 g 0 3
2
1 1
Solving 1 & 2 , &
4 4
b a
b
a
b a
a b
=
= =
=
= =

(iii) ( ) ( )
1
Let gh 3 k
=

( ) gh 3 3 3
1
1
1
4
1 5
1
4
ak b
k
b
ak b k
a
+
= =
+
+ = = = =

x
y
O
1
2
3


67
17. 2011/C1/BT/VJC/Q8
(i) ( ) ( ) f 5 f 1 =
= 2 3 3 1 7 10 + + =
( ) ( )
' '
8.5 13
f 5 f 1 3
1.5 0
= = =

(ii)

(iii) ( ) f 10 t =

( )
1
1, 3, 5, 7,
1
and 1 1 2
2 1
n
t
t
t n
n
=
=
= +
=

18. 2012/C1/BT/AJC/Q9

(a) (i) Let
( )
2
3
h( ) e
x
y x

= =
3 ln x y =
Since 0 3 x s s , 3 ln x y =
Domain of h
-1
= Range of h =
9
1, e (

1 9
h ( ) 3 ln , 1 x x x e
= s s

(ii) h
1
h(x ) = x , where | | 0, 3
h
x D e =
h h
1
(x ) = x, where
1
9
1,
h
x D e
( e =

Thus for h
1
h(x ) = h h
1
(x ),

| | 0, 3 x e and
9
1, x e ( e

| | 1, 3 x e

(b)

(3, 10)
(4, 13)
(5.5, 8.5)
(7, 10)
(8, 13)
(9.5, 8.5)
13
(1.5, 8.5)
(10, 9)
x
y
O

68
(i) If 0 = ,
Range of g,
g
R ( 1,1) =
Domain of f,
f
D ( , 1) ( 1,1) (1, ) =
Since
g f
R D _ , fg exist.
From the diagram above,
g
R ( 1,1) = will be the input for the function f. Therefore,
fg
R ( , 1] =
OR
2
1
fg( )
cos 1
x
x
=
, 0 x t < <

From the graph of y = fg(x) in the GC,
fg
R ( , 1] =

(ii)

g
R ( 1, 1) = +
The width of
g
R is always 2 units and the domain of f cannot accept 1. x =
Since is negative, for composite function fg to exist.
( ) ( 1, 1) , 1
1 1
2

+ _
+ s
s


69
5A
Inequalities

1. 2010/C1/BT/AJC/Q7
(a)
3 2
2 5 x x
>
+

3 2
0
2 5 x x
>
+

19
0
( 2)( 5)
x
x x
+
>
+

( 19)( 2)( 5) 0 x x x + + >
19 5 x s < or 2 x >

From (i), if
3 2
2 5 x x
<
+
, then 19 x < or 5 2 x < < .
Now for
3 2
2 5 x x
<
+
, replace x with x ,
19 x < (Rejected since 0 x > ) or 5 2 x < <
0 2 x s <
0 4 x s <

(b)
2
2
6 8 1
9
x
x x + + <

From the graph, 3 1.64 x s <
(correct to 3 significant figures).

2. 2010/C1/BT/ACJC/Q3

-19
-5 2

70
3. 2010/C1/BT/DHS/Q1
2
2 2
8 4 4
5 8 4 5 4 5
5 5 5
x x x x x
( | |
+ = + = +
|
(
\ .

2 2 2
4 4 4 4
For all , 0 5 0 5 0
5 5 5 5
x x x x
| | | | | |
e > > + >
| | |
\ . \ . \ .

2 2
2
1 1 4
, ,
2 1 4 3 2 3
( 1)(4 3 ) (2 1) 5 8 4 5 8 4
0 0 0
(2 1)(4 3 ) (2 1)(4 3 ) (2 1)(4 3 )
1
Since 5 8 4 0, 0
(2 1)(4 3 )
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 >

+ > >

1 4
2 3
x < <

4. 2010/C1/BT/JJC/Q2
2 2
4 ( 2)( 17) x x x x > +
2
( 2)( 2) ( 2)( 17) 0 x x x x x + + >
2
( 2) ( 2) ( 17) 0 x x x x ( + >

2
( 2)( 2 15) 0
( 2)(5 )(3 ) 0
x x x
x x x
+ + + >
+ + >

3 or 2 5 x x < < <

2 2
4 ( 2)( 17)
x x x x
e e e e > +
Replace x with
x
e , from (i), we have,

3 or 2 5
x x
e e < < <
Since
x
e > 0, therefore 5 ln5
x
e x < <

5. 2010/C1/BT/NYJC/Q5
(a)
x x
x 1
4 2
s
+

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

Since
2
( 1) 3 0 x + + > for all xe,
( ) 2 0 x x + < 2 0 x < <
(b) From graph, { } : 2 or 2.24 x x x e < >

2 1
1 2
x x
x x

>
+

1 1
2
1
2
x
x
| |
+ >
|
| |
\ .

|
\ .

Replace x by
1
x
,

1 1
2 or 2.236
x x
< >
1
2
4
3
x
+

71

1
or 0 or 0.447 0
2
x x x < > < <
[equivalently,
1
or 0.447
2
x x < > , 0 x = ]

6. 2010/C1/BT/RI/Q1

5
6 0 x
x
+ + s , 0 x = .

5 ( 6)
0
x x
x
+ +
s

2
6 5
0
x x
x
+ +
s

( 5)( 1)
0
x x
x
+ +
s
( 5)( 1) 0 x x x + + s
Hence, 5 x s or 1 0 x s <
#

7. 2010/C1/BT/RI/Q2
The curves intersect at x = 0.944 and x = 0.792
Hence, for
2 1
e 1
x
x
> + , we have
0.944 x < or 0.792 (to 3 s.f.) x >

(2 1)
e 1
x
x
+
>
2( ) 1
e 1
x
x

> +
Replace x in the inequality in earlier
part by x :
0.944 x < or 0.792 x >
0.944 x > or 0.792 (to 3 s.f.) x <

0 1
5 x
x
y = 1 x +
y =
2 1 x
e

1
1
1
e

y

72
8. 2010/C1/BT/SRJC/Q4
1
1 x
x
> +
1
1 0 x
x
>
2
1
0
x x
x

>

2
1 1
1
2 4
0
x
x
| |

|
\ .
>

2
1 5
2 4
0
x
x
| |

|
\ .
>

1 5 1 5
( ) ( )
2 2 2 2
0
x x
x
| || |
+
| |
\ .\ .
>

1 5 1 5
( ) ( )
2 2 2 2
0
x x
x
| || |
+
| |
\ .\ .
>

1 5
0
2
x
s < or
1 5
2
x
+
>

1
1 x
x
> +
By comparing with
1
1 x
x
> + , replace x by x , then
1 5
0
2
x
s < or
1 5
2
x
+
>
(rejected) as | x | > 0
1 5
2
x
+
> or
1 5
2
x

s


73
9. 2011/C1/BT/NYJC/Q2

From sketch, 4 4 or 8 x x s < >

Alternative method:
Rearranging,
2
3
4 0
4 2
x
x
x
s

1 16
0
2 4
x
x
+ s

From sketch, 4 4 or 8 x x s < >

(b)
2 2
4
x x
x x

>

2 2
0
4
x x
x x

>

4 8
0
( 4)
x
x x
+
>

( 2)( 4) 0 x x x s
0 or 2 4 x x < s <
y
x
(8, 16)
4
-4
4
(-4, -2)
2
4
x
y
x
=
3
4
2
y x = +

4 y x = +

4 x =

y
x
4 -4 8
-4

1 16
2 4
y x
x
= +

1
2
y x =

4 x =


74
10. 2011/C1/BT/RI/Q6
(a) 3 ln , 0 x x x > >

From the graphs,
0 2.21 x < < or 4.51 x > .

For 3 ln x x > , replace
1
with x
x

1 1 1 3
3 ln ln 0
x
x
x x x
| |
> + >
|
\ .
.
Thus,
1 1
0 2.2079 or 4.5052
x x
< < > .
0.453 or 0 0.222 x x > < < .
(b)

2
2
2 7 6
1
2
x x
x x
+
<

( )
2 2
2
2 7 6 2
0
2
x x x x
x x
+
<

( )( )
( ) ( )
( ) ( )
( )
( )
2
2
2 2
2
2
2
6 8
0
2
6 8 2 0
( 4)( 2)( 2)( 1) 0
( 2) ( 4)( 1) 0
1 2 or 2 4
OR
6 8
0
2
4 2
0
2 1
4
0
1
( 4)( 1) 0
1 4, 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
x x
+
<

+ <
+ <
+ <
< < < <
+
<

<
+
<
+
+ <
< < =

y = ln x
y = |x-3|
2.21 4.51

75
11. 2011/C1/BT/RVHS/Q1
( )
2
2
2 3 1 2 2 0 x x x + = + > > .
Hence
2
2 3 x x + is always positive.

2
3 2
2 3
0, 1,1, 4
4 4
x x
x
x x x
+
> =
+

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

Since
2
2 3 x x + is always positive,
( )( )( ) 1 1 4 0 x x x + >
1 1 or 4 x x < < >

12. 2011/C1/BT/TPJC/Q3

2 2
1 3
1 ( ) 0
2 4
x x x + = + > for all real values of x, as
2
1
( ) 0
2
x > .
2
2
3 2
2
1
x x
x x
+
>
+

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

2
2
5 4
0
1
x x
x x
+
>
+

Since
2
1 0 x x + > for all real values of x,
2
5 4 0 x x + >
2
5 4 0 x x + <
(x 1) (x 4) < 0
1 < x < 4
From the earlier results,
4 2
4 2
3 2
2
1
x x
x x
+
>
+
for 1 < x
2
< 4
x
2
> 1 and x
2
< 4
2 < x < 1 or 1 < x < 2

- 1 1 4
x
-2 -4.11
x
y
0.667 4.90
3 2
1 1
8 16
2 3
y x x x = +

4 2 y x = +
O

76
13. 2011/C1/BT/VJC/Q11
(a)
3 2
1 1
2 2 4
8 12
x x x x + s +
3 2
1 1
4 2 8 16
2 3
4.11 0.667 or 4.90
x x x x
x x
+ s +
s s >

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

( )( ) ( )( )
( )( )
( )( )
( )
( )( )
2 2
3 2 2 2 3
0
2 3 2
5 6 2 7 6
0
2 3 2
12
0
2 3 2
x x x x
x x
x x x x
x x
x x
x x
+ +
>
+
+
>
+
+
s
+

3
12 or 0 2
2
x x s < s <

2
2 2
2
2
2
1
2
3
2
3
2
ln 2
Replace with e
12 e or 0 e 2
12 e has no solution
as e 0 for all real .
0 e 2

x
x x
x
x
x
x
x
x
s < s <
s <
>
s <
<

2
1
2
ln 2
2

77
5B
SystemOfLinearEquations

1. 2011/C1/BT/HCI/Q4
(i) 160000
4
c
b + = .. (1)
198000
5
c
a b + + = ..(2)
2 240000
6
c
a b + + = ..(3)
50000, 100000, 240000 a b c = = =
(ii) Method 1:

240000
50000 100000 0
4
t
t
+ + =
+

t =2.71
The profit first becomes zero in 2003.
Method 2:
240000
50000 100000 0
4
t
t
+ + =
+

2
50000 100000 640000 0 t t + =
2.71or 4.71 t = (rej 0 t > )
Method 3:
240000
50000 100000 0
4
t
t
+ + =
+

From GC, t = 3.


78
2. 2011/C1/BT/IJC/Q2
Let the digit in the hundreds place, tens place and ones place be x, y and z respectively.
20 x y z + + = ----- (1)
(100 10 ) (100 10 ) 90 x y z y x z + + + + = 90 90 90 x y =
1 x y = ----- (2)
(100 10 ) (100 10 ) 297 x y z x z y + + + + = 9 9 18 y z =
2 y z = ---- (3)
Using GC: 8, 7, 5 x y z = = =
The original number is 875.

3. 2011/PU3/BT/MI/Q1
2 4 3 1499
3 7 1527.5
8 5 2524
p q r
p q r
p q r
+ + =
+ + =
+ + =

Using GC,
$75, $150.50, $249 p q r = = =

Amount spent on Diane's gift
75 5(150.50) 2(249)
$1325.50
= + +
=

4. 2011/C1/BT/NYJC/Q3
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 = + .

79

5. 2011/C1/BT/RI/Q1
Let P, G, and M be the prices ($) of 1 PineApple, Googol and Macrohard shares respectively.
10 50 300 40040
10 10 0
(0.1)(10 ) (0.15)(50 ) (0.2)(300 ) 6227
P G M
G P M P G M
P G M
+ + =
= + + =
+ + =

From GC, $326, G $582, M $25.60 P = = =

6. 2011/C1/BT/RVHS/Q2
Let , and x y z be the number of cups of coffee, tea and milo sold.
15 10 35 5920
15 10 480
172
x y z
x y
x y z
+ + =
=
+ = +

Rearranging the above equations gives,
15 10 35 5920
15 10 480
172
x y z
x y
x y z
+ + =
=
+ =

By G.C this gives,
120
132
80
x
y
z
=
=
=

So, the total number of cups of beverages sold is 120 132 80 332 x y z + + = + + = .

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
y

80
7. 2011/C1/BT/TJC/Q4

Since AB is the diameter of the circle with centre (5, 0)
and the x-coordinate of B is 1, then the x-coordinate of A
must be 9.

When x = 1, ( )
2
2
1 5 25 y + =
3 or 3 (reject since is the min pt) y B =
Therefore, B has coordinates (1,3) and A has
coordinates (9, 3).
Let
3 2
y ax bx cx d = + + + be the equation of C.

2
d
3 2
d
y
ax bx c
x
= + + .
Since max and min pts are (9, 3) and (1, 3) respectively, we have

243 18 0
729 81 9 3
3 2 0
3
a b c
a b c d
a b c
a b c d
+ + =
+ + + =
+ + =
+ + + =

Using GC,
0.0234, 0.352, 0.633, 2.70 (corr to 3 s.f.) a b c d = = = =

3 2
0.0234 0.352 0.633 2.70 y x x x = +

8. 2011/C1/BT/VJC/Q1
Let , , be the ERP rates for cars, c l m
lorries & motorcycles respectively in dollars

( ) ( ) ( )
123 91 210 788.5
175 98 210 910
154 103 190 850.5
2, 2.50, 1.50
New rate for lorries (in $) 2.50 1.2 3
Day 3's revenue (in $) 154 2 103 3 190 1.5
902
c l m
c l m
c l m
c l m
+ + =
+ + =
+ + =
= = =
= =
= + +
=

y
x
0 1 5
B
A

2013 HCI C1 Block Test H2 Mathematics Revision Package Solutions

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

2013 HCI C1 Block Test H2 Mathematics Revision Package Solutions

Caricato da

Copyright:

Formati disponibili

2013HCIC1BlockTestH2MathematicsRevisionPackageSolutions

> > >

< < <

, where a is a positive constant.

exists, f has to be one-one. Min value of c = 0.

intersect at the point where

does not exist

Potrebbero piacerti anche