Step1: For n=2

So, it is true for n=2

Step2: For n=k

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

As, LHS = RHS

Thus, P(k+1) is true. So, by the principle of mathematical induction

P(n) is true for all n.