Let the given statement be P(n), i.e.,
P(n):(1+31)(1+54)(1+79)......(1+(2n+1)n2)=(n+1)2
For n=1, we have
P(1):(1+31)=4=(1+1)2=22=4, which is true.
Let P(k) be true for some k∈N, i.e
(1+31)(1+54)(1+79)......(1+(2k+1)k2)=(k+1)2..............(1)
We shall now prove that P(k+1) is true.
Consider
(1+31)(1+54)(1+79)......(1+(2k+1)k2)(1+{2(k+1)+1}(k+1)2)
=(k+1)2[1+{2(k+1)+1}(k+1)2] [Using (i)]
=(k+1)2[(k+1)2+2(k+1)+1(k+1)2]
=(k+1)2+2(k+1)+1
={(k+1)+1}2
Thus, P(k+1) is true whenever P(k) is true.
Hence by the principle of mathematical induction, statement P(n) is true for all natural numbers i.e., n.