JC2 Block Test Practice Paper 3

Qn 1
(i) Use of Ratio Theorem,
2OA  3OB
OC =
5
1
OC  (2a  3b)
5
OA
Shortest distance  OC 
OA

1
(2a  3b)  a
5
d
a
2 3
aa  ba
5 5
=
a
3 ba
= since a  a  0
5 a
3
k
5
1
(ii) OD  a
4

 
 1
WD OA 
6
OD  OW  OA  16
1  1
 aw a 
4  6
1 1
(a a)  (w a) 
4 6
1 2   1
a  w a cos   
4 6 6
Since a is a unit vector, a =1
1 2  3 1
1  w (1)   
4  2  6
1 3
w  or
6 3 18
 2

Q2

(i) Volume of solid formed

5
 y 2 dx
5

5 cos(0.1x) esin(0.1x )  dx
5 2

5

25 5
=   0.2 cos(0.1x) e2sin(0.1x) dx
0.2 5
5
= 125  e2sin(0.1x ) 5
= 125  e2sin(0.5 )  e2sin( 0.5 ) 
= 125  e2  e2 

[Solution]

(ii) Equation of circle representing the sun:

x 2  ( y  4)2  22
y  4  4  x2
y  4  4  x2 upper semicircle

Using GC, intersections between both curves are at

x = –1.99915 and x = 1.18772

Area of sun not hidden by mountain

1.99915  4  4  x 2    5 cos(0.1x) e  dx
1.18772
= sin(0.1x )

= 2.785 (3 d.p.)

Qn 3
dp  p  kp  N  p 
(i)  kp 1   
dt  N N
1 k
 p( N  p) dp   N dt
Using partial fractions,
1 1 1 k
 
N p Np
dp  t  C '
N

ln p  ln  N  p   kt  NC since p > 0, N  p > 0

 p 
ln    kt  B
N p
p
 e kt  B  Aekt where A  e B
Np
 3

N N 1
When t = 0, p = , 5
 Ae0  A 
5 N N
5
4
p 1
 e kt
Np 4
Np N
   1  4e  kt
p p
N
 p  R = 1, Q = 4
1  4e kt
1
(ii) When t = 9, p  N
2
N N

2 1  4e9 k
1  4e9 k  2
1
e 9 k 
4
1 2
 k   ln 4 or ln 2
9 9

Possible assumption:
The population remains constant at N.
There is no births and deaths.
There is no immigration or emigration.

(iii)
p

p=N

u t
 4

Qn 4
12
 k 
(a) 300 1    300  100
 100 
12
 k  4
1   
 100  3
k  2.43 (2 d.p.)

(b)(i)
nth week No. of remaining tickets after balloting
1 0.8(25 000)
2 0.8(0.8(25 000)  25) = 0.82(25 000)  25(0.8)
3 0.8[0.82(25 000)  25(0.8) 25]
= 0.83(25 000)  25(0.82 + 0.8)

n 0.8n (25 000)  25(0.8n1  0.8n2  ....  0.8)

No. of remaining tickets after balloting at the nth week

 0.8n (25 000)  25(0.8n 1  0.8n  2  ....  0.8)
0.8 1  0.8n 1 
 0.8n (25 000)  25 
1  0.8
n 1
 0.8 (25 000)  0.8 (100)  100
n

For 0.8n (25 000)  0.8n1 (100)  100  1000

Using GC,
n 0.8n (25 000)  0.8n1 (100) 100
14 1005
15 784.01

 greatest value of n is 14

(ii)
The number of remaining tickets after balloting at the 4 th week

has to be  0.1(25000) = 2500

 p 
4
 p  
3
p  
2
p 
 1   (25000)  25   1     1    1     2500
 100    100   100   100 

Using GC, p  43.617

Thus the least integer value of p is 44
 5

Q5
y = ln(1 + e2x)  e y  1  e2 x
dy
ey  2e2 x
dx
2
y  dy 
2
y d y dy
e  e    4e 2 x  2e y
 dx 
2
dx dx
2
d 2 y  dy  dy
Hence     2  0 (shown)
dx  dx 
2
dx
dy d2 y
When x = 0, y = ln 2,  1, 2  1
dx dx
2
x
Therefore y  ln 2  x   ...
2

(2 x) 2
(i) Using standard series, e  1  (2 x) 
2x
 ...  1  2 x  2 x 2  ...
