2.

MATHEMATICAL INDUCTION

Synopsis:
1. Induction theorem : If A is a subset of N such that
i) 1A and ii) kA k + 1A, then A = N.

2. Principle of finite Mathematical Induction : Let S(n) be a statement for each nN. If i) S(1) is
true ii) S(k) is true S(k + 1) is true, then S(n) is true for all nN.

3. Principle of complete Mathematical Induction : Let S(n) be a statement for each nN. If i) S(1)
is true ii) S(1), S(2) S(k) are true S(k + 1) is true then S(n) is true for all nN.

4. Division algorithm : If 0 a, bZ then q, r Z uniquely b = aq + r where 0 r<|a|.

n(n + 1)
5. The sum of first n natural numbers = n = 2
.

n(n + 1)(2n + 1)
6. The sum of squares of first n natural numbers = n 2
=
6
.

n 2 (n + 1) 2
7. The sum of cubes of first n natural numbers = n 3
=
4
=( n) 2
.

8. i) The sum of first n even positive integers = 2n = n(n + 1).

ii) The sum of first n odd positive integers = (2n 1) = n2
n(n + 1)(n + 2)
iii) n(n + 1) = 3

(n + 1)(n + 2)(n + 3)
iv) n(n + 1)(n + 2) = 4

n
9. a + (a + d) + (a + 2d) + + (a + (n1)d) = [2a + (n 1)d]
2

a(r n 1)
10. a + ar + ar2 + . + arn1 =
r 1

11. For all + ve integral values of n, xn yn is divisible by x y.

12. n is any odd integer then n(n2 1) is divisible by 24.

13. The sum of the cubes of three successive natural numbers is divisible by 9.
14. The product of r consecutive integers are divisible by r!