Calculus 2 (BMETE92AM37, Stpendium Hungaricum) Topic List for the Examination

Total Page:16

File Type:pdf, Size:1020Kb

Calculus 2 (BMETE92AM37, Stpendium Hungaricum) Topic List for the Examination Calculus 2 (BMETE92AM37, Stpendium Hungaricum) Topic list for the examination Tamás Tasnádi June, 2018 General information • The examination is a 90 minute long written test. • Approximately 60% of the examination consists of numerical problems similar to the ones in the tests during the semester. The candidates are required to use the methods learned in order to solve the problems. • Approximately 40% of the examination contains theory. Here the candidates are required to give the definitions of concepts, state theorems, present the proof of some theorems learned in class or prove new theorems with methods similar to the ones learned in class. • If the result of the exam is less then 40% then the grade is “failed” (1), and the exam has to be repeated. • Otherwise the overall result R (in percents) is calculated as R = 0:2S + 0:2M1 + 0:2M2 + 0:4E; result grade where S, M1, M2 and E are 0% ≤ R < 40% failed (1) the cumulative result of the small 40% ≤ R < 55% sufficient (2) tests, the results of first and sec- 55% ≤ R < 65% satisfactory (3) ond midterm tests and the exam, 65% ≤ R < 80% good (4) respectively. (All in percents.) The 80% ≤ R ≤ 100% excellent (5) result R is converted to grade ac- cording to the table on the right. • The examination can be repeated with the aim of improving the result. In this case it is not compulsory to submit the exam, however, if it is submitted then it overwrites the previous result so worsening (down to 40%) is also possible. • The topic list below gives the basic concepts and theorems required. The numbers refer to the book: Miklós Laczkovich, Vera, T. Sós: Real Analysis II. (Series, Functions of Several Variables and Applications), 2017, Springer • The theorems typeset in boldface should be known with their proofs. The other theorems should be known and can be used without proofs in solving other problems. 1 1 Functions from Rp to R p Operations in R , inner product, norm, distance, triangle inequality, Schwarz in- equality. p Graph of R ! R functions. p Convergence of a sequence in R . Convergence is equivalent to coordinate-wise convergence (Theorem 1.5), operations with convergent sequences (Theorems 1.6, 1.7), Cauchy’s criterion (Theorem 1.8), Bolzano–Weierstrass theorem (1.9). Basic topological concepts (interior, boundary, exterior point; limit point, derived set, isolated point; open, closed set; closure of a set). Properties of open and closed sets (Theorems 1.13, 1.14, 1.17, 1.18, 1.24). Cantor’s theorem (1.25). Lindelöf’s theorem (1.26). Compact set. Borel’s theorem (1.31). Limit of a multivariable function. Transference principle (Theorem 1.38). Squeeze theorem (1.39), operations with limits (Theorem 1.40). Continuity of functions, transference principle (Theorem 1.44), operations with con- tinuous functions (Theorems1.46, 1.48, 1.49), Weierstrass’s theorem (1.51), uniform continuity, Heine’s theorem (1.53). Partial derivatives, local extrema and their connection (Theorem 1.60). Ex- tremal values on a compact set (Theorem 1.61). Differentiability, (total) derivative (gradient) of a function, its connection to continu- ity and to the partial derivatives (Theorems 1.66, 1.67, Theorem 1.71). Tangent plane of a function. Directional derivative and its connection to the gradient (Theorem 1.77). Second order partial derivatives, Young’s theorem (1.82). Twice differentiability, second order Taylor expansion. Quadratic forms, conditions for positive/negative (semi) definitness. Conditions for local extrema (Theorem 1.101). 2 Functions from Rp to Rq Limit and continuity of vector valued multivariable functions. Transference principle (Theorems 2.2, 2.4, 2.5). Continuous image of compact set is compact (Theorem 2.8). Differentiability, relation to differentiability of components (Theorem 2.13). Jacobian matrix. Relation of differentiability to continuity and partial differentiability (Theorem 2.16). Differentiation rules (Theorem 2.19), chain rule (Theorem 2.20, Corollary 2.23), differential of the inverse function (Theorem 2.26). Inverse function theorem (2.38), imlicit function theorem (2.40). Lagrange multiplier method (Theorem 2.44). 3 The Jordan measure Outer, inner measure, null set, Jordan measurability, Jordan measure. Box-counting measures, their limit (Theorem 3.4). Properties of the inner, outer measure (The- orems 3.6, 3.7, 3.9). Properties of the Jordan measure (Theorems 3.16, 3.17). Characterization of the Jordan measure by its properties (Theorem 3.18). Volume of a parallelepiped (Theorem 3.31). Change of measure under linear transformation (Theorems 3.35, 3.36). 2 4 Integrals of multivariable functions I Defining integral on rectangles: partition of a rectangle, lower and upper sums, their properties (Lemmas 4.2, 4.3). Lower, upper integrals; integrability and Riemann integral of a function. Oscillatory sum, approximating sum. Defining integral on bounded, measurable sets: partitions; lower, upper sums, lower, upper integrals, integrability, integral. Connection to Jordan measure (Theorem 4.11). Integrability of continuous functions (Theorem 4.14). Calculating the integrals on rectangles (Theorems 4.17, 4.19) and on normal do- mains (Theorem 4.18) by successive integration. Integration by substitution (Theo- rem 4.22). Planar polar coordinates, substitution by polar coordinates (Theorem 4.25). Cylindrical coordinates, spherical polar coordinates, and their Jacibi deter- minants. Improper integrals. 5 Integrals of multivariable functions II Line integral as Stieltjes integral. Calculation of line integrals over differentiable curve (Theorems 5.5, 5.8). Primitive function, Newton–Leibniz formula for line integrals (Theorem 5.11) and its proof for differentiable curves (Remark 5.12). Conditions for the existence of primitive function (Theorem 5.14, Theorem 5.17, Theorems 5.22, 5.32). Simple closed curve, its direction. Green’s theorem (5.34). Parametrized surface, surface area. Surface area of a graph of a function (Theorem 5.44). Divergence, rotation of a vector field. Gauss–Ostrogradsky theorem, Stoke’s theorem (5.48). 6 Series of functions Pointwise and uniform convergence of series of functions, absolute convergence. Weier- strass criterion (Theorem 7.27). Consequences of uniform convergnece (Theorems 7.36, 7.40, 7.42). Taylor series and power series. Taylor series of trigonometric, hyperbolic, exponen- tial functions (page 250). Analytic function. Radius and domain of convergence of a power series (Theorem 7.49, Couchy–Hadamard formula 7.101). Continuity, termwise differentiability and integrability of a power series (Theorems 7.51, 7.52). Generalized binomial coefficients, binomial series (pages 255–256). Trigonometric system, its orthogonality (Lemma 7.72). Trigonometric polyno- mials, trigonometric series, Fourier expansion (Theorem 7.71). Completeness of the trigonometric system (Theorem 7.77). 3.
Recommended publications
  • Sequences and Series Pg. 1
    Sequences and Series Exercise Find the first four terms of the sequence 3 1, 1, 2, 3, . [Answer: 2, 5, 8, 11] Example Let be the sequence defined by 2, 1, and 21 13 2 for 0,1,2,, find and . Solution: (k = 0) 21 13 2 2 2 3 (k = 1) 32 24 2 6 2 8 ⁄ Exercise Without using a calculator, find the first 4 terms of the recursively defined sequence • 5, 2 3 [Answer: 5, 7, 11, 19] • 4, 1 [Answer: 4, , , ] • 2, 3, [Answer: 2, 3, 5, 8] Example Evaluate ∑ 0.5 and round your answer to 5 decimal places. ! Solution: ∑ 0.5 ! 0.5 0.5 0.5 ! ! ! 0.5 0.5 ! ! 0.5 0.5 0.5 0.5 0.5 0.5 0.041666 0.003125 0.000186 0.000009 . Exercise Find and evaluate each of the following sums • ∑ [Answer: 225] • ∑ 1 5 [Answer: 521] pg. 1 Sequences and Series Arithmetic Sequences an = an‐1 + d, also an = a1 + (n – 1)d n S = ()a +a n 2 1 n Exercise • For the arithmetic sequence 4, 7, 10, 13, (a) find the 2011th term; [Answer: 6,034] (b) which term is 295? [Answer: 98th term] (c) find the sum of the first 750 terms. [Answer: 845,625] rd th • The 3 term of an arithmetic sequence is 8 and the 16 term is 47. Find and d and construct the sequence. [Answer: 2,3;the sequence is 2,5,8,11,] • Find the sum of the first 800 natural numbers. [Answer: 320,400] • Find the sum ∑ 4 5.
    [Show full text]
  • The Binomial Series 16.3   
    The Binomial Series 16.3 Introduction In this Section we examine an important example of an infinite series, the binomial series: p(p − 1) p(p − 1)(p − 2) 1 + px + x2 + x3 + ··· 2! 3! We show that this series is only convergent if |x| < 1 and that in this case the series sums to the value (1 + x)p. As a special case of the binomial series we consider the situation when p is a positive integer n. In this case the infinite series reduces to a finite series and we obtain, by replacing x with b , the binomial theorem: a n(n − 1) (b + a)n = bn + nbn−1a + bn−2a2 + ··· + an. 2! Finally, we use the binomial series to obtain various polynomial expressions for (1 + x)p when x is ‘small’. ' • understand the factorial notation $ Prerequisites • have knowledge of the ratio test for convergence of infinite series. Before starting this Section you should ... • understand the use of inequalities '& • recognise and use the binomial series $% Learning Outcomes • state and use the binomial theorem On completion you should be able to ... • use the binomial series to obtain numerical approximations & % 26 HELM (2008): Workbook 16: Sequences and Series ® 1. The binomial series A very important infinite series which occurs often in applications and in algebra has the form: p(p − 1) p(p − 1)(p − 2) 1 + px + x2 + x3 + ··· 2! 3! in which p is a given number and x is a variable. By using the ratio test it can be shown that this series converges, irrespective of the value of p, as long as |x| < 1.
    [Show full text]
  • Polar Coordinates and Complex Numbers Infinite Series Vectors And
    Contents CHAPTER 9 Polar Coordinates and Complex Numbers 9.1 Polar Coordinates 348 9.2 Polar Equations and Graphs 351 9.3 Slope, Length, and Area for Polar Curves 356 9.4 Complex Numbers 360 CHAPTER 10 Infinite Series 10.1 The Geometric Series 10.2 Convergence Tests: Positive Series 10.3 Convergence Tests: All Series 10.4 The Taylor Series for ex, sin x, and cos x 10.5 Power Series CHAPTER 11 Vectors and Matrices 11.1 Vectors and Dot Products 11.2 Planes and Projections 11.3 Cross Products and Determinants 11.4 Matrices and Linear Equations 11.5 Linear Algebra in Three Dimensions CHAPTER 12 Motion along a Curve 12.1 The Position Vector 446 12.2 Plane Motion: Projectiles and Cycloids 453 12.3 Tangent Vector and Normal Vector 459 12.4 Polar Coordinates and Planetary Motion 464 CHAPTER 13 Partial Derivatives 13.1 Surfaces and Level Curves 472 13.2 Partial Derivatives 475 13.3 Tangent Planes and Linear Approximations 480 13.4 Directional Derivatives and Gradients 490 13.5 The Chain Rule 497 13.6 Maxima, Minima, and Saddle Points 504 13.7 Constraints and Lagrange Multipliers 514 CHAPTER Infinite Series Infinite series can be a pleasure (sometimes). They throw a beautiful light on sin x and cos x. They give famous numbers like n and e. Usually they produce totally unknown functions-which might be good. But on the painful side is the fact that an infinite series has infinitely many terms. It is not easy to know the sum of those terms.
    [Show full text]
  • A Tentative Interpretation of the Epistemological Significance of the Encrypted Message Sent by Newton to Leibniz in October 1676
    Advances in Historical Studies 2014. Vol.3, No.1, 22-32 Published Online February 2014 in SciRes (http://www.scirp.org/journal/ahs) http://dx.doi.org/10.4236/ahs.2014.31004 A Tentative Interpretation of the Epistemological Significance of the Encrypted Message Sent by Newton to Leibniz in October 1676 Jean G. Dhombres Centre Alexandre Koyré-Ecole des Hautes Etudes en Sciences Sociales, Paris, France Email: [email protected] Received October 8th, 2013; revised November 9th, 2013; accepted November 16th, 2013 Copyright © 2014 Jean G. Dhombres. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In accordance of the Creative Commons Attribution License all Copyrights © 2014 are reserved for SCIRP and the owner of the intellectual property Jean G. Dhombres. All Copyright © 2014 are guarded by law and by SCIRP as a guardian. In Principia mathematica philosophiæ naturalis (1687), with regard to binomial formula and so general Calculus, Newton claimed that Leibniz proposed a similar procedure. As usual within Newtonian style, no explanation was provided on that, and nowadays it could only be decoded by Newton himself. In fact to the point, not even he gave up any mention of Leibniz in 1726 on the occasion of the third edition of the Principia. In this research, I analyse this controversy comparing the encrypted passages, and I will show that at least two ideas were proposed: vice versa and the algebraic handing of series. Keywords: Leibniz; Newton; Calculus Principia; Binomial Series; Controversy; Vice Versa Introduction tober 1676 to Leibniz.
    [Show full text]
  • Calculus Online Textbook Chapter 10
    Contents CHAPTER 9 Polar Coordinates and Complex Numbers 9.1 Polar Coordinates 348 9.2 Polar Equations and Graphs 351 9.3 Slope, Length, and Area for Polar Curves 356 9.4 Complex Numbers 360 CHAPTER 10 Infinite Series 10.1 The Geometric Series 10.2 Convergence Tests: Positive Series 10.3 Convergence Tests: All Series 10.4 The Taylor Series for ex, sin x, and cos x 10.5 Power Series CHAPTER 11 Vectors and Matrices 11.1 Vectors and Dot Products 11.2 Planes and Projections 11.3 Cross Products and Determinants 11.4 Matrices and Linear Equations 11.5 Linear Algebra in Three Dimensions CHAPTER 12 Motion along a Curve 12.1 The Position Vector 446 12.2 Plane Motion: Projectiles and Cycloids 453 12.3 Tangent Vector and Normal Vector 459 12.4 Polar Coordinates and Planetary Motion 464 CHAPTER 13 Partial Derivatives 13.1 Surfaces and Level Curves 472 13.2 Partial Derivatives 475 13.3 Tangent Planes and Linear Approximations 480 13.4 Directional Derivatives and Gradients 490 13.5 The Chain Rule 497 13.6 Maxima, Minima, and Saddle Points 504 13.7 Constraints and Lagrange Multipliers 514 CHAPTER Infinite Series Infinite series can be a pleasure (sometimes). They throw a beautiful light on sin x and cos x. They give famous numbers like n and e. Usually they produce totally unknown functions-which might be good. But on the painful side is the fact that an infinite series has infinitely many terms. It is not easy to know the sum of those terms.
    [Show full text]
  • Final Exam: Cheat Sheet"
    7/17/97 Final Exam: \Cheat Sheet" Z Z 1 2 6. csc xdx = cot x dx =lnjxj 1. x Z Z x a x 7. sec x tan xdx = sec x 2. a dx = ln a Z Z 8. csc x cot xdx = csc x 3. sin xdx = cos x Z Z 1 x dx 1 = tan 9. 4. cos xdx = sin x 2 2 x + a a a Z Z dx x 1 2 p = sin 10. 5. sec xdx = tan x 2 2 a a x Z Z d b [f y g y ] dy [f x g x] dx. In terms of y : A = 11. Area in terms of x: A = c a Z Z d b 2 2 [g y ] dy [f x] dx. Around the y -axis: V = 12. Volume around the x-axis: V = c a Z b 13. Cylindrical Shells: V = 2xf x dx where 0 a< b a Z Z b b b 0 0 14. f xg x dx = f xg x] f xg x dx a a a R m 2 2 n 2 2 15. HowtoEvaluate sin x cos xdx.:Ifm or n are o dd use sin x =1 cos x and cos x =1 sin x, 2 1 1 2 resp ectively and then apply substitution. Otherwise, use sin x = 1 cos 2x or cos x = 1 + cos 2x 2 2 1 or sin x cos x = sin 2x. 2 R m n 2 2 2 16. HowtoEvaluate tan x sec xdx.:Ifm is o dd or n is even, use tan x = sec x 1 and sec x = 2 1 + tan x, resp ectively and then apply substitution.
    [Show full text]
  • A Note on the 2F1 Hypergeometric Function
    A Note on the 2F1 Hypergeometric Function Armen Bagdasaryan Institution of the Russian Academy of Sciences, V.A. Trapeznikov Institute for Control Sciences 65 Profsoyuznaya, 117997, Moscow, Russia E-mail: [email protected] Abstract ∞ α The special case of the hypergeometric function F represents the binomial series (1 + x)α = xn 2 1 n=0 n that always converges when |x| < 1. Convergence of the series at the endpoints, x = ±1, dependsP on the values of α and needs to be checked in every concrete case. In this note, using new approach, we reprove the convergence of the hypergeometric series for |x| < 1 and obtain new result on its convergence at point x = −1 for every integer α = 0, that is we prove it for the function 2F1(α, β; β; x). The proof is within a new theoretical setting based on a new method for reorganizing the integers and on the original regular method for summation of divergent series. Keywords: Hypergeometric function, Binomial series, Convergence radius, Convergence at the endpoints 1. Introduction Almost all of the elementary functions of mathematics are either hypergeometric or ratios of hypergeometric functions. Moreover, many of the non-elementary functions that arise in mathematics and physics also have representations as hypergeometric series, that is as special cases of a series, generalized hypergeometric function with properly chosen values of parameters ∞ (a ) ...(a ) F (a , ..., a ; b , ..., b ; x)= 1 n p n xn p q 1 p 1 q (b ) ...(b ) n! n=0 1 n q n X Γ(w+n) where (w)n ≡ Γ(w) = w(w + 1)(w + 2)...(w + n − 1), (w)0 = 1 is a Pochhammer symbol and n!=1 · 2 · ..
    [Show full text]
  • Taylor Series and Mclaurin Series • Definition of a Power Series
    Learning Goals: Taylor Series and McLaurin series • Definition of a power series expansion of a function at a. • Learn to calculate the Taylor series expansion of a function at a. • Know that if a function has a power series expansion at a, then that power series must be the Taylor series expansion at a. • Be aware that the Taylor series expansion of a function f(x) at a does not always sum to f(x) in an interval around a and know what is involved in checking whether it does or not. • Remainder Theorem: Know how to get an upper bound for the remainder. • Know the power series expansions for sin(x), cos(x) and (1 + x)k and be familiar with how they were derived. • Become familiar with how to apply previously learned methods to these new power series: i.e. methods such as substitution, integration, differentiation, limits, polynomial approximation. 1 Taylor Series and McLaurin series: Stewart Section 11.10 We have seen already that many functions have a power series representation on part of their domain. For example function Power series Repesentation Interval 1 1 X xn −1 < x < 1 1 − x n=0 1 1 X (−1)nxkn −1 < x < 1 1 + xk n=0 1 X xn+1 ln(1 + x) (−1)n −1 < x ≤ 1 n + 1 n=0 1 X x2n+1 ? ? arctan(x) (−1)n −1 < x < 1 2n + 1 n=0 1 X xn ex −∞ < x < 1 n! n=0 Now that you are comfortable with the idea of a power series representation for a function, you may be wondering if such a power series representation is unique and is there a systematic way of finding a power series representation for a function.
    [Show full text]
  • One Variable Advanced Calculus
    One Variable Advanced Calculus Kenneth Kuttler March 9, 2014 2 Contents 1 Introduction 7 2 The Real And Complex Numbers 9 2.1 The Number Line And Algebra Of The Real Numbers .......... 9 2.2 Exercises ................................... 13 2.3 Set Notation ................................. 13 2.4 Order ..................................... 14 2.5 Exercises ................................... 18 2.6 The Binomial Theorem ........................... 19 2.7 Well Ordering Principle And Archimedean Property . 20 2.8 Exercises ................................... 24 2.9 Completeness of R .............................. 27 2.10 Existence Of Roots .............................. 28 2.11 Exercises ................................... 29 2.12 The Complex Numbers ............................ 31 2.13 Exercises ................................... 33 3 Set Theory 35 3.1 Basic Definitions ............................... 35 3.2 The Schroder Bernstein Theorem ...................... 37 3.3 Equivalence Relations ............................ 40 3.4 Exercises ................................... 41 4 Functions And Sequences 43 4.1 General Considerations ............................ 43 4.2 Sequences ................................... 46 4.3 Exercises ................................... 47 4.4 The Limit Of A Sequence .......................... 49 4.5 The Nested Interval Lemma ......................... 52 4.6 Exercises ................................... 53 4.7 Compactness ................................. 55 4.7.1 Sequential Compactness ....................... 55
    [Show full text]
  • 1 the Binomial Series
    The following is an excerpt from Chapter 10 of Calculus, Early Transcendentals by James Stewart. It has been reformatted slightly from its appearance in the textbook so that it corresponds to the LaTeX article style. 1 The Binomial Series You may be acquainted with the Binomial Theorem, which states that if +, and are any real numbers and 5 is a positive integer, then 5Ð5 "Ñ 5Ð5 "ÑÐ5 #Ñ Ð+ ,Ñ55 œ + 5+ 5"5 , +,## +, 5$$ #x $x 5Ð5 "ÑÐ5 #ÑâÐ5 8 "Ñ â +,588 8x â 5+,5"5 , The traditional notation for the binomial coefficient is 555Ð5 "ÑÐ5 #ÑâÐ5 8 "Ñ œ" œ 8œ"ß#ßáß5 Œ !8 Œ 8x which enables us to write the Binomial Theorem in the abbreviated form 5 5 Ð+ ,Ñ55 œ +88 , 8œ! Œ8 In particular, if we put +œ" and ,œB, we get 5 5 Ð" BÑ58 œ B Ð1 Ñ 8œ!Œ8 One of Newton's accomplishments was to extend the Binomial Theorem (Equation 1) to the case where 5Ð" is no longer a positive integer. In this case the expression for BÑ5 is no longer a finite sum; it becomes an infinite series. Assuming that Ð" BÑ5 can be expanded as a power series, we compute its Maclaurin series in the usual way: 0ÐBÑœ Ð" BÑ5 0Ð!Ñ œ " 0ÐBÑœ5Ð"w5 BÑ"w 0 Ð!Ñ œ 5 0ÐBÑœ5Ð5ww "ÑÐ" BÑ 5#ww 0 Ð!Ñ œ 5Ð5 "Ñ 0ÐBÑœ5Ð5www "ÑÐ5 #ÑÐ" BÑ 5$ 0 www Ð!Ñ œ 5Ð5 "ÑÐ5 #Ñ ãã 0ÐBÑÐ8Ñ œ5Ð5 "ÑâÐ5 8 "ÑÐ" BÑ58Ð8Ñ 0 Ð!Ñ œ 5Ð5 "ÑâÐ5 8 "Ñ 1 ∞∞0Ð!ÑÐ8Ñ 5Ð5 "ÑâÐ5 8 "Ñ Ð" BÑ58 œ B œ B 8 8œ!8x 8œ! 8x If ?88 is the th term of this series, then 8" ?5Ð58" "ÑâÐ5 8 "ÑÐ5 8ÑB 8x œ†8 ººº?Ð88 "Ñx 5Ð5 "ÑâÐ5 8 "ÑB º " 5 5 8 ¸¸8 œkk lBl œ" lBl Ä lBlas 8 Ä ∞ 8 " " 8 Thus, by the Ratio Test, the binomial series converges if lBl "lBl and diverges if ".
    [Show full text]
  • Binomial Series F(K)(A)(X − A)K → ∞
    Taylor polynomials and Taylor series Convergence of Taylor series When we want to approximate a function near x = a Given a Taylor series we know that it approximates we have several options, the first two of which we are the function at x = a as well as possible (i.e., all of the already familiar: derivatives match up). But what happens for x 6= a. To answer this we need to find a way to estimate the • (constant) f(x) ≈ f(a) error, and this is where Taylor comes in. It is known • (linear) f(x) ≈ f(a) + f0(a)(x - a) that for a function f(x) and The linear approximation is also known as the tan- n f(k)(a)(x - a)k g(x) = , gent line (of which we had great success in using k! k=0 to understand the function). But why stop at lin- X ear? In general if we want to approximate the func- in other words the n-th order approximation, that tion we want to mimic the function as best as possi- ble. This means making sure we can match as many f(n+1)(c)(b - a)n+1 g(b)- f(b) = derivatives as possible. So constant approximation (n + 1)! matches f, and linear approximation matches f, f0. For quadratic we want the approximation to match error =Rn(b) f, f0, f00 and the function which does this is where c is between a| and b.{z Note that} this is f00(a)(x - a)2 the “next” term in the approximation.
    [Show full text]
  • MA 16200 Study Guide - Exam # 3
    Fall 2011 MA 16200 Study Guide - Exam # 3 (1) Sequences; limits of sequences; Limit Laws for Sequences; Squeeze Theorem; monotone sequences; bounded sequences; Monotone Sequence Theorem. X1 Xn X1 (2) Infinite series an; sequence of partial sums sn = ak; the series an converges to s if sn ! s. n=1 k=1 n=1 (3) Special Series: X1 a n−1 2 3 ··· j j (a) Geometric Series: ar = a(1 + r + r + r + ) = − , if r < 1 (converges). n=1 1 r The Geometric Series diverges if jrj ≥ 1. X1 1 ≤ (b) p-Series: p converges when p > 1; diverges when p 1. n=1 n X1 (4) List of Convergence Tests for an. n=1 (0) Divergence Test (1) Integral Test (2) Comparison Test (3) Limit Comparison Test (4) Alternating Series Test (5) Ratio Test (6) Root Test 1 (Useful inequality: ln x < xm, for any m > > 0:37.) e (5) Strategy for Convergence/Divergence of Infinite Series. X Usually consider the form of the series an: (i) If lim an =6 0 or DNE, the use Divergence Test. n!1 X 1 X (ii) If series is a p-Series , use p-Series conclusions; if series is a Geometric series a rn−1, np use Geometric Series conclusions. P (iii) If an looks like a p-Series or Geometric series, use Comparison Test or Limit Comparison Test. (iv) If an involves factorials, use Ratio Test. th (v) If an involves n powers, use Root Test. P (vi) If an is an alternating series, use Alternating Series Test (or use Ratio/Root Test to show absolute or conditional convergence).
    [Show full text]