1

2011 HCI JC2 H2 Math Block Test 2 Solutions

No. Solutions
1

















Since 1+3i is a root of the equation, 1 3i is also a root of the equation.
( ) ( ) ( ) ( )
2
1 3 1 3 2 10 z i z i z z + = +
( )( )
3 2 2
3
2 50 2 10
Comparing coefficients of and constant terms,
2 and 5
z az bz z z cz d
z
c d
+ + = + +
= =

( )( )
3 2 2
3 2
2 50 2 10 2 5
2 9 30 50
z az bz z z z
z z z
+ + = +
= +

Therefore, 9 and 30 a b = = .

The other roots of the equation are 1 3i and
5
2
.


Alternative solution
( ) ( ) ( )
( ) ( ) ( )
3 2
2 1 3i 1 3i 1 3i 50 0
2 26 18i 6i 8 1 3i 50 0
a b
a b
+ + + + + =
+ + + =

Comparing real parts: 8 102 b a =
Comparing imaginary parts: 2 12 a b + =
Solving, 9 and 30 a b = = .
Since 1+3i is a root of the equation, 1 3i is also a root of the equation.
( ) ( ) ( ) ( )
2
1 3 1 3 2 10 z i z i z z + = +
( )( )
3 2 2
3
2 9 30 50 2 10
Comparing coefficients of and constant,
2 and 5.
z z z z z cz d
z
c d
+ = + +
= =

The other roots of the equation are 1 3i and
5
2
.

2














Let P(n) be the statement that
2
3
+4
3
+6
3
+ +(2n)
3
=2n
2
(n +1)
2
, for positive integers n (i.e.
+
n )

For n =1, LHS of P(1)=2
3
=8
RHS of P(1)=2(1)
2
(1+1)
2
=8
Therefore P(1) is true.

Assume P(k) is true for some positive integer k, i.e. 2
3
+4
3
+6
3
+ +(2k)
3
=2k
2
(k +1)
2
.



Consider P(k+1):
2
















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

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



Since P(1) is true and P(k) is trueP(k+1) is true, by Mathematical Induction, P(n) is true
for all positive integers n.

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

3(i)










(ii)




























2
4
2
sin
4 2
2
cos
4 2
ABC AOC
AC AB
BC AB

= =
= =
= =

Hence,
2 2
1 i
2 2
z
| |
= +
|
|
\ .


Alternative Solution
Solve
( )
2
2
1 1
7
tan or tan
8 8
x y
y x x

+ + =
| | | |
=
| |
\ . \ .
simultaneously,

0 (rejected) or 1.7071 x x = =
Re
O
7
8

B
( 1 , 0)
A
C

Im
3








(iii)




When 1.7071 x = , 0.70711 y =
Hence, 1.71 0.707i z = +
Or using graphs to find the intersection point (1.71, 0.707) between the circle and the
line.











Required angle =
2 4 4
1 3
(isosceles triangle)
2 4 8
ABD
ADB

= =
| |
= =
|
\ .

Least value of arg
7
( 1 i)
8
w

+ =
Alternative Solution
Consider

where X is the foot of
perpendicular from A to BD





1
2/ 2 3
( ) tan
8 1 2/ 2
ADX ADB

| |
= = =
|
|

\ .

Least value of arg
7
( 1 i)
8
w

+ =



Alternative Solution
Least value of arg( 1 i) w+ occurs when
2 2
1 i
2 2
w
| |
= +
|
|
\ .
which is found in part (ii).
Therefore, the least value of arg( 1 i) w+
D(-1,1)
A
Im
Re
O
B
(1, 0)
C
A
2 2
1 ,
2 2
| |

|
|
\ .

D (-1,1)
X
4
1
2 2
arg 1 i 1 i
2 2
2 2
arg i( 1 )
2 2
2
1
7
2
tan
8 2
2

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

= + =


4(a)










(b)











