Step1: For n=1
So, it is true for P(1)
For n=k, let P(k) be true.
Now, we need to show P(k+1) is true whenever P(k) is true.
Thus, P(k+1) is true. So, by the principle of mathematical induction
P(n) is true for all n.
Rate this question :
Prove that cos αRD Sharma - Mathematics
Prove that sin xRD Sharma - Mathematics
Prove that <spanRD Sharma - Mathematics