MATH 104A HW 02 SOLUTION KEY
|
|
- Godwin Turner
- 5 years ago
- Views:
Transcription
1 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 MATH 04A HW 0 SOLUTION KEY You are encouraged to collaborate with your classmates and utilize internet resources provided you adhere to the following rules: (i) You read the problem carefully and make a serious effort to solve it before you ask for help. (ii) You write the solution in your own words/ handwriting/ L A TEX document. (iii) You credit the people/books/websites who helped you, especially if they showed you how to do most of the problem. (iv) The TA is not omniscient. This course is aimed at developing your deductive reasoning and incredulity. For those who need a quick primer on programming, I highly recommend the python course by It s free and they claim you can learn python in a mere 3 hours..3 Algorithms and Convergence. (a) Use three-digit chopping arithmetic to compute the sum 0 i= (/i ) first by and then by Which method is more accurate, and why? (b) Write an algorithm to sum the finite series N i= x i in reverse order. SOLUTION. (a) Using three-digit chopping arithmetic, = (... (( ) + 0.) +... ) ) =.53, while = (... (( ) ) +... ) +.00) =.54. The actual value is The first sum is less accurate because the smaller numbers are added last, resulting in significant round-off error. (b) Without implementing three-digit chopping arithmetic, the pseudocode is given by Algorithm Calculate i=n x i INPUT: N, x,..., x N OUTPUT: i=n x i : i = N, Σ = 0. (initialize index and sum) : while i > 0 do 3: Σ = Σ + /i. (advance the sum) 4: i = i. (decrement the index) 5: end while 6: return sum.
2 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 We now test the pseudocode to calculate actual value presented in part (a). The python code is listed below from math import f a c t o r i a l # Only i m p o r t what i s n e c e s s a r y # I n i t i a l i z e t h e i n d e x and sum i =0 sum =0.0 w h i l e i >0: sum=sum +.0/( i ) ; # I n c r e m e n t t h e sum i = i # Decrement t h e i n d e x p r i n t sum. The number e is defined by e = n=0 (/n!), where n! = n(n ) for n 0 and 0! =. Use four-digit chopping arithmetic to compute the following approximations to e, and determine the absolute and relative errors. (a) e 5 n=0 n! (c) e 0 n=0 n! (d) e 0 j=0 (0 j)! 5. Another formula for computing π can be deduced from the identity π/4 = 4 arctan 5 arctan 39. Determine the number of terms that must be summed to ensure an approximation to π to within 0 3. SOLUTION. A direct calculation makes it plain that the Maclaurin series for arctan x are given by x x x O(x 6 ), in the language of formal series we obtain: Using the identity: we obtain that π 4 = 4 = 4 k=0 arctan(x) = p k=0 k=0 ( ) k x k + k π 4 = 4 arctan 5 arctan 39, ( ) k ( 5 ) k + k ( ) k ( 5 ) k + k m=0 q m=0 for x <. ( ) m ( 39 ) m + m ( ) m ( 39 ) m + m + Error(p, q) Since the magnitude of the first term dominates the second term, it remains to identify the truncation number p for which the first sum is less than 0 3. Indeed, a direct calculation
3 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 makes it plain that p = 3 is the smallest positive integer that suffices. The computation is routine and we ll spare you the details. 6. Find the rates of convergence of the following sequences as n. (a) (c) lim sin n n lim n = 0 (b) lim n sin n = 0 ( sin ) = 0 (d) lim [ln(n + ) ln(n)] = 0 n n SOLUTION. We first establish a seemingly "apparent" result to tackle parts (a) through (c). That is: 6 x sin(x) 4 π π 0 π π 4 6 To proof this rigorously, put f (x) = sin x x. On the interval (0, ) we see that f (x) = cos(x). Since cos(x) < it follows that f < 0 for all x. By invoking the mean value theorem we see that f is non-increasing on the interval (0, ). Since f is initially 0, i.e., f (0) = 0, it follows that f must be non-positive on the interval (0, ). That is, sin x x 0 on 0 < x <, in other words, sin x x, 0 < x <. () (a) Since 0 < n < for all n Z+, by the result established in () we deduce that sin n < n, () and it is now immediate that sin n O ( n). (b) Since 0 < n < for all n Z +, we obtain: sin n < n, therefore; sin n O ( n ). 3
4 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 (c) By squaring both sides of () we see that sin < n, hence; it follows that ( ) sin n n. (d) Using the identity ln(a) ln(b) = ln( a b ), we see that ( ) n + ln(n + ) ln(n) = ln n Again, by graphing we find: n = ln( + n ). 6 x ln( + x) 4 π π 0 π π 4 6 Now, put g(x) = ln( + x). On the interval (0, ) we see that g (x) = x+. As g (x) < 0 on (0, ), again, by the mean value theorem the original function g is nonincreasing on the interval (0, ), and since g is initially zero, it must be the case that g is non-positive on the interval (0, ). In other words, ln( + x) < x for 0 < x <. Since 0 < n < it follows that ln(n + ) ln(n) = ln( + n ) < n, thus; ln(n + ) ln(n) O ( n). 8. (a) How many multiplication and additions are required to determine a sum of the form n i= i a i b j? (b) Modify the sum in part (a) to an equivalent form that reduces the number of computations. j= 4
5 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 SOLUTION. First, recall the triangular number theorem, that is, Theorem. For every positive integer n, ( ) n n = = n(n + )/. For a rigorous argument see proof of the triangular number theorem. (a) Using the same technique presented in the first proof of the triangular number theorem, we proceed to represent our double summation in triangular form and see that n i= i a i b j = a b j= term + a b + a b -many terms + a 3 b + a 3 b + a 3 b 3 3-many terms. a n b + a n b + + a n b n + a n b n n-many terms, hence; in total, there are n = n(n + )/ many terms. Therefore, there are precisely n(n + )/ multiplications and n(n + )/ = (n + )(n ) many additions. (b) In the triangular representation, we notice the common factor a i in every term on the i-th row. By factoring and first summing over the j indices we see that n i= i a i b j = j= ( n n ) a i b j = j= i= n a i B i. Indeed, instead of i-many multiplications in the i-th row, we now require only one, namely that of a i and B i = b + b i.. Construct an algorithm that has as input an integer n, numbers x 0, x,..., x n, and a number x and that produces as output the product (x x 0 )(x x ) (x x n ). SOLUTION. Algorithm Calculate N i=0 (x x i) = (x x 0 )(x x ) (x x n ) INPUT: N, x = (x 0, x,..., x N ), x OUTPUT: N i=0 (x x i) : i = 0, p = (initialize index and product) : while i N do 3: p = p(x x i ) (advance the product) 4: i = i + (increment the index) 5: end while 6: return p i= 5
6 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04. Assume that 3 x x 4x + x + x x + x + 4x 3 8x 7 4 x 4 + x + = + x 8 + x + x, for x <, and let x = 0.5. Write and execute an algorithm that determines the number of terms needed on the left side of the equation so that the left side differs from the right side by less than 0 6. SOLUTION. Algorithm 3 Calculate INPUT: x, T OL, M OUTPUT: N DEFINITIONS: x M T OL N x x+x + x 4x 3 x +x + 4x 3 8x 7 4 x 4 +x + = +x 8 +x+x within error tolerance 0 6. = The point of evaluation = Maximum number of iterations = The error tolerance = The truncation number required to realize the desired error tolerance : sum = ( x)/( x + x ); : rhs = ( + x)/( + x + x ); 3: N = (initialize index) 4: while N M do 5: j = N 6: y = x j 7: a = jy x ( y) 8: b = y(y ) + 9: sum = sum + a/b (advance the sum) 0: if sum rhs < T OL then : return N : EXIT 3: else 4: N = N + (increment the truncation number) 5: end if 6: end while 7: print "Method failed. Please increase M" 3. (a) Suppose that 0 < q < p and that α n = α + O(n p ). Show that α n = α + O(n q ). 6
7 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 (b) Make a table listing /n, /n, /n 3, and /n 4 for n = 5, 0, 00, and 000, and discuss the varying rates of convergence of these sequences as n becomes large. SOLUTION. First, fix n Z + and put f (x) = n x. By differentiating implicitly we find that f (x) = f (x) ln n. By the familiar argument, that is, by way of the mean value theorem, we deduce that f is non-decreasing on R +. (a) Since α n α O(n p ), it follows by definition that for sufficiently large n there exists some constant K for which α n α K n p. (3) Since 0 < q < p, we see that n p < n q for any n Z +. Using the same K from (3) it is now immediate that α n α K n p K n q, so α n α O(n q ) as required. (b) From the tableau below we see that the most rapid convergence is O(/n 4 ). n /n /n /n 3 /n e e e-03.60e e-0.00e-0.00e-03.00e e-0.00e-04.00e-06.00e e-03.00e-06.00e-09.00e- The corresponding python code is posted below: # Compare t h e v a r y i n g r a t e s o f c o n v e r g e n c e f o r n i n [ 5. 0, 0. 0, , ] : p r i n t "n=%.0 f / n=%. e / n^=%. e " \ "/ n^3=%. e / n^4=%. e " % \ ( n, /n, /( n ), /( n 3 ), /( n 4 ) ) 5. Suppose that as x approaches zero, F (x) = L + O(x α ) and F (x) = L + O(x β ). Let c and c be nonzero constants, and define F (x) = c F (x) + c F (x) G(x) = F (c x) + F (c x). and Show that if γ = min{α, β}, then as x approaches zero, (a) F (x) = c L + c L + O(x γ ) (b) G(x) = L + L + O(x γ ). 7
8 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 SOLUTION. Suppose that for sufficiently small x we have positive constants K, and K independent of our choice of x, for which the following two inequalities hold simultaneously, F (x) L K x α and F (x) L K x β. Now, choose c = max{ c, c, }, K = max{k, K }, and µ = max{α, β}. (a) A direct calculation using the Triangle inequality makes it plain that for sufficiently small x, F (x) c L c L = c (F (x) L ) + c (F (x) L ) c (F (x) L ) + c (F (x) L ) = c (F (x) L ) + c (F (x) L ) c (F (x) L ) + c (F (x) L ) ck x α + ck x β ck x α + ck x β = ck ( x α + x β) ck x γ ( + x µ γ) ck x γ. By putting K = ck, it is now immediate that F (x) c L c L O(x γ ), i.e., as required. F (x) = c L + c L + O(x γ ). (b) Again, for sufficiently small x, the Triangle inequality makes it plain that G(x) L L = F (c x) + F (x x) L L (4) K c x α + K c x β (5) Kc µ ( x α + x β) (6) Kc µ x γ ( + x µ γ) (7) Kc µ x γ. (8) By putting K = Kc µ, it is now immediate that G(x) L L O(x γ ), i.e., G(x) = L + L + O(x γ ). 6. The sequence {F n } described by F 0 =, F =, and F n+ = F n + F n+, if n 0, is called a Fibonacci sequence. Its terms occur naturally in many botanical species, particularly those with petals or scales arranged in the form of a logarithmic spiral. Consider the sequence {x n }, where x n = F n+ /F n. Assuming that lim n x n = x exists, show that x = ( + 5 ) /. This number is called the golden ratio. We highly recommend that you watch the YouTube video by Vi Hart 8
9 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 SOLUTION. Give that x n x as n we see that also, lim x n+ = x = lim x n, n n x n+ = F n+ F n = F n + F n+ F n = F n F n + F n+ F n = + x n, hence; letting n on both sides of our equality, we obtain: In other words, x = + x. x x = 0, whose roots, by means of the quadratic formula, are precisely: x = ( ± 5)/. We choose the positive root as F n > 0 by construction. The python code below generates the smallest Fibonacci number below 000, namely: 597. c l a s s F i b s : # C r e a t e t h e F i b o n a c c i c l a s s def init ( s e l f ) : s e l f. a = 0 s e l f. b = def n e x t ( s e l f ) : s e l f. a, s e l f. b = s e l f. b, s e l f. a+ s e l f. b r e t u r n s e l f. a def iter ( s e l f ) : r e t u r n s e l f f i b s = F i b s ( ) # Make a F i b s o b j e c t # f i n d t h e s m a l l e s t F i b o n a c c i number >=,000 f o r f i n f i b s : i f f > : p r i n t f break Although we did not ask you to prove the convergence of the sequence {x n } n=, we include the proof below for the sake of completeness. Don t worry if you cannot follow the arguments 9
10 .3 Algorithms and Convergence Solutions by Jon Lo Kim Lin - Fall 04 after a first reading as they employ proof techniques from MATH 8. Without further ado, by construction our sequence {x n } is non-decreasing, that is, x n x n+. Also, x n = f n+ f n = f n + f n f n = f n f n + f n f n = f n f n +. Since f n f n for all n, we see that f n /f n, hence; x n, indeed the sequence {x n } is bounded from above. Let E denote the range of the sequence {x n }. By the completeness axiom of the real line, R, our set E must admit a least upper bound (also known as supremum), say x 0. More specifically, for any ε > 0, there exists some positive integer N sufficiently large such that x 0 ε < x N x 0, for otherwise, x 0 ε would be an upper bound for E, thus, contradicting the position of x 0 as the least upper bound. Since our sequence {x n } is non-decreasing, it follows that x 0 ε < x n x 0, as soon as n N. This proves that x n x 0 as n and we establish the existence of a limit as desired. 0
Math 227 Sample Final Examination 1. Name (print) Name (sign) Bing ID number
Math 227 Sample Final Examination 1 Name (print) Name (sign) Bing ID number (Your instructor may check your ID during or after the test) No books, notes, or electronic devices (calculators, cell phones,
More informationMa 530 Power Series II
Ma 530 Power Series II Please note that there is material on power series at Visual Calculus. Some of this material was used as part of the presentation of the topics that follow. Operations on Power Series
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More information8.5 Taylor Polynomials and Taylor Series
8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:
More informationSection 8.7. Taylor and MacLaurin Series. (1) Definitions, (2) Common Maclaurin Series, (3) Taylor Polynomials, (4) Applications.
Section 8.7 Taylor and MacLaurin Series (1) Definitions, (2) Common Maclaurin Series, (3) Taylor Polynomials, (4) Applications. MATH 126 (Section 8.7) Taylor and MacLaurin Series The University of Kansas
More information8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0
8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n
More informationSET 1. (1) Solve for x: (a) e 2x = 5 3x
() Solve for x: (a) e x = 5 3x SET We take natural log on both sides: ln(e x ) = ln(5 3x ) x = 3 x ln(5) Now we take log base on both sides: log ( x ) = log (3 x ln 5) x = log (3 x ) + log (ln(5)) x x
More information1 Question related to polynomials
07-08 MATH00J Lecture 6: Taylor Series Charles Li Warning: Skip the material involving the estimation of error term Reference: APEX Calculus This lecture introduced Taylor Polynomial and Taylor Series
More informationWinter 2014 Practice Final 3/21/14 Student ID
Math 4C Winter 2014 Practice Final 3/21/14 Name (Print): Student ID This exam contains 5 pages (including this cover page) and 20 problems. Check to see if any pages are missing. Enter all requested information
More informationAlgorithms CMSC Homework set #1 due January 14, 2015
Algorithms CMSC-27200 http://alg15.cs.uchicago.edu Homework set #1 due January 14, 2015 Read the homework instructions on the website. The instructions that follow here are only an incomplete summary.
More informationLimits and Infinite Series Lecture Notes for Math 226. Department of Mathematics Western Washington University
Limits and Infinite Series Lecture Notes for Math 226 by Árpád Bényi Department of Mathematics Western Washington University To the student Math 226 is a first introduction to formal arguments in mathematical
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More information7.4 DO (uniqueness of minimum-cost spanning tree) Prove: if all edge weights are distinct then the minimum-cost spanning tree is unique.
Algorithms CMSC-700 http://alg1.cs.uchicago.edu Homework set #7. Posted -19. Due Wednesday, February, 01 The following problems were updated on -0: 7.1(a), 7.1(b), 7.9(b) Read the homework instructions
More informationOutline. Math Numerical Analysis. Intermediate Value Theorem. Lecture Notes Zeros and Roots. Joseph M. Mahaffy,
Outline Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Lecture Notes Zeros and Roots Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center
More informationMATH 124B Solution Key HW 05
7.1 GREEN S FIRST IENTITY MATH 14B Solution Key HW 05 7.1 GREEN S FIRST IENTITY 1. erive the 3-dimensional maximum principle from the mean value property. SOLUTION. We aim to prove that if u is harmonic
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationMath 142, Final Exam, Fall 2006, Solutions
Math 4, Final Exam, Fall 6, Solutions There are problems. Each problem is worth points. SHOW your wor. Mae your wor be coherent and clear. Write in complete sentences whenever this is possible. CIRCLE
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationSection 10.7 Taylor series
Section 10.7 Taylor series 1. Common Maclaurin series 2. s and approximations with Taylor polynomials 3. Multiplication and division of power series Math 126 Enhanced 10.7 Taylor Series The University
More informationMATH 131A: REAL ANALYSIS
MATH 131A: REAL ANALYSIS NICKOLAS ANDERSEN The textbook for the course is Ross, Elementary Analysis [2], but in these notes I have also borrowed from Tao, Analysis I [3], and Abbott, Understanding Analysis
More informationTest 3 - Answer Key Version B
Student s Printed Name: Instructor: CUID: Section: Instructions: You are not permitted to use a calculator on any portion of this test. You are not allowed to use any textbook, notes, cell phone, laptop,
More informationDifferentiation. Table of contents Definition Arithmetics Composite and inverse functions... 5
Differentiation Table of contents. Derivatives................................................. 2.. Definition................................................ 2.2. Arithmetics...............................................
More informationInfinite series, improper integrals, and Taylor series
Chapter 2 Infinite series, improper integrals, and Taylor series 2. Introduction to series In studying calculus, we have explored a variety of functions. Among the most basic are polynomials, i.e. functions
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationMath 128A: Homework 2 Solutions
Math 128A: Homework 2 Solutions Due: June 28 1. In problems where high precision is not needed, the IEEE standard provides a specification for single precision numbers, which occupy 32 bits of storage.
More informationF 2k 1 = F 2n. for all positive integers n.
Question 1 (Fibonacci Identity, 15 points). Recall that the Fibonacci numbers are defined by F 1 = F 2 = 1 and F n+2 = F n+1 + F n for all n 0. Prove that for all positive integers n. n F 2k 1 = F 2n We
More informationIntroductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19
Introductory Analysis I Fall 204 Homework #9 Due: Wednesday, November 9 Here is an easy one, to serve as warmup Assume M is a compact metric space and N is a metric space Assume that f n : M N for each
More informationMATH 1A, Complete Lecture Notes. Fedor Duzhin
MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationb n x n + b n 1 x n b 1 x + b 0
Math Partial Fractions Stewart 7.4 Integrating basic rational functions. For a function f(x), we have examined several algebraic methods for finding its indefinite integral (antiderivative) F (x) = f(x)
More informationHave a Safe and Happy Break
Math 121 Final EF: December 10, 2013 Name Directions: 1 /15 2 /15 3 /15 4 /15 5 /10 6 /10 7 /20 8 /15 9 /15 10 /10 11 /15 12 /20 13 /15 14 /10 Total /200 1. No book, notes, or ouiji boards. You may use
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationSequences of Real Numbers
Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next
More informationFall 2017 November 10, Written Homework 5
CS1800 Discrete Structures Profs. Aslam, Gold, & Pavlu Fall 2017 November 10, 2017 Assigned: Mon Nov 13 2017 Due: Wed Nov 29 2017 Instructions: Written Homework 5 The assignment has to be uploaded to blackboard
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationDifferentiation by taking logarithms
Differentiation by taking logarithms In this unit we look at how we can use logarithms to simplify certain functions before we differentiate them. In order to master the techniques explained here it is
More informationLecture 34: Recall Defn: The n-th Taylor polynomial for a function f at a is: n f j (a) j! + f n (a)
Lecture 34: Recall Defn: The n-th Taylor polynomial for a function f at a is: n f j (a) P n (x) = (x a) j. j! j=0 = f(a)+(f (a))(x a)+(1/2)(f (a))(x a) 2 +(1/3!)(f (a))(x a) 3 +... + f n (a) (x a) n n!
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES Infinite sequences and series were introduced briefly in A Preview of Calculus in connection with Zeno s paradoxes and the decimal representation
More informationFINAL EXAM Math 25 Temple-F06
FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short
More informationIn last semester, we have seen some examples about it (See Tutorial Note #13). Try to have a look on that. Here we try to show more technique.
MATH202 Introduction to Analysis (2007 Fall and 2008 Spring) Tutorial Note #4 Part I: Cauchy Sequence Definition (Cauchy Sequence): A sequence of real number { n } is Cauchy if and only if for any ε >
More informationSection Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence.
Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence. Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence. f n (0)x n Recall from
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationand lim lim 6. The Squeeze Theorem
Limits (day 3) Things we ll go over today 1. Limits of the form 0 0 (continued) 2. Limits of piecewise functions 3. Limits involving absolute values 4. Limits of compositions of functions 5. Limits similar
More information5. Hand in the entire exam booklet and your computer score sheet.
WINTER 2016 MATH*2130 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie 19 April, 2016 INSTRUCTIONS: 1. This is a closed book examination, but a calculator is allowed. The test
More information2010 Maths. Advanced Higher. Finalised Marking Instructions
00 Maths Advanced Higher Finalised Marking Instructions Scottish Qualifications Authority 00 The information in this publication may be reproduced to support SQA qualifications only on a noncommercial
More informationFunctions. Remark 1.2 The objective of our course Calculus is to study functions.
Functions 1.1 Functions and their Graphs Definition 1.1 A function f is a rule assigning a number to each of the numbers. The number assigned to the number x via the rule f is usually denoted by f(x).
More information10.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
10.1 Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1 Examples: EX1: Find a formula for the general term a n of the sequence,
More informationPURE MATHEMATICS AM 27
AM Syllabus (014): Pure Mathematics AM SYLLABUS (014) PURE MATHEMATICS AM 7 SYLLABUS 1 AM Syllabus (014): Pure Mathematics Pure Mathematics AM 7 Syllabus (Available in September) Paper I(3hrs)+Paper II(3hrs)
More informationAP Calculus Chapter 9: Infinite Series
AP Calculus Chapter 9: Infinite Series 9. Sequences a, a 2, a 3, a 4, a 5,... Sequence: A function whose domain is the set of positive integers n = 2 3 4 a n = a a 2 a 3 a 4 terms of the sequence Begin
More information8.7 MacLaurin Polynomials
8.7 maclaurin polynomials 67 8.7 MacLaurin Polynomials In this chapter you have learned to find antiderivatives of a wide variety of elementary functions, but many more such functions fail to have an antiderivative
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
More informationIn case (1) 1 = 0. Then using and from the previous lecture,
Math 316, Intro to Analysis The order of the real numbers. The field axioms are not enough to give R, as an extra credit problem will show. Definition 1. An ordered field F is a field together with a nonempty
More informationSeries Solutions. 8.1 Taylor Polynomials
8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns
More informationNUMERICAL ANALYSIS WEEKLY OVERVIEW
NUMERICAL ANALYSIS WEEKLY OVERVIEW M. AUTH 1. Monday 28 August Students are encouraged to download Anaconda Python. Anaconda is a version of Python that comes with some numerical packages (numpy and matplotlib)
More informationMATH 100 and MATH 180 Learning Objectives Session 2010W Term 1 (Sep Dec 2010)
Course Prerequisites MATH 100 and MATH 180 Learning Objectives Session 2010W Term 1 (Sep Dec 2010) As a prerequisite to this course, students are required to have a reasonable mastery of precalculus mathematics
More informationSOLUTIONS ABOUT ORDINARY POINTS
238 CHAPTER 6 SERIES SOLUTIONS OF LINEAR EQUATIONS In Problems 23 and 24 use a substitution to shift the summation index so that the general term of given power series involves x k. 23. nc n x n2 n 24.
More informationn=1 ( 2 3 )n (a n ) converges by direct comparison to
. (a) n = a n converges, so we know that a n =. Therefore, for n large enough we know that a n
More informationNUMERICAL MATHEMATICS & COMPUTING 6th Edition
NUMERICAL MATHEMATICS & COMPUTING 6th Edition Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole www.engage.com www.ma.utexas.edu/cna/nmc6 September 1, 2011 2011 1 / 42 1.1 Mathematical
More informationMath Practice Exam 3 - solutions
Math 181 - Practice Exam 3 - solutions Problem 1 Consider the function h(x) = (9x 2 33x 25)e 3x+1. a) Find h (x). b) Find all values of x where h (x) is zero ( critical values ). c) Using the sign pattern
More informationPower series and Taylor series
Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series
More informationLesson 8: Why Stay with Whole Numbers?
Student Outcomes Students use function notation, evaluate functions for inputs in their domains, and interpret statements that use function notation in terms of a context. Students create functions that
More informationINTEGRATING RADICALS
INTEGRATING RADICALS MATH 53, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Section 8.4. What students should already know: The definitions of inverse trigonometric functions. The differentiation
More informationSeunghee Ye Ma 8: Week 2 Oct 6
Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means
More informationPURE MATHEMATICS AM 27
AM SYLLABUS (2020) PURE MATHEMATICS AM 27 SYLLABUS 1 Pure Mathematics AM 27 (Available in September ) Syllabus Paper I(3hrs)+Paper II(3hrs) 1. AIMS To prepare students for further studies in Mathematics
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationSupport for UCL Mathematics offer holders with the Sixth Term Examination Paper
1 Support for UCL Mathematics offer holders with the Sixth Term Examination Paper The Sixth Term Examination Paper (STEP) examination tests advanced mathematical thinking and problem solving. The examination
More informationMultiple Choice. (c) 1 (d)
Multiple Choice.(5 pts.) Find the sum of the geometric series n=0 ( ) n. (c) (d).(5 pts.) Find the 5 th Maclaurin polynomial for the function f(x) = sin x. (Recall that Maclaurin polynomial is another
More informationLaw of Trichotomy and Boundary Equations
Law of Trichotomy and Boundary Equations Law of Trichotomy: For any two real numbers a and b, exactly one of the following is true. i. a < b ii. a = b iii. a > b The Law of Trichotomy is a formal statement
More informationMAT137 Calculus! Lecture 45
official website http://uoft.me/mat137 MAT137 Calculus! Lecture 45 Today: Taylor Polynomials Taylor Series Next: Taylor Series Power Series Definition (Power Series) A power series is a series of the form
More informationMath 10850, Honors Calculus 1
Math 0850, Honors Calculus Homework 0 Solutions General and specific notes on the homework All the notes from all previous homework still apply! Also, please read my emails from September 6, 3 and 27 with
More informationThe number of marks is given in brackets [ ] at the end of each question or part question. The total number of marks for this paper is 72.
ADVANCED GCE UNIT 4753/0 MATHEMATICS (MEI) Methods for Advanced Mathematics (C3) MONDAY JUNE 007 Additional materials: Answer booklet (8 pages) Graph paper MEI Examination Formulae and Tables (MF) Afternoon
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationMHCA Math Summer Packet 2015
Directions: MHCA Math Summer Packet 2015 For students entering PreCalculus Honors You are to complete all the problems assigned in this packet by Friday, September 4 th. If you don t turn in your summer
More informationMath 181, Exam 2, Study Guide 2 Problem 1 Solution. 1 + dx. 1 + (cos x)2 dx. 1 + cos2 xdx. = π ( 1 + cos π 2
Math 8, Exam, Study Guide Problem Solution. Use the trapezoid rule with n to estimate the arc-length of the curve y sin x between x and x π. Solution: The arclength is: L b a π π + ( ) dy + (cos x) + cos
More informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
More informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
More informationName (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)
MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question
More informationMathematic 108, Fall 2015: Solutions to assignment #7
Mathematic 08, Fall 05: Solutions to assignment #7 Problem # Suppose f is a function with f continuous on the open interval I and so that f has a local maximum at both x = a and x = b for a, b I with a
More informationHOW TO WRITE PROOFS. Dr. Min Ru, University of Houston
HOW TO WRITE PROOFS Dr. Min Ru, University of Houston One of the most difficult things you will attempt in this course is to write proofs. A proof is to give a legal (logical) argument or justification
More informationMath 5a Reading Assignments for Sections
Math 5a Reading Assignments for Sections 4.1 4.5 Due Dates for Reading Assignments Note: There will be a very short online reading quiz (WebWork) on each reading assignment due one hour before class on
More information2.1 Convergence of Sequences
Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written
More informationPart 2 Continuous functions and their properties
Part 2 Continuous functions and their properties 2.1 Definition Definition A function f is continuous at a R if, and only if, that is lim f (x) = f (a), x a ε > 0, δ > 0, x, x a < δ f (x) f (a) < ε. Notice
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationMTH 121 Fall 2007 Essex County College Division of Mathematics and Physics Worksheet #1 1
MTH Fall 007 Essex County College Division of Mathematics and Physics Worksheet # Preamble It is extremely important that you complete the following two items as soon as possible. Please send an email
More information5. Sequences & Recursion
5. Sequences & Recursion Terence Sim 1 / 42 A mathematician, like a painter or poet, is a maker of patterns. Reading Sections 5.1 5.4, 5.6 5.8 of Epp. Section 2.10 of Campbell. Godfrey Harold Hardy, 1877
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson
JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises
More informationSection 2.5. Evaluating Limits Algebraically
Section 2.5 Evaluating Limits Algebraically (1) Determinate and Indeterminate Forms (2) Limit Calculation Techniques (A) Direct Substitution (B) Simplification (C) Conjugation (D) The Squeeze Theorem (3)
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationDerivatives of Trig and Inverse Trig Functions
Derivatives of Trig and Inverse Trig Functions Math 102 Section 102 Mingfeng Qiu Nov. 28, 2018 Office hours I m planning to have additional office hours next week. Next Monday (Dec 3), which time works
More informationAlgebra Exam. Solutions and Grading Guide
Algebra Exam Solutions and Grading Guide You should use this grading guide to carefully grade your own exam, trying to be as objective as possible about what score the TAs would give your responses. Full
More informationMath Numerical Analysis
Math 541 - Numerical Analysis Joseph M. Mahaffy, jmahaffy@mail.sdsu.edu Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More informationLECTURE 11 - PARTIAL DIFFERENTIATION
LECTURE 11 - PARTIAL DIFFERENTIATION CHRIS JOHNSON Abstract Partial differentiation is a natural generalization of the differentiation of a function of a single variable that you are familiar with 1 Introduction
More information5.6 Logarithmic and Exponential Equations
SECTION 5.6 Logarithmic and Exponential Equations 305 5.6 Logarithmic and Exponential Equations PREPARING FOR THIS SECTION Before getting started, review the following: Solving Equations Using a Graphing
More information1 What is numerical analysis and scientific computing?
Mathematical preliminaries 1 What is numerical analysis and scientific computing? Numerical analysis is the study of algorithms that use numerical approximation (as opposed to general symbolic manipulations)
More informationThe First Derivative and Second Derivative Test
The First Derivative and Second Derivative Test James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University April 9, 2018 Outline 1 Extremal Values 2
More informationMath 230 Mock Final Exam Detailed Solution
Name: Math 30 Mock Final Exam Detailed Solution Disclaimer: This mock exam is for practice purposes only. No graphing calulators TI-89 is allowed on this test. Be sure that all of your work is shown and
More information