State strong Mathematical Induction (or second principle of M.I).

According to strong mathematical induction, P(n) is a statement(or a proposition) that may be true or false for all the positive integers which can be proved by stating p(n) is true for all n1 with the help of following steps:

1.       Show that P(1), P(2), ….., P(q) is true for q1. (basis step)

2.       Assume P(i) is true for all integer i such that, 1 i k and kq. (strong inductive hypothesis)

3.       Show that P(k+1) is true on the basis of strong inductive hypothesis. (inductive steps)