Math 141: Lecture 19
|
|
- Cuthbert Bruce
- 5 years ago
- Views:
Transcription
1 Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, / 44
2 Series of positive terms Recall that, given a sequence {a n } n=1, we say that its series n=1 a n converges if the sequence of partial sums {s n } n=1 s n = n a k, converges. We begin by giving some criteria for the convergence in the case when the terms a n are non-negative. k=1 Bob Hough Math 141: Lecture 19 November 16, / 44
3 Comparison test Theorem (Comparison test) Let {a n } n=1 and {b n} n=1 be two sequences such that a n 0 and b n 0 for all n 1. Suppose there is a number N and a constant c > 0 such that a n cb n for all n > N. Then convergence of n=1 b n implies convergence of n=1 a n. In this case, we say that the sequence b n dominates the sequence a n. Bob Hough Math 141: Lecture 19 November 16, / 44
4 Comparison test Proof of the comparison test. Suppose that n=1 b n converges. Given ɛ > 0, apply the Cauchy property of the sequence of partial sums of b n to choose M > N such that m > n > M implies It follows that n k=m+1 n k=m+1 a n b n < ɛ c. n k=m+1 cb n < ɛ, so the sequence of partial sums of a n is Cauchy, hence converges. Bob Hough Math 141: Lecture 19 November 16, / 44
5 Limit comparison test Theorem (Limit comparison test) Let {a n } n=1 and {b n} n=1 be sequences satisfying a n > 0 and b n > 0 for all n 1. Suppose that a n lim = 1. n b n Then n=1 a n converges if and only if n=1 b n converges. Proof. The condition implies that there is N such that n > N implies a n 2 b n 2a n. It now follows from the comparison test that n=1 a n converges if and only if n=1 b n converges. Bob Hough Math 141: Lecture 19 November 16, / 44
6 Examples Recall that last class we checked n=1 1 n 2 + n = n=1 1 n(n + 1) = n=1 ( 1 n 1 ) = 1 n + 1 n since the series telescopes. Since lim 2 +n n = lim n 2 n n = 1, it follows that n=1 1 converges. n 2 By comparison, it follows that n=1 1 n converges for all s 2. s Bob Hough Math 141: Lecture 19 November 16, / 44
7 Examples Recall that the harmonic series satisfies check that by noting that and sin 1 n lim n 1 n n=1 lim n 1 n(n + 10) =, n(n + 10) n = lim n n=1 1 n =. One may sin 1 n = n= n = 1, ( ( )) ( ) = lim n n n + O n 3 = lim 1 + O n n 2 = 1. Bob Hough Math 141: Lecture 19 November 16, / 44
8 Integral test Theorem (Integral test) Let f be a positive decreasing function, defined for all real x 1. The infinite series n=1 f (n) converges if and only if the improper integral 1 f (x)dx converges. Bob Hough Math 141: Lecture 19 November 16, / 44
9 Integral test Proof of the integral test. We first check that the improper integral converges if and only if the sequence { t n = n 1 f (x)dx} n=1 converges. Recall that convergence of the improper integral is defined by the x existence of the limit lim x 1 f (t)dt. Evidently convergence of the integral entails convergence of the sequence as a special case. To check the reverse direction, note that for n x n + 1, t n x 1 f (t)dt t n+1, and hence, if t n L < ɛ for all n N, then x f (t)dt L < ɛ for all x N also. 1 Bob Hough Math 141: Lecture 19 November 16, / 44
10 Integral test Proof of the integral test. We now show that {t n } n=1 converges if and only if the sequence of partial sums {s n = n k=1 f (k)} k=1 converges. Given m > n, note that by taking upper and lower step functions for the integral, m 1 k=n f (k) t m t n = m n f (t)dt m k=n+1 f (k) and hence {t n } n=1 is Cauchy if and only if {s n} n=1 proves the claim. is Cauchy, which Bob Hough Math 141: Lecture 19 November 16, / 44
11 Examples We can show that the series n=1 1 n, s real, converges if and only if s s > 1. To check this, note that t n = n 1 dt t s = { n 1 s 1 1 s s 1 log n s = 1. This sequence converges if and only if s > 1. 1 For complex s = σ + it, n = 1 s n exp (it log n). Since σ exp (it log n) = 1, the sum ζ(s) = n=1 converges absolutely if σ = R(s) > 1. This function is called the Riemann zeta function. 1 n s Bob Hough Math 141: Lecture 19 November 16, / 44
12 Examples The study of the analytic properties of the Riemann zeta function and related functions is responsible for a great deal of the information that we know about the prime numbers. Bob Hough Math 141: Lecture 19 November 16, / 44
13 Root test Theorem (Root test) Let n=1 a n be a series of non-negative terms. Suppose that a 1 n n R, n. If R < 1 then the series converges. If R > 1 then the series diverges. Bob Hough Math 141: Lecture 19 November 16, / 44
14 Root test Proof of the root test. Let x = R+1 2 so that R < x < 1 if x < 1 and 1 < x < R if R > 1. Suppose R < 1. Then, for all n sufficiently large, a n < x n. The series converges by comparison with the geometric series n=1 x n. Suppose instead that R > 1. Then for all n sufficiently large, a n > x n so that the series diverges by comparison with the geometric series n=1 x n. Bob Hough Math 141: Lecture 19 November 16, / 44
15 Example We apply the root test to the series ( ) n 2 n n=1 n+1. Calculate a 1 n n = Thus the series converges. ( ) ( n n 1 = n n ) n 1 e. Bob Hough Math 141: Lecture 19 November 16, / 44
16 Ratio test Theorem Let n=1 a n be a sum of positive terms such that a n+1 a n L, n. The series converges if L < 1 and diverges if L > 1. Bob Hough Math 141: Lecture 19 November 16, / 44
17 Ratio test Proof of the ratio test. If L > 1 then the series does not converge since the terms do not tend to 0. If L < 1, let L < x = L + 1 < 1. 2 Choose N sufficiently large, so that if n N then a n+1 a n < x. It follows that, for all n > N, n 1 a n = a N k=n a k+1 a k a N x n N = a N x N x n. Since a N x N is just a constant, the series converges by comparison with the geometric series n=1 x n. Bob Hough Math 141: Lecture 19 November 16, / 44
18 Examples Consider the series n=1 n! n. Applying the ratio test, as n, n a n+1 a n = Hence the series converges. ( ) (n + 1)! nn n n (n + 1) n+1 n! = = n (1 + 1/n) n 1 e. Bob Hough Math 141: Lecture 19 November 16, / 44
19 Edge cases The ratio and root tests are not useful in the case a n+1 a n 1 as n. Note that n=1 1 n = while n=1 1 converges. The ratios of n 2 consecutive terms in these cases are given by n n + 1 = 1 1 ( ) 1 n + O n 2 n 2, (n + 1) 2 = 1 2 ( ) 1 n + O n 2. The following two tests of Raabe and Gauss sometimes help to decide convergence in cases where the limiting ratio is 1. Bob Hough Math 141: Lecture 19 November 16, / 44
20 Raabe s test Theorem (Raabe s test) Let n=1 a n be a sum of positive terms. If there is an r > 0 and N 1 such that, for all n N, a n+1 a n 1 1 n r n then n=1 a n converges. If, for all n N, a n+1 a n 1 1 n then n=1 a n =. Bob Hough Math 141: Lecture 19 November 16, / 44
21 An inequality for the logarithm In the first part of the proof of Raabe s test we use the inequality log(1 + x) x, 1 < x. To check this inequality, note equality holds at x = 0. Also, x log(1 + x) has derivative x, which changes sign at x = 0. It follows that the function decreases to 0, and increases thereafter. Bob Hough Math 141: Lecture 19 November 16, / 44
22 Raabe s test Proof of Raabe s test. Assume first that a n+1 a n 1 1+r n for n > N. Thus, for n > N, n 1 a n a N k=n ( 1 r + 1 ) a N exp k ( n 1 k=n There is some constant C (which depends on N) such that n 1 k=n 1 k C + log n. ) r + 1. k Hence, there is another constant c, depending on N, such that a n for n > N. The series thus converges by comparison with 1 n=1 n 1+r. c n 1+r Bob Hough Math 141: Lecture 19 November 16, / 44
23 Raabe s test Proof of Raabe s test. Now assume that a n+1 a n 1 1 n for n > N 1. Thus, for n > N, n 1 a n a N k=n ( 1 1 ). k Note that the product is equal to n 1 k=n k 1 k = N 1 n 1, since it telescopes. Since there is a constant c (depending on N) such that a n > c n 1 for all n > N, the series diverges by comparison with the harmonic series. Bob Hough Math 141: Lecture 19 November 16, / 44
24 Gauss s test Theorem (Gauss s test) Let n=1 a n be a series of positive terms. If there is an N 1, an s > 1 and an M > 0 such that for all n > N, a n+1 a n = 1 A n + f (n) n s where f (n) M for all n, then n=1 a n converges if A > 1 and diverges if A 1. Bob Hough Math 141: Lecture 19 November 16, / 44
25 Gauss s test Proof of Gauss s test. Let N be sufficiently large, and write, for n > N, n 1 a n = a N k=n a k+1 a k = a N n 1 k=n Since ( A k f (k) k tends to 0 as k we may write s ) log 1 A k + f (k) k = A s k + f (k) k + O ( ) 1 s k. Hence 2 a n = a N exp ( n 1 k=n ( A k + f (k) k s = a N exp ( A log n + O(1)). ( 1 A k + f (k) ) k s. + O ( )) ) 1 k 2 The series thus converges or diverges according as A > 1 or otherwise, by comparison with the sum n 1 n A. Bob Hough Math 141: Lecture 19 November 16, / 44
26 Examples Consider the series ( ) (2n 1) k. n= (2n) The ratio a n a n 1 sequence is given by ( 2n 1 2n ) k ( = 1 1 2n ) k ( ( = exp k 1 2n + O = 1 k ( ) 1 2n + O n 2 ( ))) 1 n 2 of this as n. Hence the series converges for k > 2 and diverges for k 2 by Gauss s test. Bob Hough Math 141: Lecture 19 November 16, / 44
27 Power series Definition Let {a n } n=0. The series P(x) = n=0 a nx n is called the power series associated to {a n } n=0. The series n=0 a nx n is sometimes also called a (linear) generating function of {a n } n=0. We ll return to study power series in more detail in the next several lectures, but point out some basic properties now. Bob Hough Math 141: Lecture 19 November 16, / 44
28 Power series Theorem Let {a n } n=0 be a sequence. Define R = 0 if { a n 1 n } n=1 R = if a n 1 n 0, and is unbounded, 1 R = lim sup a n 1 n n otherwise. The power series P(x) = n=0 a nx n converges absolutely in the disc D R (0) = {x C : x < R} and diverges for x > R. Definition As defined, R is called the radius of convergence of the power series P(x) = n=0 a nx n. Bob Hough Math 141: Lecture 19 November 16, / 44
29 Power series Proof. First suppose R = 0, so that a n 1 n is unbounded. It follows that for any x 0, a n x n 1 n = a n 1 n x is unbounded. The power series P(x) diverges since its terms do not tend to 0. Next suppose R = so that a n 1 n 0. Then for any x C, a n x n 1 n = a n 1 n x 0, so that the power series converges absolutely, by comparison with a geometric series. Finally, suppose that R > 0 is finite. For x < R, lim sup n a n x n 1 n = lim sup a n 1 x n x = n R < 1. The series thus converges absolutely by comparison with a geometric series. If instead x > R, then the limsup is x R > 1, and the power series does not converge since its terms do not tend to 0. Bob Hough Math 141: Lecture 19 November 16, / 44
30 Solving linear recurrences A linear recurrence sequence is a sequence in which successive terms are defined as a linear combination of a bounded number of terms preceeding them (and possibly an auxiliary function). Examples include The Fibonacci numbers, F 0 = F 1 = 1, for n 2, F n = F n 1 + F n 2. The number of steps needed to solve the Towers of Hanoi with n discs, T 0 = 0, T n+1 = 2T n + 1. (T n = 2 n 1). The number of regions into which the plane is split by n lines in general position (pairwise non-parallel), L 0 = 1, L n+1 = L n + n + 1. (L n = 1 + ( ) n+1 2 ). Bob Hough Math 141: Lecture 19 November 16, / 44
31 Solving linear recurrences Although there are other methods, often the easiest way of solving linear recurrences is through writing down the power series generating function. Fibonacci numbers: Let f (x) = n=0 F nx n. By the recurrence relation, f (x) = 1 + x + = 1 + x + F n x n n=2 (F n 2 + F n 1 )x n n=2 = 1 + (x + x 2 )f (x). Hence f (x)(1 x x 2 ) = 1, or f (x) = 1 1 x x 2. Bob Hough Math 141: Lecture 19 November 16, / 44
32 Solving linear recurrences Recall f (x) = n=0 F nx n = 1 1 x x 2. Let φ = , 1 φ = so that (1 x x 2 ) = (1 φx)(1 + x φ ). Write in partial fractions, 1 1 x x 2 = A 1 φx + B 1 + x φ with A + B = 1, A φ Bφ = 0 so that A = φ2 Matching coefficients of x n, F n = φ2 1 + φ 2 φn + ( 1)n 1 + φ 2 φ n., B = 1. 1+φ 2 1+φ 2 The radius of convergence of the power series f (x) is 1 φ. Bob Hough Math 141: Lecture 19 November 16, / 44
33 Partial summation Theorem (Abel summation) Let {a n } n=1 and {b n} n=1 be two sequences of complex numbers, and let n A n = a k. k=1 Then n n a k b k = A n b n+1 + A k (b k b k+1 ). k=1 k=1 Bob Hough Math 141: Lecture 19 November 16, / 44
34 Partial summation Proof. Define A 0 = 0. Thus, since a k = A k A k 1, k = 1, 2,..., one has n a k b k = k=1 = n (A k A k 1 )b k k=1 n A k b k k=1 = A n b n+1 + n A k b k+1 + A n b n+1 k=1 n A k (b k b k+1 ). k=1 Bob Hough Math 141: Lecture 19 November 16, / 44
35 Dirichlet s test Theorem (Dirichlet s test) Let {a n } be a sequence of complex terms, whose partial sums form a bounded sequence. Let {b n } be a decreasing sequence of positive real terms, which tends to 0. Then the series converges. a n b n n=1 This generalizes the alternating series test from last lecture. Bob Hough Math 141: Lecture 19 November 16, / 44
36 Dirichlet s test Proof of Dirichlet s test. Denote the sequence of partial sums of {a n } n=1 by {A n} n=1. Let M > 0 be such that A n M for all n. By Abel summation, the sequence of partial sums {s n = n k=1 a kb k } n=1 satisfy s n = A n b n+1 + n A k (b k b k+1 ). k=1 Note that A n b n+1 0 as n, while k=1 A k(b k b k+1 ) converges absolutely, since A k (b k b k+1 ) M (b k b k+1 ) = Mb 1. k=1 This proves the convergence. k=1 Bob Hough Math 141: Lecture 19 November 16, / 44
37 Examples Let θ R. The sum diverges otherwise. k=1 e2πikθ k converges if θ is not an integer and To see this, for θ Z, e 2πikθ = 1, so this is the harmonic series, which diverges. Otherwise, set z = e 2πiθ so z = 1, z 1. Then A n = n k=1 e2πikθ = z zn 1 z satisfies A n 2 1 z. Hence the convergence follows from Dirichlet s test. Bob Hough Math 141: Lecture 19 November 16, / 44
38 Abel s test Theorem (Abel s test) Let n=1 a n be a convergent complex series, and let {b n } n=1 be a monotonic, convergent sequence of real terms. Then converges. n=1 a n b n Bob Hough Math 141: Lecture 19 November 16, / 44
39 Abel s test Proof of Abel s test. As in the proof of Dirichlet s test, write A n = n k=1 a k, and assume that A n M. Let b = lim n b n. By Abel summation, n a k b k = A n b n+1 + k=1 n A k (b k b k+1 ). k=1 As n, lim n A n b n+1 = b k=1 a k converges. Also, A k (b k b k+1 ) M b k b k+1 = M b 1 b k=1 k=1 since the series on the right telescopes. Thus k=1 A k(b k b k+1 ) converges absolutely. Bob Hough Math 141: Lecture 19 November 16, / 44
40 Products of series Definition Let n=0 a n and n=0 b n be two series. Their Cauchy product is the series c n, c n = a 0 b n + a 1 b n a n b 0. n=0 Bob Hough Math 141: Lecture 19 November 16, / 44
41 Example The following example shows that it is possible that n=1 a n and n=1 b n converge, but their Cauchy product n=1 c n does not converge. ( 1) n Let a n = b n = ( 1)n n+1. The series n=0 n+1 converges by the alternating series test. The Cauchy product has c n = ( 1) n n 1 k=0 k+1 n k+1. By the Inequality of the Arithmetic Mean-Geometric Mean, (k + 1)(n k + 1) n + 2 2, and hence c n n 2 k=0 n+2 = 2(n+1) n+2. Since c n 1 as n, the series does not converge. Bob Hough Math 141: Lecture 19 November 16, / 44
42 Products of series Theorem Let n=0 a n = A converge absolutely, and n=0 b n = B converge. Denote by {c n } n=0 the Cauchy product of {a n} n=0 and {b n} n=0. Then c n = AB. n=0 Bob Hough Math 141: Lecture 19 November 16, / 44
43 Products of series Proof of Cauchy Product formula. See Rudin, pp Define partial sums A n = n k=0 a n, B n = n k=0 b k, C n = n k=0 c k. Set β n = B n B. Write C n = a 0 b 0 + (a 0 b 1 + a 1 b 0 ) + + (a 0 b n + a 1 b n a n b 0 ) = a 0 B n + a 1 B n a n B 0 = a 0 (B + β n ) + a 1 (B + β n 1 ) + a n (B + β 0 ) = A n B + a 0 β n + a 1 β n a n β 0. Define γ n = a 0 β n + a 1 β n a n β 0. Since A n B AB as n, it suffices to check that γ n 0. Bob Hough Math 141: Lecture 19 November 16, / 44
44 Products of series Proof of Cauchy Product formula. See Rudin, pp Recall that β n = B n B tends to 0 with n, and that we wish to show that γ n = a 0 β n + a 1 β n a n β 0 tends to 0 also. Define α = n=0 a n. Given ɛ > 0, choose N such that n > N implies β n < ɛ. Bound γ n N a n k β k + k=0 n k=n+1 a n k β k N a n k β k + ɛα. Since a n 0 as n, if n is sufficientlly large, then N k=0 a n kβ k < ɛ, whence γ n (1 + α)ɛ. Letting ɛ 0 completes the proof. k=0 Bob Hough Math 141: Lecture 19 November 16, / 44
Mathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationCHAPTER 2 INFINITE SUMS (SERIES) Lecture Notes PART 1
CHAPTER 2 INFINITE SUMS (SERIES) Lecture Notes PART We extend now the notion of a finite sum Σ n k= a k to an INFINITE SUM which we write as Σ n= a n as follows. For a given a sequence {a n } n N {0},
More information2 2 + x =
Lecture 30: Power series A Power Series is a series of the form c n = c 0 + c 1 x + c x + c 3 x 3 +... where x is a variable, the c n s are constants called the coefficients of the series. n = 1 + x +
More informationMath 141: Lecture 11
Math 141: Lecture 11 The Fundamental Theorem of Calculus and integration methods Bob Hough October 12, 2016 Bob Hough Math 141: Lecture 11 October 12, 2016 1 / 36 First Fundamental Theorem of Calculus
More informationFrom Calculus II: An infinite series is an expression of the form
MATH 3333 INTERMEDIATE ANALYSIS BLECHER NOTES 75 8. Infinite series of numbers From Calculus II: An infinite series is an expression of the form = a m + a m+ + a m+2 + ( ) Let us call this expression (*).
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More information8.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
8. Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = Examples: 6. Find a formula for the general term a n of the sequence, assuming
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationAnalysis II: Basic knowledge of real analysis: Part IV, Series
.... Analysis II: Basic knowledge of real analysis: Part IV, Series Kenichi Maruno Department of Mathematics, The University of Texas - Pan American March 1, 2011 K.Maruno (UT-Pan American) Analysis II
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationReview of Power Series
Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power
More informationMATH115. Infinite Series. Paolo Lorenzo Bautista. July 17, De La Salle University. PLBautista (DLSU) MATH115 July 17, / 43
MATH115 Infinite Series Paolo Lorenzo Bautista De La Salle University July 17, 2014 PLBautista (DLSU) MATH115 July 17, 2014 1 / 43 Infinite Series Definition If {u n } is a sequence and s n = u 1 + u 2
More information10.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
10.1 Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1 Examples: EX1: Find a formula for the general term a n of the sequence,
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationSequences and Summations
COMP 182 Algorithmic Thinking Sequences and Summations Luay Nakhleh Computer Science Rice University Chapter 2, Section 4 Reading Material Sequences A sequence is a function from a subset of the set of
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More informationCHAPTER 4. Series. 1. What is a Series?
CHAPTER 4 Series Given a sequence, in many contexts it is natural to ask about the sum of all the numbers in the sequence. If only a finite number of the are nonzero, this is trivial and not very interesting.
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationThe Prime Number Theorem
The Prime Number Theorem We study the distribution of primes via the function π(x) = the number of primes x 6 5 4 3 2 2 3 4 5 6 7 8 9 0 2 3 4 5 2 It s easier to draw this way: π(x) = the number of primes
More informationCSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of
More information1 Euler s idea: revisiting the infinitude of primes
8.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The prime number theorem Most of my handouts will come with exercises attached; see the web site for the due dates. (For example, these are
More informationSeries Solution of Linear Ordinary Differential Equations
Series Solution of Linear Ordinary Differential Equations Department of Mathematics IIT Guwahati Aim: To study methods for determining series expansions for solutions to linear ODE with variable coefficients.
More informationSeries. 1 Convergence and Divergence of Series. S. F. Ellermeyer. October 23, 2003
Series S. F. Ellermeyer October 23, 2003 Convergence and Divergence of Series An infinite series (also simply called a series) is a sum of infinitely many terms a k = a + a 2 + a 3 + () The sequence a
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationRademacher functions
Rademacher functions Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto July 6, 4 Binary expansions Define S : {, } N [, ] by Sσ σ k k, σ {, }N. For example, for σ and σ,
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 4 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 4 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 2.6.3, 2.7.4, 2.7.5, 2.7.2,
More informationLimit and Continuity
Limit and Continuity Table of contents. Limit of Sequences............................................ 2.. Definitions and properties...................................... 2... Definitions............................................
More informationFINAL EXAM Math 25 Temple-F06
FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short
More informationConvergence of Some Divergent Series!
Convergence of Some Divergent Series! T. Muthukumar tmk@iitk.ac.in 9 Jun 04 The topic of this article, the idea of attaching a finite value to divergent series, is no longer a purely mathematical exercise.
More informationInfinite Sequences and Series Section
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Infinite Sequences and Series Section 8.1-8.2 Dr. John Ehrke Department of Mathematics Fall 2012 Zeno s Paradox Achilles and
More informationSimilar to sequence, note that a series converges if and only if its tail converges, that is, r 1 r ( 1 < r < 1), ( 1) k k. r k =
Infinite Series We say an infinite series a k converges to s if its sequence of initial sums converges to s, that is, lim( n a k : n N) = s. Similar to sequence, note that a series converges if and only
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More informationSolutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa
1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such
More informationIntroduction to Series and Sequences Math 121 Calculus II Spring 2015
Introduction to Series and Sequences Math Calculus II Spring 05 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial of infinite
More information1 More concise proof of part (a) of the monotone convergence theorem.
Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationMath 104: Homework 7 solutions
Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More informationThe Comparison Test & Limit Comparison Test
The Comparison Test & Limit Comparison Test Math4 Department of Mathematics, University of Kentucky February 5, 207 Math4 Lecture 3 / 3 Summary of (some of) what we have learned about series... Math4 Lecture
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
More informationBernoulli Numbers and their Applications
Bernoulli Numbers and their Applications James B Silva Abstract The Bernoulli numbers are a set of numbers that were discovered by Jacob Bernoulli (654-75). This set of numbers holds a deep relationship
More informationPRIME NUMBER THEOREM
PRIME NUMBER THEOREM RYAN LIU Abstract. Prime numbers have always been seen as the building blocks of all integers, but their behavior and distribution are often puzzling. The prime number theorem gives
More informationHarmonic sets and the harmonic prime number theorem
Harmonic sets and the harmonic prime number theorem Version: 9th September 2004 Kevin A. Broughan and Rory J. Casey University of Waikato, Hamilton, New Zealand E-mail: kab@waikato.ac.nz We restrict primes
More informationMath Homework 2
Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is
More informationPrimes in arithmetic progressions
(September 26, 205) Primes in arithmetic progressions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/mfms/notes 205-6/06 Dirichlet.pdf].
More informationMath 680 Fall A Quantitative Prime Number Theorem I: Zero-Free Regions
Math 68 Fall 4 A Quantitative Prime Number Theorem I: Zero-Free Regions Ultimately, our goal is to prove the following strengthening of the prime number theorem Theorem Improved Prime Number Theorem: There
More informationMATH 5640: Fourier Series
MATH 564: Fourier Series Hung Phan, UMass Lowell September, 8 Power Series A power series in the variable x is a series of the form a + a x + a x + = where the coefficients a, a,... are real or complex
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationMath 259: Introduction to Analytic Number Theory More about the Gamma function
Math 59: Introduction to Analytic Number Theory More about the Gamma function We collect some more facts about Γs as a function of a complex variable that will figure in our treatment of ζs and Ls, χ.
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1.
Problem Sheet 3. From Theorem 3. we have ζ (s) = + s s {u} u+sdu, (45) valid for Res > 0. i) Deduce that for Res >. [u] ζ (s) = s u +sdu ote the integral contains [u] in place of {u}. ii) Deduce that for
More informationContents. Preface xi. vii
Preface xi 1. Real Numbers and Monotone Sequences 1 1.1 Introduction; Real numbers 1 1.2 Increasing sequences 3 1.3 Limit of an increasing sequence 4 1.4 Example: the number e 5 1.5 Example: the harmonic
More informationComplex Analysis Slide 9: Power Series
Complex Analysis Slide 9: Power Series MA201 Mathematics III Department of Mathematics IIT Guwahati August 2015 Complex Analysis Slide 9: Power Series 1 / 37 Learning Outcome of this Lecture We learn Sequence
More informationINTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES
INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES You will be expected to reread and digest these typed notes after class, line by line, trying to follow why the line is true, for example how it
More informationMATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS
MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K
More information16.4. Power Series. Introduction. Prerequisites. Learning Outcomes
Power Series 6.4 Introduction In this Section we consider power series. These are examples of infinite series where each term contains a variable, x, raised to a positive integer power. We use the ratio
More informationGeometric Series and the Ratio and Root Test
Geometric Series and the Ratio and Root Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 5, 2018 Outline 1 Geometric Series
More information10.1 Sequences. A sequence is an ordered list of numbers: a 1, a 2, a 3,..., a n, a n+1,... Each of the numbers is called a term of the sequence.
10.1 Sequences A sequence is an ordered list of numbers: a 1, a 2, a 3,..., a n, a n+1,... Each of the numbers is called a term of the sequence. Notation: A sequence {a 1, a 2, a 3,...} can be denoted
More informationMOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS
MOMENTS OF HYPERGEOMETRIC HURWITZ ZETA FUNCTIONS ABDUL HASSEN AND HIEU D. NGUYEN Abstract. This paper investigates a generalization the classical Hurwitz zeta function. It is shown that many of the properties
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationSeries. Definition. a 1 + a 2 + a 3 + is called an infinite series or just series. Denoted by. n=1
Definition a 1 + a 2 + a 3 + is called an infinite series or just series. Denoted by a n, or a n. Chapter 11: Sequences and, Section 11.2 24 / 40 Given a series a n. The partial sum is the sum of the first
More informationInfinite Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Infinite Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background Consider the repeating decimal form of 2/3. 2 3 = 0.666666 = 0.6 + 0.06 + 0.006 + 0.0006 + = 6(0.1)
More informationPower Series. Part 1. J. Gonzalez-Zugasti, University of Massachusetts - Lowell
Power Series Part 1 1 Power Series Suppose x is a variable and c k & a are constants. A power series about x = 0 is c k x k A power series about x = a is c k x a k a = center of the power series c k =
More informationPower series and Taylor series
Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series
More informationDivergent Series: why = 1/12. Bryden Cais
Divergent Series: why + + 3 + = /. Bryden Cais Divergent series are the invention of the devil, and it is shameful to base on them any demonstration whatsoever.. H. Abel. Introduction The notion of convergence
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationFINAL REVIEW FOR MATH The limit. a n. This definition is useful is when evaluating the limits; for instance, to show
FINAL REVIEW FOR MATH 500 SHUANGLIN SHAO. The it Define a n = A: For any ε > 0, there exists N N such that for any n N, a n A < ε. This definition is useful is when evaluating the its; for instance, to
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationMATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE
MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationThe Borel-Cantelli Group
The Borel-Cantelli Group Dorothy Baumer Rong Li Glenn Stark November 14, 007 1 Borel-Cantelli Lemma Exercise 16 is the introduction of the Borel-Cantelli Lemma using Lebesue measure. An approach using
More informationHomework If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator.
Homework 3 1 If the inverse T 1 of a closed linear operator exists, show that T 1 is a closed linear operator Solution: Assuming that the inverse of T were defined, then we will have to have that D(T 1
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationMath Review for Exam Answer each of the following questions as either True or False. Circle the correct answer.
Math 22 - Review for Exam 3. Answer each of the following questions as either True or False. Circle the correct answer. (a) True/False: If a n > 0 and a n 0, the series a n converges. Soln: False: Let
More informationAbsolute Convergence and the Ratio & Root Tests
Absolute Convergence and the Ratio & Root Tests Math114 Department of Mathematics, University of Kentucky February 20, 2017 Math114 Lecture 15 1/ 12 ( 1) n 1 = 1 1 + 1 1 + 1 1 + Math114 Lecture 15 2/ 12
More informationMath 162 Review of Series
Math 62 Review of Series. Explain what is meant by f(x) dx. What analogy (analogies) exists between such an improper integral and an infinite series a n? An improper integral with infinite interval of
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More information= 1 2 x (x 1) + 1 {x} (1 {x}). [t] dt = 1 x (x 1) + O (1), [t] dt = 1 2 x2 + O (x), (where the error is not now zero when x is an integer.
Problem Sheet,. i) Draw the graphs for [] and {}. ii) Show that for α R, α+ α [t] dt = α and α+ α {t} dt =. Hint Split these integrals at the integer which must lie in any interval of length, such as [α,
More informationLimits and Continuity
Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index
More informationMath 162: Calculus IIA
Math 62: Calculus IIA Final Exam ANSWERS December 9, 26 Part A. (5 points) Evaluate the integral x 4 x 2 dx Substitute x 2 cos θ: x 8 cos dx θ ( 2 sin θ) dθ 4 x 2 2 sin θ 8 cos θ dθ 8 cos 2 θ cos θ dθ
More informationAbel Summation MOP 2007, Black Group
Abel Summation MOP 007, Blac Group Zachary Abel June 5, 007 This lecture focuses on the Abel Summation formula, which is most often useful as a way to tae advantage of unusual given conditions such as
More informationRoot test. Root test Consider the limit L = lim n a n, suppose it exists. L < 1. L > 1 (including L = ) L = 1 the test is inconclusive.
Root test Root test n Consider the limit L = lim n a n, suppose it exists. L < 1 a n is absolutely convergent (thus convergent); L > 1 (including L = ) a n is divergent L = 1 the test is inconclusive.
More informationGiven a sequence a 1, a 2,...of numbers, the finite sum a 1 + a 2 + +a n,wheren is an nonnegative integer, can be written
A Summations When an algorithm contains an iterative control construct such as a while or for loop, its running time can be expressed as the sum of the times spent on each execution of the body of the
More informationSumming Series: Solutions
Sequences and Series Misha Lavrov Summing Series: Solutions Western PA ARML Practice December, 0 Switching the order of summation Prove useful identity 9 x x x x x x Riemann s zeta function ζ is defined
More informationMath 430/530: Advanced Calculus I Chapter 1: Sequences
Math 430/530: Advanced Calculus I Chapter 1: Sequences Fall 2018 Sequences A sequence is just a list of real numbers a 1, a 2,... with a definite order. We write a = (a n ) n=1 for a sequence a with n
More informationFRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS
FRACTIONAL HYPERGEOMETRIC ZETA FUNCTIONS HUNDUMA LEGESSE GELETA, ABDULKADIR HASSEN Both authors would like to dedicate this in fond memory of Marvin Knopp. Knop was the most humble and exemplary teacher
More informationDirichlet s Theorem. Calvin Lin Zhiwei. August 18, 2007
Dirichlet s Theorem Calvin Lin Zhiwei August 8, 2007 Abstract This paper provides a proof of Dirichlet s theorem, which states that when (m, a) =, there are infinitely many primes uch that p a (mod m).
More informationSequences and series
Sequences and series Jean-Marie Dufour McGill University First version: March 1992 Revised: January 2002, October 2016 This version: October 2016 Compiled: January 10, 2017, 15:36 This work was supported
More informationTHE GAMMA FUNCTION AND THE ZETA FUNCTION
THE GAMMA FUNCTION AND THE ZETA FUNCTION PAUL DUNCAN Abstract. The Gamma Function and the Riemann Zeta Function are two special functions that are critical to the study of many different fields of mathematics.
More informationAdvanced Calculus Math 127B, Winter 2005 Solutions: Final. nx2 1 + n 2 x, g n(x) = n2 x
. Define f n, g n : [, ] R by f n (x) = Advanced Calculus Math 27B, Winter 25 Solutions: Final nx2 + n 2 x, g n(x) = n2 x 2 + n 2 x. 2 Show that the sequences (f n ), (g n ) converge pointwise on [, ],
More informationSequences and infinite series
Sequences and infinite series D. DeTurck University of Pennsylvania March 29, 208 D. DeTurck Math 04 002 208A: Sequence and series / 54 Sequences The lists of numbers you generate using a numerical method
More informationMath 421 Midterm 2 review questions
Math 42 Midterm 2 review questions Paul Hacking November 7, 205 () Let U be an open set and f : U a continuous function. Let be a smooth curve contained in U, with endpoints α and β, oriented from α to
More informationChapter 11: Sequences; Indeterminate Forms; Improper Integrals
Chapter 11: Sequences; Indeterminate Forms; Improper Integrals Section 11.1 The Least Upper Bound Axiom a. Least Upper Bound Axiom b. Examples c. Theorem 11.1.2 d. Example e. Greatest Lower Bound f. Theorem
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More informationM361 Theory of functions of a complex variable
M361 Theory of functions of a complex variable T. Perutz U.T. Austin, Fall 2012 Lecture 4: Exponentials and logarithms We have already been making free use of the sine and cosine functions, cos: R R, sin:
More informationPower Series and Analytic Function
Dr Mansoor Alshehri King Saud University MATH204-Differential Equations Center of Excellence in Learning and Teaching 1 / 21 Some Reviews of Power Series Differentiation and Integration of a Power Series
More information