Prove that 
for all n ϵ N
Step1:
Thus, P(1)is true.
Step2:
Now, we need to show that P(m+1) is true whenever P(m) is true.
Thus, P(m+1) is true.
So, by the principle of mathematical induction, P(n) is true for all nϵN.
36
Prove that for all n ϵ N
Step1:
Thus, P(1)is true.
Step2:
Now, we need to show that P(m+1) is true whenever P(m) is true.
Thus, P(m+1) is true.
So, by the principle of mathematical induction, P(n) is true for all nϵN.