DOCSLIB.ORG

Power Series

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Chapter 6 Power Series Power series are one of the most useful type of series in analysis. For example, we can use them to define transcendental functions such as the exponential and trigonometric functions (and many other less familiar functions). 6.1. Introduction A power series (centered at 0) is a series of the form X1 n 2 n anx = a0 + a1x + a2x + ··· + anx + :::: n=0 where the an are some coefficients. If all but finitely many of the an are zero, then the power series is a polynomial function, but if infinitely many of the an are nonzero, then we need to consider the convergence of the power series. The basic facts are these: Every power series has a radius of convergence 0 ≤ R ≤ 1, which depends on the coefficients an. The power series converges absolutely in jxj < R and diverges in jxj > R, and the convergence is uniform on every interval jxj < ρ where 0 ≤ ρ < R. If R > 0, the sum of the power series is infinitely differentiable in jxj < R, and its derivatives are given by differentiating the original power series term-by-term. Power series work just as well for complex numbers as real numbers, and are in fact best viewed from that perspective, but we restrict our attention here to real-valued power series. 1 2 R Definition 6.1. Let (an)n=0 be a sequence of real numbers and c . The power series centered at c with coefficients an is the series X1 n an(x − c) : n=0 73 74 6. Power Series Here are some power series centered at 0: X1 xn = 1 + x + x2 + x3 + x4 + :::; n=0 1 X 1 1 1 1 xn = 1 + x + x2 + x3 + x4 + :::; n! 2 6 24 n=0 X1 (n!)xn = 1 + x + 2x2 + 6x3 + 24x4 + :::; n=0 X1 n (−1)nx2 = x − x2 + x4 − x8 + ::: ; n=0 and here is a power series centered at 1: 1 X (−1)n+1 1 1 1 (x − 1)n = (x − 1) − (x − 1)2 + (x − 1)3 − (x − 1)4 + :::: n 2 3 4 n=1 The power series in Definition 6.1 is a formal expression, since we have not said anything about its convergence. By changing variables x 7! (x − c), we can assume without loss of generality that a power series is centered at 0, and we will do so when it's convenient. 6.2. Radius of convergence First, we prove that every power series has a radius of convergence. Theorem 6.2. Let X1 n an(x − c) n=0 be a power series. There is an 0 ≤ R ≤ 1 such that the series converges absolutely for 0 ≤ jx − cj < R and diverges for jx − cj > R. Furthermore, if 0 ≤ ρ < R, then the power series converges uniformly on the interval jx − cj ≤ ρ, and the sum of the series is continuous in jx − cj < R. Proof. Assume without loss of generality that c = 0 (otherwise, replace x by x−c). Suppose the power series X1 n anx0 n=0 converges for some x0 2 R with x0 =6 0. Then its terms converge to zero, so they are bounded and there exists M ≥ 0 such that j nj ≤ anx0 M for n = 0; 1; 2;:::: If jxj < jx j, then 0 n n n x n x janx j = janx j ≤ Mr ; r = < 1: 0 x x 0 0 P n ComparingP the power series with the convergent geometric series Mr , we see n that anx is absolutely convergent. Thus, if the power series converges for some x0 2 R, then it converges absolutely for every x 2 R with jxj < jx0j. 6.2. Radius of convergence 75 Let n X o n R = sup jxj ≥ 0 : anx converges : If R = 0, then the series converges only for x = 0. If R > 0, then the series converges absolutely for every x 2 R with jxj < R, because it converges for some x0 2 R with jxj < jx0j < R. Moreover, the definition of R implies that the series diverges for every x 2 R with jxj > R. If R = 1, then the series converges for all x 2 R. Finally,P let 0 ≤ ρ < R and suppose jxj ≤ ρ. Choose σ > 0 such that ρ < σ < R. n n Then janσ j converges, so janσ j ≤ M, and therefore n n n n x n ρ n janx j = janσ j ≤ janσ j ≤ Mr ; P σ σ where r = ρ/σ < 1. Since Mrn < 1, the M-test (Theorem 5.22) implies that the series converges uniformly on jxj ≤ ρ, and then it follows from Theorem 5.16 that the sum is continuous on jxj ≤ ρ. Since this holds for every 0 ≤ ρ < R, the sum is continuous in jxj < R. The following definition therefore makes sense for every power series. Definition 6.3. If the power series X1 n an(x − c) n=0 converges for jx − cj < R and diverges for jx − cj > R, then 0 ≤ R ≤ 1 is called the radius of convergence of the power series. Theorem 6.2 does not say what happens at the endpoints x = c ± R, and in general the power series may converge or diverge there. We refer to the set of all points where the power series converges as its interval of convergence, which is one of (c − R; c + R); (c − R; c + R]; [c − R; c + R); [c − R; c + R]: We will not discuss any general theorems about the convergence of power series at the endpoints (e.g. the Abel theorem). Theorem 6.2 does not give an explicit expression for the radius of convergence of a power series in terms of its coefficients. The ratio test gives a simple, but useful, way to compute the radius of convergence, although it doesn't apply to every power series. Theorem 6.4. Suppose that a =6 0 for all sufficiently large n and the limit n a R = lim n !1 n an+1 exists or diverges to infinity. Then the power series X1 n an(x − c) n=0 has radius of convergence R. 76 6. Power Series Proof. Let a (x − c)n+1 a r = lim n+1 = jx − cj lim n+1 : !1 n !1 n an(x − c) n an By the ratio test, the power series converges if 0 ≤ r < 1, or jx − cj < R, and diverges if 1 < r ≤ 1, or jx − cj > R, which proves the result. The root test gives an expression for the radius of convergence of a general power series. Theorem 6.5 (Hadamard). The radius of convergence R of the power series X1 n an(x − c) n=0 is given by 1 R = j j1=n lim supn!1 an where R = 0 if the lim sup diverges to 1, and R = 1 if the lim sup is 0. Proof. Let n 1=n 1=n r = lim sup jan(x − c) j = jx − cj lim sup janj : n!1 n!1 By the root test, the series converges if 0 ≤ r < 1, or jx − cj < R, and diverges if 1 < r ≤ 1, or jx − cj > R, which proves the result. This theorem provides an alternate proof of Theorem 6.2 from the root test; in fact, our proof of Theorem 6.2 is more-or-less a proof of the root test. 6.3. Examples of power series We consider a number of examples of power series and their radii of convergence. Example 6.6. The geometric series X1 xn = 1 + x + x2 + ::: n=0 has radius of convergence 1 R = lim = 1: n!1 1 so it converges for jxj < 1, to 1=(1 − x), and diverges for jxj > 1. At x = 1, the series becomes 1 + 1 + 1 + 1 + ::: and at x = −1 it becomes 1 − 1 + 1 − 1 + 1 − :::; so the series diverges at both endpoints x = ±1. Thus, the interval of convergence of the power series is (−1; 1). The series converges uniformly on [−ρ, ρ] for every 0 ≤ ρ < 1 but does not converge uniformly on (−1; 1) (see Example 5.20. Note that although the function 1=(1 − x) is well-defined for all x =6 1, the power series only converges to it when jxj < 1. 6.3. Examples of power series 77 Example 6.7. The series 1 X 1 1 1 1 xn = x + x2 + x3 + x4 + ::: n 2 3 4 n=1 has radius of convergence ( ) 1=n 1 R = lim = lim 1 + = 1: n!1 1=(n + 1) n!1 n At x = 1, the series becomes the harmonic series 1 X 1 1 1 1 = 1 + + + + :::; n 2 3 4 n=1 which diverges, and at x = −1 it is minus the alternating harmonic series 1 X (−1)n 1 1 1 = −1 + − + − :::; n 2 3 4 n=1 which converges, but not absolutely. Thus the interval of convergence of the power series is [−1; 1). The series converges uniformly on [−ρ, ρ] for every 0 ≤ ρ < 1 but does not converge uniformly on (−1; 1). Example 6.8. The power series 1 X 1 1 1 xn = 1 + x + x + x3 + ::: n! 2! 3! n=0 has radius of convergence 1=n! (n + 1)! R = lim = lim = lim (n + 1) = 1; n!1 1=(n + 1)! n!1 n! n!1 so it converges for all x 2 R. Its sum provides a definition of the exponential function exp : R ! R. (See Section 6.5.) Example 6.9.
Recommended publications
  • A Combinatorial Game Theoretic Analysis of Chess Endgames

    A Combinatorial Game Theoretic Analysis of Chess Endgames

    A COMBINATORIAL GAME THEORETIC ANALYSIS OF CHESS ENDGAMES QINGYUN WU, FRANK YU,¨ MICHAEL LANDRY 1. Abstract In this paper, we attempt to analyze Chess endgames using combinatorial game theory. This is a challenge, because much of combinatorial game theory applies only to games under normal play, in which players move according to a set of rules that define the game, and the last player to move wins. A game of Chess ends either in a draw (as in the game above) or when one of the players achieves checkmate. As such, the game of chess does not immediately lend itself to this type of analysis. However, we found that when we redefined certain aspects of chess, there were useful applications of the theory. (Note: We assume the reader has a knowledge of the rules of Chess prior to reading. Also, we will associate Left with white and Right with black). We first look at positions of chess involving only pawns and no kings. We treat these as combinatorial games under normal play, but with the modification that creating a passed pawn is also a win; the assumption is that promoting a pawn will ultimately lead to checkmate. Just using pawns, we have found chess positions that are equal to the games 0, 1, 2, ?, ", #, and Tiny 1. Next, we bring kings onto the chessboard and construct positions that act as game sums of the numbers and infinitesimals we found. The point is that these carefully constructed positions are games of chess played according to the rules of chess that act like sums of combinatorial games under normal play.
  • Abel's Identity, 131 Abel's Test, 131–132 Abel's Theorem, 463–464 Absolute Convergence, 113–114 Implication of Condi

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

    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
  • Calculus and Differential Equations II

    Calculus and Differential Equations II

    Calculus and Differential Equations II MATH 250 B Sequences and series Sequences and series Calculus and Differential Equations II Sequences A sequence is an infinite list of numbers, s1; s2;:::; sn;::: , indexed by integers. 1n Example 1: Find the first five terms of s = (−1)n , n 3 n ≥ 1. Example 2: Find a formula for sn, n ≥ 1, given that its first five terms are 0; 2; 6; 14; 30. Some sequences are defined recursively. For instance, sn = 2 sn−1 + 3, n > 1, with s1 = 1. If lim sn = L, where L is a number, we say that the sequence n!1 (sn) converges to L. If such a limit does not exist or if L = ±∞, one says that the sequence diverges. Sequences and series Calculus and Differential Equations II Sequences (continued) 2n Example 3: Does the sequence converge? 5n 1 Yes 2 No n 5 Example 4: Does the sequence + converge? 2 n 1 Yes 2 No sin(2n) Example 5: Does the sequence converge? n Remarks: 1 A convergent sequence is bounded, i.e. one can find two numbers M and N such that M < sn < N, for all n's. 2 If a sequence is bounded and monotone, then it converges. Sequences and series Calculus and Differential Equations II Series A series is a pair of sequences, (Sn) and (un) such that n X Sn = uk : k=1 A geometric series is of the form 2 3 n−1 k−1 Sn = a + ax + ax + ax + ··· + ax ; uk = ax 1 − xn One can show that if x 6= 1, S = a .
  • Ch. 15 Power Series, Taylor Series

    Ch. 15 Power Series, Taylor Series

    Ch. 15 Power Series, Taylor Series 서울대학교 조선해양공학과 서유택 2017.12 ※ 본 강의 자료는 이규열, 장범선, 노명일 교수님께서 만드신 자료를 바탕으로 일부 편집한 것입니다. Seoul National 1 Univ. 15.1 Sequences (수열), Series (급수), Convergence Tests (수렴판정) Sequences: Obtained by assigning to each positive integer n a number zn z . Term: zn z1, z 2, or z 1, z 2 , or briefly zn N . Real sequence (실수열): Sequence whose terms are real Convergence . Convergent sequence (수렴수열): Sequence that has a limit c limznn c or simply z c n . For every ε > 0, we can find N such that Convergent complex sequence |zn c | for all n N → all terms zn with n > N lie in the open disk of radius ε and center c. Divergent sequence (발산수열): Sequence that does not converge. Seoul National 2 Univ. 15.1 Sequences, Series, Convergence Tests Convergence . Convergent sequence: Sequence that has a limit c Ex. 1 Convergent and Divergent Sequences iin 11 Sequence i , , , , is convergent with limit 0. n 2 3 4 limznn c or simply z c n Sequence i n i , 1, i, 1, is divergent. n Sequence {zn} with zn = (1 + i ) is divergent. Seoul National 3 Univ. 15.1 Sequences, Series, Convergence Tests Theorem 1 Sequences of the Real and the Imaginary Parts . A sequence z1, z2, z3, … of complex numbers zn = xn + iyn converges to c = a + ib . if and only if the sequence of the real parts x1, x2, … converges to a . and the sequence of the imaginary parts y1, y2, … converges to b. Ex.
  • Topic 7 Notes 7 Taylor and Laurent Series

    Topic 7 Notes 7 Taylor and Laurent Series

    Topic 7 Notes Jeremy Orloff 7 Taylor and Laurent series 7.1 Introduction We originally defined an analytic function as one where the derivative, defined as a limit of ratios, existed. We went on to prove Cauchy's theorem and Cauchy's integral formula. These revealed some deep properties of analytic functions, e.g. the existence of derivatives of all orders. Our goal in this topic is to express analytic functions as infinite power series. This will lead us to Taylor series. When a complex function has an isolated singularity at a point we will replace Taylor series by Laurent series. Not surprisingly we will derive these series from Cauchy's integral formula. Although we come to power series representations after exploring other properties of analytic functions, they will be one of our main tools in understanding and computing with analytic functions. 7.2 Geometric series Having a detailed understanding of geometric series will enable us to use Cauchy's integral formula to understand power series representations of analytic functions. We start with the definition: Definition. A finite geometric series has one of the following (all equivalent) forms. 2 3 n Sn = a(1 + r + r + r + ::: + r ) = a + ar + ar2 + ar3 + ::: + arn n X = arj j=0 n X = a rj j=0 The number r is called the ratio of the geometric series because it is the ratio of consecutive terms of the series. Theorem. The sum of a finite geometric series is given by a(1 − rn+1) S = a(1 + r + r2 + r3 + ::: + rn) = : (1) n 1 − r Proof.
  • Arxiv:1207.1472V2 [Math.CV]

    Arxiv:1207.1472V2 [Math.CV]

    SOME SIMPLIFICATIONS IN THE PRESENTATIONS OF COMPLEX POWER SERIES AND UNORDERED SUMS OSWALDO RIO BRANCO DE OLIVEIRA Abstract. This text provides very easy and short proofs of some basic prop- erties of complex power series (addition, subtraction, multiplication, division, rearrangement, composition, differentiation, uniqueness, Taylor’s series, Prin- ciple of Identity, Principle of Isolated Zeros, and Binomial Series). This is done by simplifying the usual presentation of unordered sums of a (countable) family of complex numbers. All the proofs avoid formal power series, double series, iterated series, partial series, asymptotic arguments, complex integra- tion theory, and uniform continuity. The use of function continuity as well as epsilons and deltas is kept to a mininum. Mathematics Subject Classification: 30B10, 40B05, 40C15, 40-01, 97I30, 97I80 Key words and phrases: Power Series, Multiple Sequences, Series, Summability, Complex Analysis, Functions of a Complex Variable. Contents 1. Introduction 1 2. Preliminaries 2 3. Absolutely Convergent Series and Commutativity 3 4. Unordered Countable Sums and Commutativity 5 5. Unordered Countable Sums and Associativity. 9 6. Sum of a Double Sequence and The Cauchy Product 10 7. Power Series - Algebraic Properties 11 8. Power Series - Analytic Properties 14 References 17 arXiv:1207.1472v2 [math.CV] 27 Jul 2012 1. Introduction The objective of this work is to provide a simplification of the theory of un- ordered sums of a family of complex numbers (in particular, for a countable family of complex numbers) as well as very easy proofs of basic operations and properties concerning complex power series, such as addition, scalar multiplication, multipli- cation, division, rearrangement, composition, differentiation (see Apostol [2] and Vyborny [21]), Taylor’s formula, principle of isolated zeros, uniqueness, principle of identity, and binomial series.
  • INFINITE SERIES in P-ADIC FIELDS

    INFINITE SERIES in P-ADIC FIELDS

    INFINITE SERIES IN p-ADIC FIELDS KEITH CONRAD 1. Introduction One of the major topics in a course on real analysis is the representation of functions as power series X n anx ; n≥0 where the coefficients an are real numbers and the variable x belongs to R. In these notes we will develop the theory of power series over complete nonarchimedean fields. Let K be a field that is complete with respect to a nontrivial nonarchimedean absolute value j · j, such as Qp with its absolute value j · jp. We will look at power series over K (that is, with coefficients in K) and a variable x coming from K. Such series share some properties in common with real power series: (1) There is a radius of convergence R (a nonnegative real number, or 1), for which there is convergence at x 2 K when jxj < R and not when jxj > R. (2) A power series is uniformly continuous on each closed disc (of positive radius) where it converges. (3) A power series can be differentiated termwise in its disc of convergence. There are also some contrasts: (1) The convergence of a power series at its radius of convergence R does not exhibit mixed behavior: it is either convergent at all x with jxj = R or not convergent at P n all x with jxj = R, unlike n≥1 x =n on R, where R = 1 and there is convergence at x = −1 but not at x = 1. (2) A power series can be expanded around a new point in its disc of convergence and the new series has exactly the same disc of convergence as the original series.
  • 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.
  • Formal Power Series - Wikipedia, the Free Encyclopedia

    Formal Power Series - Wikipedia, the Free Encyclopedia

    Formal power series - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Formal_power_series Formal power series From Wikipedia, the free encyclopedia In mathematics, formal power series are a generalization of polynomials as formal objects, where the number of terms is allowed to be infinite; this implies giving up the possibility to substitute arbitrary values for indeterminates. This perspective contrasts with that of power series, whose variables designate numerical values, and which series therefore only have a definite value if convergence can be established. Formal power series are often used merely to represent the whole collection of their coefficients. In combinatorics, they provide representations of numerical sequences and of multisets, and for instance allow giving concise expressions for recursively defined sequences regardless of whether the recursion can be explicitly solved; this is known as the method of generating functions. Contents 1 Introduction 2 The ring of formal power series 2.1 Definition of the formal power series ring 2.1.1 Ring structure 2.1.2 Topological structure 2.1.3 Alternative topologies 2.2 Universal property 3 Operations on formal power series 3.1 Multiplying series 3.2 Power series raised to powers 3.3 Inverting series 3.4 Dividing series 3.5 Extracting coefficients 3.6 Composition of series 3.6.1 Example 3.7 Composition inverse 3.8 Formal differentiation of series 4 Properties 4.1 Algebraic properties of the formal power series ring 4.2 Topological properties of the formal power series
  • 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.
  • 1 Approximating Integrals Using Taylor Polynomials 1 1.1 Definitions

    1 Approximating Integrals Using Taylor Polynomials 1 1.1 Definitions

    Seunghee Ye Ma 8: Week 7 Nov 10 Week 7 Summary This week, we will learn how we can approximate integrals using Taylor series and numerical methods. Topics Page 1 Approximating Integrals using Taylor Polynomials 1 1.1 Definitions . .1 1.2 Examples . .2 1.3 Approximating Integrals . .3 2 Numerical Integration 5 1 Approximating Integrals using Taylor Polynomials 1.1 Definitions When we first defined the derivative, recall that it was supposed to be the \instantaneous rate of change" of a function f(x) at a given point c. In other words, f 0 gives us a linear approximation of f(x) near c: for small values of " 2 R, we have f(c + ") ≈ f(c) + "f 0(c) But if f(x) has higher order derivatives, why stop with a linear approximation? Taylor series take this idea of linear approximation and extends it to higher order derivatives, giving us a better approximation of f(x) near c. Definition (Taylor Polynomial and Taylor Series) Let f(x) be a Cn function i.e. f is n-times continuously differentiable. Then, the n-th order Taylor polynomial of f(x) about c is: n X f (k)(c) T (f)(x) = (x − c)k n k! k=0 The n-th order remainder of f(x) is: Rn(f)(x) = f(x) − Tn(f)(x) If f(x) is C1, then the Taylor series of f(x) about c is: 1 X f (k)(c) T (f)(x) = (x − c)k 1 k! k=0 Note that the first order Taylor polynomial of f(x) is precisely the linear approximation we wrote down in the beginning.
  • The Discovery of the Series Formula for Π by Leibniz, Gregory and Nilakantha Author(S): Ranjan Roy Source: Mathematics Magazine, Vol

    The Discovery of the Series Formula for Π by Leibniz, Gregory and Nilakantha Author(S): Ranjan Roy Source: Mathematics Magazine, Vol

    The Discovery of the Series Formula for π by Leibniz, Gregory and Nilakantha Author(s): Ranjan Roy Source: Mathematics Magazine, Vol. 63, No. 5 (Dec., 1990), pp. 291-306 Published by: Mathematical Association of America Stable URL: http://www.jstor.org/stable/2690896 Accessed: 27-02-2017 22:02 UTC JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at http://about.jstor.org/terms Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to Mathematics Magazine This content downloaded from 195.251.161.31 on Mon, 27 Feb 2017 22:02:42 UTC All use subject to http://about.jstor.org/terms ARTICLES The Discovery of the Series Formula for 7r by Leibniz, Gregory and Nilakantha RANJAN ROY Beloit College Beloit, WI 53511 1. Introduction The formula for -r mentioned in the title of this article is 4 3 57 . (1) One simple and well-known moderm proof goes as follows: x I arctan x = | 1 +2 dt x3 +5 - +2n + 1 x t2n+2 + -w3 - +(-I)rl2n+1 +(-I)l?lf dt. The last integral tends to zero if Ix < 1, for 'o t+2dt < jt dt - iX2n+3 20 as n oo.