DOCSLIB.ORG

Sequences and Series of Functions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Sequences and Series of Functions 7 Sequences and Series of Functions HW7: Page 165: 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 16, 18, 19, 20, 22 7.1 DISCUSSION OF MAIN PROBLEM 7.1 Convergence Pointwise: Suppose f , n =1, 2, 3,..., is a sequence of functions { n} defined on a set E, and suppose that the sequence of numbers fn(x) converges for every x E. We can then define a function f by { } 2 f(x)= lim fn(x),xE. n !1 2 We say that f is the limit of f , or f converges to f pointwise on E. { n} { n} Similarly, if f (x) converges for every x E, and if we define n 2 P 1 f(x)= f (x),xE, n 2 n=1 X we say that the function f is the sum of the series fn. Problems: The main problem which arises is to determineP whether important prop- • erties of functions are preserved under the limit operations above. For instance, if the functions fn are continuous, or di↵erentiable, or integrable, is the same true of the limit function f? What are the relations between fn0 and f 0, say, or between the integrals of fn and that of f? To say that f is continuous at a limit point x means lim f(t)=f(x). t x ! 81 82 7 SEQUENCES AND SERIES OF FUNCTIONS Hence, to ask whether the limit of a sequence of continuous functions is continuous is the same as to ask whether lim lim fn(t)= lim lim fn(t), t x n n t x ! !1 !1 ! i.e., whether the orders in which limit processes are carried out can be inter-changed: on the left, we first let n ,thent x; on the right side, t x first, then n . !1 ! ! !1 7.2 Example For m =1, 2, 3,..., n =1, 2, 3,...,let m s = . m,n m + n Then, for each fixed n, lim sm,n =1, m !1 so that lim lim sm,n =1. n m !1 !1 On the other hand, for every fixed m, lim sm,n =0, n !1 so that lim lim sm,n =0. m n !1 !1 7.3 Example For real x,let x2 f (x)= ,n=1, 2, 3,.... n (1 + x2)n and consider 1 1 x2 f(x)= f (x)= . n (1 + x2)n n=0 n=0 X X 2 Since fn(0) = 0, we have f(0) = 0. For x = 0, the last series converges to 1 + x . Hence 6 0,x=0, f(x)= 1+x2 x =0. ⇢ 6 This example shows that a convergent series of continuous functions may have a discontinuous sum. 7.5 Example For real x,let sin nx f (x)= ,n=1, 2, 3,..., n pn 7.2 UNIFORM CONVERGENCE 83 and f(x)= lim fn(x)=0 n !1 Then f 0(x) = 0, and fn0 (x)=pn cos nx, so that f 0 does not converge to f 0. { n} 7.6 Example For 0 x 1, let f (x)=nx(1 x2)n,n=1, 2, 3,.... n − For 0 <x 1, it is clear that lim fn(x)=0. n !1 For x = 0, fn(0) = 0. Hence lim fn(x)=0, 0 x 1. n !1 It is easy to calculate 1 n f (x)dx = . n 2n +2 Z0 Thus, 1 1 1 lim fn(x)dx = =0= lim fn(x) dx. n 0 2 6 0 n !1 Z Z h !1 i 7.2 UNIFORM CONVERGENCE 7.7 Uniform Convergence: A sequence of functions fn converges uniformly on E to a function f if for every ✏>0, there is an integer{N }such that n N implies ≥ f (x) f(x) <✏ | n − | for all x E. 2 Aseries f (x) converges uniformly on E if the sequence s of partial sums, n { n} P n sn(x)= fi(x), i=1 X converges uniformly on E. It is clear that if fn converges uniformly to f on E,then fn converges pointwise • to f on E. { } { } 7.8 Theorem (Cauchy Criterion) The sequence of functions fn , defined on E, converges uniformly on E if and only if for every ✏>0 there{ exists} an integer N such that m, n N implies ≥ f (x) f (x) <✏ | n − m | 84 7 SEQUENCES AND SERIES OF FUNCTIONS for all x E. 2 Proof Suppose the Cauchy condition holds. By Theorem 3.11, the sequence fn(x) converges for each fixed x to a limit which we may call f(x). Hence the sequence{ } fn converges to f on E. Let ✏>0 be given. There is an integer N such that m,{ n} N implies ≥ f (x) f (x) <✏/2. | n − m | If we let m in the inequality, by Theorem 3.19, we have !1 f (x) f(x) ✏/2 <✏, n N, | n − | ≥ for all x E.Thus f converges uniformly to f. 2 { n} Conversely, suppose fn converges uniformly to f on E. Then, for any ✏>0, there is an integer N such{ that} n N implies ≥ f (x) f(x) <✏/2 | n − | for all x E. Hence, if n, m N,wehave 2 ≥ f (x) f (x) f (x) f(x) + f (x) f(x) <✏ | n − m || n − | | m − | for all x E. 2 7.9 Theorem Suppose f converges to f on E.Put { n} Mn =sup fn(x) f(x) . x E | − | 2 Then f converges uniformly to f on E if and only if M 0 as n . { n} n ! !1 Proof The proof is straightforward. 7.10 Theorem (Weierstrass M-Test) Suppose fn is a sequence of functions defined on E satisfying { } f (x) M ,n=1, 2, 3,..., | n | n for all x E.Then f converges uniformly on E if M converges. 2 n n Proof If Mn converges,P then, for any ✏>0, thereP is an integer N such that m n N implies ≥ ≥ P m Mi <✏. i=n X Hence, if m n N, ≥ ≥ m m fi(x) Mi <✏, i=n i=n X X for all x E. It follows from Theorem 7.8 that f converges uniformly to f on n E. 2 { } 7.3 UNIFORM CONVERGENCE AND CONTINUITY 85 7.3 UNIFORM CONVERGENCE AND CONTINUITY 7.11 Theorem Suppose fn f uniformly on a set E in a metric space. Let x be a limit point of E, and suppose! that lim fn(t)=An,n=1, 2, 3,.... t x ! Then A converges, and { n} lim f(t)= lim An. t x n ! !1 In other words, lim lim fn(t)= lim lim fn(t). t x n n t x ! !1 !1 ! Proof Let ✏>0 be given. Since fn converges uniformly on E, there exists an integer N such that n, m N implies{ } ≥ f (t) f (t) <✏, | n − m | for all t E. Letting t x,wehave 2 ! A A ✏, | n − m| form n, m N. Hence, An is a Cauchy sequence, and therefore converges, say to A. ≥ { } From the inequality f(t) A f(t) f (t) + f (t) A + A A , | − || − n | | n − n| | n − | we now give the estimates for the terms on the right hand side. In fact, since fn f uniformly, we can choose n sufficiently large such that ! f(t) f (t) <✏/3 | − n | for all t E, and such that 2 A A <✏/3. | n − | For this large n, by a condition in the theorem, we can choose a neighborhood V of x such that f (t) A <✏/3 | n − n| if t V E, t = x. Thus, we know that for t V E, t = x, 2 \ 6 2 \ 6 f(t) A <✏. | − | That is, lim f(t)=A =limAn. t x n ! !1 7.12 Theorem If fn is a sequence of continuous functions on E, and if fn f uniformly on E,then{ } f is continuous. ! 86 7 SEQUENCES AND SERIES OF FUNCTIONS Proof By Theorem 7.11, for every t E,wehave 2 lim f(t)=lim lim fn(t)= lim lim fn(t)= lim fn(x)=f(x). t x t x n n t x n ! ! !1 !1 ! !1 Thus, f is continuous on E 7.13 Theorem Suppose K is compact, and (a) f is a sequence of continuous functions on K, { n} (b) f converges pointwise to a continuous function f on K, { n} (c) f (x) f (x) for all x K, n =1, 2, 3,.... n ≥ n+1 2 Then f f uniformly on K. n ! Proof Put gn = fn f.Thengn is continuous, gn 0, and gn gn+1.Wehaveto prove that g 0 uniformly− on K. ! ≥ n ! Let ✏>0 be given. Write K = x K : g (x) ✏ ,n=1, 2, 3,.... n { 2 n ≥ } Since g is continuous, by Theorem 4.8, K K is closed for each n. By Theorem n n ⇢ 2.35, Kn is compact. Since gn gn+1, we know that Kn Kn+1.Fixx K,since g (x) 0, we see that x K ≥if n is sufficiently large. Hence⊃ x K 2. In other n ! 62 n 62 n words, Kn is empty. Hence KN is empty for some N, by Theorem 2.36. It follows T that 0 gn(x) <✏for all x K and all n N. This proves the theorem. T 2 ≥ 1 Example Consider f (x)= on (0, 1). It is clear that f is continuous • n nx +1 n on (0, 1), fn(x) 0 on (0, 1), and fn fn+1.
Load more

