6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
|
|
- Jason Freeman
- 6 years ago
- Views:
Transcription
1 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio o. The equivalece classes are called the cogruece classes or residue classes (modulo ). The cogruece class of a will be deoted by a. Notice that there is ambiguity i this otatio, for there is o referece to the modulus. Thus 1 represets the residue class of 1 with respect to the modulus 1, also with respect to the modulus 2, also with respect to the modulus 3, i fact with respect to ay modulus. However, the modulus will be usually fixed throughout a particular discussio ad a will represet the residue class of a with respect to that fixed modulus. The ambiguity is therefore harmless. By the divisio algorithm (Theorem 5.3), ay. iteger k ca be writte as k = q + r, with q,r, 0 r b. So ay iteger. k is cogruet (mod ) to oe of the umbers 0,1,2,..., 1. Furthermore,. o two distict of the umbers 0,1,2,..., 1 are cogruet (mod ), for if r 1, r 2 {0,1,2,..., 1} ad r 1 r 2 (mod ), the r 1 r 2, so r 1 r 2 by Lemma 5.2(11), ad so ( 1) 0, which is impossible. Thus ay iteger is cogruet to oe of the umbers 0,1,2,..., 1, ad these umbers are pairwise ico-gruet. This meas that 0,1,2,..., 1 are the represetatives of all the residue classes. Hece there are exactly residue classes (mod ), amely 0 = {x : x 0 (mod )} = {z : z } =: 1 = {x : (mod )} = {z + 1 : z } =: = {x : x 2 (mod )} = {z + 2 : z } =: = {x : x 1 (mod )} = {z + ( 1) : z } =: +( 1). The set {0,1,2,..., 1 } of residue classes (mod ) will be deoted by. A elemet of, thas is, a residue class (mod ) is called a iteger modulo, or a iteger mod. A iteger mod is ot a iteger, ot 54
2 a elemet of ; it is a subset of. A iteger mod is ot a iteger with a property "mod ". It is a object whose ame cosists of the three words "iteger", "mod(ulo)", "". 6.1 Lemma: Let, a,a 1,b,b 1. If a a 1 (mod ) ad b b 1 (mod ), the a + b a 1 (mod ) ad ab a 1 b 1 (mod ). Proof: If a a 1 (mod ) ad b b 1 (mod ), the a a 1 ad b b 1. Hece (a a 1 ) + (b b 1 ) by Lemma 5.2(5), which gives (a + b) (a 1 ), so a + b a 1 (mod ). Also, b(a a 1 ) + a 1 (b b 1 ) by Lemma 5.2(7), which gives ba a 1 b 1, so ab a 1 b 1 (mod ). We wat to defie a kid of additio ad a kid of multiplicatio o. We put a b = a + b ( * ) for all a,b (for all a,b additio ad multiplicatio o a b = ab ( ** ) ). This is a very atural way of itroducig. ( * ) ad ( ** ) seem quite. iocet, but we must check that ad are really biary operatios o. The reader might say at this poit that ad are clearly defied o ad that there is othig to check. But yes, there is. Let us remember that a biary operatio o is a fuctio from ito (Defiitio 3.18). As such, to each pair (a,b) i, there must correspod a sigle elemet a b ad a b if. ad are to be biary operatios o (Defiitio 3.1) We must check that the rules ( * ) ad ( ** ) produce elemets of that are uiquely determied by a ad b. The rules ( * ) ad ( ** ) above covey the wrog. impressio that a ad a b are uiquely determied by a ad b. I. order to peetrate ito the matter, let us try to evaluate X Y, where X,Y give directly as the residue classes of itegers a,b the discussio applies equally well to.) How do we. fid X. b are ot. (We discuss ; Y? Sice X,Y, there are itegers a,b with a = X, b = Y. Now add a ad b i to get a+b, the take the residue class of a+b. The result is X Y. 55
3 The result? The questio is whether we have oly oe result to justify the article "the". We summarize telegrammatically. To fid X Y, 1) choose a from X, 2) choose b from Y, 3) fid a + b i, 4) take the residue class of a + b. This souds a perfectly good recipe for fidig X use some auxiliary objects, amely a ad b, to fid X Y,. but otice that we Y,. which must be determied by X ad Y aloe.. Ideed, the result a + b depeds explicitly o the auxiliary objects a ad b.. We ca use our recipe with differet auxiliary objects. Let us do it. 1) I choose a from X ad you choose a 1 from X. 2) I choose b from Y ad you choose b 1 from Y. 3) I compute a + b ad you compute a 1. I geeral, a + b a 1. Hece our recipe gives, geerally speakig, distict elemets a + b ad a 1. So far, both of us followed the same recipe.. I caot claim that my computatio is correct ad yours is false.. Nor ca you claim the cotrary. Now we carry out the fourth step.. I fid the residue class of a + b as X Y, ad you fid the residue class of a 1 as X Y. Sice a + b a 1 i, it ca very well happe that a + b a 1 i. O the other had, if is. to be a biary operatio o, we must have a + b = a 1 + b. This is 1 the cetral issue. I order that be a biary operatio o, there must work a mechaism which esures a + b = a 1 + a 1 wheever a = a 1, b 1 = b, eve if a + b a 1. If there is such a mechaism, we say is a well defied operatio o. This meas operatio o : X is really a geuie Y is uiquely determied by X ad Y aloe. Ay depedece of X Y o auxiliary itegers a. X ad b Y is oly apparet. We will prove that ad are well defied operatios o, but before that, we discuss more geerally well defiitio of fuctios.. A fuctio f: A B is essetially a rule by which each elemet a of A is associated with a uique elemet of f(a) = b of B. The importat poit is that the rule produces a elemet f(a) that depeds oly o a. Sometimes we cosider rules havig the followig form. To fid f(a), 1) do this ad that 2) take a x related to a i such ad such maer 3) do this ad that to x 4) the result is f(a). 56
4 A rule of this type uses a auxiliary object x. The result the depeds o a ad x. At least, it seems so. This is due to the ambiguity i the secod step. This step states that we choose a x with such ad such property, but there may be may objects x,y,z,... related to a i the prescribed maer. The auxiliary objects x,y,z,... will, i geeral, produce differet results, so we should perhaps that the result is f(a,x) (or f(a,y), f(a,z),... ). I order the above rule to be a fuctio, it must produce the same result. Hece we must have f(a,x) = f(a,y) = f(a,z) =.... The rule must be so costructed that the same result will obtai eve if we use differet auxiliary objects. If this be the case, the fuctio is said to be well defied. This termiology is somewhat ufortuate. It souds as though there are two types of fuctios, well defied fuctios ad ot well defied fuctios (or badly defied fuctios). This is defiitely ot the case. A well defied fuctio is simply a fuctio. Badly defied fuctios do ot exist. Beig well defied is ot a property, such as cotiuity, boudedess, differetiability, itegrability etc. that a fuctio might or might ot possess. That a fuctio f: A B is well defied meas: 1) the rule of evaluatig f(a) for a A makes use of auxiliary, foreig objects, 2) there are may choices of these foreig objects, hece 3) we have reaso to suspect that applyig the rule with differet choices may produce differet results, which would imply that our rule does ot determie f(a) uiquely ad f is ot a fuctio i the sese of Defiitio 3.1, but 4) our suspicio is ot justified, for there is a mechaism, hidde uder the rule, which esures that same result will obtai eve if we apply the rule with differet auxiliary objects. The questio as to whether a "fuctio" is well defied arises oly if that "fuctio" uses objects ot uiquely determied by the elemet a i its "domai" i order to evaluate f(a). We wrote "fuctio" i quotatio marks, for such a thig may ot be a fuctio i the sese of Defiitio 3.1. Give such a "fuctio", which we wat to be a fuctio i the sese of Defiitio 3.1, we check whether f(a) is uiquely determied by a, that is, we check whether f(a) is idepedet of the auxiliary objects that we use for evaluatig f(a). If this be the case, our supposed "fuctio" f is ideed a fuctio i the sese of Defiitio 3.1. We say the that f is well defied, or f is a well defied fuctio. This meas f is a fuctio. I fact, it is more accurate to say that a fuctio is defied istead of sayig that a fuctio is well defied. 57
5 6.2 Examples: (a). Let L be the set of all straight lies i the Euclidea plae, o which we have a cartesia coordiate system.. We cosider the "fuctio" s: L { },. which assigs the slope of the lie l to l. How do we fid s(l)? As follows: 1) choose a poit, say (, ), o l; 2) choose aother poit, say (x 2,y 2 ), o l; 3) evaluate x 2 ad y 2 ; 4) put s(l) = (y 2 )/(x 2 ) if x 2 ad s(l) = if = x 2. Clearly we ca choose the poits i may ways. For example, we might choose (, ) (, ) as the first poit, (x 2,y 2 ) (x 2,y 2 ) as the secod poit. The we have, i geeral, x 2 x 2 ad y 2 y 2, so we might suspect that (y 2 )/(x 2 ) (y 2 )/(x 2 ). It is kow from aalytic geometry that these two quotiets are equal, hece s(l) depeds oly o l, ad ot o the poits we choose. Thus s is a well defied fuctio. Ultimately, this is due to the fact that there passes oe ad oly oe straight lie through two distict poits. The ext example shows that well defiitio breaks dow if we modify the domai a little. (b) Let C be the set of all curves i the Euclidea plae.. We cosider the "fuctio" s: C { },. which assigs the "slope" of the curve c to c. How do we fid s(c)? As follows: 1) choose a poit, say (, ), o l; 2) choose aother poit, say (x 2,y 2 ), o l; 3) evaluate x 2 ad y 2 ; 4) put s(l) = (y 2 )/(x 2 ) if x 2 ad s(l) = if = x 2. This is the same rule as the rule i Example 6.2(a). Let us fid the "slope" of the curve y = x 2. 1) Choose a poit o this curve, for example (0,0). If you prefer, you might choose ( 1,1). 2) Choose aother poit o this curve, for example (1,1). If you prefer, you might choose (2,4) of course. 3) Evaluate the differeces of coordiates. We fid 1 0 ad 1 0. You fid 2 ( 1) ad 4 1. Hece 4) the slope is 2/1. You fid it to be 3/3. So s(c) = 2 ad s(c) = 1. This is osese. We see that differet choices of the poits o the curve (differet choices of the auxiliary objects) give rise to differet results. So the above rule is ot a fuctio. We do ot say "s is ot a well defied fuctio". s is simply ot a fuctio at all. s is ot defied. (c) Let F be the set of all cotiuous fuctios o a closed iterval [a,b]. We wat to "defie" a itegral "fuctio" I: F, which assiges the real umber a b f(x)dx to f F. So I(f) = a b f(x)dx. I is a "fuctio" whose "domai" is a set of fuctios. How do we fid I(f)?. As follows. 1) Choose a idefiite itegral of f,. that is, choose a fuctio F o [a,b] such that F (x) = f(x) for all x [a,b]. (we take oe-sided derivatives at a 58
6 ad b). 2) Evaluate F(a) ad F(b). 3) Put I(f) = F(b) F(a).. There are may fuctios F with F (x) = f(x) for all x [a,b].. For two differet choices F 1 ad F 2, we have F 1 (b) F 2 (b) ad F 1 (a) F 2 (a) i geeral. So we may suspect that F 1 (b) F 1 (a) F 2 (b) F 2 (a). I order to show that I is a well defied fuctio, we must prove F 1 (b) F 1 (a) = F 2 (b) F 2 (a) wheever F 1 ad F 2 are fuctios o [a,b] such that F 1 (x) = f(x) = F 2 (x) for all x [a,b]. We kow from the calculus that, whe F 1 ad F 2 have this property, there is a costat c such that F 1 (x) = F 2 (x) + c for all x [a,b]. So F 1 (b) F 1 (a) = (F 2 (b) + c) (F 2 (a) + c) = F 2 (b) F 2 (a). Therefore, I is well defied. After this legthy digressio, we retur to the itegers mod ad to the "operatios" ad. 6.3 Lemma: ad are well defied operatios o. Proof:. We are to prove a b = a b ad a b = a b wheever a = a ad b = b i (differet ames for idetical residue classes should ot yield differeret results). This follows from Lemma 6.1. Ideed, if a = a ad b = b, the a a (mod ) ad b b (mod ) by defiitio, so we obtai a + b a + b (mod ) ad ab a b (mod ) by Lemma 6.1, hece a + b = a + b ad ab = a b, which gives a b = a + b = a + b = a b ad a b = ab = a b = a b. Havig proved that ad are well defied operatios o, we proceed to show that ad possess may (but ot all) properties of the usual additio ad multiplicatio of itegers. First we simplify our otatio. From ow o, we write + ad. istead of ad. I fact, we shall eve drop. ad use simply juxtapositio to deote a product of two itegers mod. Thus. we will have a + b = a + b ad a. b = ab or simply a b = ab. The. reader should ote that the same sig "+" is used to deote two very distict. operatios: i the old otatio ad the usual additio of itegers.. If aythig, they are defied o distict sets ad. The same remarks apply to multiplicatio. 59
7 6.4 Lemma: For all a,b,c (1) a + b ; (2) (a + b) + c = a + (b + c ); (3) a + 0 = a ; (4) a + a = 0; (5) a + b = b + a ; (6) a. b ; (7) (a. b). c = a. (b. c ); (8) a. 1= a ; (9) if (a,) = 1, the there is a x (10) a. b = b. a ;, the followig hold. such that a. x = 1; (11) a. (b + c) = a. b + a. c ad (b + c). a = b. a + c. a ; (12) a. 0 = 0. Proof: (1) is obvious. (2) follows from the correspodig property of additio i. We ideed have (a + b) + c = ( a + b ) + c = (a + b) + c = a + (b + c) = a + (b + c) = a + (b + c). The remaiig assertios are proved i the same way by drawig bars over itegers i the correspodig equatios i. We prove oly (9), which is ot as straightforward as the other claims. If (a,) = 1, The there are itegers x,y with ax y = 1 (Lemma 5.10). Usig (3) ad (12), we get 1 = ax y= ax y = a. x. y = a. x 0. y = a. x 0 = a. x. Exercises 1. Determie whether the "fuctio" g: 13 is well defied, if g is defied as follows. (a) g(a ) = (a,13); (b) g(a ) = (a,26); (c) g(a ) = (a,169); (d) g(a ) = (a 2,13); 60
8 (e) g(a ) = (a 3,169); (f) g(a ) = (a,6); (g) g(a ) = (a 2,65); where a 2) Let f: 13 ad a be such that (a,b) f a 2 +ab+b 2. Is f well defied? 3) For a iteger a, we deote by a the residue class of a (mod 12), by ã the residue class of a (mod 6), ad by â the residue class of a (mod 5), so that a 12, ã 6 ad â. Determie whether the followig 5 "fuctios" are well defied. (a) 12 6, a ã; (b) 6 12, â a ; (c) 12 5, a â; (d) 5 6, â ã; (e) 5 6, â a+1 ~. 61
Infinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationSummary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this
More informationlim za n n = z lim a n n.
Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationModern Algebra. Previous year Questions from 2017 to Ramanasri
Moder Algebra Previous year Questios from 017 to 199 Ramaasri 017 S H O P NO- 4, 1 S T F L O O R, N E A R R A P I D F L O U R M I L L S, O L D R A J E N D E R N A G A R, N E W D E L H I. W E B S I T E
More informationContinuous Functions
Cotiuous Fuctios Q What does it mea for a fuctio to be cotiuous at a poit? Aswer- I mathematics, we have a defiitio that cosists of three cocepts that are liked i a special way Cosider the followig defiitio
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationLecture 6: Integration and the Mean Value Theorem. slope =
Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech 202 The Mea Value Theorem The Mea Value Theorem abbreviated MVT is the followig result: Theorem. Suppose
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationSeptember 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1
September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright
More information1. ARITHMETIC OPERATIONS IN OBSERVER'S MATHEMATICS
1. ARITHMETIC OPERATIONS IN OBSERVER'S MATHEMATICS We cosider a ite well-ordered system of observers, where each observer sees the real umbers as the set of all iite decimal fractios. The observers are
More information2 Geometric interpretation of complex numbers
2 Geometric iterpretatio of complex umbers 2.1 Defiitio I will start fially with a precise defiitio, assumig that such mathematical object as vector space R 2 is well familiar to the studets. Recall that
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More information4.3 Growth Rates of Solutions to Recurrences
4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationINEQUALITIES BJORN POONEN
INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad
More informationInverse Matrix. A meaning that matrix B is an inverse of matrix A.
Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationWe are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n
Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This
More informationA brief introduction to linear algebra
CHAPTER 6 A brief itroductio to liear algebra 1. Vector spaces ad liear maps I what follows, fix K 2{Q, R, C}. More geerally, K ca be ay field. 1.1. Vector spaces. Motivated by our ituitio of addig ad
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationSection 4.3. Boolean functions
Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationSection 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations
Differece Equatios to Differetial Equatios Sectio. Calculus: Areas Ad Tagets The study of calculus begis with questios about chage. What happes to the velocity of a swigig pedulum as its positio chages?
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 5: SINGULARITIES. ANDREW SALCH 1. The Jacobia criterio for osigularity. You have probably oticed by ow that some poits o varieties are smooth i a sese somethig
More informationHOMEWORK #10 SOLUTIONS
Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationPolynomial Functions and Their Graphs
Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively
More informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationSome examples of vector spaces
Roberto s Notes o Liear Algebra Chapter 11: Vector spaces Sectio 2 Some examples of vector spaces What you eed to kow already: The te axioms eeded to idetify a vector space. What you ca lear here: Some
More informationTheorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.
Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More information(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:
Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationMath 10A final exam, December 16, 2016
Please put away all books, calculators, cell phoes ad other devices. You may cosult a sigle two-sided sheet of otes. Please write carefully ad clearly, USING WORDS (ot just symbols). Remember that the
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationMath 4400/6400 Homework #7 solutions
MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationChapter 8. Euler s Gamma function
Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the
More informationLecture 6: Integration and the Mean Value Theorem
Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech - Fall, 2011 1 Radom Questios Questio 1.1. Show that ay positive ratioal umber ca be writte as the sum of
More informationMath 113, Calculus II Winter 2007 Final Exam Solutions
Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationTHE SOLUTION OF NONLINEAR EQUATIONS f( x ) = 0.
THE SOLUTION OF NONLINEAR EQUATIONS f( ) = 0. Noliear Equatio Solvers Bracketig. Graphical. Aalytical Ope Methods Bisectio False Positio (Regula-Falsi) Fied poit iteratio Newto Raphso Secat The root of
More informationLet us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.
Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,
More information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More informationSubject: Differential Equations & Mathematical Modeling-III
Power Series Solutios of Differetial Equatios about Sigular poits Subject: Differetial Equatios & Mathematical Modelig-III Lesso: Power series solutios of differetial equatios about Sigular poits Lesso
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationBrief Review of Functions of Several Variables
Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationUniversity of Manitoba, Mathletics 2009
Uiversity of Maitoba, Mathletics 009 Sessio 5: Iequalities Facts ad defiitios AM-GM iequality: For a, a,, a 0, a + a + + a (a a a ) /, with equality iff all a i s are equal Cauchy s iequality: For reals
More informationCOMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION (x 1) + x = n = n.
COMPUTING SUMS AND THE AVERAGE VALUE OF THE DIVISOR FUNCTION Abstract. We itroduce a method for computig sums of the form f( where f( is ice. We apply this method to study the average value of d(, where
More informationThe minimum value and the L 1 norm of the Dirichlet kernel
The miimum value ad the L orm of the Dirichlet kerel For each positive iteger, defie the fuctio D (θ + ( cos θ + cos θ + + cos θ e iθ + + e iθ + e iθ + e + e iθ + e iθ + + e iθ which we call the (th Dirichlet
More information