Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring
|
|
- Emma Jenkins
- 5 years ago
- Views:
Transcription
1 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), nd stisfies the following dditionl properties: (v) (bc) = (b)c, b, c R i.e., ssocitivity for multipliction (vi) 1 R such tht 1 = = 1 R i.e., multiplictive identity * (vii) (b + c) = (b) + (c) nd ( + b)c = (c) + (bc), b, c R i.e., distributivity ** Nturl exmples of rings re the ring of integers, ring of polynomils in one vrible, the ring Zn of integers mod n, the Boolen ring of P(A) for some set A under + (symmetric difference) nd (s multipliction), nd the ring of 3 3 mtrices of rel numbers. Since + is lwys commuttive in ring, we sy tht ring is commuttive if its multipliction is commuttive (notice tht the mtrix ring fils to be commuttive). Notice lso tht there s no requirement for ring to hve multiplictive inverses. If ring is commuttive nd hs multiplictive inverses for everything other tht 0, then it s clled field. For exmple, the field of rtionl numbers, or of rel numbers, or integers modulo prime, or non-singulr 3 3 mtrices together with the zero mtrix. The fct tht the integers re commuttive ring, but fil to be field, nd tht they re very useful(!!), is why ttention is focussed on rings. In this course we ll mostly confine our ttention to commuttive rings becuse of the more immedite ppliction to the integers. * Some uthors prefer not to include the requirement of generl ring hving multiplictive identity, preferring to tlk bout rings nd rings with identity s very distinct nimls. There re some benefits to this, however the community is divided on this, so for simplicity we ll go with the side tht includes ** There re bunch of useful properties common to ll rings. For exmple, 0x = 0 lwys, since 0x = (0 + 0)x = 0x + 0x. Also ( 1)x = x lwys, since x + ( 1)x = 1x + ( 1)x = (1 + ( 1))x = 0x = 0. Similrly, ( )( b) = b lwys.
2 Returning to where we left off two slides go, we observed tht in the field Zp ny non-zero element hs the property tht p 1 = 1. Wht bout the commuttive ring Zn when n isn t prime, for exmple when n = p r? First some definitions. Let s define unit in commuttive * ring to be ny element u R such tht v R with uv = 1. The set of ll units in ring (clerly non=empty since 1 is unit) is clled the group of units of the ring R, nd is often denoted R. We define p R to be prime if it s not unit nd if p b p or p b. ** Similrly, we cn define zero divisor to be ny non-zero element r R such tht s R with s 0 nd rs = 0. Notice tht zero divisors cn t hve multiplictive inverses. *** If t R is such tht t k = 0 for some k 1, then t is sid to be nilpotent. Notice tht if ring hs no zero divisors ****, then even if it doesn t hve multiplictive inverses, we cn still solve equtions like x = b if 0, for then 0 = x b = (x b), nd the lck of zero divisors then implies tht either = 0 or x b = 0, hence x b = 0 nd so x = b. So cncelltion is still possible even without inverses! So wht does the group of units of R = Zn look like? We could list the elements, so if n = p r : \ \ \ \ \ R = { 0, 1, 2,..., p 1, p, p + 1,..., 2p 1, 2p, 2p + 1,..., 3p 1, 3p, 3p + 1,....., p r 1 1, p r 1, p r 1 + 1,..., p r 1 } So there were totl of p r elements in R, from which we ve deleted p r 1 of them (since multiples of p cn t hve multiplictive inverses), leving us with R = p r p r 1. * If defining this for non-commuttive ring, then we d hve to require both tht uv = 1 nd vu = 1. *** Otherwise if m k = 1 nd r m = 0, then r = r1 = r (m k) = (r m) k = 0 k = ** Recll tht the nottion x y mens tht x divides y exctly. Notice lso tht our definition specificlly excludes 1 from being prime. **** Such ring is clled n integrl domin.
3 More generlly, if n is some composite number, then n = rm, whereupon m is zero divisor nd so cn t hve multiplictive inverse. So R comprises numbers between 1 nd n which re co-prime to n. This quntity is function, nmely φ(n), nd is clled the Euler phi function. Notice tht φ(n) = 1 for ny non zero-divisor R when R = Zn. How cn we clculte φ(n)? We ve seen tht φ(n) = p 1 if n = p ( prime), nd lso tht φ(n) = p r p r 1 if n = p r. Indeed, it s not hrd to show * tht if nd b re co-prime, then φ(b) = φ() φ(b), hence for n ny composite number, by fctorising n completely we cn get φ(n) = φ(p r.... q z ) = (p r p r 1 ).... (q z q z 1 ) = n(1 p 1 ).... (1 q 1 ). Let s ply with wht we hve for bit. We ll clculte 2 35 (mod 7). Since 35 = (6)(5) + 5 nd φ(7) = 6, we cn see tht 2 35 = (2 6 ) = 1 32 = 4 (mod 7). Similrly, we cn clculte (mod 1176). Firstly we fctorise 1176 = (2 3 )(3)(7 2 ), so then φ(1176) = (8 4)(3 1)(49 7) = 336, nd then compute (mod 336), nmely 3. Hence = ( ) = 1331 (mod 1176) = 155 (mod 1176). In order to be ble to hndle multiple simultneous modulr equtions, we ll need to be ble to relte multiple rings. Essentilly, ech ring will define the effect of ech modulr fctor, but there s nturl isomorphism which will mke life much esier. Let s strt by supposing tht we hve two rings R nd S, then we cn mke the set R = R S into ring in nturl wy by defining (r, s) + (r, s ) = (r + r, s + s ) nd (r, s)(r, s ) = (rr, ss ). * you cn check tht this is true simply by compring the number of zero divisors of, b, nd b. We cn lso get this s corollry of the Chinese reminder theorem we ll prove shortly. 31
4 Define the subset A R to be bsorptive * if it s subgroup of R under + nd tht ra A nd Ar A ** for ll r R (hence the use of the word bsorptive ). As nturl exmple of such set in the ring Z consider A = nz, since for ny r R, ny t ra is utomticlly multiple of n nd so lives in A. It s not hrd to show tht if f : R S is ring homomorphism, then ker f is n bsorptive set (the kernel for rings will be the set of ll elements of R which get mpped to 0S). Notice tht if A is bsorptive nd 1 A, then A = R, so typiclly we re more interested in the cses where A doesn t contin 1. We define A + B = { + b A, b B } nd AB = { Σ ibi i A, bi B }, where the summtion in AB is only ever llowed to be over finitely mny things. It s esy to show tht both of these re bsorptive if A nd B re bsorptive. If A nd B re bsorptive in R, then we cn define f : R R/A R/B by f(r) = (r + A, r + B). Then f is (ring) homomorphism, *** with ker f = A B. If moreover A + B = R, then f is onto nd A B = AB, **** hence R/AB is isomorphic to R/A R/B. In the context of R = Z nd A = mz nd B = nz, then if m nd n re coprime, then AB = mnz. However, why is it obvious tht A + B = R in this cse? It s ll down to the fct tht the gcd (gretest common divisor) of m nd n is 1. * This is not stndrd nottion. The stndrd lnguge is to cll these sets idels. However, the word bsorptive seems to chrcterise how they behve, so for now we ll use this more descriptive lnguge. ** Notice tht in fct, ra = A = Ar. Tht s esy to see once you spot tht 1 R mens tht 1A A. 32 *** Showing f(r + s) = f(r) + f(s) is strightforwrd. However, the bsorptive nture of A nd B is needed to show tht f(rs) = f(r) f(s) since, for exmple, (r + A) (s + B) = rs + ra + Ar + AA = rs + A + A + A = (rs) + A **** Since A is bsorptive, ibi A, nd since B is bsorptive, ibi B, nd since bsorptive sets re subgroups under +, Σ ibi A B! AB A B. Now if A + B = R then 1 A + B so 1 = + b for some A nd b B, but then c A B! c = c1 = c( + b) = c + cb AB. Hence A B AB.
5 So we need n effective wy to compute the gcd of pir of numbers. Clim: if d = gcd(m,n) then the eqution mx + ny = kd hs solutions x, y Z k Z. We ll pproch this by ctully constructing solution to the eqution 13155x y = 3 using the Eucliden subtrction lgorithm. Divide 2367 into to get = Divide 1320 into 2367 to get 2367 = Divide 1047 into 1320 to get 1320 = Divide 273 into 1047 to get 1047 = Divide 228 into 273 to get 273 = Divide 45 into 228 to get 228 = Divide 3 into 45 to get 45 = STOP. Hence this lst dividing vlue is the gcd of 2367 nd This is ctully process to find lrgest common mesurement unit for two lengths; t lest, tht ws how it ws formulted in ncient Greek times. It ws used to get pproximtions for the rtios of side to the digonl of squre, for side to the digonl Hence if we let units = 3, then working from the bottom up, 45 = 15 units 228 = 5(45) + 3 = 5(15 units) + 1 unit = 76 units 273 = 1(228) + 45 = 1(76) + 15 units = 91 units 1047 = 3(273) = 3(91) + 76 units = 349 units 1320 = 1(1047) = 1(349) + 91 units = 440 units 2367 = 1(1320) = 1(440) units = 789 units = 5(2367) = 5(789) units = 4385 units We cn lso use this informtion to get solution to the eqution by focussing on the reminders, letting = nd b = 2367, vi 1320 = 5b 1047 = b 1320 = b ( 5b) = + 6b 273 = = ( 5b) ( + 6b) = 2 11b 228 = (273) = ( + 6b) 3(2 11b) = b 45 = = (2 11b) ( b) = 9 50b 3 = 228 5(45) = ( b) 5(9 50b) = b of regulr pentgon, nd for the rtio of the circumference to the dimeter of circle, nd is strongly relted to the construction of continued frctions. 33
6 Notice tht if we tke successive trunctions of the previous continued frction, we get sequence of rtionl pproximtions to the vlue of r = , nd tht they lternte round bove nd below, nmely: r 5, 6, 5+ 1/2, 5+ 4/7, 5+ 5/9, 5+ 29/52, /789, or in deciml form: r 5, 6, 5.5, , , , = We ll pply this to find n sequence of pproximtions for the dimeter : side rtio for regulr pentgon. It ll be reminder of eucliden geometry... We ll lbel the length of side by s nd digonl by d. So in our picture, d = 2 + b. Since AB is prllel to EC, AEF is isoceles, nd AF = s. So d = s + nd s = + b Since EA is prllel to GF nd BD, EFG is isoceles, nd GF =. But GF is the digonl of nother regulr pentgon with side b. So d : s is the sme rtio s b :. So in the spirit of the eucliden subtrction lgorithm... D d = 1s +, s = 1 + b, b = 1s1 + 1, s1 = 11 + b1, b1 = 1s2 + 2, s2 = 12 + b2, b2 = 1s3 + 3,.... where the bn, sn, nd n re repeting the sme pttern of sides nd digonls within ever smller pentgons. This gives continued frction expnsion: d / s = 1 + 1/ (1 + 1/ (1 + 1/ (1 + 1/ ( ) ) ) ) which gives successive rtionl pproximtions: 1, 1+ 1/2, 1+ 2/3, 1+ 3/5, 1+ 5/8, 1+ 8/13, 1+ 13/21, 1+ 21/34,..... Not only does this method give surprisingly fst rtionl pproximtion, but it lso musingly uses the Fiboncci sequence! Applied to estimting π this process yields: 3, 22/7, 333/106, 355/113, /33102, E s A b G F b C B
7 This pproch cn be generlised. Suppose ring R cn dmit function f : R * N such tht, b R * q, r R with = bq + r nd f(r) < f(b) or r = 0. Certinly the ring of integers stisfies this (with for exmple, f(n) = n being the function). Cn we do this for Zn? Any ring which hs this property is sid to be Eucliden domin. Notice tht we could extend this to the ring of polynomils hving integer (or rtionl, or rel, or complex) coefficients by defining f to yield the degree of the polynomil. The results of pplying the Eucliden subtrction lgorithm to such polynomils will of course be different depending on the rnge of coefficients vilble. Before our detour on finding gcds, we rised the question of solving multiple simultneous modulr equtions, nd observed tht for A nd B bsorptive in R with A + B = R, then R/AB is isomorphic to R/A R/B, nd so if m nd n re coprime, then Zmn is isomorphic to Zm Zn. This is known s the Chinese reminder theorem. A consequence of this is tht if we re given pir of equtions x = mod m, x = b mod n with m, n coprime, then (, b) Zm Zn corresponds to unique vlue in Zmn, hence we cn solve in the trditionl simultneous eqution style, substituting successively. * We cn even do this for mny equtions, s long s the moduli re pirwise coprime. Suppose x = 3 mod 11, x = 6 mod 8, x = 1 mod 15. The first eqution gives us x = , so from the second eqution we get x = 6 + 8b = This gives 3 = 11 8b = 1 = b x = t s generl solution for the first two equtions. The third eqution gives us x = c = t 15 = 15c 88t c = 1, t = 0 x = s is the generl solution for the three equtions. 35 * This pproch ctully feels bit like using the Eucliden lgorithm -- we ll work through more efficient wy to formulte this in the homework.
Math 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 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 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 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 informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
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 informationMatrices. Elementary Matrix Theory. Definition of a Matrix. Matrix Elements:
Mtrices Elementry Mtrix Theory It is often desirble to use mtrix nottion to simplify complex mthemticl expressions. The simplifying mtrix nottion usully mkes the equtions much esier to hndle nd mnipulte.
More informationChapter 1: Fundamentals
Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,
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 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 QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p
THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ
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 informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
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 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 informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
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 informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
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 informationChapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY
Chpter 3 MTRIX In this chpter: Definition nd terms Specil Mtrices Mtrix Opertion: Trnspose, Equlity, Sum, Difference, Sclr Multipliction, Mtrix Multipliction, Determinnt, Inverse ppliction of Mtrix in
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 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 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 informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
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 informationHW3, Math 307. CSUF. Spring 2007.
HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem
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 informationHere we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.
Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous
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 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 informationMAT 215: Analysis in a single variable Course notes, Fall Michael Damron
MAT 215: Anlysis in single vrible Course notes, Fll 2012 Michel Dmron Compiled from lectures nd exercises designed with Mrk McConnell following Principles of Mthemticl Anlysis, Rudin Princeton University
More informationPre-Session Review. Part 1: Basic Algebra; Linear Functions and Graphs
Pre-Session Review Prt 1: Bsic Algebr; Liner Functions nd Grphs A. Generl Review nd Introduction to Algebr Hierrchy of Arithmetic Opertions Opertions in ny expression re performed in the following order:
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 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 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 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 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 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 informationQuadratic reciprocity
Qudrtic recirocity Frncisc Bozgn Los Angeles Mth Circle Octoer 8, 01 1 Qudrtic Recirocity nd Legendre Symol In the eginning of this lecture, we recll some sic knowledge out modulr rithmetic: Definition
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 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 informationMathCity.org Merging man and maths
MthCity.org Merging mn nd mths Exercise.8 (s) Pge 46 Textbook of Algebr nd Trigonometry for Clss XI Avilble online @ http://, Version: 3.0 Question # Opertion performed on the two-member set G = {0, is
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 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 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 informationLecture 19: Continuous Least Squares Approximation
Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for
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 informationThe Algebra (al-jabr) of Matrices
Section : Mtri lgebr nd Clculus Wshkewicz College of Engineering he lgebr (l-jbr) of Mtrices lgebr s brnch of mthemtics is much broder thn elementry lgebr ll of us studied in our high school dys. In sense
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 area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationFinite Field Arithmetic and Implementations. Xinmiao Zhang Case Western Reserve University
Finite Field Arithmetic nd Implementtions Xinmio Zhng Cse Western Reserve University Applictions of Finite Field Arithmetic Error-correcting codes Hmming codes BCH codes Reed-Solomon codes Low-density
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
More informationMath Lecture 23
Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question 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, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
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 informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
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 informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
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 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 informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics
SCHOOL OF ENGINEERING & BUIL ENVIRONMEN Mthemtics An Introduction to Mtrices Definition of Mtri Size of Mtri Rows nd Columns of Mtri Mtri Addition Sclr Multipliction of Mtri Mtri Multipliction 7 rnspose
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 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 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 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 informationECON 331 Lecture Notes: Ch 4 and Ch 5
Mtrix Algebr ECON 33 Lecture Notes: Ch 4 nd Ch 5. Gives us shorthnd wy of writing lrge system of equtions.. Allows us to test for the existnce of solutions to simultneous systems. 3. Allows us to solve
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 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 informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
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 informationLinear Algebra 1A - solutions of ex.4
Liner Algebr A - solutions of ex.4 For ech of the following, nd the inverse mtrix (mtritz hofkhit if it exists - ( 6 6 A, B (, C 3, D, 4 4 ( E i, F (inverse over C for F. i Also, pick n invertible mtrix
More informationCHAPTER 9. Rational Numbers, Real Numbers, and Algebra
CHAPTER 9 Rtionl Numbers, Rel Numbers, nd Algebr Problem. A mn s boyhood lsted 1 6 of his life, he then plyed soccer for 1 12 of his life, nd he mrried fter 1 8 more of his life. A dughter ws born 9 yers
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 informationIntroduction to Determinants. Remarks. Remarks. The determinant applies in the case of square matrices
Introduction to Determinnts Remrks The determinnt pplies in the cse of squre mtrices squre mtrix is nonsingulr if nd only if its determinnt not zero, hence the term determinnt Nonsingulr mtrices re sometimes
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 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 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 informationAbsolute values of real numbers. Rational Numbers vs Real Numbers. 1. Definition. Absolute value α of a real
Rtionl Numbers vs Rel Numbers 1. Wht is? Answer. is rel number such tht ( ) =. R [ ( ) = ].. Prove tht (i) 1; (ii). Proof. (i) For ny rel numbers x, y, we hve x = y. This is necessry condition, but not
More informationI do slope intercept form With my shades on Martin-Gay, Developmental Mathematics
AAT-A Dte: 1//1 SWBAT simplify rdicls. Do Now: ACT Prep HW Requests: Pg 49 #17-45 odds Continue Vocb sheet In Clss: Complete Skills Prctice WS HW: Complete Worksheets For Wednesdy stmped pges Bring stmped
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 informationNumerical Integration
Chpter 5 Numericl Integrtion Numericl integrtion is the study of how the numericl vlue of n integrl cn be found. Methods of function pproximtion discussed in Chpter??, i.e., function pproximtion vi the
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 informationLine and Surface Integrals: An Intuitive Understanding
Line nd Surfce Integrls: An Intuitive Understnding Joseph Breen Introduction Multivrible clculus is ll bout bstrcting the ides of differentition nd integrtion from the fmilir single vrible cse to tht of
More informationMath 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of
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 informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
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 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 information38 Riemann sums and existence of the definite integral.
38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These
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 informationCH 9 INTRO TO EQUATIONS
CH 9 INTRO TO EQUATIONS INTRODUCTION I m thinking of number. If I dd 10 to the number, the result is 5. Wht number ws I thinking of? R emember this question from Chpter 1? Now we re redy to formlize the
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 informationSTRAND B: NUMBER THEORY
Mthemtics SKE, Strnd B UNIT B Indices nd Fctors: Tet STRAND B: NUMBER THEORY B Indices nd Fctors Tet Contents Section B. Squres, Cubes, Squre Roots nd Cube Roots B. Inde Nottion B. Fctors B. Prime Fctors,
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 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 informationp(t) dt + i 1 re it ireit dt =
Note: This mteril is contined in Kreyszig, Chpter 13. Complex integrtion We will define integrls of complex functions long curves in C. (This is bit similr to [relvlued] line integrls P dx + Q dy in R2.)
More information