Recommended publications
  • 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.
    [Show full text]
  • A Quotient Rule Integration by Parts Formula Jennifer Switkes ([email protected]), California State Polytechnic Univer- Sity, Pomona, CA 91768
    A Quotient Rule Integration by Parts Formula Jennifer Switkes ([email protected]), California State Polytechnic Univer- sity, Pomona, CA 91768 In a recent calculus course, I introduced the technique of Integration by Parts as an integration rule corresponding to the Product Rule for differentiation. I showed my students the standard derivation of the Integration by Parts formula as presented in [1]: By the Product Rule, if f (x) and g(x) are differentiable functions, then d f (x)g(x) = f (x)g(x) + g(x) f (x). dx Integrating on both sides of this equation, f (x)g(x) + g(x) f (x) dx = f (x)g(x), which may be rearranged to obtain f (x)g(x) dx = f (x)g(x) − g(x) f (x) dx. Letting U = f (x) and V = g(x) and observing that dU = f (x) dx and dV = g(x) dx, we obtain the familiar Integration by Parts formula UdV= UV − VdU. (1) My student Victor asked if we could do a similar thing with the Quotient Rule. While the other students thought this was a crazy idea, I was intrigued. Below, I derive a Quotient Rule Integration by Parts formula, apply the resulting integration formula to an example, and discuss reasons why this formula does not appear in calculus texts. By the Quotient Rule, if f (x) and g(x) are differentiable functions, then ( ) ( ) ( ) − ( ) ( ) d f x = g x f x f x g x . dx g(x) [g(x)]2 Integrating both sides of this equation, we get f (x) g(x) f (x) − f (x)g(x) = dx.
    [Show full text]
  • Operations on Power Series Related to Taylor Series
    Operations on Power Series Related to Taylor Series In this problem, we perform elementary operations on Taylor series – term by term differen­ tiation and integration – to obtain new examples of power series for which we know their sum. Suppose that a function f has a power series representation of the form: 1 2 X n f(x) = a0 + a1(x − c) + a2(x − c) + · · · = an(x − c) n=0 convergent on the interval (c − R; c + R) for some R. The results we use in this example are: • (Differentiation) Given f as above, f 0(x) has a power series expansion obtained by by differ­ entiating each term in the expansion of f(x): 1 0 X n−1 f (x) = a1 + a2(x − c) + 2a3(x − c) + · · · = nan(x − c) n=1 • (Integration) Given f as above, R f(x) dx has a power series expansion obtained by by inte­ grating each term in the expansion of f(x): 1 Z a1 a2 X an f(x) dx = C + a (x − c) + (x − c)2 + (x − c)3 + · · · = C + (x − c)n+1 0 2 3 n + 1 n=0 for some constant C depending on the choice of antiderivative of f. Questions: 1. Find a power series representation for the function f(x) = arctan(5x): (Note: arctan x is the inverse function to tan x.) 2. Use power series to approximate Z 1 2 sin(x ) dx 0 (Note: sin(x2) is a function whose antiderivative is not an elementary function.) Solution: 1 For question (1), we know that arctan x has a simple derivative: , which then has a power 1 + x2 1 2 series representation similar to that of , where we subsitute −x for x.
    [Show full text]
  • Derivative of Power Series and Complex Exponential
    LECTURE 4: DERIVATIVE OF POWER SERIES AND COMPLEX EXPONENTIAL The reason of dealing with power series is that they provide examples of analytic functions. P1 n Theorem 1. If n=0 anz has radius of convergence R > 0; then the function P1 n F (z) = n=0 anz is di®erentiable on S = fz 2 C : jzj < Rg; and the derivative is P1 n¡1 f(z) = n=0 nanz : Proof. (¤) We will show that j F (z+h)¡F (z) ¡ f(z)j ! 0 as h ! 0 (in C), whenever h ¡ ¢ n Pn n k n¡k jzj < R: Using the binomial theorem (z + h) = k=0 k h z we get F (z + h) ¡ F (z) X1 (z + h)n ¡ zn ¡ hnzn¡1 ¡ f(z) = a h n h n=0 µ ¶ X1 a Xn n = n ( hkzn¡k) h k n=0 k=2 µ ¶ X1 Xn n = a h( hk¡2zn¡k) n k n=0 k=2 µ ¶ X1 Xn¡2 n = a h( hjzn¡2¡j) (by putting j = k ¡ 2): n j + 2 n=0 j=0 ¡ n ¢ ¡n¡2¢ By using the easily veri¯able fact that j+2 · n(n ¡ 1) j ; we obtain µ ¶ F (z + h) ¡ F (z) X1 Xn¡2 n ¡ 2 j ¡ f(z)j · jhj n(n ¡ 1)ja j( jhjjjzjn¡2¡j) h n j n=0 j=0 X1 n¡2 = jhj n(n ¡ 1)janj(jzj + jhj) : n=0 P1 n¡2 We already know that the series n=0 n(n ¡ 1)janjjzj converges for jzj < R: Now, for jzj < R and h ! 0 we have jzj + jhj < R eventually.
    [Show full text]
  • 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
    [Show full text]
  • 20-Finding Taylor Coefficients
    Taylor Coefficients Learning goal: Let’s generalize the process of finding the coefficients of a Taylor polynomial. Let’s find a general formula for the coefficients of a Taylor polynomial. (Students complete worksheet series03 (Taylor coefficients).) 2 What we have discovered is that if we have a polynomial C0 + C1x + C2x + ! that we are trying to match values and derivatives to a function, then when we differentiate it a bunch of times, we 0 get Cnn!x + Cn+1(n+1)!x + !. Plugging in x = 0 and everything except Cnn! goes away. So to (n) match the nth derivative, we must have Cn = f (0)/n!. If we want to match the values and derivatives at some point other than zero, we will use the 2 polynomial C0 + C1(x – a) + C2(x – a) + !. Then when we differentiate, we get Cnn! + Cn+1(n+1)!(x – a) + !. Now, plugging in x = a makes everything go away, and we get (n) Cn = f (a)/n!. So we can generate a polynomial of any degree (well, as long as the function has enough derivatives!) that will match the function and its derivatives to that degree at a particular point a. We can also extend to create a power series called the Taylor series (or Maclaurin series if a is specifically 0). We have natural questions: • For what x does the series converge? • What does the series converge to? Is it, hopefully, f(x)? • If the series converges to the function, we can use parts of the series—Taylor polynomials—to approximate the function, at least nearby a.
    [Show full text]
  • The Set of Continuous Functions with Everywhere Convergent Fourier Series
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 302, Number 1, July 1987 THE SET OF CONTINUOUS FUNCTIONS WITH EVERYWHERE CONVERGENT FOURIER SERIES M. AJTAI AND A. S. KECHRIS ABSTRACT. This paper deals with the descriptive set theoretic properties of the class EC of continuous functions with everywhere convergent Fourier se- ries. It is shown that this set is a complete coanalytic set in C(T). A natural coanalytic rank function on EC is studied that assigns to each / € EC a count- able ordinal number, which measures the "complexity" of the convergence of the Fourier series of /. It is shown that there exist functions in EC (in fact even differentiable ones) which have arbitrarily large countable rank, so that this provides a proper hierarchy on EC with uii distinct levels. Let G(T) be the Banach space of continuous 27r-periodic functions on the reals with the sup norm. We study in this paper descriptive set theoretic aspects of the subset EC of G(T) consisting of the continuous functions with everywhere convergent Fourier series. It is easy to verify that EC is a coanalytic set. We show in §3 that EC is actually a complete coanalytic set and therefore in particular is not Borel. This answers a question in [Ku] and provides another example of a coanalytic non-Borel set. We also discuss in §2 (see in addition the Appendix) the relations of this kind of result to the studies in the literature concerning the classification of the set of points of divergence of the Fourier series of a continuous function.
    [Show full text]
  • Calculus of Variations Raju K George, IIST
    Calculus of Variations Raju K George, IIST Lecture-1 In Calculus of Variations, we will study maximum and minimum of a certain class of functions. We first recall some maxima/minima results from the classical calculus. Maxima and Minima Let X and Y be two arbitrary sets and f : X Y be a well-defined function having domain → X and range Y . The function values f(x) become comparable if Y is IR or a subset of IR. Thus, optimization problem is valid for real valued functions. Let f : X IR be a real valued → function having X as its domain. Now x X is said to be maximum point for the function f if 0 ∈ f(x ) f(x) x X. The value f(x ) is called the maximum value of f. Similarly, x X is 0 ≥ ∀ ∈ 0 0 ∈ said to be a minimum point for the function f if f(x ) f(x) x X and in this case f(x ) is 0 ≤ ∀ ∈ 0 the minimum value of f. Sufficient condition for having maximum and minimum: Theorem (Weierstrass Theorem) Let S IR and f : S IR be a well defined function. Then f will have a maximum/minimum ⊆ → under the following sufficient conditions. 1. f : S IR is a continuous function. → 2. S IR is a bound and closed (compact) subset of IR. ⊂ Note that the above conditions are just sufficient conditions but not necessary. Example 1: Let f : [ 1, 1] IR defined by − → 1 x = 0 f(x)= − x x = 0 | | 6 1 −1 +1 −1 Obviously f(x) is not continuous at x = 0.
    [Show full text]
  • Taylor's Series of Sin X
    Taylor's Series of sin x In order to use Taylor's formula to find the power series expansion of sin x we have to compute the derivatives of sin(x): sin0(x) = cos(x) sin00(x) = − sin(x) sin000(x) = − cos(x) sin(4)(x) = sin(x): Since sin(4)(x) = sin(x), this pattern will repeat. Next we need to evaluate the function and its derivatives at 0: sin(0) = 0 sin0(0) = 1 sin00(0) = 0 sin000(0) = −1 sin(4)(0) = 0: Again, the pattern repeats. Taylor's formula now tells us that: −1 sin(x) = 0 + 1x + 0x 2 + x 3 + 0x4 + · · · 3! x3 x5 x7 = x − + − + · · · 3! 5! 7! Notice that the signs alternate and the denominators get very big; factorials grow very fast. The radius of convergence R is infinity; let's see why. The terms in this sum look like: x2n+1 x x x x = · · · · · : (2n + 1)! 1 2 3 (2n + 1) Suppose x is some fixed number. Then as n goes to infinity, the terms on the right in the product above will be very, very small numbers and there will be more and more of them as n increases. In other words, the terms in the series will get smaller as n gets bigger; that's an indication that x may be inside the radius of convergence. But this would be true for any fixed value of x, so the radius of convergence is infinity. Why do we care what the power series expansion of sin(x) is? If we use enough terms of the series we can get a good estimate of the value of sin(x) for any value of x.
    [Show full text]
  • Math 104 – Calculus 10.2 Infinite Series
    Math 104 – Calculus 10.2 Infinite Series Math 104 - Yu InfiniteInfinite series series •• Given a sequence we try to make sense of the infinite Given a sequence we try to make sense of the infinite sum of its terms. sum of its terms. 1 • Example: a = n 2n 1 s = a = 1 1 2 1 1 s = a + a = + =0.75 2 1 2 2 4 1 1 1 s = a + a + a = + + =0.875 3 1 2 3 2 4 8 1 1 s = a + + a = + + =0.996 8 1 ··· 8 2 ··· 256 s20 =0.99999905 Nicolas Fraiman MathMath 104 - Yu 104 InfiniteInfinite series series Math 104 - YuNicolas Fraiman Math 104 Geometric series GeometricGeometric series series • A geometric series is one in which each term is obtained • A geometric series is one in which each term is obtained from the preceding one by multiplying it by the common ratiofrom rthe. preceding one by multiplying it by the common ratio r. 1 n 1 2 3 1 arn−1 = a + ar + ar2 + ar3 + ar − = a + ar + ar + ar + ··· kX=1 ··· kX=1 2 n 1 • DoesWe have not converges for= somea + ar values+ ar of+ r + ar − n ··· 1 2 3 n rsn =n ar1 + ar + ar + + ar r =1then ar − = a + a + a + a···+ n ···!1 sn rsn = a ar −kX=1 − 1 na(11 rn) r = 1 then s ar= − =− a + a a + a a − n 1 −r − − ··· kX=1 − Nicolas Fraiman MathNicolas 104 Fraiman Math 104 - YuMath 104 GeometricGeometric series series Nicolas Fraiman Math 104 - YuMath 104 Geometric series Geometric series 1 1 1 = 4n 3 n=1 X Math 104 - Yu Nicolas Fraiman Math 104 RepeatingRepeatingRepeang decimals decimals decimals • We cancan useuse geometricgeometric series series to to convert convert repeating repeating decimals toto fractions.fractions.
    [Show full text]
  • Calculus of Variations
    Calculus of Variations The biggest step from derivatives with one variable to derivatives with many variables is from one to two. After that, going from two to three was just more algebra and more complicated pictures. Now the step will be from a finite number of variables to an infinite number. That will require a new set of tools, yet in many ways the techniques are not very different from those you know. If you've never read chapter 19 of volume II of the Feynman Lectures in Physics, now would be a good time. It's a classic introduction to the area. For a deeper look at the subject, pick up MacCluer's book referred to in the Bibliography at the beginning of this book. 16.1 Examples What line provides the shortest distance between two points? A straight line of course, no surprise there. But not so fast, with a few twists on the question the result won't be nearly as obvious. How do I measure the length of a curved (or even straight) line? Typically with a ruler. For the curved line I have to do successive approximations, breaking the curve into small pieces and adding the finite number of lengths, eventually taking a limit to express the answer as an integral. Even with a straight line I will do the same thing if my ruler isn't long enough. Put this in terms of how you do the measurement: Go to a local store and purchase a ruler. It's made out of some real material, say brass.
    [Show full text]
  • Tent Cash Flow Designs and Analysis for Gradient Cash Flow Lectures
    Page 8.1095.1 Page 8.1095.2 Page 8.1095.3 Page 8.1095.4 Page 8.1095.5 Page 8.1095.6 Page 8.1095.7 Page 8.1095.8 Page 8.1095.9 Page 8.1095.10 Page 8.1095.11 Page 8.1095.12 Page 8.1095.13 Page 8.1095.14 Page 8.1095.15.
    [Show full text]