(i)
2
2
(2 (2 1) 0.05 )
2
n
n
S y n y = +
( ) 2 0.1 0.05
(0.1 1.95)
n y ny y
ny n
= +
= +

(ii) (0.1 1.95) 20 ny n y + >

2
19.5 200 0
26.9 7.43 (by GC)
n n
n or n
+ >
< >

Therefore least integer of n is 8.

( )
( )
( ) ( )
( )
( )
2 1
3 2 1
2
1
2
4 3 1
3 2
1
1 2 2
1
1.05 30
1.05 30 1.05 1.05 30 30
1.05 1.05 1 30
1.05 30 1.05 1.05 1.05 1 30 30
1.05 1.05 1.05 1 30
1.05 1.05 1.05 1.05 1 30
n n
n
u u
u u u
u
u u u
u
u u

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

( )
( )
1
1
1
1
11.05 1
1.05 30
1.05 1
1.05 600 600
n
n
n
u
y

= +

= +

where 600 and 600 a b = =



Alternative Solution
0
1
2
1.05 ( )
0 (1)
1.05 30 1.05( )
30 1.05 (2)
u y y a b y a b
a b
u y y a b
a b
= = + + = + +
+ =
= + = + +
= +

Solving (1) and (2),
5
600 and 600 a b = = .

5(i)


1
f :
ax
x
x a

Let
1 ax
y
x a

1 xy ax ay =
( ) 1 x y a ay =
1 ay
x
y a

1
f
f
\{ } D R a

= =
1
1
f :
ax
x
x a

, x , x a

5(ii)
Since
1
f ( ) f ( ) x x

= ,
2
f ( ) x x = .
2011 2010
f (5) f (f (5)) =
=f(5)
=
5 1
5
a
a

(iii) For 2 a = ,

2 1
f :
2
x
x
x

, x , 2 x
For fg to exist,
g f
R D
g
\{2} R
For 2, b check that
g f
[0, ) R D = .
Therefore, 2 b >
Consider the graph of g for 2 b > :

2
g
(( 2) , ) R b = +
Maximal (2, )
g
R = so that
{ }
g f
\ 2 R D = .
2
Least value for ( +2) 2 b =
2 2 b = or 2 2 (rej.) b = since 2 b >
Least possible value of 2 2 b =
-2
2
( ,( 2) ) b b +
x
g( ), y x x b = >
6
6(i)


2
:
2 1 0
= 0 1 1
1 0 1
| | | | | |
| | |
+ +
| | |
| | |
\ . \ . \ .
r
2
1 0 1
1 1 1
0 1 1
n
| | | | | |
| | |
= =
| | |
| | |
\ . \ . \ .

1 2 1
1 0 1 3
1 1 1
| | | | | |
| | |
= =
| | |
| | |
\ . \ . \ .
r 3 x y z + =

1
: 3 x y z + + =

2
: 3 x y z + =
By GC:
3 1
: 0 0
0 1
l
| | | |
| |
= +
| |
| |

\ . \ .
r
Alternative Solution

2 1 0 1
0 1 1 1 3
1 0 1 1
2 1
1 3
1 1
2 1 3
| |
| | | | | | | |
|
| | | |
+ + =
|
| | | |
| | | |
|
\ . \ . \ . \ .
\ .
+ | | | |
| |
+ =
| |
| |
+
\ . \ .
+ + + + + =
=

Sub = into
2 1 0
= 0 1 1
1 0 1
| | | | | |
| | |
+ +
| | |
| | |
\ . \ . \ .
r ,
we obtain
2 1 0 2 1
: 0 1 1 0 0
1 0 1 1 1
l
| | | | | | | | | |
| | | | |
= + = +
| | | | |
| | | | |

\ . \ . \ . \ . \ .
r

6(ii)
Firstly, l must be parallel to
3
.
7
1 2
0 0
1
2 0
2
a
b
b
b
| | | |
| |
=
| |
| |

\ . \ .
=
=

Secondly, l cannot lie in
3

