Prove that for all n > 2, n ϵ N.

Let the given statement be P(n)





Thus, P(2) is true.


Let, P(m) be true,


Now,



Now, we need to prove that P(m+1) is true whenever P(m) is true.







Thus, Pm+1 is true. By the principle of mathematical induction, P(n) is true for all nN, n2.


37