PARTIAL FRACTION DECOMPOSITION
|
|
- Winfred Lewis
- 6 years ago
- Views:
Transcription
1 PARTIAL FRACTION DECOMPOSITION LARRY SUSANKA 1. Fcts bout Polynomils nd Nottion We must ssemble some tools nd nottion to prove the existence of the stndrd prtil frction decomposition, used s n integrtion technique in most Clculus texts. If f is generic polynomil, Deg(f) will denote the degree of f. If f is ny polynomil let c(f) be the leding coefficient of f. f is clled monic if c(f) = 1. If p nd q re two nonzero polynomils let GCF(p, q) denote the monic polynomil which is the gretest common fctor of p nd q. The theorem sttes tht when f nd re polynomils with rel coefficients nd no common fctors nd Deg(f) < Deg() then the frction f/ cn be written in prticulr form which is menble to methods of integrtion lerned previously. For convenience, we presume without loss tht is monic. We ssume tht is fctored into the product of powers of distinct monic terms which hve rel coefficients nd re either liner or irreducible qudrtic. The form gurnteed by the theorem is tht f/ cn be written s (possibly lengthy) sum of terms of the form µ (x β) n or µx + γ (x 2 + δx + ɛ) n where (x β)n nd (x 2 + δx + ɛ) n re fctors of nd ech x 2 + δx + ɛ is irreducible (tht is, it hs complex roots) nd ll the coefficients nd constnts involved re rel. This theorem doesn t tell you how to find the µ or µx + γ for ech summnd, nor does it mention the existence of (unique) fctoriztion of the denomintor into the product of irreducible powers. The existence of the fctoriztion follows from the Fundmentl Theorem of Algebr, though the proofs re not constructive in the sense tht they don t tell you how to find these fctors in the wy tht the qudrtic formul does for second degree polynomils. We will describe generl proof technique nd two theorems from lgebr. The proof technique is clled Proof by Induction. If you hve sequence of propositions P 1, P 2, P 3,... indexed by the nturl numbers you my conclude tht Dte: November 13,
2 2 LARRY SUSANKA every proposition on this list is true provided you cn show (I) P 1 is true nd (II) If P k is true for ll k < n then P n must be true. The reson we cn drw this conclusion is tht if some of the P j re flse there would hve to be some smllest integer n for which P n is flse. Tht n cnnot be 1 by (I), nd (II) then implies P n is true. This contrdiction implies tht the premise tht led to it, nmely tht there re flse P j, must itself be flse. In other words ll P n re true. With this in hnd, we give the two lgebric results. First, is the Eucliden lgorithm. It sttes tht if p nd h re polynomils nd h 0 there re polynomils q nd r with r = 0 or Deg(r) < Deg(h) nd p = qh+r. Second, if the gretest common fctor of two nonzero polynomils g nd h is w then there re polynomils c nd d for which w = cg + dh. In tht cse, it follows tht c nd d shre no common fctor. The specil cse we will cre bout is when w = 1: tht is, g nd h shre no common fctor. You cn either ccept these two results, or follow the rguments for them given now. The first result is obviously true whenever p = 0 or if Deg(p) < Deg(h) since we cn choose q = 0 nd r = p. If the first result were ever flse, there would be nonzero pir p nd h exhibiting this, nd for which Deg(p) Deg(h) is s smll s possible. Tht difference cnnot be negtive, by the discussion we just gve. So the difference n = Deg(p) Deg(h) must be positive or 0. Then w = x n c(p) c(h) h p is 0 or it is polynomil tht hs degree less thn the degree of p, so w = 0 or Deg(w) Deg(h) < n nd the first result pplies: tht is, there re polynomils nd b with b = 0 or Deg(b) < Deg(h) nd w = h + b. But then h + b = w = x n c(p) c(h) h p so p = ( x n c(p) c(h) ) h + ( b). But this represents p in the form required by the first result nd p nd h were specificlly picked becuse they were mong the pirs of polynomils for which the first result fils. Since tht is impossible, it must be tht the first result never fils. Tht is, the first result is true for ll p, h pirs. The rgument my be recognized s (very slightly disguised) Proof by Induction, in this cse induction on Deg(p) Deg(h). The proof of the second lgebric result cn lso be hndled by Induction. If p nd q re nonzero polynomils let S(p, q) = { p + bq, b re polynomils }. Every member of this set of polynomils is divisible by GCF (p, q) nd the clim of the second result is tht GCF (p, q) is ctully member of S(p, q). If q is the constnt polynomil, the second result is obviously true. If the second result were to ever fil it would hve to fil for some p, q pir where q hs smllest degree mong ll the filed pirs.
3 PARTIAL FRACTION DECOMPOSITION 3 By the minimlity ssumption on q we hve Deg(q) Deg(p) so there re polynomils c nd r with r = 0 or Deg(r) < Deg(q) nd p = cq + r. r cnnot be 0 becuse in tht cse p is multiple of q nd the second result is obviously true in tht cse. It must then be tht GCF (q, r) = GCF (p, q) since every shred fctor of p nd q must be shred by p nd r, nd conversely. Since the degree of r is less thn tht of q the second result is true for the q, r pir nd there re polynomils x nd y for which xq + yr = GCF (q, r) = GCF (p, q). But then xq + y(p cq) = yp + (x yc)q = GCF (p, q) contrry to choice of the p, q pir. In other words, there cn be no pir for which the second result fils. It must lwys be true. 2. The Proof Prt One We will suppose tht sttement P n is: The Prtil Frction Theorem is true when f hs the form ζ ζx + µ (i) (x µ) n or (ii) (x 2 + δx + ɛ) n. P 1 is true: tht is, the theorem is true for f/ of the form (i) ζ x µ or (ii) ζx + µ x 2 + δx + ɛ becuse (i) nd (ii) re lredy in the form specified in the theorem. We now presume tht sttement P k is true for ll k < n nd some n exceeding 1. This is prt (II) of the Proof by Induction process. Let s exmine P n. In cse (i) there is polynomil q nd rel constnt r with f = q(x µ) + r. Then f q(x µ) + r q = (x µ) n (x µ) n = (x µ) n 1 + r (x µ) n. The lst frction is in the form specified in the theorem, while the previous term cn be plced in the pproprite form by inductive hypothesis (II). In cse (ii) there re polynomils q nd (t most) first degree r with f = q(x 2 + δx + ɛ) + r. This time we hve: f (x 2 + δx + ɛ) n = q(x2 + δx + ɛ) + r q (x 2 + δx + ɛ) n = (x 2 + δx + ɛ) n 1 + r (x 2 + δx + ɛ) n. Agin, the lst frction is in the form specified in the theorem, while the previous term cn be plced in the pproprite form by inductive hypothesis (II). So we hve proved the theorem when is power of fctors of these two specified types.
4 4 LARRY SUSANKA 3. The Proof Prt Two Let s exmine now the sitution in the generl theorem where nth degree monic polynomil hs nontrivil fctoriztion = gh where g nd h re monic nd hve no common fctors nd Deg(f) < n. So g will hve ll of some of the irreducible fctors of nd h will hve ll of the remining irreducible fctors. Deg(f) < Deg(g) + Deg(h) = n nd both Deg(g) nd Deg(h) re t lest 1. Since the gretest common fctor of g nd h is 1 there re polynomils c nd d for which 1 = cg + dh. Note tht c cn shre no fctors with h, while d cn shre no fctors with g. Then f f(cg + dh) = = fcg + fdh = fc h + fd g. It is possible tht both Deg(fc) < Deg(h) nd Deg(fd) < Deg(g) in which cse both frctions on the end of the line bove re in the form to which the theorem pplies, but ech denomintor hs strictly fewer irreducible fctor types in the denomintor thn hs. On the other hnd, it my be tht one of Deg(fc) Deg(h) or Deg(fd) Deg(g) holds. We will ssume tht Deg(fc) Deg(h) nd the other cse is hndled identiclly. If Deg(fc) Deg(h) then fc = qh + r for certin polynomils q nd r where Deg(r) < Deg(h). Note tht this implies tht r cn shre no fctors with h becuse c shres no fctor with h so ny shred fctor of r nd h would hve to be shred lso with f, contrdicting the ssumption tht f/ is in lowest terms. We now hve f f(cg + dh) (qh + r)g + dhf rg + (q + df)h = = =. Note tht q +df cn shre no fctor with g, gin becuse f/ is in lowest terms. The left-hnd side of the lst numertor hs degree strictly less thn Deg(h) + Deg(g), nd since f lso hs degree less thn Deg(h) + Deg(g) we must hve Deg( (q + df)h ) less thn Deg(h) + Deg(g) too. So Deg(q + df) < Deg(g) nd (by its definition) Deg(r) < Deg(h). Now we hve f rg + (q + df)h = = r h + q + df g nd both of these frctions re in the form to which the theorem pplies, but with strictly fewer types of irreducible fctors in the denomintor thn hs. 4. The Proof Prt Three We will suppose this time tht sttement P n is the ssertion The Prtil Frction Theorem is true when hs n different types of irreducible fctors. P 1 is true: tht is the content of The Proof Prt One, bove. We hve in hnd, therefore, step (I) of the Proof by Induction process.
5 PARTIAL FRACTION DECOMPOSITION 5 We now presume tht sttement P k is true for ll k < n nd some n exceeding 1. This is the setup for step (II) of the Proof by Induction process. Let s look t P n. In The Proof Prt Two bove we showed tht ny frction in the form of the theorem whose denomintor hs n different types of irreducible fctors cn be split into the sum of two frctions of the type to which the theorem pplies, but with strictly fewer irreducible fctor types in their denomintors. But ech of these two terms cn be plced in the pproprite form gurnteed by the theorem by inductive hypothesis (II). So their sum cn be s well. We hve verified the two steps of the Proof by Induction process, nd conclude tht the theorem is true for ny number of irreducible fctors.
p-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationChapter 6 Techniques of Integration
MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationUniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that
Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de
More informationMath& 152 Section Integration by Parts
Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationMath 3B Final Review
Mth 3B Finl Review Written by Victori Kl vtkl@mth.ucsb.edu SH 6432u Office Hours: R 9:45-10:45m SH 1607 Mth Lb Hours: TR 1-2pm Lst updted: 12/06/14 This is continution of the midterm review. Prctice problems
More informationf(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral
Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one
More informationImproper Integrals. Type I Improper Integrals How do we evaluate an integral such as
Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph
More informationMath 113 Exam 2 Practice
Mth Em Prctice Februry, 8 Em will cover sections 6.5, 7.-7.5 nd 7.8. This sheet hs three sections. The first section will remind you bout techniques nd formuls tht you should know. The second gives number
More informationf = ae b e , i.e., ru + P = (r + P )(u + P ) = (s + P )(t + P ) = st + P. Then since ru st P and su P we conclude that r s t u = ru st
Mth 662 Spring 204 Homewor 2 Drew Armstrong Problem 0. (Drwing Pictures) The eqution y 2 = x 3 x defines curve in the complex plne C 2. Wht does it loo lie? Unfortuntely we cn only see rel things, so we
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationAnti-derivatives/Indefinite Integrals of Basic Functions
Anti-derivtives/Indefinite Integrls of Bsic Functions Power Rule: In prticulr, this mens tht x n+ x n n + + C, dx = ln x + C, if n if n = x 0 dx = dx = dx = x + C nd x (lthough you won t use the second
More information1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers...
Contents 1 Sets 1 1.1 Functions nd Reltions....................... 3 1.2 Mthemticl Induction....................... 5 1.3 Equivlence of Sets nd Countbility................ 6 1.4 The Rel Numbers..........................
More informationChapter 8: Methods of Integration
Chpter 8: Methods of Integrtion Bsic Integrls 8. Note: We hve the following list of Bsic Integrls p p+ + c, for p sec tn + c p + ln + c sec tn sec + c e e + c tn ln sec + c ln + c sec ln sec + tn + c ln
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More informationSection 7.1 Integration by Substitution
Section 7. Integrtion by Substitution Evlute ech of the following integrls. Keep in mind tht using substitution my not work on some problems. For one of the definite integrls, it is not possible to find
More informationIn Section 5.3 we considered initial value problems for the linear second order equation. y.a/ C ˇy 0.a/ D k 1 (13.1.4)
678 Chpter 13 Boundry Vlue Problems for Second Order Ordinry Differentil Equtions 13.1 TWO-POINT BOUNDARY VALUE PROBLEMS In Section 5.3 we considered initil vlue problems for the liner second order eqution
More informationENGI 3424 Engineering Mathematics Five Tutorial Examples of Partial Fractions
ENGI 44 Engineering Mthemtics Five Tutoril Exmples o Prtil Frctions 1. Express x in prtil rctions: x 4 x 4 x 4 b x x x x Both denomintors re liner non-repeted ctors. The cover-up rule my be used: 4 4 4
More information1 Structural induction
Discrete Structures Prelim 2 smple questions Solutions CS2800 Questions selected for Spring 2018 1 Structurl induction 1. We define set S of functions from Z to Z inductively s follows: Rule 1. For ny
More informationAQA Further Pure 2. Hyperbolic Functions. Section 2: The inverse hyperbolic functions
Hperbolic Functions Section : The inverse hperbolic functions Notes nd Emples These notes contin subsections on The inverse hperbolic functions Integrtion using the inverse hperbolic functions Logrithmic
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More information5.2 Exponent Properties Involving Quotients
5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use
More informationMath 113 Fall Final Exam Review. 2. Applications of Integration Chapter 6 including sections and section 6.8
Mth 3 Fll 0 The scope of the finl exm will include: Finl Exm Review. Integrls Chpter 5 including sections 5. 5.7, 5.0. Applictions of Integrtion Chpter 6 including sections 6. 6.5 nd section 6.8 3. Infinite
More informationPolynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230
Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given
More informationThe Henstock-Kurzweil integral
fculteit Wiskunde en Ntuurwetenschppen The Henstock-Kurzweil integrl Bchelorthesis Mthemtics June 2014 Student: E. vn Dijk First supervisor: Dr. A.E. Sterk Second supervisor: Prof. dr. A. vn der Schft
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationMath 130 Midterm Review
Mth 130 Midterm Review April 6, 2013 1 Topic Outline: The following outline contins ll of the mjor topics tht you will need to know for the exm. Any topic tht we ve discussed in clss so fr my pper on the
More information7. Indefinite Integrals
7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find
More informationJim Lambers MAT 169 Fall Semester Lecture 4 Notes
Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of
More informationGeometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.
Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number
More informationThe Product Rule state that if f and g are differentiable functions, then
Chpter 6 Techniques of Integrtion 6. Integrtion by Prts Every differentition rule hs corresponding integrtion rule. For instnce, the Substitution Rule for integrtion corresponds to the Chin Rule for differentition.
More informationODE: Existence and Uniqueness of a Solution
Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =
More information1 The Lagrange interpolation formula
Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x
More informationImproper Integrals. Introduction. Type 1: Improper Integrals on Infinite Intervals. When we defined the definite integral.
Improper Integrls Introduction When we defined the definite integrl f d we ssumed tht f ws continuous on [, ] where [, ] ws finite, closed intervl There re t lest two wys this definition cn fil to e stisfied:
More informationUSA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year
1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.
More informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationIs there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!
PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For
More informationIf deg(num) deg(denom), then we should use long-division of polynomials to rewrite: p(x) = s(x) + r(x) q(x), q(x)
Mth 50 The method of prtil frction decomposition (PFD is used to integrte some rtionl functions of the form p(x, where p/q is in lowest terms nd deg(num < deg(denom. q(x If deg(num deg(denom, then we should
More informationLecture 2: Fields, Formally
Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationBefore we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!
Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble
More informationMath 113 Exam 2 Practice
Mth 3 Exm Prctice Februry 8, 03 Exm will cover 7.4, 7.5, 7.7, 7.8, 8.-3 nd 8.5. Plese note tht integrtion skills lerned in erlier sections will still be needed for the mteril in 7.5, 7.8 nd chpter 8. This
More informationCHAPTER 4 MULTIPLE INTEGRALS
CHAPTE 4 MULTIPLE INTEGAL The objects of this chpter re five-fold. They re: (1 Discuss when sclr-vlued functions f cn be integrted over closed rectngulr boxes in n ; simply put, f is integrble over iff
More informationMATH 174A: PROBLEM SET 5. Suggested Solution
MATH 174A: PROBLEM SET 5 Suggested Solution Problem 1. Suppose tht I [, b] is n intervl. Let f 1 b f() d for f C(I; R) (i.e. f is continuous rel-vlued function on I), nd let L 1 (I) denote the completion
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More informationAnonymous Math 361: Homework 5. x i = 1 (1 u i )
Anonymous Mth 36: Homewor 5 Rudin. Let I be the set of ll u (u,..., u ) R with u i for ll i; let Q be the set of ll x (x,..., x ) R with x i, x i. (I is the unit cube; Q is the stndrd simplex in R ). Define
More informationHomework Solution - Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.
More informationMath 118: Honours Calculus II Winter, 2005 List of Theorems. L(P, f) U(Q, f). f exists for each ǫ > 0 there exists a partition P of [a, b] such that
Mth 118: Honours Clculus II Winter, 2005 List of Theorems Lemm 5.1 (Prtition Refinement): If P nd Q re prtitions of [, b] such tht Q P, then L(P, f) L(Q, f) U(Q, f) U(P, f). Lemm 5.2 (Upper Sums Bound
More informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationSOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set
SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL 28 Nottion: N {, 2, 3,...}. (Tht is, N.. Let (X, M be mesurble spce with σ-finite positive mesure µ. Prove tht there is finite positive mesure ν on (X, M such
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationSection 5.1 #7, 10, 16, 21, 25; Section 5.2 #8, 9, 15, 20, 27, 30; Section 5.3 #4, 6, 9, 13, 16, 28, 31; Section 5.4 #7, 18, 21, 23, 25, 29, 40
Mth B Prof. Audrey Terrs HW # Solutions by Alex Eustis Due Tuesdy, Oct. 9 Section 5. #7,, 6,, 5; Section 5. #8, 9, 5,, 7, 3; Section 5.3 #4, 6, 9, 3, 6, 8, 3; Section 5.4 #7, 8,, 3, 5, 9, 4 5..7 Since
More informationSpring 2017 Exam 1 MARK BOX HAND IN PART PIN: 17
Spring 07 Exm problem MARK BOX points HAND IN PART 0 5-55=x5 0 NAME: Solutions 3 0 0 PIN: 7 % 00 INSTRUCTIONS This exm comes in two prts. () HAND IN PART. Hnd in only this prt. () STATEMENT OF MULTIPLE
More informationComplex integration. L3: Cauchy s Theory.
MM Vercelli. L3: Cuchy s Theory. Contents: Complex integrtion. The Cuchy s integrls theorems. Singulrities. The residue theorem. Evlution of definite integrls. Appendix: Fundmentl theorem of lgebr. Discussions
More informationVariational Techniques for Sturm-Liouville Eigenvalue Problems
Vritionl Techniques for Sturm-Liouville Eigenvlue Problems Vlerie Cormni Deprtment of Mthemtics nd Sttistics University of Nebrsk, Lincoln Lincoln, NE 68588 Emil: vcormni@mth.unl.edu Rolf Ryhm Deprtment
More informationProperties of the Riemann Integral
Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University Februry 15, 2018 Outline 1 Some Infimum nd Supremum Properties 2
More information1 Linear Least Squares
Lest Squres Pge 1 1 Liner Lest Squres I will try to be consistent in nottion, with n being the number of dt points, nd m < n being the number of prmeters in model function. We re interested in solving
More informationMATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
More informationAP Calculus Multiple Choice: BC Edition Solutions
AP Clculus Multiple Choice: BC Edition Solutions J. Slon Mrch 8, 04 ) 0 dx ( x) is A) B) C) D) E) Divergent This function inside the integrl hs verticl symptotes t x =, nd the integrl bounds contin this
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationEuler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )
Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s
More informationBernoulli Numbers Jeff Morton
Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f
More informationConsolidation Worksheet
Cmbridge Essentils Mthemtics Core 8 NConsolidtion Worksheet N Consolidtion Worksheet Work these out. 8 b 7 + 0 c 6 + 7 5 Use the number line to help. 2 Remember + 2 2 +2 2 2 + 2 Adding negtive number is
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
More information. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. sin 2 (θ) =
Review of some needed Trig. Identities for Integrtion. Your nswers should be n ngle in RADIANS. rccos( 1 ) = π rccos( - 1 ) = 2π 2 3 2 3 rcsin( 1 ) = π rcsin( - 1 ) = -π 2 6 2 6 Cn you do similr problems?
More informationLesson 25: Adding and Subtracting Rational Expressions
Lesson 2: Adding nd Subtrcting Rtionl Expressions Student Outcomes Students perform ddition nd subtrction of rtionl expressions. Lesson Notes This lesson reviews ddition nd subtrction of frctions using
More informationDuke Math Meet
Duke Mth Meet 01-14 Power Round Qudrtic Residues nd Prime Numers For integers nd, we write to indicte tht evenly divides, nd to indicte tht does not divide For exmle, 4 nd 4 Let e rime numer An integer
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationTaylor Polynomial Inequalities
Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil
More informationFundamental Theorem of Calculus
Fundmentl Theorem of Clculus Recll tht if f is nonnegtive nd continuous on [, ], then the re under its grph etween nd is the definite integrl A= f() d Now, for in the intervl [, ], let A() e the re under
More informationPRIMES AND QUADRATIC RECIPROCITY
PRIMES AND QUADRATIC RECIPROCITY ANGELICA WONG Abstrct We discuss number theory with the ultimte gol of understnding udrtic recirocity We begin by discussing Fermt s Little Theorem, the Chinese Reminder
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More informationMatrices, Moments and Quadrature, cont d
Jim Lmbers MAT 285 Summer Session 2015-16 Lecture 2 Notes Mtrices, Moments nd Qudrture, cont d We hve described how Jcobi mtrices cn be used to compute nodes nd weights for Gussin qudrture rules for generl
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More informationLet S be a numerical semigroup generated by a generalized arithmetic sequence,
Abstrct We give closed form for the ctenry degree of ny element in numericl monoid generted by generlized rithmetic sequence in embedding dimension three. While it is known in generl tht the lrgest nd
More informationHeat flux and total heat
Het flux nd totl het John McCun Mrch 14, 2017 1 Introduction Yesterdy (if I remember correctly) Ms. Prsd sked me question bout the condition of insulted boundry for the 1D het eqution, nd (bsed on glnce
More informationSummary Information and Formulae MTH109 College Algebra
Generl Formuls Summry Informtion nd Formule MTH109 College Algebr Temperture: F = 9 5 C + 32 nd C = 5 ( 9 F 32 ) F = degrees Fhrenheit C = degrees Celsius Simple Interest: I = Pr t I = Interest erned (chrged)
More informationQuotient Rule: am a n = am n (a 0) Negative Exponents: a n = 1 (a 0) an Power Rules: (a m ) n = a m n (ab) m = a m b m
Formuls nd Concepts MAT 099: Intermedite Algebr repring for Tests: The formuls nd concepts here m not be inclusive. You should first tke our prctice test with no notes or help to see wht mteril ou re comfortble
More informationII. Integration and Cauchy s Theorem
MTH6111 Complex Anlysis 2009-10 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.
More information4. Calculus of Variations
4. Clculus of Vritions Introduction - Typicl Problems The clculus of vritions generlises the theory of mxim nd minim. Exmple (): Shortest distnce between two points. On given surfce (e.g. plne), nd the
More informationREVIEW Chapter 1 The Real Number System
Mth 7 REVIEW Chpter The Rel Number System In clss work: Solve ll exercises. (Sections. &. Definition A set is collection of objects (elements. The Set of Nturl Numbers N N = {,,,, 5, } The Set of Whole
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More information