1. Principle of mathematical induction.
(i). First of all verify that P(1) is true.
(ii). Then assume that P(m) is true.
(iii). Prove that P(m + 1) is also true.
∴ Show that P(m) is true ⇒ P(m + 1) is true.
2. Given expression is divisible by an integer.
(i). First of all show that F(1) is divisible by x.
(ii). Then assuming f(m) to be divisible by x show that F(m+1) is also divisible by x.
For this divide F(m + 1) by F(m) and then Show that the remainder thus go it is divisible by x.
| Click here to pdf download |