Section 4.1 Sequences and Series of Complex Numbers 73
Solutions to Exercises 4.1 1. We have in π e 2 1 0 ≤|an| = = → 0asn →∞. n n
So an → 0 by the squeeze theorem or by applying (2), Sec. 4.1. 5. We have cosh in = cos n (see (25), Sec. 1.6). Hence
cosh in cos n 1 |an| = = ≤ → 0asn →∞. n2 n2 n2
So an → 0 by the squeeze theorem.
9. (a) Suppose that {an} is a convergent sequence and let bn = an+1. We want to show that {bn} is a convergent sequence and that limn→∞ an = limn→∞ bn. Let L denote the limit of the sequence {an}. By definition of convergence, given >0, we can find N ≥ 0, such that for all n ≥ N,
|an − L| <.
But n ≥ N implies that n +1≥ N. So for all n ≥ N,
|an+1 − L| <.
But an+1 = bn, so for all n ≥ N, |bn − L| <, which implies that {bn} is a convergent sequence with same limit as {an}. (b) Define a = i and a = 3 . Given that {a } is convergent, then by part (a), we have 1 n+1 2+an n limn→∞ an = limn→∞ an+1. Let L = limn→∞ an. Then
3 3 L = lim an = lim an+1 = lim = . n→∞ n→∞ n→∞ 2+an 2+L Solving for L,wefind
3 L = ⇒ L(2 + L)=3; 2+L ⇒ L2 +2L − 3=0, (L + 3)(L − 1)=0,L= −3orL =1.
Because the limit of a convergent sequence is unique, we have to decide whether L =1orL = −3. Note that |a1| = 1. If we can show that Re an ≥ 0, then Re L = limn→∞ Re an ≥ 0, and this would eliminate the value L = −3. Let’s prove by induction that Re an ≥ 0. The statement is clearly true if n = 1, because a1 = i and so Re i =0≥ 0. Now suppose that Re an ≥ 0 and let’s prove that Re an+1 ≥ 0. For this purpose, we compute
3 2+an ! Re an+1 =Re =3Re 2+an (2 + an) · (2 + an)
3 2 = · Re (2 + Re an − i Im an)=3α (2 + 2 Re an) ≥ 0, (2 + an) · (2 + an)
2 1 1 where α = = 2 . This completes the proof by induction and shows that L =6 −3, (2+an )·2+an |2+an | so L =1. 74 Chapter 4 Power Series and Laurent Series
∞ 3 − i 13. The series X is a constant multiple of a convergent geometric series and so it is (1 + i)n n=3 convergent. To find its sum proceed as follows:
∞ 3 − i 1 1 X =(3− i) + + ··· (1 + i)n (1 + i)3 (1 + i)4 n=3 1 1 1 =(3− i) 1+ + + ··· (1 + i)3 1+i (1 + i)2 ∞ 3 − i 1 3 − i 1 = X = · , (1 + i)3 (1 + i)n (1 + i)3 1 − r n=0
where r = 1 , |r| = √1 < 1. So the sum is 1+i 2 3 − i 1 3 − i −1 − 3i 3 i S = · = = = − + . (1 + i)3 − 1 (1 + i)2 i (1 + i)2 2 2 1 1+i
∞ 1 1 17. The series X is absolutely convergent by comparison to the series 2 P 2 : (n + i)((n − 1) + i) n n=2 1 |(n + i)((n − 1) + i)| = (n + i) (n − 1) + i ≥ n(n − 1) ≥ n2 if n ≥ 2; 2 so 1 2 ≤ . (n + i)((n − 1) + i) n2
To sum the series, use partial fractions and the terms will telescope, as follows: 1 1 1 = − . (n + i)((n − 1) + i) (n − 1) + i) n + i
So the Nth partial sum is
N 1 1 s = X + N (n − 1) + i) n + i n=2 1 1 1 1 1 1 = − + − + ···+ − (2 − 1) + i) 2+i (3 − 1) + i) 3+i (N − 1) + i) N + i 1 1 1 = − → − 0, 2+i N + i 1+i →∞ 1 1−i as N . So the sum is S = 1+i = 2 . ∞ 1+3i n √ 21. The series X is a geometric series with z = 1+3i . Since |z| = 1 10 < 1, the series 4 4 4 n=0 converges to 1 1 4 4 1 2 = = = = (1 + i). 1 − z − 1+3i 3 − 3i 3 1 − i 3 1 4 25. Write (1+2in)n 1 n = +2i . nn n Section 4.1 Sequences and Series of Complex Numbers 75
1 | |≥| | It is now clear that the series is a geometric series with z = n +2i. Since z Im z = 2, it follows that the series diverges. 29. For n ≥ 2, we have
n −n cos(in) cosh n e + e 1 3 3 3 = = = (e−n +n + e−n −n) ≤ e−n /2. en3 en3 2en3 2 ∞ 3 The series is absolutely convergent by comparison with the convergent series X e−n /2. n=1 33. The series converges as long as
z < 1 ⇒|z| < 2. 2 37. The series converges as long as
1 < 1 ⇒ 1 < |2 − 10z| 2 − 10z
1 1 ⇒ 1 < | − z| 10 5 1 ⇒ 10 < | − z|. 5 1 Thus the series converges outside the closed disk of radius 10 and center at 5 . The limit in this region is (use the geometric series minus the first term, which is 1) 1 2 − 10z 1 − 1= − 1= . − 1 − − 1 2−10z 1 10z 1 10z
i 41. If the nth partial sum of the series is sn = n , then the series converges and its limit is i lim sn = lim =0. n→∞ n→∞ n An example of such a series is ∞ i i 1+X − . n +1 n n=1 45. The test of convergence in Theorem 12 is really about series with positive real terms. For a proof, see any calculus book and use the same proof for real series. 49. To establish the addition formula for cosines, we will manipulate the series for cosine, using several properties of absolutely convergent series and Cauchy products. We have
∞ ∞ z2n z2n cos z = X(−1)n 1 ; cos z = X(−1)n 2 ; 1 (2n)! 2 (2n)! n=0 n=0 n z2k z2(n−k) cos z cos z = X(−1)k 1 (−1)n−k 2 1 2 (2k)! (2(n − k))! k=0 (−1)n n (2n)! = X z2kz2(n−k) (2n)! (2k)!(2(n − k))! 1 2 k=0 n n (−1) 2n − = X z2kz2(n k). (2n)! 2k 1 2 k=0 76 Chapter 4 Power Series and Laurent Series
Similarly,
∞ ∞ z2n+1 z2n+1 sin z = X(−1)n 1 ; sin z = X(−1)n 2 ; 1 (2n + 1)! 2 (2n + 1)! n=0 n=0 n z2k+1 z2(n−k)+1) sin z sin z = X(−1)k 1 (−1)n−k 2 1 2 (2k + 1)! (2(n − k) + 1)! k=0 (−1)n n (2(n + 1))! = X z2k+1z2(n+1)−(2k+1) (2(n + 1))! (2k)!(2(n +1)− (2k + 1)))! 1 2 k=0 n n (−1) 2(n +1) − = X z2k+1z2(n+1) (2k+1). (2(n + 1))! 2k +1 1 2 k=0 Hence
∞ n n (−1) 2n − cos z cos z − sin z sin z = X X z2kz2(n k) 1 2 1 2 (2n)! 2k 1 2 n=0 k=0 ∞ n n (−1) 2(n +1) − − X X z2k+1z2(n+1) (2k+1) (2(n + 1))! 2k +1 1 2 n=0 k=0 ∞ n n (−1) 2n − =1+X X z2kz2(n k) (2n)! 2k 1 2 n=1 k=0 ∞ n−1 n−1 (−1) 2n − − X X z2k+1z2n (2k+1), (2n)! 2k +1 1 2 n=1 k=0 where in the first series on the right, we wrote the first term separately, and in the second series on the right, we shifted the index by changing n to n − 1. Combining the two series, we see that the last displayed sum equals
∞ n n n−1 (−1) ( 2n − 2n − ) 1+X X z2kz2(n k) + X z2k+1z2n (2k+1) . (2n)! 2k 1 2 2k +1 1 2 n=1 k=0 k=0 But the two inner sums in k add up to
2n 2n X zkz2n−k =(z + z )n , k 1 2 1 2 k=0 because the first sum adds the even-indexed terms and the second sum adds the odd-indexed terms. Hence ∞ (−1)n cos z cos z − sin z sin z =1+X (z + z )n 1 2 1 2 (2n)! 1 2 n=1 ∞ (−1)n = X (z + z )n = cos(z + z ), (2n)! 1 2 1 2 n=0 as desired. Note: While this was a good exercise in Cauchy products, it is not the most efficient way to prove the addition formula for the cosine. For a more elegant proof, see Example 2(b), Sec. 4.6. Section 4.2 Sequences and Series of Functions 77
Solutions to Exercises 4.2 sin nx 1. The sequence of functions f (x)= converges uniformly on the interval 0 ≤ x ≤ π. To see n n this, let Mn = max |0 − fn(x)| = max |fn(x)|, where the maximum is taken over all x in [0,π]. Then ≤ 1 → →∞ Mn = n . Since Mn 0, as n , it follows that fn converges uniformly to f =0on[0,π]. In fact, we fact uniform convergence on the entire real line.
5. (a) and (b) First, let us determine the pointwise limit of the sequence of functions fn(x)= nx .Forx in the interval 0 ≤ x ≤ 1, we have n2x2 − x +1 nx nx x f (x)= = = → 0, as n →∞. n 2 2 − 2 2 − x 1 2 − x 1 n x x +1 n (x n2 + n2 n(x n2 + n2 Does the sequence converge to 0 uniformly for all x in [0, 1]? To answer this question we estimate the maximum possible difference between 0 and fn(x), as x varies in [0, 1]. For this purpose, we compute Mn = max |fn(x)| for x in [0, 1]. We have
3 2 0 n − n x 0 3 2 1 fn(x)= ; fn(x)=0⇒ n − n x =0⇒ x = ; (1 − x + n2 x2)2 n 1 1 1 1 f ( )= > ⇒ M > . n n − 1 2 n 2 2 n
Since Mn does not converge to 0, we conclude that the sequence does not converge uniformly to 0 on [0, 1]. (c) The sequence does converge uniformly on any interval of the form [a, b], where 0 (b) Let Mn = max |fn(z)| for |z|≤1, To prove that fn converges uniformly, we must show that Mn → 0, as n →∞. We have 1 1 1 z + |z| + 1+ |f (z)| = n ≤ n ≤ n . n z |z| 1 n( 2 +2) − n(2 − 2 ) n n(2 n2 ) n This shows that Mn is smaller than the last displayed expression, which tends to 0 as n →∞. Hence fn does converge to 0 uniformly for all |z|≤1. 13. If |z|≤1, then zn 1 ≤ . n(n +1) n(n +1) 1 Apply the Weierstrass M-test with Mn = n(n+1) . Since P Mn is convergent, it follows that the ∞ zn series X , converges uniformly for all |z|≤1. n(n +1) n=1 17. If |z|≤2, then n n z +2 4 ≤ . 5 5 78 Chapter 4 Power Series and Laurent Series 4 n Apply the Weierstrass M-test with Mn = 5 . Since P Mn is convergent (a geometric series with ∞ z +2 n r<1), it follows that the series X converges uniformly for all |z|≤2. 5 n=0 21. If 2.01 ≤|z − 2|≤2.9, then n (z − 2)n 2.9 ≤ = An, 3n 3 and n 2n 2 ≤ = Bn. (z − 2)n 2.01 Apply the Weierstrass M-test with Mn =(An + Bn). Since P Mn is convergent (two geometric ∞ (z − 2)n 2n series with ratios < 1), it follows that the series X + converges uniformly in 3n (z − 2)n n=0 the annular region 2.01 ≤|z − 2|≤2.9. | − 1 | 1 25. (a) If z 2 < 6 then 1 1 1 1 1 1 2 |z|≤|z − + |≤|z − | + < + = < 1. 2 2 2 2 6 2 3 ∞ n | − 1 | 1 n So the series Pn=0 z converge uniformly on z 2 < 6 by the Weierstrass M-test with Mn = (23) . | − 1 | 1 ∞ n (b) If z 2 < 2 , then z can get very close to the value 1, where the series Pn=0 z does not | − 1 | 1 converge. So the initial guess is that the series is not uniformly convergent in the region z 2 < 2 . To prove this assertion, you can repeat the proof given in Example 4; in particular, the inequalities in (3) and the argument that follows them still hold. 29. (a) Let δ>1 be a positive real number. To show that the series ∞ 1 ζ(z)=X (principal branch of nz) nz n=1 converges uniformly on the half-plane Hδ = {z :Rez ≥ δ>1}, we will apply the Weierstrass M-test. For all z ∈ Hδ, we have z (x+iy)lnn x ln n x δ |n | = e = e = n >n . So 1 1 ≤ = Mn. nz nδ 1 Since P Mn = P nδ is a convergent series (because δ>1), it follows from the Weierstrass M-test ∞ 1 that that Pn=1 nz converges uniformly in Hδ. ∞ 1 { } (b) Each term of the series Pn=1 nz is analytic in H = z :Rez>1 (in fact, each term is entire). To conclude that the series is analytic in H, it is enough by Corollary 2 to show that the series converges uniformly on any closed disk contained in H.IfS is a closed disk contained in H, S is clearly disjoint from the imaginary axis. Let Hδ (δ>0) be a half-plane containing S. By part (a), the series converges uniformly on Hδ, consequently, the series converges uniformly on S.By Corollary 2, the series is analytic in H. (Note the subtilty in the proof. We did not show that the series converges uniformly on H. In fact, the series does not converge uniformly in H.) (c) To compute ζ0(z), according to Corollary 2, we can differentiate the series term-by-term. Write 1 1 = = e−z ln n. nz ez ln n Section 4.2 Sequences and Series of Functions 79 Using properties of the exponential function, we have d 1 d 1 = e−z ln n = − ln ne−z ln n = − ln n . dz nz dz nz So, for all z ∈ H, ∞ ln n ζ0(z)=− X . nz n=1 33. To show that fn {fn} converges uniformly on Ω, it is enough to show that max |fn(z) − fm(z)| z∈Ω can be made arbitrarily small by choosing m and n large. In other words, given >0, we must show that there is a positive integer N such that if m, n ≥ N, then max |fn(z) − fm(z)| <. z∈Ω This will show that the sequence {fn} is uniformly Cauchy, and hence it is uniformly convergent by Exercise 30. Since each fn is analytic inside C and continuous on C, it follows that fn − fm is also analytic inside C and continuous on C. Since C is a simple closed path, the region interior to C is a bounded region. By the maximum principle, Corollary 2, Sec. 3.7, the maximum value of |fn − fm| occurs on C. But on C the sequence {fn} is a Cauchy sequence, so there is a positive integer N such that if m, n ≥ N, then max |fn(z) − fm(z)| <. z∈C Hence max |fn(z) − fm(z)|≤max |fn(z) − fm(z)| <, z∈Ω z∈C which is what we want to prove. The key idea in this exercise is that the maximum value of an analytic function occurs on the boundary. So the uniform convergence of a sequence inside a bounded region can be deduced from the uniform convergence of the sequence on the boundary of the region. 80 Chapter 4 Power Series and Laurent Series Solutions to Exercises 4.3 1. Apply the ratio test: For z =0,6 n+1 an+1 z 2n +1 ρ = lim = lim (−1)n+1 · (−1)n n→∞ a n→∞ 2n +1+1 zn n 2n +1 n(2 + 1 ) = |z| lim = |z| lim n = |z|. n→∞ n→∞ 3 2n +3 n(2 + n ) Thus the series converges absolutely if |z| < 1 and diverges if |z| > 1. The radius of convergence is 1, the disk of convergence is |z| < 1, the circle of convergence is |z| =1. ∞ (4iz − 2)n 5. Apply the ratio test: For z =6 2 , X . 4i 2n n=0 n+1 n an+1 (4iz − 2) 2 ρ = lim = lim · n→∞ a n→∞ 2n+1 (4iz − 2)n n |4iz − 2| = . 2 Thus the series converges absolutely if |4iz − 2| 2 1 2 (−i) 1 < 1 ⇔|4i(z − )| < 2 ⇔|z − (−i)| < ⇔|z − | < . 2 4i 2 4 2 2 | − (−i) | 1 1 The series diverges if z 2 > 2 . The radius of convergence is 2 ; the disk of convergence is | − (−i) | 1 | − (−i) | 1 z 2 < 2 ; and the circle of convergence is z 2 = 2 . 9. We compute the radius of convergence by using the Cauchy-Hadamard formula 1 n in π in π = limsup q (1 − e 4 )n = lim sup 1 − e 4 =2. R To understand why the limsup is equal to 2, recall that the limsup is the limit of the sup of the in π ∞ in π tail of the sequence { 1 − e 4 } ,asN tends to ∞. The terms e 4 take values from the set √ √ n=N 2 2 in π {± ± ± ± } − 4 2 2 , i, 1 . So the largest value of 1 e is 2, and this value repeats infinitely often, 1 which explains the value of the limsup. Thus, R = 2 . 13. Start with the geometric series ∞ 1 = X zn, |z| < 1. 1 − z n=0 Differentiate term-by-term: ∞ 1 = X nzn−1, |z| < 1. (1 − z)2 n=1 Multiply both sides by 2: ∞ 2 = X 2nzn−1, |z| < 1. (1 − z)2 n=1 Section 4.3 Power Series 81 17. We have ∞ ∞ ∞ (3z − i)n (3(z − i ))n i X = X 3 = X(z − )n 3n 3n 3 n=0 n=0 n=0 ∞ i = X wn (w = z − ) 3 n=0 1 1 i = = z − < 1 1 − w 1 − (z − i ) 3 3 3 = , 3+i − 3z which is valid for z − i < 1. 3 21. This exercise is a simple application of Theorem 15, Sec. 4.1, and basic properties of power ∞ n ∞ n series. If Pn=0 an(z − z0) has radius of convergence R1 > 0 and Pn=0 bn(z − z0) has radius of convergence R2 > 0, then these series converge absolutely within their radii of convergence. Apply Theorem 15, Sec. 4.1: If z is inside the disk of convergence of both series; that is, if |z − z0| Thus, for |z − z0| (d) Switching to polar coordinates: u = r cos θ, v = r sin θ, u2 + v2 = r2, dudv = rdrdθ; for (u, v) ≤ ∞ ≤ ∞ ≤ ≤ π ≤ ∞ varying in the first quadrant (0 u< and 0 v< ), we have 0 θ 2 ,and0 r< , and the double integral in (c) becomes ∞ π 2 2 Z Z −r 2z1 −1 2z2−1 Γ(z1)Γ(z2)=4 e (r cos θ) (r sin θ) rdrdθ 0 0 =Γ(z1+z2 ) π ∞ 2 z }| 2 { =2Z (cos θ)2z1 −1(sin θ)2z2 −1dθ 2 Z r2(z1+z2 )−1e−r dr 0 0 (use (b) with z1 + z2 in place of z) π 2 Z 2z1−1 2z2−1 = 2Γ(z1 + z2) (cos θ) (sin θ) dθ, 0 implying (d). Section 4.4 Taylor Series 83 Solutions to Exercises 4.4 1. According to Theorem 1, the Taylor series around z0 converges in the largest disk, centered at z−1 z0 = 0, in which the function is analytic. Clearly, e is entire, so radius of convergence is R = ∞. 5. According to Theorem 1, the Taylor series around z0 converges in the largest disk, centered at z +1 z =2+i, in which the function is analytic. The function f(z)= is analytic for all z =6 i.So 0 z − i the largest disk around z0 on which f is analytic has radius R = |z0 − i| = |2+i − i| =2. 9. According to Theorem 1, the Taylor series around z0 converges in the largest disk, centered at 6 π z0 = 0, in which the function is analytic. The function f(z) = tan z is analytic for all z = 2 +2kπ. So the largest disk around z0 on which f is analytic has radius equal to the distance from z0 =0to | − π | π the nearest point where f fails to be analytic. Clearly, then R = 0 2 = 2 . z 13. Arguing as we did in Exercises 1-9, we find that the Taylor series of f(z)= around 1 − z z0 = 0 has radius of convergence equal to the distance from z0 = 0 to the nearest point where f fails to be analytic. Thus R = 1. (This will also come out of the computation of the Taylor series.) Now, for |z| < 1, the geometric series tells us that ∞ 1 = X zn. 1 − z n=0 Multiplying both sides by z, we get, for |z| < 1, ∞ z = X zn+1. 1 − z n=0 17. Because the function is entire, the Taylor series will have an infinite radius of convergence. Note that the series expansion around 0 is easy to obtain: ∞ ∞ ∞ zn zn zn+1 ez = X ⇒ zez = z X = X . n! n! n! n=0 n=0 n=0 But how do we get the series expansion around z0 = 1? In the previous expansion, replacing z by z − 1, we get ∞ (z − 1)n+1 (z − 1)ez−1 = X . n! n=0 The expansion on the right is a Taylor series centered at z0 = 1, but the function on the left is not quite the function that we want. Let f(z)=zez. We have (z − 1)ez−1 = e−1zez − ez−1 = e−1f(z) − ez−1. So f(z)=e(z − 1)ez−1 + ez−1. Using the expansion of (z − 1)ez−1 and the expansion of ez−1 = ∞ (z−1)n Pn=0 n! ,wefind ∞ ∞ ∞ ∞ (z − 1)n+1 (z − 1)n (z − 1)n (z − 1)n f(z)=e X + X = e X + X n! n! (n − 1)! n! n=0 n=0 n=1 n=0 ∞ ∞ (z − 1)n (z − 1)n = e X ++1+X (n − 1)! n! n=1 n=1 ∞ ∞ 1 1 n 1 = e1+X(z − 1)n + = e1+X(z − 1)n + (n − 1)! n! n! n! n=1 n=1 ∞ n +1 = e1+X(z − 1)n . n! n=1 84 Chapter 4 Power Series and Laurent Series 21. (a) To obtain the partial fractions decomposition 1 1 1 = − , (1 − z)(2 − z) 1 − z 2 − z we proceed in the usual way: 1 A B = + (1 − z)(2 − z) 1 − z 2 − z A(2 − z)+B(1 − z) = ; (1 − z)(2 − z) 1=A(2 − z)+B(1 − z) Take z =2 ⇒ 1=−B, B = −1. Take z =1 ⇒ 1=A. Thus we obtain the desired partial fractions decomposition. Expanding each term in the partial fractions decomposition around z0 = 0, we obtain ∞ 1 = X zn, |z| < 1; 1 − z n=0 ∞ 1 1 1 z n z − = − = − X , | | < 1, or |z| < 2. 2 − z 2(1 − z ) 2 2 2 2 n=0 So, for |z| < 1, ∞ 1 1 1 1 = − = X(1 − )zn. (1 − z)(2 − z) 1 − z 2 − z 2n+1 n=0 (b) We an derive the series in (a) by considering the Cauchy products of the series expansions of 1 1 1−z and 2−z , as follows. From (a), we have ∞ ∞ ∞ 1 1 zn · = X zn · X = X c zn, 1 − z 2 − z 2n+1 n n=0 n=0 n=0 where cn is obtained from the Cauchy product formula (see Exercise 21, Sec. 4.3): n cn = X akbn−k, k=0 1 a =1,b− = , k n k 2n−k+1 n 1 1 n c = X = X 2k. n 2n−k+1 2n+1 k=0 k=0 (c) To show that the Cauchy product is the same as the series that we found in (a), we must prove that 1 n 1 X 2k =(1− ). 2n+1 2n+1 k=0 But this is clear since n X 2k =1+2+22 + ···+2n =2n+1 − 1, k=0 Section 4.4 Taylor Series 85 and so 1 n 1 1 X 2k = (2n+1 − 1) = (1 − ). 2n+1 2n+1 2n+1 k=0 The radius of the Maclaurin series is 1. This follows from our argument in (a) or from Theorem 1, since the function has a problem at z =1. 1 25. The easiest way to do this problem is to start with the series expansion of f(z)= and z − 2i then differentiate it term-by-term, twice. Let’s see: 1 1 −i i 1 = = = · − z − z − − z z 2i 2i( 2i 1) 2( 2i 1) 2 1 2i ∞ ∞ n i z n i z = X = X(−i)n , 2 2i 2 2n n=0 n=0 | z | | | which is valid for 2i < 1or z < 2. Within the radius of convergence, the series can be differentiated term by term as often as we wish. Differentiating once, we obtain ∞ −1 i zn−1 = X(−i)nn . (z − 2i)2 2 2n n=1 Differentiating a second time, we obtain ∞ ∞ 2 i zn−2 1 i zn−2 = X(−i)nn(n − 1) ⇒ = X(−i)nn(n − 1) . (z − 2i)3 2 2n (z − 2i)3 4 2n n=2 n=2 All series are valid in |z| < 2. If we shift the index of summation of the series (change n to n + 2), we obtain the series ∞ ∞ i zn i zn X(−i)n+2(n + 2)(n +1) = − X(−i)n(n + 2)(n +1) . 4 2n+2 4 2n+2 n=0 n=0 29. For all z, we have ∞ 2 n ∞ 2n 4 2 (z ) z z ez = X = X =1+z2 + + ···. n! n! 2! n=0 n=0 Hence, for all z, 2 2 z ez − 1=z2 + + ··· . 2! If z =6 0, we have 4 6 2 4 2 z z z z ez − 1=z2 + + + ···= z2(1 + + + ···), 2! 3! 2! 3! so, if z =0,6 2 2 4 ez − 1 z2(1 + z + z + ···) z2 z4 = 2! 3! =1+ + + ···, z2 z2 2! 3! where the series converges for all z. But a power series is analytic in the disk where it converges. So z2 z4 ··· ∞ z2n ∞ z2n the series 1 + 2! + 3! + = Pn=0 (n+1)! is entire. Call g(z)=Pn=0 (n+1)! . We just proved that 2 6 ez −1 02 04 ··· for z =0,g(z)= z2 = f(z). Now for z = 0, we have g(0) = 1 + 2! + 3! + =1=f(0). Thus f(z)=g(z) for all z and since g is entire, it follows that f is entire and its Maclaurin series is g(z). 86 Chapter 4 Power Series and Laurent Series 33. (a) The sequence of integers {ln} satisfies the recurrence relation ln = ln−1 + ln−2 for n ≥ 2, with l0 =1andl1 = 3. As suggested, suppose that ln occur as the Maclaurin coefficient of some ∞ n analytic function f(z)=Pn=0 lnz , |z|