Let the given statement be P(n), i.e.,
P (n) :
1⋅2⋅31+2⋅3⋅41+3⋅4⋅51 + ... +
(n+1)(n+2)1 =
4(n+1)(n+2)n(n+3) First we prove that statement is true for n = 1.
P (1) :
1⋅2⋅31 =
4(1+1)(1+2)1⋅(1+3) ⇒
61 =
4⋅2⋅34 =
61 which is true
Assume P(k) is true for some positive integer k, i.e.,
1⋅2⋅31+2⋅3⋅41+3⋅4⋅51 + ... +
(k+1)(k+2)1 =
4(k+1)(k+2)k(k+3) ... (i)
We shall now prove that P(k + 1) is also true.
For this we have to prove that
1⋅2⋅31+2⋅3⋅41+3⋅4⋅51 + ... +
(k+1)(k+2)1 +
(k+1)(k+2)(k+3)1 =
4(k+2)(k+3)(k+1)(9k+4) L.H.S. =
1⋅2⋅31+2⋅3⋅41+3⋅4⋅51 + ... +
(k+1)(k+2)1 +
(k+1)(k+2)(k+3)1 =
4(k+1)(k+2)k(k+3) +
(k+1)(k+2)(k+3)1 [From (i)]
=
(k+1)(k+2)1 [4k(k+3)+k+31] =
(k+1)(k+2)1 [4(k+3)k(k+3)2+4] =
4(k+1)(k+2)(k+3)k(k2+6k+9)+4 =
4(k+1)(k+2)(k+3)k3+6k2+9k+4 =
4(k+1)(k+2)(k+3)(k+1)(k2+5k+4) =
4(k+1)(k+2)(k+3)(k+1)(k+1)(k+4) =
4(k+2)(k+3)(k+1)(k+2) Thus, P(k + 1) is true, whenever P(k) is true.
Hence, by the principal of mathematical induction P(n) is true.