Binomial Expansions
Binomial Expansions
This relation is the so-called binomial expansion. It certainly is an improvement over multiplying out (a+b)(a+b)...(a+b) by hand! The series in eq. (1) can be used for any value of n, integer or not, but when n is an integer the series terminates or ends after n+1 terms. For example 5.4 5.4.3 / 2 3 5.4 /.3 /.2 / 1 4 5.4.3.2.1 5 (a+b) 5 = a5 + 5a 4b1 + 1.2 a3b2 + 3 a b + a b + /.2.1 4 /.3 /.2 /.1 5.4.3.2.1 a and the next term would vanish by extension. = a5 + 5a4b + 10a3b2 + 10a2b3 + 5ab4 + b 5 Note that the coefficients of that occur in the binomial expansion formula (n+1)st row of Pascals triangle. 1 1 1 1 1 ----> 1 1 6 5 15 4 10 20 3 6 10 15 2 3 4 5 6 1 1 1 1 1 <---- n = 5 1 whose entries are obtained by adding the two above each one.
An even neater form of eq.(1) occurs when a = 1. Changing b to x: (l + x)n = 1 + nx + n(n-1) 2 n(n-l)(n-2) 3 x + x +... 2! 3! (2)
We will find it very helpful to use this expansion under circumstances when x is small compared to one. An expansion like that of eq.(2) occurs, for example, based on eq.(1) if a is much greater than b. You can see this as
*
Adapted from notes written by Charles Holbrow and J. N. Lloyd, in use at Colgate University
follows. Let x b/a with a >> b so that x <<1. Then the right hand side of eq.(1) can be rearranged: b n (a+b) n = an (1 + a ) = an (1 + x) n When x is small, each successive term in the series, eq. (2), gets increasingly smaller by roughly a factor of x. Thus for moderate sizes of n: nx <<1; n(n-1) 2 x << nx; 2! and so on....
At any point, if we just quit adding terms, the ones we have left out would have added hardly anything to the sum, so we don't make much of an error. Thus we can often make a good approximation by leaving out all but the first two or three terms. Example 1 Let n = 2 and x = .0200 Exact: (1 + .02)2 = l.0404 Two term approx.: Error: only 0.04% Now comes something very interesting. Those people skilled at this sort of thing can tell us that the expression (2) is correct even when n is not a positive integer provided x < 1. The real power of the method now becomes evident. Example 2 Let n = -1 and x = 0.020 (1 + 0.02) -1 = 1/1.02 Plugging n = -1 into (2) gives 1 + (-1) x + (-1)(-2) 2 x 2 + ... l + 2* .0200 = l.0400
While the method now leads to an infinite series, we are assured by 1 mathematicians that the series does accurately reproduce the function 1+x if (and only if) |x| <1.
82
Again ignoring higher terms, we get: (1.02) -1 = 1 + (-1)0.20 = 0.980 Accurate value: 0.98039, or again only a .04% error Example 3 One final example occurs frequently in physics 1 1x
1 x = (1 x) -1/2 1 + (- 2 )( x) = 1 + 2 ( 3)
Problem 1 Choose the + sign case and try the exact calculation for three assumed values of x and compare with the approximation. (See the figure on the following page for further interesting comparisons.) Problem 2 This technique allows you to outwit your calculator in some extreme situations. Try: 11 1 - 1.5x10-12
=?
The technique is also valuable for seeing how algebraic expressions behave without having to use specific values of x. Consider the form in Example 3. The dependence of the reciprocal square root on the quantity x would be very hard to visualize. But, as shown in the figure below for the function linear and to have slope -2 .
1 1 1+x
1.0
0.9
1- 1 x+ 2
x 8
1 1 + x
0.8
0.7
1 - 1 x 2
0.6
1 + x