MIT OpenCourseWare http://ocw.mit.edu 18.01 Single Variable Calculus Fall 2006 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.� � Lecture 36 18.01 Fall 2006 Lecture 36: Infinite Series and Convergence Tests Infinite Series Geometric Series A geometric series looks like 1 + a + a 2 + a 3 + ... = S There’s a trick to evaluate this: multiply both sides by a: a + a 2 + a 3 + ... = aS Subtracting, (1 + a + a 2 + a 3 + ) − (a + a 2 + a 3 + ) = S − aS··· ··· In other words, 11 = S − aS = ⇒ 1 = (1 − a)S = ⇒ S =1 − a This only works when |a| < 1, i.e. −1 < a < 1. a = 1 can’t work: 1 + 1 + 1 + ... = ∞ a = −1 can’t work, either: 1 11 − 1 + 1 − 1 + ... =�1 − (−1) = 2 Notation Here is some notation that’s useful for dealing with series or sums. An infinite sum is written: ∞ak = a0 + a1 + a2 + ... k=0 The finite sum nSn = ak = a0 + ... + an k=0 is called the “nth partial sum” of the infinite series. 1� � � � � � Lecture 36 18.01 Fall 2006 Definition ∞ak = s k=0 means the same thing as nlim Sn = s, where Sn = ak n→∞ k=0 We say the series converges to s, if the limit exists and is finite. The importance of convergence is illustrated here by the example of the geometric series. If a = 1, S = 1 + 1 + 1 + ... = ∞. But S − aS = 1 or ∞ − ∞ = 1 does not make sense and is not usable! Another type of series: ∞1 np n=1 We can use integrals to decide if this type of series converges. First, turn the sum into an integral: ∞1 � ∞ dx np ∼ xp n=1 1 If that improper integral evaluates to a finite number, the series converges. Note: This approach only tells us whether or not a series converges. It does not tell us what number the series converges to. That is a much harder problem. For example, it takes a lot of work to determine � π2∞1 = n2 6 n=1 Mathematicians have only recently been able to determine that ∞1 n3 n=1 converges to an irrational number! Harmonic Series ∞1 � ∞ dx n ∼ 1 x n=1 We can evaluate the improper integral via Riemann sums. We’ll use the upper Riemann sum (see Figure 1) to get an upper bound on the value of the integral. 2� Lecture 36 18.01 Fall 2006 1 2 31½ ⅓1½ y=⁄xFigure 1: Upp er Riemann Sum. � N dx 1 1 1 x ≤ 1 + 2 + ... + N − 1= sN −1 ≤ sN We know that � N dx = ln N 1 x As N → ∞, ln N → ∞, so sN → ∞ as well. In other words, ∞1 n n=1 diverges. Actually, sN approaches ∞ rather slowly. Let’s take the lower Riemann sum (see Figure 2). 1 2 3y=⁄x4½⅓¼Therefore, Figure 2: Lower Riemann Sum. sN = 1 + 1 2 + ... + 1 N = 1 + N� n=2 1 n ≤ 1 + � N 1 ln N < sN < 1 + ln N dx x = 1 + ln N 3����� ������ �� � � � Lecture 36 18.01 Fall 2006 Integral Comparison 1Consider a positive, decreasing function f(x) > 0. (For example, f (x) = )xp ∞ f(x)dx ∞� =1nf(n) − < f(1) 1 So, either both of the terms converge, or they both diverge. This is what we mean when we say ∞np ∼ 1 xp � =1n1 ∞ dx ∞Lots of fudge room: in comparison. � =1nTherefore, 1 diverges for p ≤ 1 and converges for p > 1. np ∞n=1 1 √n2 + 10 diverges, because 1 1 1 √n2 + 10 ∼ (n2)1/2 = n Limit comparison: If f(x) ∼ g(x) as x → ∞, then f(n) and g(n) either both converge or both diverge. What, exactly, does f(x) ∼ g(x) mean? It means that f(x)lim = c x→∞ g(x) where 0 < c < ∞. Let’s check: does the following series converge? ∞√n5 − 10 n=1 n n 1 = n5/2 n3/2√n5 − 10 ∼ = n−3/2 3Since > 1, this series does converge. 2 n 4Lecture 36 18.01 Fall 2006 Playing with blocks At this point in the lecture, the professor brings out several long, identical building blocks. Do you think it’s possible to stack the blocks like this? Top block is farther outthan the bottom block.Figure 3: Collective center of mass of upp er blocks is always over the base block. In order for this to work, you want the collective center of mass of the upper blocks always to be over the base block. The professor successfully builds the stack. Is it possible to extend this stack clear across the room? The best strategy is to build from the top block down. Let C0 be the left end of the first (top) block. Let C1 = the center of mass of the first block (top block). Put the second block as far to the right as possible, namely, so that it’s left end is at C1 (Figure 4). Let C2 = the center of mass of the top two blocks. Strategy: put the left end of the next block underneath the center of mass of all the previous ones combined. (See Figure 5). 5Lecture 36 18.01 Fall 2006 C0C1C2211/2Figure 4: Stack of 2 Blocks. C0C1C2211/2C31/3123Figure 5: Stack of 3 Blocks. Left end of block 3 is C2 = center of mass of blocks 1 and 2. C0 = 0 C1 = 1 1 C2 = 1 + 2 nCn + 1(Cn + 1) (n + 1)Cn + 1 1 Cn+1 = = = Cn + n + 1 n + 1 n + 1 1 1 C3 = 1 + +2 3 1 1 1 C4 = 1 + + +2 3 4 1 1 1 1 C5 = 1 + + + + > 2 2 3 4 5 6Lecture 36 18.01 Fall 2006 }nn+1 blockcenter of mass of the first n blocksFigure 6: Stack of n + 1 Blocks. So yes, you can extend this stack as far (horizontally) as you want — provided that you have enough blocks. Another way of looking at this problem is to say N� 1 = SN n n=1 Recall the Riemann Sum estimation from the beginning of this lecture: ln N < SN < (ln N) + 1 as N → ∞, SN → ∞. How high would this stack of blocks be if we extended it across the two lab tables here at the front of the lecture hall? The blocks are 30 cm by 3 cm (see Figure 7). One lab table is 6.5 blocks, or 13 units, long. …
View Full Document
Unlocking...