2 2 3 2
0 or 0
1 2 0 2
6
a c a c
c
| | | | | | | |
| | | |

| | | |
| | | |
\ . \ . \ . \ .

There are no other requirements so as such, there is no restriction on a found.
2, 6 and b c a =

6
(iii)

The plane should contain the point of origin and l .

:
0 1 2
= 0 0 0
0 1 1
| | | | | |
| | |
+ +
| | |
| | |

\ . \ . \ .
r
Normal vector of =
2 1 0 0
0 0 3 3 1
1 1 0 0
| | | | | | | |
| | | |
= =
| | | |
| | | |

\ . \ . \ . \ .

0
1 0 (RHS =0 since origin lies on the plane)
0
0 y
| |
|
=
|
|
\ .
=
r


7(a)



Given vertical asymptote at
1
2
x = ,
1
( ) 0 2 0 (1)
2
c d c d + = + =
Given oblique asymptote of 2 1 y x = + ,
2 (2)
2
Sub (1) in (2),
2 0
2
4 0 (shown)
a a
c
c
a
d
a d
= =
+ =
+ =


7(b)
(i)
When 8, 8 4 0 2. a d d = + = =
Equation of the curve is
2
8 1
4 2
x
y
x
+
=

.
8
















(b)
(ii)
1
f ( )
y
x
=










8(a)

u x =
d 1
d 2
u
x x
=
d
2
d
x
u
u
=
Or
2
d
2
d
x
x u u
u
= =
2 2
1 1 1
d 2 d 2 d
( 1) 1 ( 1)
x u u u
u u u x x
= =



=
2 1
ln
2(1) 1
u
C
u

+
+

=
1
ln
1
x
C
x

+
+


x
y
0
2 1 y x = +
1
2
x =
(1.11, 4.45)
(0.112, 0.449)
0.5


x
2
(1.11, 0.225)
(0.112, 2.22)
0.5
y
9
8(b)
(i)


