Summary
The Principle of Mathematical Induction (PMI) proves a statement P(n) for every natural number n. It has two parts. Both are needed: the base case starts the chain and the inductive step keeps it going.
What MHT-CET asks. Most questions do not ask for the full proof. They ask for the value of P(1), the expression after adding the next term, the blank in a divisibility step, or the first n for which an inequality starts to hold. Know the working of each type.
Key formulas
- Sum of first n natural numbers
- n(n + 1)/2
- Sum of squares
- n(n + 1)(2n + 1)/6
- Sum of cubes
- [n(n + 1)/2]²
- Sum of first n odd numbers
- 1 + 3 + … + (2n − 1) = n²
- Telescoping sum
- Σ 1/(r(r + 1)) = n/(n + 1)
- Factorial relation
- (k + 2)! = (k + 2)(k + 1)!
- Divisibility step
- aᵏ⁺¹ − bᵏ⁺¹ = a(aᵏ − bᵏ) + bᵏ(a − b)
What this note covers
- Proofs using mathematical induction
The full note has 6 solved questions, 6 practice questions, figures and a topic test. Reading it on PrepKi is free after you log in.
PDF download is included in PrepKi plans. See plans.