Relations Introduc3on to Rela3ons. 8.2 Proper3es of Rela3ons 8.3 Equivalence Rela3ons. mjarrar Watch this lecture and download the slides

Size: px
Start display at page:

Download "Relations Introduc3on to Rela3ons. 8.2 Proper3es of Rela3ons 8.3 Equivalence Rela3ons. mjarrar Watch this lecture and download the slides"

Transcription

1 Mustf Jrrr: Lecture s in Dcrete Mm6cs Birzeit University Plestine 2015 eltions 81 Introducon elons 82 Properes elons 8 Equivlence elons mjrrr Wtch th lecture downlod slides Course Pge: More Online Courses t: hfp://wwwjrrrinfo cknowledgement: Th lecture bed on (but not limited ) chpter 8 in Dcrete Mm:cs with pplic:ons by Susn S Epp ( rd Edi:on) 2 1

2 Mustf Jrrr: Lecture s in Dcrete Mmtics Birzeit University Plestine 2015 eltions 81 Introduc-on el-ons In th lecture: qprt 1: Wht el-on qprt 2: Inverse elon; qprt : Grphs; qprt 4: n-ry elons qprt 5: elonl Dtbes Wht eltion? LessTh 10 Equls 100/10 Hge 20 MoreTh FrOf li FriendOf dm Mustf Smi FriendOf EnrolledIn Knows Tes EnrolledIn Workst DMth2 Birzeit University LoctedIn LivesIn mi Birzeit I 4 2

3 Wht eltion? Definition Let B be sets (binry) B subset B Given ordered pir (xy) in B x relted y by written x y if only if (x y) in x y (xy) 5 Person EnrolledIn Course li S Lin I DMth lgo DB Domin Co-domin 6

4 Person FriendOf Person li S Lin li S Lin FriendOf I = {(li S) (Sli)} 7 Z 1 2 LessTh Z

5 Z 1 2 E Z Define E Z Z follows: ll (m n) Z Z m E n m n even 9 : rel-on on Power Set Let X = { b c} Then P(X) = { {} {b} {c} { b} { c} {b c} { b c}} Define S P(X) Z follows: ll sets B in P(X) (ie for ll subsets B X) S B h t let my elements B Is {b} S {bc}? Is {} S? both sets hve elements {} h one element h zero elements 1 0 Is {bc} S {bc}? {b c} h elements { b c} h three elements 2 < Is {c} S {}? both sets hve one element 10 5

6 el&ons Func&ons Definition function F set set B B stfies following properties: 1 every element x in re element y in B such (xy) F 2 ll elements x in y z in B If F function B we write If (xy) F (xz) F n y=z Y = F(x) (xy) F 11 Let = {2 4 6} B = {1 5} Is function B? = {(2 5) (4 1) (4 ) (6 5)} P 12 6

7 Let = {2 4 6} B = {1 5} Is function B? ll (xy) B (xy) S y=x+1-1 Mustf Jrrr: Lecture s in Dcrete Mmtics Birzeit University Plestine 2015 eltions 81 Introduction eltions In th lecture: qprt 1: Wht el0on qprt 2: Inverse el8on qprt : Grphs qprt 4: n-ry el0ons qprt 5: el0onl Dtbes 14 7

8 Definition Inverse el-on Let be B Define inverse -1 B follows: -1 = {(yx) B (xy) } ll x y B (yx) -1 (xy) 15 Let = {24} B = {268} let be divides B: ll (x y) B x y x y x divides y Stte explicitly which ordered pirs re in 1 drw digrms for 1 } = {(22)(26)(28)(6)(48)} 1 = {(22)(62)(82)(6)(84)} 2 B 2 2 B Describe 1 in words: ll (y x) B y 1 x y multiple x 16 8

9 Person EnrolledIn -1 Course li S Lin I DMth DS DB 17 Person FriendOf -1 Person li S Lin li S Lin 18 9