2!
Hence
ln(1  e2 x )  ln(1  1  2 x  2 x2 )
= ln(2 + 2x + 2x2)
= ln [2(1 + x + x2)]
= ln 2 + ln (1 + x + x2)
( x  x 2 )2
= ln 2  ( x  x 2 )   ...
2
x2
= ln 2  ( x  x 2 )   ...
2
x2
= ln 2  x  ...
2
Thus the above expansion obtained is correct up
to the term in x2.

ln(1  e 2 x )
(ii)  ln(1  e 2 x )(1  2 x) 1
1 2x
 x2 

  ln 2  x   ...  1  2 x  4 x 2  ... 
 2 
(using (i) and binomial thm)
 3
 ln 2  (1  2 ln 2) x   4 ln 2   x 2 since x is small
 2
3
Hence a = ln 2, b = (1 – 2 ln 2), c = 4ln 2 
2
 6

Qn 6
[ Boys 10 consisting 9 + 1 brother ;
Girls 4 consisting 3 + 1 sister ]

No. of ways to select a committee with at least 3 boys and at least 2 girls
= n (2G 6B) + n (3G 5B) + n (4G 4B)
= 4C2 10C6  4C3 10C5  4C4 10C4
= 2478

Alternative
Number of ways without restriction – n (1G 7B) – n (0G 8B)
= 14C8  4C1 10C7  4C0 10C8
= 2478

(i) Method 1

Number of arrangements without restriction – number of arrangements with brother & sister in
back row

= 8!  6C2  4!  4C4  4!
= 31680

Method 2
Required Probability
= n (Only bro in front row & sis in back row)
+ n (Only sis in front row & bro in back row)
+ n (Both bro & sis in front row)

 6
C3  4!  3C3  4! Sis X X X back row
Bro X X X front row

 6C3  4!  3C3  4! Bro X X X back row

Sis X X X front row

 6C2  4!  2C2  4! X X X X back row

Bro Sis X X front row
= 31680

Method 2
Number of arrangements

= n (Bro in front row & sis in any row)

+ n (Sis in front row & bro in any row)
 n (Bro & sis in front row)

 7
C3  4!  4C4  4! X X X X back row
Bro X X X front row
 7

 7C4  4!  3C3  4! Bro X X X back row

X X X X front row

 6C2  4!  2C2  4! X X X X back row

Bro Sis X X front row

= 31680

(ii) Number of arrangements

=  5  1!  5C3  3!
= 1440

(iii)
Method 1
Case 1: Brother does not participate (hence sister also will not participate)
Number of ways = 6C4 = 15

Case 2: Brother participates but sister is not participating

Number of ways = 6C3 = 20

Case 3: Brother participates and sister is also participating

Number of ways = 6C2 = 15

Total number of ways = 15 + 20 + 15 = 50

Method 2
Case 1: The sister is in the delegation
Number of ways = 6C2 = 15

Case 2: The sister is not in the delegation

Number of ways = 7C3 = 35

Total number of ways = 15 + 35 = 50

Method 3

Number of ways
= Total number of ways without restriction
– Number of ways where sister participates but not brother
= 8C4  6C3
= 50
 8

Qn 7
 3
 
(i) Equation of the reflective metal surface: r  2   1
1
 
 5  3   2 1
       
PQ  OQ  OP   8    4    4   2  2 
 2   2   4   2
       
Let  be the acute angle between the light ray and the metal surface.
1  3 
  
 2   2 
 2  1 
sin  =     
1
9 14 3 14

 = 5.1 o
(ii) Height of the vertical stand = PQ n or PQ sin 

 2  3
   
 4  2 
 4  1
   
=
14
2 14
= =
14 7
 3  3
   
(iii) OS   4     2  for some  
 2   1
   

 3  3   3 
   
Since S lies on the plane,  4  2    2   1
 2     1 
   
9  9  8  4  2    1
14  2
1

7
 3  3
  1 
OS   4    2 
 2  7  1 
   
 24 
1 
  26 
7 
 13 
 9

 24 26 13 
The coordinates of S is  , ,  
 7 7 7

P
R
d

S
Q
d
d

By mid point theorem,

1

OS  OP  OP
2

OP  2OS  OP
 24   3 
2   
  26    4 
7   
 13   2 
 27 
1 
  24 
7 
 12 
QP  OP  OQ
 27   5 
1   
=  24    8 
7   
 12   2 
 8 
1 
=  32 
7 
 26 
4
2 
=  16 
7 
 13 
5 4
   
Vector equation of the reflected ray : r   8    16  ,  
 2  13 
   