Suppose Math, session 2024

(Preparation for Lecturer Test)

Course: Quick Review

Chapter # 08 Mathematical Induction and Binomial Theorem

These notes are the summary of the whole chapter which can be helpful
to prepare the objective as well as subjective part of paper.

1. Mathematical induction was devised by Francesco Mourolico.

2. The statement
S(n) = n2 − n + 41 is a prime number, ∀n ∈ N
is false for n = 41. This example was discovered by Euler.
3. Principal of Mathematical Induction
If a statement S(n) for each positive integer n is such that:
(i) S(1) is true:
(ii) S(k + 1) is true whenever S(k) is true for every positive integer k,
then S(n) is true for all positive integers.
4. Principal of Extended Mathematical Induction
Let i be an integer. If for n ≥ i, S(n) is such that:
(i) S(i) is true:
(ii) S(k + 1) is true whenever S(k) is true for any integer n ≥ i,
then S(n) is true for all integers n ≥ i.
5. According to binomial theorem, for a positive integer n, we have
n  
n
X n n−r r
(a + x) = a x .
r
r=0
n n n n





6. 0 , 1 , 2 , ..., n are called the binomial coefficients.
7. In the expansion of (a + x)n , the number of terms is n + 1.
8. The general term of the expansion (a + x)n is Tr+1 = nr an−r xr .

9. If n is even, then ( n+2

2 )th term will be the only one middle term in the expansion.

10. If n is odd, then ( n+1 n+3

2 )th and ( 2 )th terms will be two middle terms in the expansion.

11. The sum of the binomial coefficients in the binomial expansion equals to 2n , i.e.,
       
n n n n
+ + ... + + = 2n
0 1 n−1 n

The best preparation for tomorrow is doing your best today. H. Jackson Brown

Best Of Luck

Notes by: Akhtar Abbas (M.Phil QAU), Lecturer at University of Jhang. 0332-6297570