Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
>
( )
2 3
3
0
2
x
x x
>
( )
( )
2
3
0, 0, 2
2
x
x
x x
>
Therefore 3 x >
or
2 x < , 0 x
Alternative solution: 0 or 0 2 or 3 x x x < < < >
0 2
+ +
3
+
y
x
O
2
Qn Solution
Q2 Transformation of Graphs
(a)
3 6
1
e
2
x
y
=
( )
3 6
3 2
e
e
x
x
y
+
=
=
1
Q
3
e
x
y
=
1
P
3
e
x
y =
3
e
x
y =
(b)
8
O 2
x
y
( ) 2 4 ,
8 y =
2 x =
0 y =
1
R
3
Qn Solution
Q3 Maclaurin Series
1
tan y x
=
( )
( ) ( )
( ) ( ) ( ) ( )
( )
2
2
2
2
2
3 2 2
2
3 2 2
3 2
2
3 2
d 1
d 1
d
1 1
d
d d
1 2 0 (proven)
d d
d d d d
1 2 2 2 0
d d d d
d d d
1 4 2 0
d d d
y
x x
y
x
x
y y
x x
x x
y y y y
x x x
x x x x
y y y
x x
x x x
=
+
+ =
+ + =
+ + + + =
+ + + =
When x =0,
2
2
3
3
0
d
1
d
d
0
d
d
2
d
y
y
x
y
x
y
x
=
=
=
=
1 3
3
2
tan ...
3!
1
...
3
y x x x
x x
= = + +
= +
Required area
1
2
1
0
1
2
3
0
1
2 4
2
0
tan d
1
d
3
1
2 3 4
1 1
0
8 192
23
or 0.120 (3s.f.)
192
x x
x x x
x x
=
(
=
(
| | | |
=
| |
\ . \ .
=
Working is not required,
i.e. can use G.C.
directly.
4
Qn Solution
Q4 Curve Sketching
(a)
(b)
11
b
y
x
O
11 = x
ax y =
y x =
y
x O
11 = x
1 10
11
10
( ) 7.84,4.68
( ) 14,2,17.3
11
b
y ax
x
= +
5
Qn Solution
Q5 Techniques of Integration (By parts)
(i)
( )
( )
1 2
2
2 2
2 2
2
2
d
sin 1
d
1 1
2 1
2
1 1
1 1
1
2 1 (shown)
x x x
x
x
x x
x x
x x
x
x
+
= + +
+
=
=
(ii)
( )
( )
2
2
2 2
2
2
1 1
1
1
1 1
shown
1
x
x
x x
x
x
+
+ =
=
( )
( )
( )
2
2
2 2
2
2 2
2
2
Alternative method:
1 1
1 1
1
1
1 1
1
1 shown
1
x
x
x x
x
x x
x
x
=
=
= +
(iii)
( )
1
2 1 2
2
2 1 2
2
2 1 1 2 1
2 1 2
4 sin d
1
2 sin 2 d
1
1
2 sin 2 1 d
1
2 sin sin 1 2sin
2 1 sin 1
x x x
x x x x
x
x x x x
x
x x x x x x c
x x x x c
| |
= +
|
\ .
= + + +
= + +
6
Qn Solution
Q6 Application of Differentiation (exc. Tangent/Normal)
(a)
2
tan 3 5 x y xy + + =
Using implicit differentiation,
2
d d
2 sec 3 3 0
d d
y y
x y x y
x x
+ + + =
( ) ( )
2
d
3 sec 2 3
d
y
x y x y
x
+ = +
( )
( )
2
2 3
d
d 3 sec
x y
y
x x y
+
=
+
(b)
5 1
using similar triangles,
15 3
1
3
r
h
r h
= =
=
2
2
3
1
3
1 1
3 3
1
27
V r h
h h
h
=
| |
=
|
\ .
=
( )
( )
( )
2
2
2
1
d 1
d 9
d d d
d d d
9
4
9
4
2
9
cms
V
h
h
h h V
t V t
h
=
=
=
=
=
7
Qn Solution
7 Loci & Integration application (Vol)
( ) ( )
2 2
2 i 2
2 1 2
z
x y
=
+ =
4 i 3i z z + =
( )
4 0 1 3
Midpoint of line-segment ,
2 2
2,1
+ + | |
=
|
\ .
=
1 3
Gradient of line-segment
4 0
1
=
=
Equation of perpendicular bisector is
( )
( )
1 1 2
1 shown
y x
y x
=
=
( ) ( )
( ) ( )
( )
2 2
2 2
2
2 1 2
2 2 1
2 2 1
x y
x y
x y
+ =
=
=
( ) ( )
( )
2
2
2 2
0
3
Volume generated 1 2 2 1 d
23.9 units (3 s.f)
y y y = +
=
Re
Im
O
1
2 4
1
3
1
2
2
3
8
Qn Solution
Q8 AP/GP
( ) ( ) ( )
( )
2 11
12
Interest owed to Bank A 0.01 0.011.1 0.011.1 0.011.1
1.1 1
0.01
1.1 1
0.21384 21.4% (3 s.f.)
= + + + + +
(
= (
(
=
( ) ( ) ( )
| |
Interest owed to Bank B 0.01 0.01 0.01 0.01 0.02 0.01 0.11
12
0.01 0.01 0.11
2
0.12 0.66
k k k
k
k
= + + + + + + +
= + +
= +
Alternative method:
( ) ( ) ( )
( ) ( )
Interest owed to Bank B 0.01 0.01 0.01 0.01 0.02 0.01 0.11
12
2 0.01 11 0.01
2
0.12 0.66
k k k
k
k
= + + + + + + +
= + (
= +
Since interest owed to both banks is the same,
0.12 0.66 0.214
0.1424
0.142 (3 s.f.)
k
k
+ =
=
=
( )( )
( )
Interest owed under special loan 12 0.01 1000
120
120 0.214 1000
1.78
p
p
p
p
=
=
=
=
9
Let n be the number of months in the loan tenure with Bank A.
Interest owed on special loan 0.015n =
( )
( )
1.1 1
Interest owed on regular loan 0.01 0.11.1 1
1.1 1
n
n
(
= = (
(
( )
( )
0.11.1 1 0.015
0.11.1 1 0.015 0
n
n
n
n
<
<
Using GC,
( )
( )
8,0.11.1 1 0.015 0.00564 0
9,0.11.1 1 0.015 0.000795 0
n
n
n n
n n
= = <
= = >
Therefore max n =8.
Qn Solution
Q9 Mathematical Induction + Method of Difference
(i)
Let P
n
denotes the statement
( ) ( )
1
2 4 1 2
3 ! 3 3 !
n
r
r
r n
=
+
=
+ +
for all 1 n .
When 1 n = ,
LHS
( )
( )
( )
1
1
2 1 4
2 4 1
3 ! 1 3 ! 4
r
r
r
=
+
+
= = =
+ +
RHS
( )
1 2 1
3 1 3 ! 4
= =
+
LHS.
Therefore
1
P is true.
Assume P
k
is true for some value of k where 1 k
i.e
( ) ( )
1
2 4 1 2
3 ! 3 3 !
k
r
r
r k
=
+
=
+ +
Need to prove that
1
P
k+
is also true
i.e
( ) ( )
1
1
2 4 1 2
3 ! 3 4 !
k
r
r
r k
+
=
+
=
+ +
(1)
10
LHS
( ) ( )
( )
( )
1
1 1
2 1 4
2 4 2 4
3 ! 3 ! 1 3 !
k k
r r
k
r r
r r k
+
= =
+ +
+ +
= = +
+ + + +
( ) ( )
1 2 2 6
3 3 ! 4 !
k
k k
+
= +
+ +
[from (1)]
( ) ( )
1 2 2 6
3 3 ! 4 !
k
k k
(
+
=
(
+ +
( ) ( )
( )
2 4 2 6
1
3 4 !
k k
k
( + +
=
(
+
( )
1 2
RHS
3 4 ! k
(
= =
(
+
Therefore P
k
is true
1
P
k+
is also true.
Hence since
1
P is true and
1
P is true P is true
k k+
, by mathematical induction, P
n
is true for
all 1 n .
(ii)
( )
( ) ( )
0
2 6
f 1 f
4 !
n
r
r
r r
r
=
(
+
+ +
(
+
( )
( ) ( )
0 0
2 6
f 1 f
4 !
n n
r r
r
r r
r
= =
+
= + + (
+
Method 1
( ) ( ) ( )
0
2 6 6 8 2 4 2 6
4 ! 4! 5! 3 ! 4 !
n
r
r n n
r n n
=
+ + +
= + + +
+ + +
( ) ( )
1
2 4 2 6
3 ! 4 !
n
r
r n
r n
=
+ +
= +
+ +
( )
1
1
2 4
3 !
n
r
r
r
+
=
+
=
+
( ) ( )
1 2 1 2
3 1 3 ! 3 4 ! n n
= =
+ + +
Method 2
(2)
(3)
11
( ) ( ) ( )
0
2 6 6 8 2 4 2 6
4 ! 4! 5! 3 ! 4 !
n
r
r n n
r n n
=
+ + +
= + + +
+ + +
( ) ( )
1
2 4 2 6
3 ! 4 !
n
r
r n
r n
=
+ +
= +
+ +
( ) ( )
1 2 2 6
3 3 ! 4 !
n
n n
+
= +
+ +
( ) ( ) ( ) ( )
0 0
f 1 f f 1 f 0
n n
r r
r r
= =
+ = (
( ) ( ) f 2 f 1 +
( ) ( ) f 3 f 2 +
( ) ( )
( ) ( )
f f 1
f 1 f
n n
n n
+
+
+ + (
( ) ( ) f 1 f 0 n = + (
( )
( ) 1
1 e 0
n
n
+
(
= +
Sub (3) and (4) into (2)
( )
( ) ( )
( )
( )
( ) 1
0
2 6 1 2
f 1 f 1 e
4 ! 3 4 !
n
n
r
r
r r n
r n
+
=
(
+
+ + = + +
(
+ +
or
( )
( ) ( )
( ) ( )
( )
( ) 1
0
2 6 1 2 2 6
f 1 f 1 e
4 ! 3 3 ! 4 !
n
n
r
r n
r r n
r n n
+
=
(
+ +
+ + = + + +
(
+ + +
(iii)
Method 1
As n , ( )
( ) 1
1 e 0,
n
n
+
+
( )
2
0
4 ! n
+
( )
( ) ( )
0
2 6 1
f 1 f
4 ! 3
n
r
r
r r
r
=
(
+
+ +
(
+
(3)
12
The limit of convergence is
1
3
.
Method 2
As n , ( )
( ) 1
1 e 0,
n
n
+
+
( )
2
0,
3 ! n
+
( )
2 6
0
4 !
n
n
+
+
( )
( ) ( )
0
2 6 1
f 1 f
4 ! 3
n
r
r
r r
r
=
(
+
+ +
(
+
The limit of convergence is
1
3
.
Qn Solution
Q10 Functions
(i)
( )
( )
| ) 1
2
f f
f
Let 1 2
1 2
Since 1, 1 2
Hence , f 1 2.
Since D R ,D 2,
f : 1 2, , 2
y x
x y
x x y
x x
x x x x
= +
=
= +
= +
= =
+
(ii)
( )
1
f f x x
= , ( )
1
ff x x
=
-1 -1
1 1
ff f f
f f is not equal to ff because D [1, ) [2, ) D
= =
(iii)
Method 1:
( )
1
3
h
2
x
x
a
=
( )
3
g ln 2 1 1
2
3
ln 1 1
x
x
a
x
a
| | | |
= +
| |
\ . \ .
| | | |
= +
| |
\ . \ .
Method 2:
( ) ( ) Let g ln 1 x Ax B = + +
13
( ) ( ) ( ) ( ) gh ln 2 3 1 ln 2 1 1
By comparison,
1
2 2
3
3 1 1
x A ax B x
aA A
a
A B B
a
= + + + = +
= =
+ = =
( )
3
g ln 1 1
x
x
a
| | | |
= +
| |
\ . \ .
(iv)
For fh to exist,
h f
R D .
| )
f
D 2, = ,
( )
h
R 3, a = +
Since
h f
R D , fh exists.
1 1 a + +
( ) fh
R 1 1, a = + +
( ) f 1 2 x x = +
1
2
f
D
( ) fg
R 1 1, a = + +
f
( )
g
R 3, a = +
h
h
1
D ,
2
| |
=
|
\ .
y
x
O
3 a +
14
Qn Solution
Q11 Differential Equations
(a)
d dy
d d
u xy
u
y x
x x
=
= +
Sub.
d 1
d
y y
y
x x
= into
d dy
d d
u
y x
x x
= +
d 1
d
1
1
d
1
d
u y
y x y
x x
y y xy
xy
u
u
x
| |
= +
|
\ .
= +
=
=
1
d 1 dx
1
ln1
ln1
1 e e
1 e e
1 e where e
1 e
1 e
C x
C x
x C
x
x
u
u
u x C
u x C
u
u
u A A
xy A
A
y
x
= +
=
=
=
= =
=
=
(b)
2
2
2
2
2
d
e
d
d
2e
d
4e
t
t
t
x
t
x
C
t
x Ct D
=
= +
= + +
when 0, 7 t x = =
( )
0
2
7 4e 0
7 4
3
C D
D
D
= + +
= +
=
15
2
4e 3
4, 3
t
x Ct
B D
= + +
= =
2 C =
x
t
C =0
C =1
C = 1
3 x =
7
O
16
Qn 12 Solution
(i)
( )
3 1
2
5 4
2
3 5
1 4
2 1
3 5 ,
1 4
y z
x
x
y
z
+
= = =
=
= +
= +
| | | |
| |
= +
| |
| |
\ . \ .
r
(ii) Method 1
2 1
3 5 ,
1 4
| | | |
| |
= +
| |
| |
\ . \ .
r
1 1
5 1 1 5 4 0 is parallel to
4 1
l
| | | |
| |
= + =
| |
| |
\ . \ .
2 1
3 1 2 3 1 6 A point on lies in
1 1
l
| | | |
| |
= + + =
| |
| |
\ . \ .
Therefore l lies in .
Method 2
2 1
3 5 1 2 3 5 1 4 6
1 4 1
| | | |
| |
+ = + + + =
| |
| |
+
\ . \ .
Therefore l lies in .
(iii) Method 1
Line passing through A and perpendicular to ,
7 1
: 6 1 ,
1 1
AN
l
| | | |
| |
= +
| |
| |
\ . \ .
r
Since N lies on
AN
l ,
7
6
1
ON
+ | |
|
= +
|
|
\ .
for some
At point of intersection of
AN
l and ,
17
7 1
6 1 6
1 1
7 6 1 6
3 6
2
+ | | | |
| |
+ =
| |
| |
\ . \ .
+ + + + + =
=
=
7 2 5
6 2 8
1 2 3
ON
+ | | | |
| |
= + =
| |
| |
\ . \ .
(shown)
Method 2
Let
6
0
0
OB
| |
|
=
|
|
\ .
be a point on
6 7 13
0 6 6
0 1 1
AB
| | | | | |
| | |
= =
| | |
| | |
\ . \ . \ .
A( 7,6, 1)
N
(6,0,0) B
18
AN
=Projection of AB
( )
AB
n n
13 1 1
1 1
6 1 1
3 3
1 1 1
1
13 6 1
1
3
1
1
2 1
1
2
2
2
| | | | | |
| | |
=
| | |
| | |
\ . \ . \ .
| |
| | |
=
|
|
\ .
|
\ .
| |
|
=
|
|
\ .
| |
|
=
|
|
\ .
7 2 5
6 2 8
1 2 3
ON OA AN
| | | | | |
| | |
= + + = + =
| | |
| | |
\ . \ . \ .
(shown)
Using ratio theorem,
( )
1
'
2
ON OA OA = +
' 2
5 7
2 8 6
3 1
3
10
5
OA ON OA =
| | | |
| |
=
| |
| |
\ . \ .
| |
|
=
|
|
\ .
19
(iv) Method 1 to find P using A
The smallest possible area of ANP occurs when P is the foot of perpendicular from A to l .
To find OP
Let P be the foot of the perpendicular from A to l .
2 1
3 5 , .
1 4
| | | |
| |
= +
| |
| |
\ . \ .
r
Since P lies on l then
2
3 5
1 4
OP
| |
|
= +
|
|
+
\ .
for some
2 7 9
3 5 6 3 5
1 4 1 4
AP OP OA
| | | | | |
| | |
= = + = +
| | |
| | |
+
\ . \ . \ .
9 1
, 3 5 . 5 0
4 4
9 15 25 16 0
42 24
4
7
AP l
| | | |
| |
+ =
| |
| |
\ . \ .
+ + + =
=
=
4
2
7
10
4 1
3 5 41
7 7
9
4
1 4
7
OP
| |
|
|
| |
|
| | |
= + =
| |
|
\ .
| |
\ .
|
| |
+
|
|
\ . \ .
A
P
N
l
20
Method 2 to find P using N
The smallest possible area of ANP occurs when P is the foot of perpendicular from N to l .
To find OP
Let P be the foot of the perpendicular from N to l .
2 1
3 5 , .
1 4
| | | |
| |
= +
| |
| |
\ . \ .
r
Since P lies on l then
2
3 5
1 4
OP
| |
|
= +
|
|
+
\ .
for some
2 5 7
3 5 8 5 5
1 4 3 2 4
NP OP ON
| | | | | |
| | |
= = + = +
| | |
| | |
+ +
\ . \ . \ .
7 1
, 5 5 . 5 0
2 4 4
7 25 25 8 16 0
42 24
4
7
NP l
| | | |
| |
+ =
| |
| |
+
\ . \ .
+ + + + =
=
=
A
P
N
l
21
4
2
7
10
4 1
3 5 41
7 7
9
4
1 4
7
OP
| |
|
|
| |
|
| | |
= + =
| |
|
\ .
| |
\ .
|
| |
+
|
|
\ . \ .
Method 3 to find PN using cross-product
The smallest possible area of ANP occurs when P is the foot of perpendicular from A to l .
To find PN
Let P be the foot of the perpendicular from Ato l .
Let
2
3
1
OC
| |
|
=
|
|
\ .
be a point on
2 1
: 3 5 , .
1 4
l
| | | |
| |
= +
| |
| |
\ . \ .
r
5 2 7
8 3 5
3 1 2
CN
| | | | | |
| | |
= =
| | |
| | |
\ . \ . \ .
2 2 2
7 1
1
5 5
1 5 4
2 4
PN CN =
| | | |
| |
=
| |
+ +
| |
\ . \ .
d
A
P
N
l
C
22
30
1
30
42
30
30
3
42
30 15
14
7 14
| |
|
=
|
|
\ .
=
= =
After finding OP
or PN
,
5 10 3
1 15
8 41 1
7 7
3 9 2
15
14
7
5 7 2
8 6 2
3 1 2
' 12
PN
PN
AN
AA
| | | | | |
| | |
= =
| | |
| | |
\ . \ . \ .
=
| | | | | |
| | |
= =
| | |
| | |
\ . \ . \ .
=
2
1
Smallest possible area of
2
1 15
14 12
2 7
15 42
13.9 units
7
ANP PN AN =
| |
=
|
\ .
= =