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

34. (a) Let P(n) be the proposition ‘12 + 22 + 32 + … + n2 = ’, where n is a positive

6
integer.
When n = 1,
L.H.S. = 12 = 1
1(1  1)[ 2(1)  1]
R.H.S. = =1
6
∴ L.H.S. = R.H.S.
∴ P(1) is true.
k (k  1)( 2k  1)
Assume that P(k) is true for some positive integer k, i.e. 12 + 22 + 32 + … + k2 = .
6
When n = k + 1,
L.H.S. = 12 + 22 + 32 + … + k2 + (k + 1)2
k (k  1)( 2k  1)
= + (k + 1)2
6
k (k  1)(2k  1)  6(k  1) 2
=
6
(k  1)[k (2k  1)  6(k  1)]
=
6
(k  1)(2k  7k  6)
2
=
6
(k  1)(k  2)( 2k  3)
=
6
(k  1)[(k  1)  1][2(k  1)  1]
R.H.S. =
6
(k  1)(k  2)( 2k  3)
=
6
∴ L.H.S. = R.H.S.
∴ P(k + 1) is also true.
By the principle of mathematical induction,
P(n) is true for all positive integers n.

x2
(b) (i) From x2 = my, we have y = .
m
From y2 = mx, we have y =  mx .
x2
Since m > 0, the required region is bounded by y = and y =
m
 x2
 y   (1)
 m
 y 2  mx . (2)

 2
 x2 
  = mx
m
 
x4
= mx
m2
x4 = m3x
x4  m3x = 0
x(x3  m3) = 0
x(x  m)(x + mx + m2) = 0
2

 m   3m 2 y
x = 0 or m or (rejected)
2
∴ The x-coordinates of the points of intersection are 0 and m. y2 = mx

m
 3

m x 2
 2 m x 2 x3  m2 m2
Rm = 
0



mx   dx = 
m 3

3m 
=
3
 0 =
3 x2 = my
  x
0 0 m
12 22 32 m2
(ii) R1 + R2 + R3 + … + Rm = + + +…+
3 3 3 3
1 2 1  m ( m  1)( 2 m  1)  m(m  1)( 2m  1)
= (1  2 2  32    m 2 ) =   =
3 3 6  18
m(m  1)( 2m  1) m(m)(2m) 2m3 m3
R1 + R2 + R3 + … + Rm = > = =
18 18 18 9
3
m
∴ R1  R2  R3    Rm 
9

(iii) R1 + R2 + R3 + … + R50
50(50  1)[2(50)  1] 42 925
= =
18 3
R2 + R4 + R6 + … + R50
22 42 62 502
= + + +…+
3 3 3 3
1 2
2 2
32
252 
= 22       
3 3 3 3 
 25(25  1)[2(25)  1]  22 100
= 22  =
 18  3
∴ R1 + R3 + R5 + … + R49
= (R1 + R2 + R3 + … + R50)  (R2 + R4 + R6 + … + R50)
42 925 22 100 20 825
=  =
3 3 3