LESSON 1.

1: Mathematical Induction and Binomial Theorem

Mathematical Induction

Theorem (First Principle of Finite Induction)

Let S be a set of positive integers with the following properties:
a. The integer 1 belong to S.
b. Whenever the integer k is in S, the next integer k + 1 must also
be in S.
Then S is the set of all positive integers.
Mathematical Induction

Theorem (Second Principle of Finite Induction)

Let S be a set of positive integers with the following properties:
a. The integer 1 belong to S.
b. If k is a positive integer such that 1, 2, . . . , k belong to S, then
k + 1 must also be in S.
Then S is the set of all positive integers.
Mathematical Induction

Example: Prove the following formulas by mathematical induction.

n(2n + 1)(n + 1)
1. 1 + 2 + 3 + · · · + n =
2 2 2 2
6
2. 20 + 21 + 22 + 23 + · · · + 2n≠1 = 2n ≠ 1
3. 1, 3, 4, 7, 11, 18, 29, 47, 76, . . . (Lucas sequence)
a1 = 1, a2 = 3, an = an≠1 + an≠2 for all n Ø 3.
Prove that an < ( 74 )n .
Binomial Theorem
A B
n
Binomial coefficients
k

For any positive integer n and any integer k satisfying 0 Æ k Æ n,

A B
n n!
=
k k!(n ≠ k)!

Alternatively, it can be written as

A B
n n(n ≠ 1) · · · (k + 1) n(n ≠ 1) · · · (n ≠ k + 1)
= =
k (n ≠ k)! k!
Binomial Theorem
Pascal’s Rule: For 1 Æ k Æ n,
A B A B A B
n n n+1
+ =
k k ≠1 k

Pascal’s Triangle
Binomial Theorem

A B A B A B A B
n n n n n≠1 n n≠1 n n
(a + b) = a + a b + ··· + ab + b
0 1 n≠1 n

Equivalently, A B
n
n
ÿ n n≠k k
(a + b) = a b
k=0
k