All I know are the steps in the first principle of MI.

1. Show that a given equation is true for n=1.

2. Assume that it is true for n= k.

3. Then, show that it is true for n = k+1.

After showing that the given equation is true n= k+1, you can now conclude that the equation is true for all n > or = to 1