Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function
|
|
- Jemima Ball
- 5 years ago
- Views:
Transcription
1 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 gives a good ituitive feel for cogrueces. However, as poited out i the lab otebook, the algebraic defiitio The mai goal of this chapter is to provide a itroductio to cogrueces, ad to preset differet ways of thikig about cogruece classes. We ca look at cogrueces mod i terms of coutig with rows, i terms of remaiders, or i terms of differeces beig multiples of. We looked at arithmetic i terms of cogrueces ad foud that additio, subtractio, ad multiplicatio are all well defied for cogrueces classes. Fially, we ivestigated two additive questios related to cogrueces: the remaider of P j=1 of cogruece is ofte the most useful i proofs. defiitio our official defiitio here. So, we ow make the algebraic Deitio If is a positive iteger ad a, b Z, the we write a b (mod ) if j (b a). I Research Questio 1, we ivestigate oe way to characterize the relatioship betwee differet elemets i the same cogruece class. I this case, we will give two proofs. The first oe deals with cogruece i terms of coutig with rows, ad the secod oe uses our defiitio of cogruece as stated above. Theorem 3.1 (RQ1) I the output of modcogclasses[], 1 all of the etries i a give row are the same. Moreover, the commo value i a give row is the remaider whe each elemet is divided by. The fuctio modcogclasses[] is the same as cogclasses[], except that each umber is replaced by its remaider whe divided by. If we start coutig with 0 for cogclasses[], we see that each row gets exactly oe of the umbers 0, 1,..., 1. Sice there is exactly oe remaider (for divisio by ) ieachrowof cogclasses[], it suffices to prove this more fudametal result. Theorem 3. Suppose that a b (mod ). The a ad b have the same remaider whe divided by. Proof. It is eough to show that ay iteger a is i the same cogruece class as its remaider whe divided by. The cojecture would the follow because if a ad b are i the same cogruece class, we would kow that the remaider for a ad the 1 Here we use the Mathematica sytax for the fuctio. I Maple worksheets, the fuctio is writte modcogclasses(). I the web pages, the Java applet is titled Cogruece Classes modulo. The Java applet i the same sectio which correspods to cogclasses[] is titled simply Cogruece Classes. 177
2 178 CHAPTER 3. remaider for b would also be i this cogruece class. However, there is exactly oe remaider i each cogruece class modulo. So, a ad b would have to have the same remaider whe divided by. We ow show that a is i the same cogruece class as its remaider. From the Divisio Algorithm, we ca write a = q + r where r is the remaider whe a is divided by. The, a r = q ad so a r is a multiple of. Therefore, a r (mod ). Here is the more algebraic proof of RQ1 we promised above. Proof. By the Divisio Algorithm, we kow that we ca write a = q 1 + r 1 b = q + r where 0 r 1 <ad 0 r <. Therefore it follows that a b =(q 1 q ) +(r 1 r ). (3.1) Furthermore, sice a b (mod ), we kow that a b = k for some iteger k. Combiig this observatio with equatio (3.1), we get which implies k =(q 1 q ) +(r 1 r ), (k q 1 + q ) = r 1 r. (3.) It is clear that the left side of equatio (3.) is a multiple of, ad so the right side must be a multiple of as well. However, the restrictios o r 1 ad r impose the iequalities <r 1 r <. Therefore the oly possibility is that r 1 r =0 =0, ad so r 1 = r. Aother way of statig this theorem would be to say: If a b (mod ), the (a % ) =(b % ). The proof of this theorem is very similar to part of the proof of the Divisio Algorithm. Alteratively, we ca apply the Divisio Algorithm for yet aother proof: With the otatio as i this proof, we substitute b = q + r ito a b = k to get a q r = k. Rearragig a bit gives a =(q + k) + r. But a = q 1 + r 1, ad both r 1 ad r lie betwee 0 ad 1, so by the uiqueess of quotiet ad remaider we must have r 1 = r (ad q + k = q 1 ).
3 I fact, the if ad oly if versio of this statemet is true. Because of this equivalece, statemets ivolvig cogrueces ca ofte be made i either otatio. We will use the otatio uless the values of a remaider a % is particularly relevat to the statemet. Sice the cogruece classes modulo are i 1-1 correspodece with the possible remaiders for divisio by, it is useful to have a otatio for the remaiders. We let 3 Z = f0, 1,,..., 1g. Whe workig with cogrueces modulo, we like to thik of their beig differet umbers. Cocretely, we thik of these as the elemets of Z. To get from a iteger a to the uique elemet of Z to which it is cogruet modulo, we simply compute its remaider: a %. We refer to this process as reducig a modulo, or as fidig its value mod. I the Prelab sectio ad the electroic otebook, you have see examples that illustrate the fact that additio, subtractio, ad multiplicatio of cogruece classes are well defied. Not oly does this property make it possible to do arithmetic with cogruece classes, but it also ca ofte be exploited to make hard computatios much easier. Theorem 3.3 (RQ) Suppose that a b (mod ) ad c d (mod ). The a+c b + d (mod ), a c b d (mod ), ad ac bd (mod ). Proof. Sice a b (mod ), we kow that a b = k 1 for some iteger k 1. Similarly, sice c d (mod ) it follows that c d = k for some iteger k. Therefore we have ad so (a b)+(c d) =k 1 + k, (a + c) (b + d) =(k 1 + k ). Therefore a + c b + d (mod ). To prove the claim for multiplicatio, we first ote that we have, as above, a = b + k 1 ad c = d + k. Therefore ac bd =(b + k 1 )(d + k ) bd = bd + bk + dk 1 + k 1 k bd = bk + dk 1 + k 1 k =(bk + dk 1 + k 1 k ), 3 Note that abstract algebra books ofte use a defiitio of Z which is formally differet from this oe to capture essetially the same idea. 179
4 180 CHAPTER 3. ad so ac bd (mod ). The claim for subtractio ca be proved i a maer similar to the proof give for additio. Alteratively, we ca use our results for additio ad multiplicatio as follows: a c = a +( 1) c b +( 1) c (mod ) b +( 1) d (mod ) b d (mod ) Oe iterpretatio of the fact that cogruece arithmetic is well defied is that we ca thik of doig arithmetic with the elemets of Z. To add two elemets, we simply add them ad the take the remaider of the sum modulo. If we start with two itegers a ad b, we ca add them ad the reduce mod to get (a + b)%. For this to be a sesible operatio o elemets of Z, we do t wat the result to chage if we replace oe or both of the origial itegers a ad b with other itegers to which they are cogruet modulo. RQ assures us of just that. Oe way to prove the cojecture associated with Research Questio 3 is to take advatage of the fact that ay elemet of a cogruece class ca be used whe doig arithmetic. We frequetly use the umbers 0, 1,,..., 1 whe doig arithmetic modulo, but sometimes other choices are more useful. The proof give below illustrates this icely. Theorem 3.4 (RQ3) Let S()= If is odd, the S()% =0, ad if is eve, the S()% = /. Proof. I each case, we will rearrage the sum, pairig 1 with 1, pairig with, ad so o. The we use the fact that 0 (mod ) to simplify the expressios. First suppose that is odd. There are a eve umber of itegers from 1 to 1, so we ca pair them up clealy: =(1+( 1))+(+( )) (1+( 1))+(+( )) (mod ) 0 (mod ). Sice 0 is a possible remaider for divisio by, S()% =0.
5 Now suppose that is eve. Whe we apply our pairig strategy, / has o mate: =(1+( 1))+(+( )) (1+( 1))+(+( )) (mod ) (mod ) Sice 0 / <, we have that / is a possible remaider for divisio by. So, S()% = /. You may recogize this pairig strategy. It is ofte used to deduce a simple formula for the sum of the itegers from 1 to. If you remembered this formula, you could have used it to give a differet proof of this cojecture: Proof. We start with the stadard formula that ( +1) =. If is odd, the + 1 is eve which implies that ( +1)/ is a iteger. Thus, 181 ( +1) = = +1 0 (mod ). As above, this implies that S()% = 0 sice 0 is a possible remaider from divisio by. O the other had, if is eve we have that = ( +1) =( +1) 1 (mod ). I the last lie, we replaced + 1 with 1 because we are workig mod. Sice / is a possible remaider for divisio by, S()% = /. Research Questio 4 provides a warm-up for determiig the form of all solutios to ma 0 (mod ), which is the subject of Research Questio 5.
6 18 CHAPTER 3. Theorem 3.5 (RQ4) If a b (mod ), the the output from fidkillers[a,] will be idetical to the output from fidkillers[b,]. 4 Proof. The output from fidkillers[a,] is a list of itegers m such that m 8 ad ma 0 (mod ). Sice a b (mod ), it follows that ka kb (mod ) for ay iteger k. Therefore ma 0 (mod ) if ad oly if mb 0 (mod ), ad so the output from fidkillers[a,] is exactly the same as the output from fidkillers[b,]. The fial Research Questio focuses o the additive order of a iteger a modulo. Let s recall the defiitio. Deitio The additive order of a iteger a modulo is the least positive iteger j such that ja 0 (mod ). Our theorem states that ma 0 (mod ) if ad oly if m is a multiple of the additive order of a. The theorem also provides a formula for the additive order of a. Theorem 3.6 (RQ5) Let a Z ad let be a positive iteger. The, 1. The additive order of a modulo is gcd(a, ).. A iteger m satisfies the cogruece ma 0 (mod ) if ad oly if m = k gcd(a, ) for some iteger k. Proof. Note that the secod statemet implies the first sice the smallest positive iteger of the form k(/gcd(a, )) is clearly /gcd(a, ). So, we cocetrate o determiig the itegers m which satisfy ma 0 (mod ). Let d = gcd(a, ). If m = k(/d) for some iteger k, the ma = k d a = k a d which implies j ma, ad so ma 0 (mod ). Now assume the coverse, that ma 0 (mod ). The ma = c for some iteger c, ad so m(a/d) = c(/d). Because gcd(a/d, /d) = 1 (by exercise 1.14), it follows that (/d) j m. Thus, there is a iteger k such that m = k(/d), which is the form required. 4 This is the Mathematica sytax; i Maple worksheets, the fuctio is writte as fidkillers(a,). I the web pages, the Java applet is titled Fid Killers.,
In 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 information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
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
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 informationAPPENDIX F Complex Numbers
APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios
More informationInternational Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY
Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....
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 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 informationExponents. Learning Objectives. Pre-Activity
Sectio. Pre-Activity Preparatio Epoets A Chai Letter Chai letters are geerated every day. If you sed a chai letter to three frieds ad they each sed it o to three frieds, who each sed it o to three frieds,
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 informationTrial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014
Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms
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 informationAppendix F: Complex Numbers
Appedix F Complex Numbers F1 Appedix F: Complex Numbers Use the imagiary uit i to write complex umbers, ad to add, subtract, ad multiply complex umbers. Fid complex solutios of quadratic equatios. Write
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 informationRADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify
Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL
More informationn m CHAPTER 3 RATIONAL EXPONENTS AND RADICAL FUNCTIONS 3-1 Evaluate n th Roots and Use Rational Exponents Real nth Roots of a n th Root of a
CHAPTER RATIONAL EXPONENTS AND RADICAL FUNCTIONS Big IDEAS: 1) Usig ratioal expoets ) Performig fuctio operatios ad fidig iverse fuctios ) Graphig radical fuctios ad solvig radical equatios Sectio: Essetial
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 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 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 informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
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 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 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 information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
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 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 informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
More informationPolynomial and Rational Functions. Polynomial functions and Their Graphs. Polynomial functions and Their Graphs. Examples
Polomial ad Ratioal Fuctios Polomial fuctios ad Their Graphs Math 44 Precalculus Polomial ad Ratioal Fuctios Polomial Fuctios ad Their Graphs Polomial fuctios ad Their Graphs A Polomial of degree is a
More informationx c the remainder is Pc ().
Algebra, Polyomial ad Ratioal Fuctios Page 1 K.Paulk Notes Chapter 3, Sectio 3.1 to 3.4 Summary Sectio Theorem Notes 3.1 Zeros of a Fuctio Set the fuctio to zero ad solve for x. The fuctio is zero at these
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 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 informationComplex Numbers Primer
Complex Numbers Primer Complex Numbers Primer Before I get started o this let me first make it clear that this documet is ot iteded to teach you everythig there is to kow about complex umbers. That is
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 informationComplex Numbers Primer
Before I get started o this let me first make it clear that this documet is ot iteded to teach you everythig there is to kow about complex umbers. That is a subject that ca (ad does) take a whole course
More informationPolynomials with Rational Roots that Differ by a Non-zero Constant. Generalities
Polyomials with Ratioal Roots that Differ by a No-zero Costat Philip Gibbs The problem of fidig two polyomials P(x) ad Q(x) of a give degree i a sigle variable x that have all ratioal roots ad differ by
More informationNumber Conversion. Roland Backhouse March 5, 2001
1 Number Coversio Rolad Backhouse March 5, 2001 Outlie 2 We discuss the mathematical properties of covertig real umbers to itegers. I particular, we show how to implemet roudig up (of ratioal umbers) i
More informationAlgebra II Notes Unit Seven: Powers, Roots, and Radicals
Syllabus Objectives: 7. The studets will use properties of ratioal epoets to simplify ad evaluate epressios. 7.8 The studet will solve equatios cotaiig radicals or ratioal epoets. b a, the b is the radical.
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationAddition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c
Notes for March 31 Fields: A field is a set of umbers with two (biary) operatios (usually called additio [+] ad multiplicatio [ ]) such that the followig properties hold: Additio: Name Descriptio Commutativity
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 informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
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 informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationC. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions
C. Complex Numbers. Complex arithmetic. Most people thik that complex umbers arose from attempts to solve quadratic equatios, but actually it was i coectio with cubic equatios they first appeared. Everyoe
More informationSummary: CORRELATION & LINEAR REGRESSION. GC. Students are advised to refer to lecture notes for the GC operations to obtain scatter diagram.
Key Cocepts: 1) Sketchig of scatter diagram The scatter diagram of bivariate (i.e. cotaiig two variables) data ca be easily obtaied usig GC. Studets are advised to refer to lecture otes for the GC operatios
More informationUNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007
UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST First Roud For all Colorado Studets Grades 7- November, 7 The positive itegers are,,, 4, 5, 6, 7, 8, 9,,,,. The Pythagorea Theorem says that a + b =
More informationMath 61CM - Solutions to homework 1
Math 61CM - Solutios to homework 1 Cédric De Groote October 1 st, 2018 Problem 1: Use mathematical iductio to check the validity of the formula j 3 = 2 ( + 1) 2 for = 1, 2,.... Note: The priciple of mathematical
More informationP.3 Polynomials and Special products
Precalc Fall 2016 Sectios P.3, 1.2, 1.3, P.4, 1.4, P.2 (radicals/ratioal expoets), 1.5, 1.6, 1.7, 1.8, 1.1, 2.1, 2.2 I Polyomial defiitio (p. 28) a x + a x +... + a x + a x 1 1 0 1 1 0 a x + a x +... +
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 50-004 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
More informationInfinite 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 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 informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More information1 Summary: Binary and Logic
1 Summary: Biary ad Logic Biary Usiged Represetatio : each 1-bit is a power of two, the right-most is for 2 0 : 0110101 2 = 2 5 + 2 4 + 2 2 + 2 0 = 32 + 16 + 4 + 1 = 53 10 Usiged Rage o bits is [0...2
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 informationLINEAR ALGEBRA. Paul Dawkins
LINEAR ALGEBRA Paul Dawkis Table of Cotets Preface... ii Outlie... iii Systems of Equatios ad Matrices... Itroductio... Systems of Equatios... Solvig Systems of Equatios... 5 Matrices... 7 Matrix Arithmetic
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 informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
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 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 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 informationLESSON 2: SIMPLIFYING RADICALS
High School: Workig with Epressios LESSON : SIMPLIFYING RADICALS N.RN.. C N.RN.. B 5 5 C t t t t t E a b a a b N.RN.. 4 6 N.RN. 4. N.RN. 5. N.RN. 6. 7 8 N.RN. 7. A 7 N.RN. 8. 6 80 448 4 5 6 48 00 6 6 6
More informationMath 525: Lecture 5. January 18, 2018
Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If the
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationMath 609/597: Cryptography 1
Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit
More informationLinear Programming and the Simplex Method
Liear Programmig ad the Simplex ethod Abstract This article is a itroductio to Liear Programmig ad usig Simplex method for solvig LP problems i primal form. What is Liear Programmig? Liear Programmig is
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 informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationSNAP Centre Workshop. Basic Algebraic Manipulation
SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More information14.2 Simplifying Expressions with Rational Exponents and Radicals
Name Class Date 14. Simplifyig Expressios with Ratioal Expoets ad Radicals Essetial Questio: How ca you write a radical expressio as a expressio with a ratioal expoet? Resource Locker Explore Explorig
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
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 informationWORKING WITH NUMBERS
1 WORKING WITH NUMBERS WHAT YOU NEED TO KNOW The defiitio of the differet umber sets: is the set of atural umbers {0, 1,, 3, }. is the set of itegers {, 3,, 1, 0, 1,, 3, }; + is the set of positive itegers;
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 informationPROPERTIES OF THE POSITIVE INTEGERS
PROPERTIES OF THE POSITIVE ITEGERS The first itroductio to mathematics occurs at the pre-school level ad cosists of essetially coutig out the first te itegers with oe s figers. This allows the idividuals
More information10.2 Infinite Series Contemporary Calculus 1
10. Ifiite Series Cotemporary Calculus 1 10. INFINITE SERIES Our goal i this sectio is to add together the umbers i a sequece. Sice it would take a very log time to add together the ifiite umber of umbers,
More informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationCongruence Modulo a. Since,
Cogruece Modulo - 03 The [ ] equivalece classes refer to the Differece of quares relatio ab if a -b o defied as Theorem 3 - Phi is Periodic, a, [ a ] [ a] The period is Let ad a We must show ( a ) a ice,
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More information1. n! = n. tion. For example, (n+1)! working with factorials. = (n+1) n (n 1) 2 1
Biomial Coefficiets ad Permutatios Mii-lecture The followig pages discuss a few special iteger coutig fuctios You may have see some of these before i a basic probability class or elsewhere, but perhaps
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More informationx x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,
Math Activity 9( Due with Fial Eam) Usig first ad secod Taylor polyomials with remaider, show that for, 8 Usig a secod Taylor polyomial with remaider, fid the best costat C so that for, C 9 The th Derivative
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 informationMATH1035: Workbook Four M. Daws, 2009
MATH1035: Workbook Four M. Daws, 2009 Roots of uity A importat result which ca be proved by iductio is: De Moivre s theorem atural umber case: Let θ R ad N. The cosθ + i siθ = cosθ + i siθ. Proof: The
More informationName Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions
Nae Period ALGEBRA II Chapter B ad A Notes Solvig Iequalities ad Absolute Value / Nubers ad Fuctios SECTION.6 Itroductio to Solvig Equatios Objectives: Write ad solve a liear equatio i oe variable. Solve
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 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 informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
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 informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationTopic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or
Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad
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 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 informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
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 informationMath 113 Exam 4 Practice
Math Exam 4 Practice Exam 4 will cover.-.. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for
More informationAnalytic Continuation
Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for
More informationComplex Number Theory without Imaginary Number (i)
Ope Access Library Joural Complex Number Theory without Imagiary Number (i Deepak Bhalchadra Gode Directorate of Cesus Operatios, Mumbai, Idia Email: deepakm_4@rediffmail.com Received 6 July 04; revised
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
More information