Scribd
Upload
49 views

Theorem 3.6: (Binomial Theorem For A Positive Integral Index) Statement: For Any Natural Number N

The document proves by mathematical induction that the binomial theorem for positive integral indices holds true. Specifically, it shows that for any natural number n, the expansion of (x + a)n consists of (n + 1) terms of the form nCrxn-rar, where r ranges from 0 to n. The base case of n = 1 is verified. Assuming the statement holds true for some integer k, it is shown that the statement also holds true for k + 1, thereby completing the induction proof.

Uploaded by

s_amalorpavaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Theorem 3.6: (Binomial Theorem For A Positive Integral Index) Statement: For Any Natural Number N

The document proves by mathematical induction that the binomial theorem for positive integral indices holds true. Specifically, it shows that for any natural number n, the expansion of (x + a)n consists of (n + 1) terms of the form nCrxn-rar, where r ranges from 0 to n. The base case of n = 1 is verified. Assuming the statement holds true for some integer k, it is shown that the statement also holds true for k + 1, thereby completing the induction proof.

Uploaded by

s_amalorpavaraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

n n 0 n −1 1 1 n −1 0 n

(x + a) = nC0 x a + nC1x a + … + nCn− 1 x a + nCn x a


In fact, this conjecture is proved to be true and we establish it by using
the principle of mathematical induction.
Theorem 3.6: (Binomial theorem for a Positive Integral Index)
Statement: For any natural number n
n −1 1
a +… + nCr xn − r ar + …
n n 0
(x + a) = nC0 x a + nC1x
1 n −1 0 n
+ nCn− 1 x a + nCn x a
Proof:
We shall prove the theorem by the principle of mathematical induction.
Let P(n) denote the statement :
n −1 1
a +… + nCr xn − r ar + …
n n 0
(x + a) = nC0 x a + nC1x
1 n −1 0 n
+ nCn− 1 x a + nCn x a
Step (1) :
Put n = 1
1 1 0 1 −1 1
Then P(1) is the statement : (x + a) = 1C0x a + 1C1 x a
x+a = x+a
∴ P(1) is true
Step (2):
Now assume that the statement be true for n = k
(i.e.) assume P(k) be true.
k k 0 k −1 1 k −2 2 k −r r 0 k
(x + a) =kC0x a +kC1x a + kC2 x a +…+ kCr x a +…+ kCk x a
be true … (1)
Step (3):
Now to prove P(k + 1) is true
(i.e.) To prove:
K+1 k+1 (k + 1) − 1 1 (k + 1) −2 2
(x + a) = (k + 1)C0x + (k + 1)C1x a +(k + 1)C2x a +…
(k + 1) − r r k+1
+ (k + 1)Crx a + … + (k + 1)C(k + 1) a
k+1 k
Consider (x + a) = (x + a) (x + a)
k k −1 1 k −2 2 k − (r − 1) (r − 1)
= [kC0x + kC1x a + kC2 x a + … + kC(r−1) x a
k− r r k
+ kCr x a + … + kCka ] (x + a)

106
k+1 k 1 k −1 2 k−r+2 r−1
= [kC0x + kC1x a + kC2x a + … + kCr−1 x a
k−r+1 r k
+ kCrx a + … + kCkxa ]
k k− 1 2 k−2 3 k −r+ 1 r
+ [kC0x a + kC1x a + kC2 x a + …+ kCr−1 x a
k −r r+1 k+1
+ kCr x a + … + kCka ]
k+1 k+1 k k −1 2
(x + a) = kC0x + (kC1 + kC0) x .a + (kC2 + kC1) x a
k−r+1 r k+ 1
+ … + (kCr + kCr − 1) x a + … + kCk a … (2)
We know that kCr + kCr− 1 = (k + 1)Cr
Put r = 1, 2, 3, … etc.
kC1 + kC0 = (k + 1)C1
kC2 + kC1 = (k + 1)C2
kCr + kCr−1 = (k + 1)Cr for 1 ≤ r ≤ k
kC0 = 1 = (k + 1)C0
kCk = 1 = (k + 1)C(k + 1)
∴ (2) becomes
k+1 k+1 k k −1 2
(x + a) = (k + 1)C0 x + (k + 1)C1 x a + (k + 1)C2 x a
k+ 1−r r
+ … + (k + 1)Cr x a + … + (k + 1)C(k + 1) ak + 1
∴ P(k + 1) is true
Thus if P(k) is true, P(k + 1) is true.
∴ By the principle of mathematical induction P(n) is true for all n∈N
n −1 1
a +… + nCr xn − r ar + …
n n 0
(x + a) = nC0 x a + nC1x
1 n −1 0 n
+ nCn− 1 x a + nCn x a for all n∈N
Some observations:
1. In the expansion
n −1 1
a +… + nCr xn − r ar + …
n n 0
(x + a) = nC0 x a + nC1x
1 n −1
+ nCn x a , the general term is nCr xn − r ar.
0 n
+ nCn− 1 x a
Since this is nothing but the (r + 1)th term, it is denoted by Tr + 1
i.e. Tr + 1 = nCr xn − r ar.
2. The (n + 1) term is Tn + 1 = nCn xn − n an = nCn an, the last term.
th

Thus there are (n + 1) terms in the expansion of (x + a)n

107

You might also like