DOCSLIB.ORG

Abel's Identity, 131 Abel's Test, 131–132 Abel's Theorem, 463–464 Absolute Convergence, 113–114 Implication of Condi

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

INDEX Abel’s identity, 131 Bolzano-Weierstrass theorem, 66–68 Abel’s test, 131–132 for sequences, 99–100 Abel’s theorem, 463–464 boundary points, 50–52 absolute convergence, 113–114 bounded functions, 142 implication of conditional bounded sets, 42–43 convergence, 114 absolute value, 7 Cantor function, 229–230 reverse triangle inequality, 9 Cantor set, 80–81, 133–134, 383 triangle inequality, 9 Casorati-Weierstrass theorem, 498–499 algebraic properties of Rk, 11–13 Cauchy completeness, 106–107 algebraic properties of continuity, 184 Cauchy condensation test, 117–119 algebraic properties of limits, 91–92 Cauchy integral theorem algebraic properties of series, 110–111 triangle lemma, see triangle lemma algebraic properties of the derivative, Cauchy principal value, 365–366 244 Cauchy sequences, 104–105 alternating series, 115 convergence of, 105–106 alternating series test, 115–116 Cauchy’s inequalities, 437 analytic functions, 481–482 Cauchy’s integral formula, 428–433 complex analytic functions, 483 converse of, 436–437 counterexamples, 482–483 extension to higher derivatives, 437 identity principle, 486 for simple closed contours, 432–433 zeros of, see zeros of complex analytic on circles, 429–430 functions on open connected sets, 430–432 antiderivatives, 361 on star-shaped sets, 429 for f :[a, b] Rp, 370 → Cauchy’s integral theorem, 420–422 of complex functions, 408 consequence, see deformation of on star-shaped sets, 411–413 contours path-independence, 408–409, 415 Cauchy-Riemann equations Archimedean property, 5–6 motivation, 297–300 argument, 29–30 necessity, 300–302 continuity of, 182–183 sufficiency, 302–304 continuous arguments, 445–446 Cauchy-Schwarz inequality, 15–16 average values, 362–363 for integrals, 384 chain rule, 245–246 balls, 48–49 for f : D C, 296 → closed balls, 48–49 for f : Dk Rp, 283–284 → open balls, 48–49 change of variables Bernoulli numbers, 513 for complex integrals, 389 bijective, see one-to-one correspondence for real integrals, 367 539 540 INDEX circles, 30–31, 391 connected sets, 72–75 closed sets, 58–59 contour-connected sets, 392–393, 450 relatively closed, 61 path-connected sets, 392 closure, 59–60 simply connected sets, see simply codomain, 136 connected sets compact sets, 70–71 continuity Heine-Borel theorem, 71 algebraic properties, 184 comparison test, 117 classification of discontinuities, see limit comparisons, 119–120 discontinuity completeness property of Rk, 13–14 composite functions, 185–186 complex analytic functions, see analytic connection with closure, 189–190 functions definition of, 178–179 complex conjugate, 24–25 examples of, 179–184 complex integrals extending, see continuous extensions change of variables, 389 implication by limit preservation, 190 fundamental theorem of calculus, 390 implication of boundedness, 187–188 inequalities, 388–389 inverse images of open sets, 188–189 line integrals, see complex line left and right continuity, 194–195 integrals Lipschitz continuity, 226 linearity property, 388 of inverses, 195–196 of uniformly convergent sequences, of several variables, 186–187 472 order properties, 191–192 over an interval, 387–388 preservation of compactness, 190–191 complex line integrals, 394–395 preservation of connectedness, 191 algebraic properties of, 395–397 uniform continuity, see uniform independence of parametrization, continuity 398–399 continuous extensions, 203–204 inequalities, 398 of uniformly continuous functions, complex numbers, 19–24 206–207 algebraic properties of, 21–22 pasting theorem, 204–206 field properties of, 22–23 Tietze extension theorem, 220–222 imaginary part, 21 contours, 375–376 integer powers of, 23 closed contours, 375 matrix representation, 34–35 in the complex plane, 390 multiplication, 19 lengths of, 397–398 order properties of, 23 parametrizations of, see powers of, 31 parametrizations real part, 21 reverse of, 377, 399–400 roots of, 31–33 simple contours, 375 conditional convergence, 113–114 smooth contours, 375 arbitrary rearrangements, 124–125 subcontours, 390 relation to absolute convergence, 114 winding numbers of, see winding conformal mapping, 524–530 numbers disks to disks, 529–530, 532 convergence, 85–89 half-planes to disks, 524 absolute convergence, see absolute rectangular regions to hyperbolas, 529 convergence Riemann mapping theorem, 532–533 componentwise, 112 sectors to half-planes, 527–528 conditional convergence, see absolute strips to sectors, 528–529 convergence INDEX 541 convex functions, 385 definitions, see definition of convex sets, 410 derivatives cosine function, see trigonometric differentiability, see differentiability functions directional derivatives, see directional curves, 372 derivatives catenations of, 373 examples in R, 239–242 closed curves, 372, 390 examples of, 243, 259, 277, 281–282 contours, see contours for f : D C, 291–294 → in the complex plane, 390 for f : Dk R, 258 → initial point, 390 for f : Dk Rp, 273–274 → initial points of, 372 gradients, see gradients lengths of, 397–398 higher-order derivatives, 243–244 parametrizations of, see higher-order derivatives in C, 294–295 parametrizations of a power series, 468–469 simple closed curves, 372 of a sequence, 255–256 simple curves, 372, 390 of a series, 256–257 smooth curves, 374, 390 partial derivatives, see partial subdivisions of, 374 derivatives terminal point, 390 uniqueness of, 239, 259, 274–275, 294 terminal points of, 372 derived set, 54 diameter, 68 de Moivre’s formula, 29 differentiability decreasing, 145 analyticity, see analytic functions decreasing sequences, 96 definition of, see definition of Dedekind completeness property, 4–5 derivatives for f : Dk R, 258 definition of derivatives, 237 → , δ version, 235–236, 293 implication of continuity, 242, 276, 294 difference quotient version, 235, in Rk, to Rp, 273 292–293 of implicit functions, see implicit directional derivatives, 264–265 function theorem equivalence of definitions, 238, 293 of inverse functions, see inverse for f : Dk R, 258 function theorem → for f : Dk Rp, 273 relation to the gradient, 263–264 → for complex f : D C, 292 sufficient conditions of, 279–281 → gradients, 263 differentiability classes n linear approximation version, C functions, 289–290 n k 236–237, 292 C functions f : D R, 290 → partial derivatives, 261 differentiation deformation of contours, 423–428 under an integral sign, 435–436 deleted neighborhoods, 49–50 dilation, 520 dense sets, 62–63 directional derivatives, 264–265 derivatives definition of, 264–265 algebraic properties of, 244, 270, 283, examples of, 265 295 Dirichlet’s test, 132 at local extrema, 247–248 disconnected sets, 72–74 at local extrema in Rk, 271 discontinuity Cauchy-Riemann equations, see classification of, 196–197 Cauchy-Riemann equations essential discontinuities, 197 chain rule, 245–246 jump discontinuities, 197 542 INDEX removable discontinuities, 197 fundamental theorem of algebra, discrete distance, 75–76, 79 442–443 disks, 30–31 fundamental theorem of calculus, distance, 42 360–362 discrete distance, 75–76, 79 for complex integrals, 390 divergence, 85 for complex line integrals, 408 test for, 113 for line integrals, 380 to , 97 for vector-valued functions, 370–371 ±∞ domain, 136 Gauss’s mean value theorem, 430 general LFTs, 521–523 entire functions, 441 geometric series, 115, 458–460 bounded entire functions, 441–442 gradients, 262–264 essential singularities, 494–495 definition of, 263 Casorati-Weierstrass theorem, greatest lower bound, 45–47 498–499 Euler’s formula, 27 ex harmonic functions, 438–439 definition, 128 harmonic conjugates, 454 exponential function Heine-Borel theorem, 71–72 complex, 150–151 Hessian, 329–330 continuity of, 218–219 higher-order derivatives, 243–244 definition, 128 in C, 294–295 derivative of, 241–242 exponents of complex numbers, 175–176 identity principle, 486 extended complex plane, see Riemann image, 139 sphere imaginary part, 21 exterior points, 50–52 implicit function theorem, 318–321 extreme value theorem, see max-min improper integrals, see integrals theorem increasing, 145 increasing sequences, 96 infimum, 45–47 R field properties of , 2–3 infinite series, see series field property of limits, 92–93 injective, see one-to-one fixed point theorem, 312 inner products, 14–15 fixed points, 534 parallelogram equality, 37–39 function polarization identity, 37–38 complex functions, 137 integrable functions, 337–339 functions, 136 absolute values of, 357–358 complex functions, 137 classes of, 349–354 composition of, 143 continuous functions, 351–353 products and quotients of, 143 functions with finitely many real-valued functions of a single real discontinuities, 353–354 variable, 137 integrals of, 337–339 real-valued functions of a vector, 137 monotone functions, 353 real-valued functions of several real on subintervals, 358–359 variables, 137 products of, 356–357 sums, differences, and scalar relation to upper and lower sums, multiples of, 142 347–349 INDEX 543 uniform limits of, 367–368 Jacobian matrices, 278–279 integrals, 337–339 connection with differentiability, algebraic properties of, 354–356 279–281 approximation by upper and lower Jensen’s inequality, 385 sums, 344–345 Jordan curve theorem, 393 average values, 362–363 Jordan’s inequality, 358 Cauchy principal value, 365–366 change of variables, 367 L’Hospital’s Rule, 254–255 complex integrals, see complex Laurent series, 487 integrals analytic parts, 487 depending on a parameter, 384 integration of, 489 existence of, see integrable functions Laurent’s theorem, see Laurent’s p for f :[a, b] R , 370 theorem → fundamental theorem of calculus,
Recommended publications
  • Cauchy's Cours D'analyse

    Cauchy's Cours D'analyse

    SOURCES AND STUDIES IN THE HISTORY OF MATHEMATICS AND PHYSICAL SCIENCES Robert E. Bradley • C. Edward Sandifer Cauchy’s Cours d’analyse An Annotated Translation Cauchy’s Cours d’analyse An Annotated Translation For other titles published in this series, go to http://www.springer.com/series/4142 Sources and Studies in the History of Mathematics and Physical Sciences Editorial Board L. Berggren J.Z. Buchwald J. Lutzen¨ Robert E. Bradley, C. Edward Sandifer Cauchy’s Cours d’analyse An Annotated Translation 123 Robert E. Bradley C. Edward Sandifer Department of Mathematics and Department of Mathematics Computer Science Western Connecticut State University Adelphi University Danbury, CT 06810 Garden City USA NY 11530 [email protected] USA [email protected] Series Editor: J.Z. Buchwald Division of the Humanities and Social Sciences California Institute of Technology Pasadena, CA 91125 USA [email protected] ISBN 978-1-4419-0548-2 e-ISBN 978-1-4419-0549-9 DOI 10.1007/978-1-4419-0549-9 Springer Dordrecht Heidelberg London New York Library of Congress Control Number: 2009932254 Mathematics Subject Classification (2000): 01A55, 01A75, 00B50, 26-03, 30-03 c Springer Science+Business Media, LLC 2009 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden.
  • 11.3-11.4 Integral and Comparison Tests

    11.3-11.4 Integral and Comparison Tests

    11.3-11.4 Integral and Comparison Tests The Integral Test: Suppose a function f(x) is continuous, positive, and decreasing on [1; 1). Let an 1 P R 1 be defined by an = f(n). Then, the series an and the improper integral 1 f(x) dx either BOTH n=1 CONVERGE OR BOTH DIVERGE. Notes: • For the integral test, when we say that f must be decreasing, it is actually enough that f is EVENTUALLY ALWAYS DECREASING. In other words, as long as f is always decreasing after a certain point, the \decreasing" requirement is satisfied. • If the improper integral converges to a value A, this does NOT mean the sum of the series is A. Why? The integral of a function will give us all the area under a continuous curve, while the series is a sum of distinct, separate terms. • The index and interval do not always need to start with 1. Examples: Determine whether the following series converge or diverge. 1 n2 • X n2 + 9 n=1 1 2 • X n2 + 9 n=3 1 1 n • X n2 + 1 n=1 1 ln n • X n n=2 Z 1 1 p-series: We saw in Section 8.9 that the integral p dx converges if p > 1 and diverges if p ≤ 1. So, by 1 x 1 1 the Integral Test, the p-series X converges if p > 1 and diverges if p ≤ 1. np n=1 Notes: 1 1 • When p = 1, the series X is called the harmonic series. n n=1 • Any constant multiple of a convergent p-series is also convergent.
  • 3.3 Convergence Tests for Infinite Series

    3.3 Convergence Tests for Infinite Series

    3.3 Convergence Tests for Infinite Series 3.3.1 The integral test We may plot the sequence an in the Cartesian plane, with independent variable n and dependent variable a: n X The sum an can then be represented geometrically as the area of a collection of rectangles with n=1 height an and width 1. This geometric viewpoint suggests that we compare this sum to an integral. If an can be represented as a continuous function of n, for real numbers n, not just integers, and if the m X sequence an is decreasing, then an looks a bit like area under the curve a = a(n). n=1 In particular, m m+2 X Z m+1 X an > an dn > an n=1 n=1 n=2 For example, let us examine the first 10 terms of the harmonic series 10 X 1 1 1 1 1 1 1 1 1 1 = 1 + + + + + + + + + : n 2 3 4 5 6 7 8 9 10 1 1 1 If we draw the curve y = x (or a = n ) we see that 10 11 10 X 1 Z 11 dx X 1 X 1 1 > > = − 1 + : n x n n 11 1 1 2 1 (See Figure 1, copied from Wikipedia) Z 11 dx Now = ln(11) − ln(1) = ln(11) so 1 x 10 X 1 1 1 1 1 1 1 1 1 1 = 1 + + + + + + + + + > ln(11) n 2 3 4 5 6 7 8 9 10 1 and 1 1 1 1 1 1 1 1 1 1 1 + + + + + + + + + < ln(11) + (1 − ): 2 3 4 5 6 7 8 9 10 11 Z dx So we may bound our series, above and below, with some version of the integral : x If we allow the sum to turn into an infinite series, we turn the integral into an improper integral.
  • The Binomial Series 16.3   

    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.
  • Series: Convergence and Divergence Comparison Tests

    Series: Convergence and Divergence Comparison Tests

    Series: Convergence and Divergence Here is a compilation of what we have done so far (up to the end of October) in terms of convergence and divergence. • Series that we know about: P∞ n Geometric Series: A geometric series is a series of the form n=0 ar . The series converges if |r| < 1 and 1 a1 diverges otherwise . If |r| < 1, the sum of the entire series is 1−r where a is the first term of the series and r is the common ratio. P∞ 1 2 p-Series Test: The series n=1 np converges if p1 and diverges otherwise . P∞ • Nth Term Test for Divergence: If limn→∞ an 6= 0, then the series n=1 an diverges. Note: If limn→∞ an = 0 we know nothing. It is possible that the series converges but it is possible that the series diverges. Comparison Tests: P∞ • Direct Comparison Test: If a series n=1 an has all positive terms, and all of its terms are eventually bigger than those in a series that is known to be divergent, then it is also divergent. The reverse is also true–if all the terms are eventually smaller than those of some convergent series, then the series is convergent. P P P That is, if an, bn and cn are all series with positive terms and an ≤ bn ≤ cn for all n sufficiently large, then P P if cn converges, then bn does as well P P if an diverges, then bn does as well. (This is a good test to use with rational functions.
  • SFS / M.Sc. (Mathematics with Computer Science)

    SFS / M.Sc. (Mathematics with Computer Science)

    Mathematics Syllabi for Entrance Examination M.Sc. (Mathematics)/ M.Sc. (Mathematics) SFS / M.Sc. (Mathematics with Computer Science) Algebra.(5 Marks) Symmetric, Skew symmetric, Hermitian and skew Hermitian matrices. Elementary Operations on matrices. Rank of a matrices. Inverse of a matrix. Linear dependence and independence of rows and columns of matrices. Row rank and column rank of a matrix. Eigenvalues, eigenvectors and the characteristic equation of a matrix. Minimal polynomial of a matrix. Cayley Hamilton theorem and its use in finding the inverse of a matrix. Applications of matrices to a system of linear (both homogeneous and non–homogeneous) equations. Theoremson consistency of a system of linear equations. Unitary and Orthogonal Matrices, Bilinear and Quadratic forms. Relations between the roots and coefficients of general polynomial equation in one variable. Solutions of polynomial equations having conditions on roots. Common roots and multiple roots. Transformation of equations. Nature of the roots of an equation Descarte’s rule of signs. Solutions of cubic equations (Cardon’s method). Biquadratic equations and theirsolutions. Calculus.(5 Marks) Definition of the limit of a function. Basic properties of limits, Continuous functions and classification of discontinuities. Differentiability. Successive differentiation. Leibnitz theorem. Maclaurin and Taylor series expansions. Asymptotes in Cartesian coordinates, intersection of curve and its asymptotes, asymptotes in polar coordinates. Curvature, radius of curvature for Cartesian curves, parametric curves, polar curves. Newton’s method. Radius of curvature for pedal curves. Tangential polar equations. Centre of curvature. Circle of curvature. Chord of curvature, evolutes. Tests for concavity and convexity. Points of inflexion. Multiplepoints. Cusps, nodes & conjugate points. Type of cusps.
  • 1 Notes for Expansions/Series and Differential Equations in the Last

    1 Notes for Expansions/Series and Differential Equations in the Last

    Notes for Expansions/Series and Differential Equations In the last discussion, we considered perturbation methods for constructing solutions/roots of algebraic equations. Three types of problems were illustrated starting from the simplest: regular (straightforward) expansions, non-uniform expansions requiring modification to the process through inner and outer expansions, and singular perturbations. Before proceeding further, we first more clearly define the various types of expansions of functions of variables. 1. Convergent and Divergent Expansions/Series Consider a series, which is the sum of the terms of a sequence of numbers. Given a sequence {a1,a2,a3,a4,a5,....,an..} , the nth partial sum Sn is the sum of the first n terms of the sequence, that is, n Sn = ak . (1) k =1 A series is convergent if the sequence of its partial sums {S1,S2,S3,....,Sn..} converges. In a more formal language, a series converges if there exists a limit such that for any arbitrarily small positive number ε>0, there is a large integer N such that for all n ≥ N , ^ Sn − ≤ ε . (2) A sequence that is not convergent is said to be divergent. Examples of convergent and divergent series: • The reciprocals of powers of 2 produce a convergent series: 1 1 1 1 1 1 + + + + + + ......... = 2 . (3) 1 2 4 8 16 32 • The reciprocals of positive integers produce a divergent series: 1 1 1 1 1 1 + + + + + + ......... (4) 1 2 3 4 5 6 • Alternating the signs of the reciprocals of positive integers produces a convergent series: 1 1 1 1 1 1 − + − + − + ......... = ln 2 .
  • Calculus Terminology

    Calculus Terminology

    AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential
  • Learning Goals: Power Series • Master the Art of Using the Ratio Test

    Learning Goals: Power Series • Master the Art of Using the Ratio Test

    Learning Goals: Power Series • Master the art of using the ratio test to find the radius of convergence of a power series. • Learn how to find the series associated with the end points of the interval of convergence. 1 X xn • Become familiar with the series : n! n=0 xn • Become familiar with the limit lim : n!1 n! • Know the Power series representation of ex • Learn how to manipulate the power series representation of ex using tools previously mastered such as substitution, integration and differentiation. • Learn how to use power series to calculate limits. 1 Power Series, Stewart, Section 11.8 In this section, we will use the ratio test to determine the Radius of Convergence of a given power series. We will also determine the interval of convergence of the given power series if this is possible using the tests for convergence that we have already developed, namely, recognition as a geometric series, harmonic series or alternating harmonic series, telescoping series, the divergence test along with the fact that a series is absolutely convergent converges. The ratio and root tests will be inconclusive at the end points of the interval of convergence in the examples below since we use them to determine the radius of convergence. We may not be able to decide on convergence or divergence for some of the end points with our current tools. We will expand our methods for testing individual series for convergence in subsequent sections and tie up any loose ends as we proceed. We recall the definition of the Radius of Convergence and Interval of Convergence of a power series below.
  • Sequences, Series and Taylor Approximation (Ma2712b, MA2730)

    Sequences, Series and Taylor Approximation (Ma2712b, MA2730)

    Sequences, Series and Taylor Approximation (MA2712b, MA2730) Level 2 Teaching Team Current curator: Simon Shaw November 20, 2015 Contents 0 Introduction, Overview 6 1 Taylor Polynomials 10 1.1 Lecture 1: Taylor Polynomials, Definition . .. 10 1.1.1 Reminder from Level 1 about Differentiable Functions . .. 11 1.1.2 Definition of Taylor Polynomials . 11 1.2 Lectures 2 and 3: Taylor Polynomials, Examples . ... 13 x 1.2.1 Example: Compute and plot Tnf for f(x) = e ............ 13 1.2.2 Example: Find the Maclaurin polynomials of f(x) = sin x ...... 14 2 1.2.3 Find the Maclaurin polynomial T11f for f(x) = sin(x ) ....... 15 1.2.4 QuestionsforChapter6: ErrorEstimates . 15 1.3 Lecture 4 and 5: Calculus of Taylor Polynomials . .. 17 1.3.1 GeneralResults............................... 17 1.4 Lecture 6: Various Applications of Taylor Polynomials . ... 22 1.4.1 RelativeExtrema .............................. 22 1.4.2 Limits .................................... 24 1.4.3 How to Calculate Complicated Taylor Polynomials? . 26 1.5 ExerciseSheet1................................... 29 1.5.1 ExerciseSheet1a .............................. 29 1.5.2 FeedbackforSheet1a ........................... 33 2 Real Sequences 40 2.1 Lecture 7: Definitions, Limit of a Sequence . ... 40 2.1.1 DefinitionofaSequence .......................... 40 2.1.2 LimitofaSequence............................. 41 2.1.3 Graphic Representations of Sequences . .. 43 2.2 Lecture 8: Algebra of Limits, Special Sequences . ..... 44 2.2.1 InfiniteLimits................................ 44 1 2.2.2 AlgebraofLimits.............................. 44 2.2.3 Some Standard Convergent Sequences . .. 46 2.3 Lecture 9: Bounded and Monotone Sequences . ..... 48 2.3.1 BoundedSequences............................. 48 2.3.2 Convergent Sequences and Closed Bounded Intervals . .... 48 2.4 Lecture10:MonotoneSequences .
  • Calculus Online Textbook Chapter 10

    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.
  • Real Analysis Honors Exam 1 Do the Best That You Can to Respond to The

    Real Analysis Honors Exam 1 Do the Best That You Can to Respond to The

    Real Analysis Honors Exam 1 Do the best that you can to respond to the following problems. It is not required that you respond to every problem, and, in fact, it is much better to provide complete and clearly explained responses to a subset of the given problems than to provide hurried and incomplete responses to all of them. When a complete response is not possible you are encouraged to clearly explain the partial progress that you can achieve. x2 y2 z2 4 1. Prove that the ellipsoid a2 + b2 + c2 = 1 has volume 3 πabc. You may assume that this formula is correct for the spherical case where a = b = c. 2. Newton's Method: Suppose that f : R ! R is continuously differen- tiable. Newton's method is an iterative algorithm designed to approx- imate the zeros of f. Start with a first guess x0, then for each integer n > 0 find the equation of the tangent line to the graph of f at the point (xn−1; f(xn−1))), and solve for the x intercept of that line which is named xn. Show that the sequence (xn) is guaranteed to converge under the following conditions: (a) f has a zero in the interval (a; b). (b) f is twice continuous differentiable with f 0(x) > 0 and f 00(x) > 0 on (a; b). 2 3. A function f : R ! R is Gateux differentiable at x0 if the limit f(x + hv) − f(x ) lim 0 0 ; h!0 h exists for all v 2 R2, i.e.