Applicable Analysis and Discrete Mathematics available online at
|
|
- Dinah Black
- 5 years ago
- Views:
Transcription
1 Applicble Anlysis nd Discrete Mthemtics vilble online t Appl. Anl. Discrete Mth. 4 (2010), doi: /aadm k NUMERICAL ANALYSIS MEETS NUMBER THEORY: USING ROOTFINDING METHODS TO CALCULATE INVERSES MOD p n Michel P. Knpp, Christos Xenophontos We show how clssicl rootfinding methods from numericl nlysis cn be used to clculte inverses of units modulo prime powers. 1. INTRODUCTION In this rticle we explore very interesting ppliction of tools from numericl nlysis to number theory. As the title suggests, we will see how one cn use clssicl rootfinding methods, such s Newton s method, to clculte the reciprocl of n integer modulo p n, where p is prime number. We first encountered this ide in [3], where Newton s method ws used to find the reciprocl of finite segment p-dic number (lso referred to s Hensel code; see [3] for more detils). In our experience, mny people who specilize in either number theory or numericl nlysis do not study the other subject, nd so we hve ttempted to keep our exposition t uniformly low level so tht specilists in either field my benefit from this rticle. We define frctions modulo p n in the usul wy s follows. If, b nd α re integers nd is not divisible by p, then we sy tht α b (mod p n ) if α b (mod p n ). Using this definition, the reciprocl 1 of n integer modulo pn is solution of the congruence x 1 (mod p n ). In other words, it is n inverse of modulo p n Mthemtics Subject Clssifiction. 11A07 (65-01). Keywords nd Phrses. Newton s method, inverses modulo p n, secnt method. 23
2 24 Michel P. Knpp, Christos Xenophontos The ide of using Newton s method to perform division (or clculte inverses) dtes bck to the erly dys of computing, since one cn ctully pproximte the reciprocl of number by performing only the opertions of multipliction nd ddition. The ide behind itertive rootfinding methods such s Newton s method is s follows. Suppose tht we hve function f(x) for which we wish to find zero in n intervl [, b]. To ccomplish this, let x 0 [, b] be n initil guess for the zero, nd let g(x) be n itertion function. Then we clculte further pproximtions through the formul (1) x i+1 = g(x i ), i = 0, 1,... If the initil guess x 0 nd the itertion function g(x) re suitbly chosen, then the sequence x 0, x 1, x 2,... should converge to zero of f(x) in [, b]. If this does in fct occur, then we cn tlk bout the rte t which the sequence converges to zero of f(x). Roughly speking, if the rte of convergence of method is m (i.e. the method converges with order m), then fter ech itertion the number of correct significnt digits in the pproximtion increses by fctor of pproximtely m. For exmple, if our pproximtion converges qudrticlly (i.e. with order 2), then the number of correct significnt digits pproximtely doubles with ech itertion. Now let us see wht this hs to do with congruences modulo p n. In this sitution, the role of significnt digits will be plyed by smller powers of p. We will strt with n inverse of modulo p, nd then find inverses of modulo higher powers of p until we hve n inverse modulo p n. The connection between digits nd powers of p cn be found by looking t the bse p representtion of numbers. It is well-known tht ny positive integer α hs bse p representtion α = c 0 + c 1 p + c 2 p c k p k, where 0 c i p 1 for ech i. Ech coefficient c i is digit in the bse p representtion of α. To find number which is congruent to α modulo p r, we cn simply truncte the bse p expnsion of α fter the first r digits. Thus, if r < n then we my think of n inverse of modulo p r s giving the correct first r digits of n inverse of modulo p n. We note here tht our Theorems 1, 3 nd 4 hed re not truly originl. In fct, they re simple consequences of more powerful theorems bout itertive methods. However, we feel tht our proofs re worthwhile becuse they re quite simple nd void ny hevy mchinery. 2. NEWTON S METHOD (FOR DIVISION MOD p n ) The itertion function for Newton s method is g(x) = x f(x)/f (x), whence eqution (1) becomes (2) x i+1 = x i f(x i) f (x i ), i = 0, 1,...
3 Numericl nlysis meets number theory: using rootfinding Under suitble ssumptions on f, f nd x 0 (see for exmple Theorem 3.2 on pge 100 of [1]), the bove itertion converges to zero of f(x) in [, b] t qudrtic rte. So to clculte 1, we let f(x) = 1, nd solve f(x) = 0 using Newton s x Method. In this cse itertion (2) becomes (3) x i+1 = x i (2 x i ), i = 0, 1,... Like Newton s method for rel numbers, we cn show tht Newton s method lso converges qudrticlly for congruences. This is proven in the following theorem. Although we re using different lnguge, this is essentilly the sme s the min theorem of [3]. We believe tht our proof is simpler, however. Theorem 1. Let α > 0 nd suppose tht x i is n inverse of modulo p α. Then x i+1 given by (3) is n inverse of modulo p 2α. Proof. To prove this, we know tht x i 1 (mod p α ), nd therefore cn write x i = sp α + 1 for some integer s. Then we hve x i+1 = x i (2 x i ) = s 2 p 2α (mod p 2α ). Hence x i+1 is n inverse of modulo p 2α, s desired. So if we cn find n inverse of modulo p to use s n initil guess, then we cn use Newton s method to find inverses of modulo p 2, p 4, p 8 nd so on. If the prime p is smll, then we cn often find n inverse of modulo p by inspection. If p is lrger, then we cn use Fermt s Little Theorem to find our initil guess. Theorem 2. (Fermt s Little Theorem) Suppose tht p is prime nd tht is n integer not divisible by p. Then p 1 1 (mod p). An esy consequence of this theorem is tht if p does not divide, then p 2 is n inverse of modulo p. We cn evlute p 2 modulo p by the technique of repeted squring. For exmple, to find the inverse of 29 modulo 53, we need to evlute modulo 53. To do this, we hve (mod 53) (mod 53) (mod 53) (mod 53) (mod 53) (mod 53).
4 26 Michel P. Knpp, Christos Xenophontos Thus we obtin = (28)(44)(46)(29) 11 (mod 53), nd so 1 11 (mod 53). 29 Let us now illustrte the use of Newton s method in the context of the present pper vi n exmple. Exmple 1. Let p = 5, = 3 nd n = 8. We wish to find n integer congruent to 1 3 modulo 5 8 using the Newton itertion (3). As our initil guess, we choose x 0 = 2 since 3(2) 1 (mod 5) nd so (mod 5). Then we hve from (3) tht x 1 = 2 (2 3 2) = 8 17 = 2 + 3(5) (mod 5 2 ). Note tht 3(17) = 51 1 (mod 5 2 ), nd so (mod 52 ) s indicted by Theorem 1. Iterting twice more gives us x = 2 + 3(5) + 1(5) 2 + 3(5) 3 (mod 5 4 ) x = 2 + 3(5) + 1(5) 2 + 3(5) 3 + 1(5) 4 + 3(5) 5 + 1(5) 6 + 3(5) 7 (mod 5 8 ), nd so we see tht (mod 58 ). 3. THE SECANT METHOD (FOR DIVISION MOD p n ) Another well-known rootfinding method is the secnt method, whose itertion is given by (4) x i+1 = x i f(x i)(x i x i 1 ) f(x i ) f(x i 1 ), i = 1, 2,... Note tht we now need two initil guesses x 0 nd x 1, but we no longer need the derivtive 1 of f(x). Since there is no such thing s free lunch, the trde-off is tht the order of convergence drops down to the golden rtio φ = (1 + 5)/2. In fct, we will show tht fter ech itertion, insted of doubling (like in Newton s method), the number of correct digits increses by fctor of pproximtely φ. For our function f(x) = 1, eqution (4) becomes x (5) x i+1 = x i + x i 1 x i x i 1. To estblish the rte of convergence when using the secnt method for congruences we hve the following theorem. 1 This is importnt when the derivtive of the function f(x) is difficult to obtin; however, this is not the cse here.
5 Numericl nlysis meets number theory: using rootfinding Theorem 3. Suppose tht x i 1 1 (mod pα ) nd tht x i 1 (mod pβ ). Then, with x i+1 given by (5), we hve x i+1 1 (mod pα+β ). Proof. To prove this, note tht since we hve x i 1 1 (mod p α ) nd x i 1 (mod p β ), there exist integers s nd t such tht Then we hve s desired. x i 1 = sp α + 1 nd x i = tp β + 1. x i+1 = x i + x i 1 (x i )(x i 1 ) = stp α+β (mod p α+β ), So if x 1 nd x 2 re both inverses of modulo p 1, we cn show by induction tht x i is the inverse of modulo p Fi, where F i is the i th Fiboncci number. Since it is well-known tht F i gets closer nd closer to φ n / 5 s n gets lrge, we find tht the secnt method hs order of convergence φ. Another wy to see this is by introducing the errors ε i+1 = x i+1 1/, ε i = x i 1/, ε i 1 = x i 1 1/. Then (5) gives the reltion (6) ε i+1 = ε i ε i 1. Assuming tht the rte of convergence of the secnt method is r, we hve (7) ε i+1 Aε r i ε i Aε r i 1 ε1/r i A ε i 1, 1/r for some positive constnt A. Thus, by (6) nd (7) we get ε i+1 C 1 A ε1/r 1/r i where B, C re positive constnts. Hence, ε 1+1/r i ε i Bε 1+1/r i, A B εr i, from which it follows tht 1 + 1/r = r, or equivlently tht the order of convergence of the secnt method is given by the positive root of the eqution r 2 r 1 = 0, i.e. r = φ = (1 + 5)/ It is worth noticing tht lthough the generl formul (4) for the itertion requires tht our initil guesses x 0 nd x 1 be different, this is not required in either formul (5) or Theorem 3. Thus we cn tke x 0 nd x 1 to both be inverses of modulo p, nd in fct cn even tke them to be the sme number. Let us illustrte the bove ides vi n exmple.
6 28 Michel P. Knpp, Christos Xenophontos Exmple 2. Let p = 7, = 5 nd n = 8, i.e. we wish to find n integer congruent to 1 5 modulo 7 8 using the itertion (5). We choose x 0 = x 1 = 3, since (mod 7). We hve from (5) x 2 = = 3 + 1(7) (mod 7 2 ) x 3 = = 3 + 1(7) + 4(7) 2 (mod 7 3 ) x = 3 + 1(7) + 4(7) 2 + 5(7) 3 + 2(7) 4 (mod 7 5 ) x = = 3 + 1(7) + 4(7) 2 + 5(7) 3 + 2(7) 4 + 1(7) 5 + 4(7) 6 + 5(7) 7 (mod 7 8 ) nd so we see tht (mod 78 ). 4. FIXED POINT ITERATION AND HIGH ORDER CONVERGENT METHODS The generl itertion formul (1) ctully defines lrger clss of itertive methods, clled fixed point methods: insted of solving f(x) = 0 we solve g(x) = x (for suitbly chosen g(x)). The dvntge of this pproch is tht it cn be esily generlized to higher dimensions nd nlyzed using plethor of fmous fixed point theorems. Newton s method is specil cse of fixed point itertion, s cn be redily seen by eqution (2). Under suitble ssumptions on g (see Theorems 3.5 nd 3.7 on pges of [1]), itertion (1) converges to α for ny initil guess x 0 sufficiently close to α, t rte r such tht (8) g(α) = α, g (α) = g (α) = g (α) = = g (r 1) (α) = 0 but g (r) (α) 0. With this in mind, one cn construct itertion functions g such tht (8) holds for some r, hence obtining method which converges t tht rte. In our cse, Newton s method cn be written s fixed point itertion with g(x) = x(2 x). Since we ( lredy know tht this is qudrticlly convergent 1 method, we expect tht g = ) 1 ( ) ( ), 1 g = 0, nd g 1 0, nd this is esily seen to be the cse. Now suppose we wnted to construct n itertive method for finding the zero of f(x) = 1, with higher convergence rte. To this end, define u(x) = x f(x)/f (x) nd E 2 (x) = x u(x). Then, Newton s method corresponds to solving Trub [5] derived the following reltion x n+1 = E 2 (x n ), n = 0, 1, 2,... (9) E r+1 (x) = E r (x) u(x) r E r(x), r = 2, 3,...
7 Numericl nlysis meets number theory: using rootfinding to produce sequence of generlized itertive formuls, of order r + 1, for solving non-liner equtions, known s Schröder s method of the first kind [4]. In prticulr, if f(x) = 1, then introducing z = 1 x yields x = (1 z)/ x nd u = z(z 1)/, so tht E 2 (x) = x(1 + (1 z)) = 1 z For rbitrry r 2, ssume tht (1 + z) = 1 z2 = 1 (1 x)2. (10) E r (x) = 1 zr Then, pplying (9) we obtin = 1 (1 x)r. E r+1 = 1 zr z(z 1) z r 1 = 1 (1 zr+1 ) = ( 1 1 (1 x) r+1 ). Therefore, we see tht by induction, (10) holds true for rbitrry r 2. As result, n itertive method of order r ( 2) for finding n inverse of modulo prime numbers is given by (11) x i+1 = E r (x i ) x i+1 = 1 ( 1 (1 xi ) r), i = 0, 1, 2,... For exmple, for r = 2 we obtin (3) nd for r = 3 we obtin (12) x i+1 = x i [1 + (1 x i )(2 x i )]. The following exmple illustrtes the use of itertion (12). Exmple 3. As in Exmple 1, let p = 5, = 3 nd n = 8. We wish to find n integer congruent to 1 3 modulo 58 using the itertion (12). We expect tht 2 itertions will suffice here, s opposed to 3 itertions which were needed in Exmple 1, since this method converges cubiclly. Indeed, with x 0 = 2, x 1 = 2 [1 + (1 3 2)(2 3 2)] = = 2 + 3(5) + 1(5) 2 (mod 5 3 ) x 2 = 42 [1 + (1 3 42)(2 3 42)] = (mod 5 9 ). Note tht since is n inverse of 3 modulo 5 9, it is lso n inverse of 3 modulo 5 8. Noting tht (mod 5 8 ), we see tht = 2 + 3(5) + 1(5) 2 + 3(5) 3 + 1(5) 4 + 3(5) 5 + 1(5) 6 + 3(5) 7 is the smllest inverse of 3 modulo 5 8. An ssertion similr to Theorem 1, cn be stted for the generlized method (11): Theorem 4. Let α > 0 nd suppose tht x i is n inverse of modulo p α. Then x i+1 given by (11) is n inverse of modulo p rα.
8 30 Michel P. Knpp, Christos Xenophontos Proof. As before, we hve x i = sp α + 1, for some integer s. Hence we hve x i+1 = E r (x i ) = 1 (1 x i ) r = 1 (1 sp α 1) r = 1 ( 1) r s r p αr 1 (mod p rα ). Our next exmple illustrtes the use of itertion (11) with r = 4, i.e. (13) x i+1 = 1 ( 1 (1 xi ) 4), nd compres the performnce of ll methods presented in this rticle. Exmple 4. Let p = 2, = 3 nd n = 16. We wish to find n integer congruent to 1 3 modulo 2 16 using itertion (13). As our initil guess we choose x 0 = 1, since (mod 2). For comprison purposes, we will lso show the nswers obtined using itertions (3), (5) nd (12) for (5) we need second initil guess, nd we tke x 1 = 1. Using itertion (13) we hve x 1 11 = 1 + (2) + (2) 3 (mod 2 4 ) x = 1 + (2) + (2) 3 + (2) 5 + (2) 7 + (2) 9 + (2) 11 + (2) 13 + (2) 15 (mod 2 16 ) nd so we see tht in just two itertions we obtin (mod 216 ). For itertion (3) we obtin x 1 3 (mod 2 2 ), x 2 11 (mod 2 4 ), x (mod 2 8 ), x (mod 2 16 ), while for itertion (5) we get x 2 3 (mod 2 2 ), x 3 3 (mod 2 3 ), x 4 1 (mod 2 5 ), x (mod 2 8 ) x (mod 2 13 ), x (mod 2 21 ), from which we obtin (mod 216 ), since (mod 2 16 ). Finlly, for itertion (12), we hve x 1 2 (mod 2 3 ), x (mod 2 9 ), x (mod 2 27 ), from which we get (mod 216 ), since (mod 2 16 ). Therefore, we see tht the secnt method, which converges t the rte (1+ 5)/2 1.6, requires 7 itertions, the qudrticlly convergent Newton s method requires 4 itertions, while the cubiclly nd qurticlly convergent itertions (12) nd (13), require 3 nd 2 itertions, respectively. These results demonstrte how the higher order methods cn produce the desired inverse in significntly smller number of itertions. Acknowledgements. We would like to thnk Robert Benedetto nd Lis Oberbroeckling for some very helpful discussions bout the rtes of convergence of p-dic itertive methods.
9 Numericl nlysis meets number theory: using rootfinding We lso thnk the nonymous referee whose useful comments gretly improved Section 4. The first uthor ws prtilly supported by NSF grnt DMS during the preprtion of this pper. REFERENCES 1. J. Epperson: An Introduction to Numericl Methods nd Anlysis. Wiley nd Sons, E. V. Krishnmurthy: Economicl itertive nd rnge trnsformtion schemes for division. IEEE Trns. Comput., C-20 (1971), E. V. Krishnmurthy, V. K. Murthy: Fst Itertive Division of p-dic Numbers. IEEE Trnsctions on Computers, 32 (1983), E. Schröder: Über unendlich viele Algorithmen zur Auflösung der Gleichunger. Mth. Annl., 2 (1870), J. F. Trub: Itertive Methods for Solution of Equtions. Prentice Hll, Englewood Cliffs, New Jersey, Mthemticl Sciences Deprtment, (Received August 2, 2009) Loyol University Mrylnd, (Revised Februry 1, 2010) 4501 N. Chrles Street, Bltimore, MD USA E-mil: mpknpp@loyol.edu Deprtment of Mthemtics nd Sttistics, University of Cyprus, P.O. Box 20537, 1678 Nicosi Cyprus
NUMERICAL ANALYSIS MEETS NUMBER THEORY: USINGROOTFINDINGMETHODSTOCALCULATE INVERSES MOD p n
Applicble Anlysis nd Discrete Mthemtics vilble online t http://pefmth.etf.bg.c.yu Appl. Anl. Discrete Mth. x (xxxx), xxx xxx. doi:10.2298/aadmxxxxxxxx NUMERICAL ANALYSIS MEETS NUMBER THEORY: USINGROOTFINDINGMETHODSTOCALCULATE
More informationNumerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n
Numerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n This article is dedicated to the memory of George Mackiw June 7, 2004 Introduction In this article we explore
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 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 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 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 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 informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
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 informationP 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)
1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this
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 informationarxiv:math/ v2 [math.ho] 16 Dec 2003
rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,
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 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 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 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 informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More informationp-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 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 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 informationNumerical Analysis: Trapezoidal and Simpson s Rule
nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
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 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 information1.9 C 2 inner variations
46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for
More informationSelf-similarity and symmetries of Pascal s triangles and simplices mod p
Sn Jose Stte University SJSU ScholrWorks Fculty Publictions Mthemtics nd Sttistics Februry 2004 Self-similrity nd symmetries of Pscl s tringles nd simplices mod p Richrd P. Kubelk Sn Jose Stte University,
More informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationAn approximation to the arithmetic-geometric mean. G.J.O. Jameson, Math. Gazette 98 (2014), 85 95
An pproximtion to the rithmetic-geometric men G.J.O. Jmeson, Mth. Gzette 98 (4), 85 95 Given positive numbers > b, consider the itertion given by =, b = b nd n+ = ( n + b n ), b n+ = ( n b n ) /. At ech
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
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 informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
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 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 informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationStuff You Need to Know From Calculus
Stuff You Need to Know From Clculus For the first time in the semester, the stuff we re doing is finlly going to look like clculus (with vector slnt, of course). This mens tht in order to succeed, you
More informationDefinite integral. Mathematics FRDIS MENDELU
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the
More informationBest Approximation. Chapter The General Case
Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given
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 informationThe presentation of a new type of quantum calculus
DOI.55/tmj-27-22 The presenttion of new type of quntum clculus Abdolli Nemty nd Mehdi Tourni b Deprtment of Mthemtics, University of Mzndrn, Bbolsr, Irn E-mil: nmty@umz.c.ir, mehdi.tourni@gmil.com b Abstrct
More informationZ b. f(x)dx. Yet in the above two cases we know what f(x) is. Sometimes, engineers want to calculate an area by computing I, but...
Chpter 7 Numericl Methods 7. Introduction In mny cses the integrl f(x)dx cn be found by finding function F (x) such tht F 0 (x) =f(x), nd using f(x)dx = F (b) F () which is known s the nlyticl (exct) solution.
More informationReview of Riemann Integral
1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.
More informationDefinite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová (Mendel University) Definite integrl MENDELU / Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function
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 informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More informationChapter 3 Polynomials
Dr M DRAIEF As described in the introduction of Chpter 1, pplictions of solving liner equtions rise in number of different settings In prticulr, we will in this chpter focus on the problem of modelling
More informationMonte Carlo method in solving numerical integration and differential equation
Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The
More informationThe final exam will take place on Friday May 11th from 8am 11am in Evans room 60.
Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23
More informationAN INTEGRAL INEQUALITY FOR CONVEX FUNCTIONS AND APPLICATIONS IN NUMERICAL INTEGRATION
Applied Mthemtics E-Notes, 5(005), 53-60 c ISSN 1607-510 Avilble free t mirror sites of http://www.mth.nthu.edu.tw/ men/ AN INTEGRAL INEQUALITY FOR CONVEX FUNCTIONS AND APPLICATIONS IN NUMERICAL INTEGRATION
More informationNumerical integration
2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter
More informationNatural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring
More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),
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 informationAPPROXIMATE INTEGRATION
APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be
More informationChapter 1. Basic Concepts
Socrtes Dilecticl Process: The Þrst step is the seprtion of subject into its elements. After this, by deþning nd discovering more bout its prts, one better comprehends the entire subject Socrtes (469-399)
More informationdifferent methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s).
Mth 1A with Professor Stnkov Worksheet, Discussion #41; Wednesdy, 12/6/217 GSI nme: Roy Zho Problems 1. Write the integrl 3 dx s limit of Riemnn sums. Write it using 2 intervls using the 1 x different
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More informationDecomposition of terms in Lucas sequences
Journl of Logic & Anlysis 1:4 009 1 3 ISSN 1759-9008 1 Decomposition of terms in Lucs sequences ABDELMADJID BOUDAOUD Let P, Q be non-zero integers such tht D = P 4Q is different from zero. The sequences
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More information13: Diffusion in 2 Energy Groups
3: Diffusion in Energy Groups B. Rouben McMster University Course EP 4D3/6D3 Nucler Rector Anlysis (Rector Physics) 5 Sept.-Dec. 5 September Contents We study the diffusion eqution in two energy groups
More informationSOME PROPERTIES OF CHEBYSHEV SYSTEMS
SOME PROPERTIES OF CHEBYSHEV SYSTEMS RICHARD A. ZALIK Abstrct. We study Chebyshev systems defined on n intervl, whose constituent functions re either complex or rel vlued, nd focus on problems tht my hve
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
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 informationNUMERICAL INTEGRATION
NUMERICAL INTEGRATION How do we evlute I = f (x) dx By the fundmentl theorem of clculus, if F (x) is n ntiderivtive of f (x), then I = f (x) dx = F (x) b = F (b) F () However, in prctice most integrls
More information63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1
3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =
More informationMIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model:
1 2 MIXED MODELS (Sections 17.7 17.8) Exmple: Suppose tht in the fiber breking strength exmple, the four mchines used were the only ones of interest, but the interest ws over wide rnge of opertors, nd
More information1 The Riemann Integral
The Riemnn Integrl. An exmple leding to the notion of integrl (res) We know how to find (i.e. define) the re of rectngle (bse height), tringle ( (sum of res of tringles). But how do we find/define n re
More informationIntegrals - Motivation
Integrls - Motivtion When we looked t function s rte of chnge If f(x) is liner, the nswer is esy slope If f(x) is non-liner, we hd to work hrd limits derivtive A relted question is the re under f(x) (but
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2019
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS MATH00030 SEMESTER 208/209 DR. ANTHONY BROWN 7.. Introduction to Integrtion. 7. Integrl Clculus As ws the cse with the chpter on differentil
More informationMath 360: A primitive integral and elementary functions
Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:
More informationFUNCTIONS OF α-slow INCREASE
Bulletin of Mthemticl Anlysis nd Applictions ISSN: 1821-1291, URL: http://www.bmth.org Volume 4 Issue 1 (2012), Pges 226-230. FUNCTIONS OF α-slow INCREASE (COMMUNICATED BY HÜSEYIN BOR) YILUN SHANG Abstrct.
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
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 informationThe Riemann-Lebesgue Lemma
Physics 215 Winter 218 The Riemnn-Lebesgue Lemm The Riemnn Lebesgue Lemm is one of the most importnt results of Fourier nlysis nd symptotic nlysis. It hs mny physics pplictions, especilly in studies of
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 informationIntegral points on the rational curve
Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box
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 informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
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 informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
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 informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationA new algorithm for generating Pythagorean triples 1
A new lgorithm for generting Pythgoren triples 1 RH Dye 2 nd RWD Nicklls 3 The Mthemticl Gzette (1998; 82 (Mrch, No. 493, pp. 86 91 http://www.nicklls.org/dick/ppers/mths/pythgtriples1998.pdf 1 Introduction
More informationWhen a force f(t) is applied to a mass in a system, we recall that Newton s law says that. f(t) = ma = m d dt v,
Impulse Functions In mny ppliction problems, n externl force f(t) is pplied over very short period of time. For exmple, if mss in spring nd dshpot system is struck by hmmer, the ppliction of the force
More informationPredict Global Earth Temperature using Linier Regression
Predict Globl Erth Temperture using Linier Regression Edwin Swndi Sijbt (23516012) Progrm Studi Mgister Informtik Sekolh Teknik Elektro dn Informtik ITB Jl. Gnesh 10 Bndung 40132, Indonesi 23516012@std.stei.itb.c.id
More informationLecture 20: Numerical Integration III
cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed
More informationn f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1
The Fundmentl Theorem of Clculus As we continue to study the re problem, let s think bck to wht we know bout computing res of regions enclosed by curves. If we wnt to find the re of the region below the
More informationNUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationON A CONVEXITY PROPERTY. 1. Introduction Most general class of convex functions is defined by the inequality
Krgujevc Journl of Mthemtics Volume 40( (016, Pges 166 171. ON A CONVEXITY PROPERTY SLAVKO SIMIĆ Abstrct. In this rticle we proved n interesting property of the clss of continuous convex functions. This
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More information13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS
33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in
More informationChapter 3 Solving Nonlinear Equations
Chpter 3 Solving Nonliner Equtions 3.1 Introduction The nonliner function of unknown vrible x is in the form of where n could be non-integer. Root is the numericl vlue of x tht stisfies f ( x) 0. Grphiclly,
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 informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
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 information