Q19 Using mathematical induction prove that for all positive integers n.
Given equation is
We need to show that for all positive integers n
Now,
For ( n = 1)
Hence, true for n = 1
For (n = k)
Hence, true for n = k
For ( n = k+1)
Hence, (n = k+1) is true whenever (n = k) is true
Therefore, by the principle of mathematical induction we can say that is true for all positive integers n