Question
Question: Explain binomial series ....
Explain binomial series .
Solution
Hint : We have to state what binomial series is . We also have to give the expression for the expansion of sum or difference of two terms using the binomial theorem . I also use the concept of permutation and combination for expanding the binomial theorem . We also state the concept of Pascal’s Triangle .
Complete step-by-step answer :
Definition of binomial series :
Binomial series is the method of expanding the terms of sum or difference of two variables of an expansion which are raised to any finite power ( n ), where n belongs to natural number . The expansion is used in various sections such as trigonometric formulas , algebra , probability etc .
The expansion of sum of two variables is given by the formula :
(x+y)n=nC0xn+nC1x(n−1)×y+nC2x(n−2)×y2+...............+nCnyn
The expansion of difference of two variables is given by the formula :
(x−y)n=nC0xn+(−1)×nC1x(n−1)×y+nC2x(n−2)×y2+.............+(−1)n×nCnyn
The expansion for various value of n :
(A+B)0=1
(A+B)1=A+B
(A+B)2=A2+2AB+B2
(A+B)3=A3+3×A2×B+3×A×B2+B3
(A+B)4=4C0A4+4C1A3×B+4C2A2×B2+4C3A×B3+4C4B4
( using the values of combinations )
(A+B)4=A4+4×A3×B+6A2×B2+4A×B3+B4
From the above expression we can conclude that the total number of terms in the expression are 1 more than the power of the expression .
The sum of powers of variables of the expansion should be equal to the power of the original term .
Some other expressions for the expansion :
(x+y)n+(x+y)n=2×[nC0xn+nC2x(n−1)y2+nC4x(n−4)y4+.............] ———(1)
(x+y)n−(x−y)n=2×[nC1x(n−1)y+nC3x(n−3)y3+nC5x(n−5)y5+.............] ———(2)
(1+x)n=[nC0+nC1x+nC2x2+ .......+nCnxn]
(1+x)n+(1−x)n=2×[nC0+nC2x2+nC4x4+..........]
(1+x)n−(1−x)n=2×[nC1x+nC3x3+nC5x5+.................]
The number of terms in the expansion(1)are 2( n + 2 ) if is even or2( n + 1 ) if is odd .
The number of terms in the expansion (2)are 2nif is even or2( n + 1 ) if is odd .
Note : Corresponding to each combination of nCrwe have r!permutations, because r objects in every combination can be rearranged in r!ways . Hence , the total number of permutations of n different things taken r at a time isnCr × r!. Thus nPr = nCr × r! , 0< r ⩽n
Also , some formulas used :
nC1 = n
nC2=2 n(n−1)
nC0 = 1
nCn= 1