Step1: For n=2, P(n):

Therefore, it is true for n=2.

Step2: Let P(n) be true for n=k.

Now, we need to show P(k+1) is true whenever P(k) is true.

P(k+1):

So, it is true for n=k+1, thus by the principle of mathematical induction P(n) is true for all n ≥ 2