Question 14. By using Principle of Mathematical Induction prove that for all nN
Since we need to prove it by mathematical induction method, first we will prove that result (1) is true for n =1.
then we will assume that it is true for n = k and we will try to prove that it is true for n = (k+1)
step I: put n =1 in eq(1)
thus it is true for n =1
step II: let us assume that it is true for n = k
therefore ..........(2)
step III: we will calculate the sum for n = (k+1)
thus result holds for n = k+1 also.
therefore it holds for all values of n
hope this helps you.
cheers!!