10 Inverse el/ons in Lguge Wht would be inverse following s in Englh SonOf -1 =? WifeOf -1 =? Workst -1 =? EnrolledOf -1 =? PresidentOf -1 =? BrorOf -1 =? SterOf -1 =? 19 Mustf Jrrr: Lecture s in Dcrete Mm0cs Birzeit University Plestine 2015 el:ons 81 Introduction eltions In th lecture: qprt 1: Wht el0on qprt 2: Inverse el0on qprt : Grphs qprt 4: n-ry el0ons qprt 5: el0onl Dtbes 20 10

11 When defined on set Insted digrm c be mo so becomes Insted seprte s so it becomes Insted representing representing seprte sets sowhen itit becomes representing seprte defined on set digrm c be mo When becomes defined on setdrw c be defined on set digrm bemodified modifi so When itbecomes Insted digrm representing seprte s represent only once s represent only once drw c reltrss s represent only once drw so it Insted representing seprte its becomes seprte sets soso itwith becomes ordinry Insted representing representing seprte setsor s represent only once drw s ordinry ordinry digrm with only digrm s with digrm s represent once drw s represent only once once s represent only drw relted reltr s with ordinry digrm 11/25/18 ss with ordinry swith with ordinry digrm digrm ordinry digrm ll ll s in ll s x y in s xx yy in ll ll s s xx yy in in ll s x y in ll s x y in re yyy re xx yyy y)y) y) re xx x (x(x (x re xx y x y (x y) Grph re re x yyelon y)y) y) re xx xyy y (x (x(x relted relted itself itself loop loop drwn drwn extends out If relted itself loop drwn extends out go If If defined extends out When on set digrm If relted itself loop drwn extends out If If relted itself loop it drwn drwn extends bck it bck it beitself modified so becomes bck If it reltedc itself loop extends out relted loop extends ouut goe go bck it it bck bckitit ll s x y in bck re x y x y (xy) Grph eltion mple 816 Grph eltion 616 Grph eltion Definition 16 Grph eltion Grph eltion ple 816 Grph eltion eltion e Grph Let = ={ { define follows: Let 4 =4{ } define on llll x yx y y Let }8} define on on follows: llx set follows: Let = { } define on follows: ll x y LetLet = { }8} on on follows: y Let ={ { 455 8} define define follows: ll = define on follows: llxll xy yx xx y) x yy y 222 (x (x y) (x y) xxxxit y 2 (x y) importt dtinguh clerly y 2 (x y) y 2 (x (x y) y) between set on Drw grph Drw grph Drw grph Drw grph which it defined Drw grph grph Drw Solution becuse ==000 0Thus re Solution becuse becuse = re lo Solution 0000== = Thus Thus re Solution becuse = 0 = 0 Thus re Solution becuse loop == Thus re Solution becuse = 0 Thus re loop lo itself Similrly re itself itself so itself Similrly re loop loop itself so for itself Similrly re loop itself itself itself itself itself Similrly re itself sos itself Similrly re loop 4 itself 5 itself so forth itself Similrly re 4 itself 5 itself so for difference integer itself 0 difference integerwith withitself itself difference difference integer with itself difference integer integerwith difference integer with itself 00 == 222 = ( 1) nd becuse 5becuse 5 becuse = 2 ( 1) nd becuse 5 55 = ( 1) nd becuse 55555= nd becuse = 22= 5becuse becuse 1) nd 55 becuse 5 5 5= 555becuse becuse ==222 ( ( ( 1)1) nd becuse =1Hence re 555 The 2Hence 1 Hence re 5 5 The oth 2 22== re The Th = re The o The = Hence 1Hence Hence re = re 55 oth ss in in grph shown below re obtined by reoning grph shown below obtined by similr reoning s inin below re obtined by similr reoning Let =grph { } definere re on similr similr reoning s grph shown below re obtined s in grph shown shown obtined by similr reoning s in grph shown below re obtined byby similr reoning follows: ll x y x y 2 (x y) N-ry eltions eltionl Dtbes N-ry eltions eltionl Dtbes N-ry eltions eltionl Dtbes N-ry eltions eltionldtbes Dtbes N-ry eltions eltionl ry s form mmticl mmticl foundtion foundtion l dtbe ory binry NN-ry s form mmticl for l dtbe ory N -ry s form foundtion for l dtbe ory -ry s form mmticl foundtion for l dtbe ory N-ry s form mmticlfoundtion foundtionfor l dtbe ory bin bin NN -ry s form mmticl for l dtbe ory ubset subsetcrtesi Crtesi product sets similrly y y ubset Crtesi product sets similrly n-r n-r sets similrly n-r y reltio ubset subset Crtesi Crtesi product sets similrly n-r yyreltio subset Crtesi product sets similrly n-r y product sets similrly n-r relt subset Crtesi product n subset Crtesi product n sets subset subset Crtesi Crtesi product product n n sets

12 Mustf Jrrr: Lecture s in Dcrete MmEcs Birzeit University Plestine 2015 eltions 81 Introduction eltions In th lecture: qprt 1: Wht eltion qprt 2: Inverse eltion qprt : Grphs qprt 4: n-ry eltions qprt 5: eltionl Dtbes 2 N-ry eltions EnrolledIn(li Dmth) EnrolledIn(Smi DB) Enrollment(Smi DB 99) Enrollment(Smi DB ) Enrollment(Smi DB F) ( 1 2 n ) Binry (2-ry) Ternry (-ry) Quternry (4-ry) 5-ry n-ry 24 12

13 N-ry el+ons Definition Given sets 1 2 n n-ry on 1 2 n subset 1 2 n Thespecilces2-ry-ry4-rysre clled binry ternry quternry s respectively 25 Mustf Jrrr: Lecture s in Dcrete Mmtics Birzeit University Plestine 2015 el7ons 81 Introduction eltions In th lecture: qprt 1: Wht el0on qprt 2: Inverse el0on qprt : Grphs qprt 4: n-ry el0ons qprt 5: el7onl Dtbes 26 1

14 el'onl Dtbes on follows: (1 2 4) ptient with ptient ID number 1 nmed 2 w dmitted on dte with primry dignos 4 eltion Ech row clled tuple Ptient ID Nme Dte Dignos ( John Schmidt thm) (57429 Tk Kurosw pneumoni) ( Mry Lzrs ppendicigs) (00852 Jo Kpl gtrigs) ( John Schmidt pneumoni) (24488 Srh Wu broken leg) ( Jml Bkers ppendicigs) 27 eltionl Dtbes on follows: (1 2 4) ptient with ptient ID number 1 nmed 2 w dmitted on dte with primry dignos 4 eltion Ech row clled tuple Ptient ID Nme Dte Dignos ( John Schmidt thm) (57429 Ø Notice Tk Kurosw Tbles in th pneumoni) wy re ( clled Mry eltions Lzrs ppendicit) (00852 Ø Informtion Jo Kpl sred in th gtrit) wy ( clled John Schmidt eltionl Dtbe pneumoni) (24488 Srh Wu broken leg) ( Jml Bkers ppendicit) mjrrr 2015 mjrrr

Functions. mjarrar Watch this lecture and download the slides

Functions. mjarrar Watch this lecture and download the slides 9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides

More information

S56 (5.3) Vectors.notebook January 29, 2016

S56 (5.3) Vectors.notebook January 29, 2016 Dily Prctice 15.1.16 Q1. The roots of the eqution (x 1)(x + k) = 4 re equl. Find the vlues of k. Q2. Find the rte of chnge of 剹 x when x = 1 / 8 Tody we will e lerning out vectors. Q3. Find the eqution

More information

Summary: Method of Separation of Variables

Summary: Method of Separation of Variables Physics 246 Electricity nd Mgnetism I, Fll 26, Lecture 22 1 Summry: Method of Seprtion of Vribles 1. Seprtion of Vribles in Crtesin Coordintes 2. Fourier Series Suggested Reding: Griffiths: Chpter 3, Section

More information

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation

Strong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32

More information

20 MATHEMATICS POLYNOMIALS

20 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 information

M597K: Solution to Homework Assignment 7

M597K: Solution to Homework Assignment 7 M597K: Solution to Homework Assignment 7 The following problems re on the specified pges of the text book by Keener (2nd Edition, i.e., revised nd updted version) Problems 3 nd 4 of Section 2.1 on p.94;

More information

Chapter 6 Notes, Larson/Hostetler 3e

Chapter 6 Notes, Larson/Hostetler 3e Contents 6. Antiderivtives nd the Rules of Integrtion.......................... 6. Are nd the Definite Integrl.................................. 6.. Are............................................ 6. Reimnn

More information

Problem Set 3

Problem Set 3 14.102 Problem Set 3 Due Tuesdy, October 18, in clss 1. Lecture Notes Exercise 208: Find R b log(t)dt,where0

More information

Matrices and Determinants

Matrices and Determinants Nme Chpter 8 Mtrices nd Determinnts Section 8.1 Mtrices nd Systems of Equtions Objective: In this lesson you lerned how to use mtrices, Gussin elimintion, nd Guss-Jordn elimintion to solve systems of liner

More information

Infinite Geometric Series

Infinite 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 information

First Midterm Examination

First Midterm Examination Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does

More information

CS375: Logic and Theory of Computing

CS375: Logic and Theory of Computing CS375: Logic nd Theory of Computing Fuhu (Frnk) Cheng Deprtment of Computer Science University of Kentucky 1 Tle of Contents: Week 1: Preliminries (set lger, reltions, functions) (red Chpters 1-4) Weeks

More information

Sections 1.3, 7.1, and 9.2: Properties of Exponents and Radical Notation

Sections 1.3, 7.1, and 9.2: Properties of Exponents and Radical Notation Sections., 7., nd 9.: Properties of Eponents nd Rdicl Nottion Let p nd q be rtionl numbers. For ll rel numbers nd b for which the epressions re rel numbers, the following properties hold. i = + p q p q

More information

1. Extend QR downwards to meet the x-axis at U(6, 0). y

1. Extend QR downwards to meet the x-axis at U(6, 0). y In the digrm, two stright lines re to be drwn through so tht the lines divide the figure OPQRST into pieces of equl re Find the sum of the slopes of the lines R(6, ) S(, ) T(, 0) Determine ll liner functions

More information

UNIT-2 POLYNOMIALS Downloaded From: [Year] UNIT-2 POLYNOMIALS

UNIT-2 POLYNOMIALS Downloaded From:   [Year] UNIT-2 POLYNOMIALS UNIT- POLYNOMIALS Downloded From: www.jsuniltutoril.weebly.com [Yer] UNIT- POLYNOMIALS It is not once nor twice but times without number tht the sme ides mke their ppernce in the world.. Find the vlue

More information

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY

Chapter 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 information

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART I MULTIPLE CHOICE NO CALCULATORS 90 MINUTES

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART I MULTIPLE CHOICE NO CALCULATORS 90 MINUTES THE 08 09 KENNESW STTE UNIVERSITY HIGH SHOOL MTHEMTIS OMPETITION PRT I MULTIPLE HOIE For ech of the following questions, crefully blcken the pproprite box on the nswer sheet with # pencil. o not fold,

More information

AQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system

AQA 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 information

Improper Integrals, and Differential Equations

Improper 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 information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

5.2 Volumes: Disks and Washers

5.2 Volumes: Disks and Washers 4 pplictions of definite integrls 5. Volumes: Disks nd Wshers In the previous section, we computed volumes of solids for which we could determine the re of cross-section or slice. In this section, we restrict

More information

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner

More information

Riemann Sums and Riemann Integrals

Riemann 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 information

Talen en Automaten Test 1, Mon 7 th Dec, h45 17h30

Talen en Automaten Test 1, Mon 7 th Dec, h45 17h30 Tlen en Automten Test 1, Mon 7 th Dec, 2015 15h45 17h30 This test consists of four exercises over 5 pges. Explin your pproch, nd write your nswer to ech exercise on seprte pge. You cn score mximum of 100

More information

Riemann Sums and Riemann Integrals

Riemann 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 information

Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory

Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph Theory Dniel Gibson, Concordi University Jckelyn Ngel, Dominicn University Benjmin Stnley, New Mexico Stte University Allison

More information

(6.5) Length and area in polar coordinates

(6.5) Length and area in polar coordinates 86 Chpter 6 SLICING TECHNIQUES FURTHER APPLICATIONS Totl mss 6 x ρ(x)dx + x 6 x dx + 9 kg dx + 6 x dx oment bout origin 6 xρ(x)dx x x dx + x + x + ln x ( ) + ln 6 kg m x dx + 6 6 x x dx Centre of mss +

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

MathCity.org Merging man and maths

MathCity.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 information

1 ELEMENTARY ALGEBRA and GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE

1 ELEMENTARY ALGEBRA and GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE ELEMENTARY ALGEBRA nd GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE Directions: Study the exmples, work the prolems, then check your nswers t the end of ech topic. If you don t get the nswer given, check

More information

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15 Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

Harvard University Computer Science 121 Midterm October 23, 2012

Harvard University Computer Science 121 Midterm October 23, 2012 Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is

More information

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi

More information

MA 15910, Lessons 2a and 2b Introduction to Functions Algebra: Sections 3.5 and 7.4 Calculus: Sections 1.2 and 2.1

MA 15910, Lessons 2a and 2b Introduction to Functions Algebra: Sections 3.5 and 7.4 Calculus: Sections 1.2 and 2.1 MA 15910, Lessons nd Introduction to Functions Alger: Sections 3.5 nd 7.4 Clculus: Sections 1. nd.1 Representing n Intervl Set of Numers Inequlity Symol Numer Line Grph Intervl Nottion ) (, ) ( (, ) ]

More information

Recitation 3: More Applications of the Derivative

Recitation 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 information

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

ARITHMETIC 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 information

HQPD - ALGEBRA I TEST Record your answers on the answer sheet.

HQPD - ALGEBRA I TEST Record your answers on the answer sheet. HQPD - ALGEBRA I TEST Record your nswers on the nswer sheet. Choose the best nswer for ech. 1. If 7(2d ) = 5, then 14d 21 = 5 is justified by which property? A. ssocitive property B. commuttive property

More information

Special Numbers, Factors and Multiples

Special Numbers, Factors and Multiples Specil s, nd Student Book - Series H- + 3 + 5 = 9 = 3 Mthletics Instnt Workooks Copyright Student Book - Series H Contents Topics Topic - Odd, even, prime nd composite numers Topic - Divisiility tests

More information

Preparation for A Level Wadebridge School

Preparation for A Level Wadebridge School Preprtion for A Level Mths @ Wdebridge School Bridging the gp between GCSE nd A Level Nme: CONTENTS Chpter Removing brckets pge Chpter Liner equtions Chpter Simultneous equtions 6 Chpter Fctorising 7 Chpter

More information

5.2 Exponent Properties Involving Quotients

5.2 Exponent Properties Involving Quotients 5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use

More information

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Unit #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 information

1 From NFA to regular expression

1 From NFA to regular expression Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work

More information

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»

More information

Pre-AP Geometry Worksheet 5.2: Similar Right Triangles

Pre-AP Geometry Worksheet 5.2: Similar Right Triangles ! re-a Geometr Worksheet 5.2: Similr Right Tringles Nme: te: eriod: Solve. Show ll work. Leve nswers s simplified rdicls on #1-5. For #6, round to the nerer tenth. 12!! 6! 1) =! 8! 6! 2) = 18! 8! w!+!9!

More information

Gold s algorithm. Acknowledgements. Why would this be true? Gold's Algorithm. 1 Key ideas. Strings as states

Gold s algorithm. Acknowledgements. Why would this be true? Gold's Algorithm. 1 Key ideas. Strings as states Acknowledgements Gold s lgorithm Lurent Miclet, Jose Oncin nd Tim Otes for previous versions of these slides. Rfel Crrsco, Pco Cscuert, Rémi Eyrud, Philippe Ezequel, Henning Fernu, Thierry Murgue, Frnck

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, 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 information

ODE: Existence and Uniqueness of a Solution

ODE: 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 information

Math 1102: Calculus I (Math/Sci majors) MWF 3pm, Fulton Hall 230 Homework 2 solutions

Math 1102: Calculus I (Math/Sci majors) MWF 3pm, Fulton Hall 230 Homework 2 solutions Mth 1102: Clculus I (Mth/Sci mjors) MWF 3pm, Fulton Hll 230 Homework 2 solutions Plese write netly, nd show ll work. Cution: An nswer with no work is wrong! Do the following problems from Chpter III: 6,

More information

1 The fundamental theorems of calculus.

1 The fundamental theorems of calculus. The fundmentl theorems of clculus. The fundmentl theorems of clculus. Evluting definite integrls. The indefinite integrl- new nme for nti-derivtive. Differentiting integrls. Tody we provide the connection

More information

Things to Memorize: A Partial List. January 27, 2017

Things to Memorize: A Partial List. January 27, 2017 Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved

More information

First Midterm Examination

First Midterm Examination 24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet

More information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

MTH 4-16a Trigonometry

MTH 4-16a Trigonometry MTH 4-16 Trigonometry Level 4 [UNIT 5 REVISION SECTION ] I cn identify the opposite, djcent nd hypotenuse sides on right-ngled tringle. Identify the opposite, djcent nd hypotenuse in the following right-ngled

More information

CS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS

CS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)

More information

ragsdale (zdr82) HW2 ditmire (58335) 1

ragsdale (zdr82) HW2 ditmire (58335) 1 rgsdle (zdr82) HW2 ditmire (58335) This print-out should hve 22 questions. Multiple-choice questions my continue on the next column or pge find ll choices before nswering. 00 0.0 points A chrge of 8. µc

More information

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES

STRAND J: TRANSFORMATIONS, VECTORS and MATRICES Mthemtics SKE: STRN J STRN J: TRNSFORMTIONS, VETORS nd MTRIES J3 Vectors Text ontents Section J3.1 Vectors nd Sclrs * J3. Vectors nd Geometry Mthemtics SKE: STRN J J3 Vectors J3.1 Vectors nd Sclrs Vectors

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

6.2 The Pythagorean Theorems

6.2 The Pythagorean Theorems PythgorenTheorems20052006.nb 1 6.2 The Pythgoren Theorems One of the best known theorems in geometry (nd ll of mthemtics for tht mtter) is the Pythgoren Theorem. You hve probbly lredy worked with this

More information

Lesson 25: Adding and Subtracting Rational Expressions

Lesson 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 information

MATH 423 Linear Algebra II Lecture 28: Inner product spaces.

MATH 423 Linear Algebra II Lecture 28: Inner product spaces. MATH 423 Liner Algebr II Lecture 28: Inner product spces. Norm The notion of norm generlizes the notion of length of vector in R 3. Definition. Let V be vector spce over F, where F = R or C. A function

More information

Riemann Integrals and the Fundamental Theorem of Calculus

Riemann Integrals and the Fundamental Theorem of Calculus Riemnn Integrls nd the Fundmentl Theorem of Clculus Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University September 16, 2013 Outline Grphing Riemnn Sums

More information

b a 2 ((g(x))2 (f(x)) 2 dx

b a 2 ((g(x))2 (f(x)) 2 dx Clc II Fll 005 MATH Nme: T3 Istructios: Write swers to problems o seprte pper. You my NOT use clcultors or y electroic devices or otes of y kid. Ech st rred problem is extr credit d ech is worth 5 poits.

More information

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either

More information

AUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton

AUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton 25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q

More information

GEOMETRY OF THE CIRCLE TANGENTS & SECANTS

GEOMETRY OF THE CIRCLE TANGENTS & SECANTS Geometry Of The ircle Tngents & Secnts GEOMETRY OF THE IRLE TNGENTS & SENTS www.mthletics.com.u Tngents TNGENTS nd N Secnts SENTS Tngents nd secnts re lines tht strt outside circle. Tngent touches the

More information

7.2 The Definite Integral

7.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 information

A-Level Mathematics Transition Task (compulsory for all maths students and all further maths student)

A-Level Mathematics Transition Task (compulsory for all maths students and all further maths student) A-Level Mthemtics Trnsition Tsk (compulsory for ll mths students nd ll further mths student) Due: st Lesson of the yer. Length: - hours work (depending on prior knowledge) This trnsition tsk provides revision

More information

The practical version

The practical version Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht

More information

arxiv:math/ v2 [math.ho] 16 Dec 2003

arxiv:math/ v2 [math.ho] 16 Dec 2003 rxiv:mth/0312293v2 [mth.ho] 16 Dec 2003 Clssicl Lebesgue Integrtion Theorems for the Riemnn Integrl Josh Isrlowitz 244 Ridge Rd. Rutherford, NJ 07070 jbi2@njit.edu Februry 1, 2008 Abstrct In this pper,

More information

Consolidation Worksheet

Consolidation Worksheet Cmbridge Essentils Mthemtics Core 8 NConsolidtion Worksheet N Consolidtion Worksheet Work these out. 8 b 7 + 0 c 6 + 7 5 Use the number line to help. 2 Remember + 2 2 +2 2 2 + 2 Adding negtive number is

More information

Abstract inner product spaces

Abstract inner product spaces WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the

More information

In Section 5.3 we considered initial value problems for the linear second order equation. y.a/ C ˇy 0.a/ D k 1 (13.1.4)

In Section 5.3 we considered initial value problems for the linear second order equation. y.a/ C ˇy 0.a/ D k 1 (13.1.4) 678 Chpter 13 Boundry Vlue Problems for Second Order Ordinry Differentil Equtions 13.1 TWO-POINT BOUNDARY VALUE PROBLEMS In Section 5.3 we considered initil vlue problems for the liner second order eqution

More information

1 Techniques of Integration

1 Techniques of Integration November 8, 8 MAT86 Week Justin Ko Techniques of Integrtion. Integrtion By Substitution (Chnge of Vribles) We cn think of integrtion by substitution s the counterprt of the chin rule for differentition.

More information

16 Newton s Laws #3: Components, Friction, Ramps, Pulleys, and Strings

16 Newton s Laws #3: Components, Friction, Ramps, Pulleys, and Strings Chpter 16 Newton s Lws #3: Components, riction, Rmps, Pulleys, nd Strings 16 Newton s Lws #3: Components, riction, Rmps, Pulleys, nd Strings When, in the cse of tilted coordinte system, you brek up the

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State 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 information

Control with binary code. William Sandqvist

Control with binary code. William Sandqvist Control with binry code Dec Bin He Oct 218 10 11011010 2 DA 16 332 8 E 1.1c Deciml to Binäry binry weights: 1024 512 256 128 64 32 16 8 4 2 1 71 10? 2 E 1.1c Deciml to Binäry binry weights: 1024 512 256

More information

STRAND B: NUMBER THEORY

STRAND 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 information

A 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. 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 information

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year

USA 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 information

Homework 1/Solutions. Graded Exercises

Homework 1/Solutions. Graded Exercises MTH 310-3 Abstract Algebra I and Number Theory S18 Homework 1/Solutions Graded Exercises Exercise 1. Below are parts of the addition table and parts of the multiplication table of a ring. Complete both

More information

Chapters 4 & 5 Integrals & Applications

Chapters 4 & 5 Integrals & Applications Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions

More information

CAAM 453 NUMERICAL ANALYSIS I Examination There are four questions, plus a bonus. Do not look at them until you begin the exam.

CAAM 453 NUMERICAL ANALYSIS I Examination There are four questions, plus a bonus. Do not look at them until you begin the exam. Exmintion 1 Posted 23 October 2002. Due no lter thn 5pm on Mondy, 28 October 2002. Instructions: 1. Time limit: 3 uninterrupted hours. 2. There re four questions, plus bonus. Do not look t them until you

More information

On the diagram below the displacement is represented by the directed line segment OA.

On the diagram below the displacement is represented by the directed line segment OA. Vectors Sclrs nd Vectors A vector is quntity tht hs mgnitude nd direction. One exmple of vector is velocity. The velocity of n oject is determined y the mgnitude(speed) nd direction of trvel. Other exmples

More information

Similarity and Congruence

Similarity and Congruence Similrity nd ongruence urriculum Redy MMG: 201, 220, 221, 243, 244 www.mthletics.com SIMILRITY N ONGRUN If two shpes re congruent, it mens thy re equl in every wy ll their corresponding sides nd ngles

More information

Answers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics

Answers and Solutions to (Some Even Numbered) Suggested Exercises in Chapter 11 of Grimaldi s Discrete and Combinatorial Mathematics Answers n Solutions to (Some Even Numere) Suggeste Exercises in Chpter 11 o Grimli s Discrete n Comintoril Mthemtics Section 11.1 11.1.4. κ(g) = 2. Let V e = {v : v hs even numer o 1 s} n V o = {v : v

More information

CM10196 Topic 4: Functions and Relations

CM10196 Topic 4: Functions and Relations CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input

More information

Scientific notation is a way of expressing really big numbers or really small numbers.

Scientific notation is a way of expressing really big numbers or really small numbers. Scientific Nottion (Stndrd form) Scientific nottion is wy of expressing relly big numbers or relly smll numbers. It is most often used in scientific clcultions where the nlysis must be very precise. Scientific

More information

Entropy and Ergodic Theory Notes 10: Large Deviations I

Entropy and Ergodic Theory Notes 10: Large Deviations I Entropy nd Ergodic Theory Notes 10: Lrge Devitions I 1 A chnge of convention This is our first lecture on pplictions of entropy in probbility theory. In probbility theory, the convention is tht ll logrithms

More information

df dt f () b f () a dt

df dt f () b f () a dt Vector lculus 16.7 tokes Theorem Nme: toke's Theorem is higher dimensionl nlogue to Green's Theorem nd the Fundmentl Theorem of clculus. Why, you sk? Well, let us revisit these theorems. Fundmentl Theorem

More information

Convex Sets and Functions

Convex Sets and Functions B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line

More information

Chapter 14. Matrix Representations of Linear Transformations

Chapter 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 information

Chapter 1: Fundamentals

Chapter 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 information

GRADE 4. Division WORKSHEETS

GRADE 4. Division WORKSHEETS GRADE Division WORKSHEETS Division division is shring nd grouping Division cn men shring or grouping. There re cndies shred mong kids. How mny re in ech shre? = 3 There re 6 pples nd go into ech bsket.

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemann 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 information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Calculus 2: Integration. Differentiation. Integration

Calculus 2: Integration. Differentiation. Integration Clculus 2: Integrtion The reverse process to differentition is known s integrtion. Differentition f() f () Integrtion As it is the opposite of finding the derivtive, the function obtined b integrtion is

More information

Lecture 4: Piecewise Cubic Interpolation

Lecture 4: Piecewise Cubic Interpolation Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 4: Piecewise Cubic Interpoltion Compiled 5 September In this lecture we consider piecewise cubic interpoltion

More information