2
2 2
2
2 2
2 2 2
2
2 2
e cos2 d
e e
cos2 2sin2 d
2 2
[By parts, cos2 , ' ]
1
e cos2 e sin2 d
2
1 1
e cos2 e sin2 e cos2 d
2 2
[By parts, sin2 , ' ]
1 1
e cos2 e sin2
2 2
x
x x
x
x x
x x x
x
x x
x x
x x x
u x v e
x x x
x x x x
u x v e
I x x I
=
= =
= +
= +
= =
= +

2 2
2
1 1
2 e cos2 e sin2
2 2
4 e (sin2 cos2 )
x x
x
I x x D
I x x C
= + +
= + +


(ii)







Let cos 0,
cos 0
2
x
y e x
x x

= =
= =

Volume
2
2
0
2 2
2
0
2
2
0
(e cos ) d
e cos d
cos2 1
e ( ) d
2
x
x
x
x x
x x
x
x

=
=
+
=

x
y
e cos
x
y x =

R
/ 2 0
10
( )
2
2
2 2
2 2
0 0
2
2
0
0
3
1 1
e d e cos2 d
2 2
1 e 1 1
e (sin2 cos2 )
2 2 2 4
1 1 1
e ( 1)
2 2 2 2 4 4
1 3
8 8
3 units
8
x x
x
x
x x x
x x
e
e
e

= +
(
(
= + +
(
(


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

=


9 The manager can obtain the sample of 30 based on the following strata.
Stratum Number of cans selected
Supplier A 180
30 6
900
=
Supplier B 480
30 16
900
=
Supplier C 240
30 8
900
=
Conduct simple random sampling method to select the number of cans as given above
from each stratum.

Advantage:
The sample obtained is representative of the population since the quality of the tomatoes
may vary depending on the suppliers and this method allows us take samples from
different suppliers to be tested proportionally.
10
(i)

(ii)
















Required Probability =
3 3 3 27
0.0787
7 7 7 343
= =

P(least integer selected is 5)
=P(one integer out of the three is 5, the rest is 6 or 7) +
P(two integers out of the three are 5) +
P(all three integers are 5) =
1 2 2 1 1 2 1 1 1
3 3
7 7 7 7 7 7 7 7 7
| | | | | |
+ +
| | |
\ . \ . \ .

=
19
0.0554
343
=


Alternative Solution
P(least integer selected is 5)
P(all 3 numbers selected are greater than 4)
P(all 3 numbers selected are greater than 5)
=

27 2 2 2
343 7 7 7
19
0.0554
343
(
=
(

= =


11





10
(iii)














P(3 diff integers | least integer is 5)
=
P(3 diff integers & least integer is 5)
P(least integer is 5)

=
3!P(1st select 5, 2nd select 6, 3rd select 7)
19
343

=
1 1 1
3!
7 7 7
19
243
| |

|
\ .

=
6
343
19
343
=
6
0.316
19
=

11
(a)
(i)
Let
1
X be the number of requests in the first hour and
2
X be the number of requests in the
second hour.
1 2 1 2
, ~Po(5) and Po(10) X X X X +
Required probability
=
1 1 2
P( 4 5) X X X = +
=
1 1 2
1 2
P( 4 and 5)
P( 5)
X X X
X X
= +
+

=
1 2
1 2
P( 4 and 1)
P( 5)
X X
X X
=
+

=
1 2
1 2
P( 4) P( 1)
P( 5)
X X
X X
=
+

=
0.00709373
0.06708596
=0.106
(a)
(ii)
Poisson distribution is not a good model for the number of requests in a day received by
the counsellor as the mean rate of requests might not be a constant throughout the day due
to higher mean rates during peak periods like evenings or lunchtimes where people are off
from work.

(b)

Let T be the duration of a counselling session for each individual request.

2
1 2 3
1 2 3
( ) N(10 2 10, 2 3)
( ) N( 10,12)
T T T
T T T
+
+

.
1 2 3
1 2 3
P( )
P( ( ) 0)
0.00195
T T T
T T T
> +
= + >
=


12
(i)
2
N( , ) X
12
P( 25) 0.1908 X < =
25
P 0.1908 Z

| |
< =
|
\ .


25
0.874952

= --- (1)
P( 45) 0.0521 X > = P( 45) 0.9479 X =

45
P 0.9479 Z

| |
=
|
\ .


45
1.624824

= --- (2)
Solving (1) and (2), 32, 8 = = (nearest integer)


(ii)

2 N(12,100) X Y
P( 2 ) X Y > =P( 2 0) X Y >
=0.885

(iii) Let T be the number of days where the journey time took more than 45 minutes.
Then B(50, 0.0521) T .

Since n =50 is large and 2.605 5 np = < ,
Po(2.605) T approximately.
P( 5) 0.951 T =
13 Whether a packet contains red coupon or not is independent of the other packets.
OR
The probability of a packet containing a red coupon is constant for every packet.
OR
The total number of packets of Quickie Cereal with coupons has to be very large so that
the probability of getting a red coupon in each packet is approximately constant at 0.3 after
one is opened.
(i) Let X be the number of red coupons found in 10 packets of Quickie Cereal.
Then B(10,0.3) X .
Probability that at least 1 toy can be exchanged
=P( 4) X
=1 P( 3) X
=0.350



(ii) Probability that exactly 1 toy and 1 cash voucher can be exchanged
=P( 4 or 5) X =
=P( 4) P( 5) X X = + =
=0.303
Let Y be the number of gold coupons found in 100 packets of Quickie Cereal.
Then B(100,0.7) Y .

Since n (=100) is large such that np =70 >5 and
13
(1 ) 30 5 n p = > ,
N(70,21) Y approximately.

Probability that more than 11 cash vouchers can be exchanged
=P(at least 12 cash vouchers can be exchanged)
=P( 60) Y
=P( 59.5) Y > (with c.c.) =0.989