Discrete Structures Lecture 11

Save this PDF as:
Size: px
Start display at page:

Download "Discrete Structures Lecture 11"

Transcription

1 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion. A funtion my or my not e invertile. We wnt ertin funtions to e invertile. For exmple, we wnt funtion tht enrypts messge to e invertile so tht we n derypt the messge. On the other hnd, we wnt our psswords to e impossile to derypt tht is we wnt the funtion tht mps our pssword into inry ode to e not invertile. DEFINITION EXAMPLE 0. Let A nd B e nonempty sets. A funtion f from A to B is n ssignment of extly one element of B to eh element of A. We write ff() = if is the unique element of B ssigned y the funtion f to the element of A. If f is funtion from A to B, we write ff: AA BB. Let AA = {,,, dd, ee}, BB = {0,,,,}, nd ff: AA BB is defined y the reltion RR = {(, 0), (, ), (, ), (dd, )} where (uu, vv) ff(uu) = vv in RR. Thus ff() = 0, ff() =, ff() =, ff(dd) =. Is ff: AA BB funtion? 0 d e Solution: Nope. Funtion ff fils to ssign element ee AA to ny element in BB. Rell, the definition A funtion f from A to B is n ssignment of extly one element of B to eh element of A. Sine ee AA, n element of BB must e ssigned to ee nd no suh ssignment is defined y ff: AA BB.

2 EXAMPLE 0. Let AA = {,,, dd, ee}, BB = {0,,,,}, nd ff: AA BB is defined y the reltion RR = {(, 0), (, ), (, ), (, ), (dd, ), (ee, 0)} where (uu, vv) ff(uu) = vv in RR. Thus ff() = 0, ff() =, ff() =, ff() =, ff(dd) =, ff(ee) = 0. Is ff: AA BB funtion? 0 d e Solution: Nope. Funtion ff fils to ssign extly one element of BB to element AA. Rell, the definition A funtion f from A to B is n ssignment of extly one element of B to eh element of A. Sine ff() = 0 nd ff() =, ff: AA BB is not funtion. Adms A Chou Goodfriend B C Rodriguez D Stevens F FIGURE Assignment of Grdes in Disrete Mthemtis Clss Remrk: DEFINITION Funtions re sometimes lso lled mppings or trnsformtions. If f is funtion from A to B, we sy tht A is the domin of f nd B is the odomin of f. If ff() =, we sy tht is the imge of nd is preimge of. The rnge of f is the set of ll imges of elements of A. Also, if f is funtion from A to B, we sy tht f mps A to B.

3 f =f() f A B FIGURE The Funtion ff Mps AA to BB EXAMPLE Wht re the domin, odomin, nd rnge of the funtion tht ssigns grdes to students shown in Figure. Solution: Let G e the funtion tht ssigns grde to student in our disrete mthemtis lss. Note tht GG(AAAAAAAAAA) = AA, for instne. The domin of G is the set {Adms, Chou, Goodfriend, Rodriguez, Stevens}. The odomin is the set {A,B,C,D,F}. The rnge is the set {AA, BB, CC, FF} euse eh grde exept D is ssigned to some student. EXAMPLE Let R e the reltion onsisting of ordered pirs (Adul, ), (Brend, ), (Crl, ), (Desire, ), (Eddie, ), nd (Felii, ), where eh pir onsists of grdute student nd the ge of this student. Wht is the funtion tht this reltion determines? Solution: The reltion defines the funtion f s given elow. f(adul)= f(brend)= f(crl)= f(desire)= f(eddie)= f(felii)= The domin of f is the set {Adul, Brend, Crl, Desire, Eddie, Felii} A odomin of f is the set of positive integers. The rnge of f is the set {,,}

4 EXAMPLE Let ff e the funtion tht ssigns the lst two its of it string of length or greter to tht string. For exmple, ff(00) = 0. Wht re the domin, odomin, nd rnge of ff? Solution: The domin of ff is the set of ll strings of length or greter. The odomin ff is the set {00,0,0,}. The rnge of ff is the sme s the odomin of ff, nmely the set {00,0,0,}. EXAMPLE Let ff: Z Z ssign the squre of n integer to this integer. Further define f nd identify the domin, odomin, nd the rnge of f. Solution ff(xx) = xx The domin of f is Z, the set of ll integers. The odomin of ff is Z, the set of ll integers. The rnge of f is the set of ll integers tht re perfet squres nmely, {0,,, 9, } DEFINITION Let ff nd ff e funtions from A to R. Then ff + ff nd ff ff re lso funtions from A to R defined y (ff + ff )(xx) = ff (xx) + ff (xx) (ff ff )(xx) = ff (xx)ff (xx) EXAMPLE 6 Let ff nd ff e funtions from R to R suh tht ff (xx) = xx nd ff (xx) = xx xx. Wht re the funtions ff + ff nd ff ff? Solution (ff + ff )(xx) = ff (xx) + ff (xx) = xx + (xx xx ) = xx (ff ff )(xx) = ff (xx)ff (xx) = xx (xx xx ) = xx xx DEFINITION Remrk: Let f e funtion from the set A to the set B nd let S e suset of A. The imge of S under the funtion f is the suset of B tht onsists of the imges of S. We denote the imge of S y ff(ss), so ff(ss) = tt ss SS tt = ff(ss). We lso use the shorthnd {ff(ss) ss SS} to denote this set. The nottion ff(ss) for the imge of the set S under the funtion f is potentilly miguous. Here, ff(ss) denotes set, nd not the vlue of the funtion f for the set S. EXAMPLE 7 Let AA = {,,, dd, ee} nd BB = {,,,} withff() =, ff() =, ff() =, ff(dd) =, nd ff(ee) =. Wht is the imge of the suset SS = {,, dd}? Solution: The imge of S under the funtion f is the set ff(ss) = {,}.

5 One-to-one nd Onto Funtions DEFINITION 5 A funtion f is sid to e one-to-one, or n injuntion, if nd only if ff() = ff() implies tht = for ll nd in the domin of f. A funtion is sid to e injetive if it is one-to-one. EXAMPLE 8 Determine whether the funtion f from {,,, dd} to{,,,,5} with ff() =, ff() = 5, ff() =, nd ff(dd) = is one-to-one. Solution: The funtion f is one-to-one euse f tkes on different vlues t the four elements of its domin. This is illustrted in Figure. d 5 FIGURE A One-to-One Funtion EXAMPLE 9 EXAMPLE 0 EXAMPLE DEFINITION 6 Remrk: Determine whether the funtion ff(xx) = xx from the set of integers to the set of integers is one-to-one. Solution: The funtion ff(xx) = xx is not one-to-one euse, for instne, ff() = ff( ) =, ut. Determine whether the funtion ff(xx) = xx + from the set of rel numers to itself is one-to-one. Solution: The funtion ff(xx) = xx + is one-to-one funtion. To demonstrte this, note tht xx + yy + when xx yy. Suppose tht eh worker in group of employees is ssigned jo from set of possile jos, eh to e done y single worker. In this sitution, the funtion ff tht ssigns jo to eh worker is one-to-one. To see this, note tht if xx nd yy re two different workers, then ff(xx) ff(yy) euse the two workers xx nd yy must e ssigned different jos. A funtion f whose domin nd odomin re susets of the set of rel numers is lled inresing if ff(xx) ff(yy), nd stritly inresing if ff(xx) < ff(yy), whenever xx < yy nd x nd y re in the domin of f. Similrly, f is lled deresing if ff(xx) ff(yy), nd stritly deresing if ff(xx) > ff(yy), whenever xx < yy nd x nd y re in the domin of f. (The word stritly in this definition indites strit inequlity.) A funtion tht is either stritly inresing or stritly deresing is gurnteed to e one-to-one. 5

6 Remrk: DEFINITION 7 A funtion ff is inresing if xx yy(xx < yy ff(xx) ff(yy). A funtion ff is stritly inresing if xx yy(xx < yy ff(xx) < ff(yy). A funtion ff is deresing if xx yy(xx < yy ff(xx) ff(yy). A funtion ff is stritly deresing if xx yy(xx < yy ff(xx) > ff(yy). A funtion f from A to B is lled onto, or surjetion, if nd only if for every element BB there is n element AA with ff() =. A funtion f is lled surjetive if it is onto. FIGURE 5 () One-to-one, not onto d FIGURE 5 () Onto, not one-to-one d FIGURE 5 () One-to-one nd onto d FIGURE 5 (d) Neither one-to-one nor onto FIGURE 5 (e) Not funtion 6

7 EXAMPLE Let ff e the funtion from {,,, dd} to {,,} defined y ff() =, ff() =, ff() =, nd ff(dd) =. Is ff n onto funtion? Solution: Beuse ll three elements of the odomin re imges of elements in the domin, we see tht ff is onto. This is illustrted in the figure elow. Note tht if the odomin were {,,,}, then ff would not e onto. d ff: n onto funtion EXAMPLE EXAMPLE EXAMPLE 5 Is the funtion ff(xx) = xx from the set of integers to the set of integers onto? Solution: The funtion ff is not onto euse there is no integer xx with xx =. Is the funtion ff(xx) = xx + from the set of integers to the set of integers onto? Solution: The funtion is onto, euse for every integer yy there is n integer xx suh tht ff(xx) = yy. To see this, note tht ff(xx) = yy if nd only if xx + = yy, whih holds if nd only if xx = yy. Consider the funtion ff in Exmple tht ssigns jos to workers. The funtion ff is onto if for every jo there is worker ssigned to this jo. The funtion ff is not onto when there is t lest one jo tht hs no worker ssigned to it. DEFINITION 8 The funtion f is one-to-one orrespondene, or ijetion, if it is oth one-to-one nd onto. 7

8 EXAMPLE 6 Let ff e the funtion from {,,, dd} to {,,,} with ff() =, ff() =, ff() =, nd ff(dd) =. Is ff ijetion? Solution: The funtion f is one-to-one nd onto. It is one-to-one euse no two vlues in the domin re ssigned the sme funtion vlue. It is onto euse ll four elements of the odomin re imges of elements in the domin. Hene, ff is ijetion. d We see grphil representtion of ff in the digrm ove. A funtion is one-to-one nd onto if it n e inverted. The funtion n e inverted if ll of the direted edges n e reversed nd ll of the elements in the odomin re mpped y the reversed direted edges to individul elements in the domin. d EXAMPLE 7 Let AA e set, the identity funtion on AA is the funtion ii AA : AA AA, where ii AA (xx) = xx for ll xx AA. In other words, the identity funtion ii AA is the funtion tht ssigns eh element to itself. The funtion ii AA is one-to-one nd onto, so it is ijetion. 8

9 Suppose tht ff: AA BB. To show tht f is injetive (one-to-one) Show tht if ff(xx) = ff(yy) for ritrry xx, yy AA with xx yy, then xx = yy. To show tht f is not injetive Find prtiulr elements xx, yy AA suh tht xx yy nd ff(xx) = ff(yy). To show tht f is surjetive (onto) Consider n ritrry element yy BB nd find n element xx AA suh tht ff(xx) = yy. To show tht f is not surjetive Find prtiulr yy BB suh tht ff(xx) yy for ll xx AA. Inverse Funtions nd Compositions of Funtions DEFINITION 9 Let f e one-to-one orrespondene from the set A to the set B. The inverse funtion of f is the funtion tht ssigns to n element elonging to B the unique element in A suh tht ff() =. The inverse funtion is denoted y ff. Hene, ff () = when ff() =. f() - =f () A f -() =f() f B f - FIGURE 6 The Funtion ff Is the Inverse of Funtion ff. EXAMPLE 8 Let ff e the funtion for {,, } to {,,} suh tht ff() =, ff() =, nd ff() =. Is ff invertile, nd if it is, wht is its inverse? Solution: The funtion ff is invertile euse it is one-to-one orrespondene. The inverse funtion ff reverses the orrespondene so ff () =, ff () =, ndff () =. EXAMPLE 9 Let ff: Z Z e suh tht ff(xx) = xx +. Is ff invertile, nd if it is, wht is the inverse? Solution: The funtion f hs n inverse euse it is one-to-one orrespondene, s hs een shown previously. To reverse the orrespondene, suppose tht y is the imge of x, so tht yy = xx +. Then xx = yy. This mens tht yy is the unique element of Z tht is sent to y y f. onsequently, ff (yy) = yy. 9

10 EXAMPLE 0 EXAMPLE Let f e the funtion from R to R with ff(xx) = xx. Is f invertile? Solution: Beuse ff() = ff( ) =, f is not one-to-one. If n inverse funtion were defined it would hve to ssign two elements to. Hene, f is not invertile. Show tht if we restrit the funtion ff(xx) = xx to the set of nonnegtive rel numers. Is f in exmple 0 to funtion from the set of ll nonnegtive rel numers to the set of ll nonnegtive rel numers, then ff is invertile. Solution: One-to-one: The funtion ff(xx) = xx from the set of nonnegtive rel numers to the set of nonnegtive rel numers is one-to-one. To see this, note tht if ff(xx) = ff(yy), then xx = yy, so xx yy = 0. xx yy n e ftored to (xx + yy)(xx yy) = 0. This mens tht xx + yy = 0 or xx yy = 0, so xx = yy or xx = yy. Beuse oth xx nd yy re nonnegtive, we must hve xx = yy. So, this funtion is one-to-one. Onto: Furthermore, ff(xx) = xx is onto when the odomin is the set of ll nonnegtive rel numers, euse eh nonnegtive rel numer hs squre root. Tht is, if yy is nonnegtive rel numer, there exists nonnegtive rel numer xx suh tht xx = yy, whih mens tht xx = yy. Invertile: Beuse the funtion ff(xx) = xx from the set of nonnegtive rel numers to the set of nonnegtive rel numers is one-to-one nd onto, it is invertile. Its inverse is given y the rule ff (yy) = yy. DEFINITION 0 Let g e funtion from the set A to the set B nd let f e funtion from the set B to the set C. The omposition of the funtions f nd g, denoted for ll AA y ff gg, is defined y (ff gg)() = ff(gg()) 0

11 ( f g)( ) g() f(g()) f g A B C f g FIGURE 7 The Composition of the Funtions ff nd gg. EXAMPLE Let g e the funtion from the set {,, } to itself suh tht gg() =, gg() =, nd gg() =. Let f e the funtion from the set {,, } to the set {,,} suh tht ff() =, ff() =, nd ff() =. Wht is the omposition of ff nd gg, nd wht is the omposition of g nd f? Solution: The omposition ff gg is defined y (ff gg)() = ff gg() = ff() =, (ff gg)() = ff gg() = ff() =, nd (ff gg)() = ff gg() = ff() = EXAMPLE Let f nd g e the funtions from the set of integers to the set of integers defined y ff(xx) = xx + nd gg(xx) = xx +. Wht is the omposition of ff nd gg? Wht is the omposition of g nd f? Solution: Both the ompositions ff gg nd gg ff re defined. Moreover, (ff gg)(xx) = ff gg(xx) = ff(xx + ) = (xx + ) + = 6xx + 7 nd (gg ff)(xx) = gg ff(xx) = gg(xx + ) = (xx + ) + = 6xx + Remrk: Note tht even though ff gg nd gg ff re defined for funtions f nd g in Exmple, ff gg nd gg ff re not equl. In other words, the ommuttive lw does not hold for the omposition of funtions.

12 Inverse Funtions: When the omposition of funtion nd its inverse is formed, in either order, n identity funtion is otined. To see this, suppose tht f is one-to-one orrespondene from the set A to the set B. Then the inverse funtion ff exists nd is one-to-one orrespondene from B to A. the inverse funtion reverses the orrespondene of the originl funtion, so ff () = when ff() =, nd ff() = when ff () =. Hene, (ff ff)() = ff ff() = ff () =, nd (ff ff )() = ff ff () = ff() =. The Grphs of Funtions DEFINITION EXAMPLE Let ff e funtion from the set AA to the set BB. The grph of the funtion ff is the set of ordered pirs {(, ) AA nd ff() = }. Disply the grph of the funtion ff(nn) = nn + from the set of integers to the set of integers. Solution: The grph of ff is the set of ordered pirs of the form (nn, nn + ), where nn is n integer. The grph is displyed in Figure 8. FIGURE 8 The Grph of ff(nn) = + from Z to Z. EXAMPLE 5 Disply the grph of the funtion ff(xx) = xx from the set of integers to the set of integers. Solution: The grph of ff is the set of ordered pirs of the form (xx, ff(xx) = (xx, xx ), where xx is n integer. The grph is displyed in Figure 9.

13 (-,9) (,9) (-,) (,) (,) (0,0) FIGURE 9 The Grph of ff(xx) = xx from Z to Z. Some Importnt Funtions DEFINITION The floor funtion ssigns to the rel numer xx the lrgest integer tht is less thn or equl to xx. The vlue of the floor funtion t xx is denoted y xx. The eiling funtion ssigns to the rel numer xx the smllest integer tht is greter thn or equl to xx. The vlue of the eiling funtion t xx is denoted y xx.

14 FIGURE 0 () Grph of the Floor Funtion

15 FIGURE 0 () Grph of the Ceiling Funtion EXAMPLE 6 These re some vlues of the floor nd eiling funtions: = 0, =, =, = 0,. =,. =, 7 = 7, 7 = 7 5

16 EXAMPLE 7 Dt stored on omputer disk or trnsmitted over dt network re usully represented s string of ytes. Eh yte is mde up of 8 its. How mny ytes re required to enode 00 its of dt? Solution: To determine the numer of ytes needed, we determine the smllest integer tht is t lest s lrge s the quotient when 00 is divided y 8, the numer of its in yte. Consequently, 00 8 =.5 = ytes re required. 6

17 . Why is ff not funtion from R to R? Solution: Prt Funtion Explntion ) ff(xx) = xx The expression xx is meningless for xx = 0, whih is one of the elements in the domin; thus the rule is no rule t ll. In other words, f (0) is not defined. ) ff(xx) = xx The funtion ff(xx) does not mp vlues to the rel numers when xx < 0. In other words, when xx < 0, ff(xx) is undefined. ) ff(xx) = ± (xx + ) The rule for ff is miguous. We must hve ff(xx) defined uniquely, ut here there re two vlues ssoited with every xx, the positive squre root nd the negtive squre root of xx Find the domin nd rnge of these funtions. Solution: Prt Funtion Domin Rnge ) the funtion tht ssigns to eh pir of Z + Z + Z + positive integers the mximum of these two integers. ) the funtion tht ssigns to eh positive Z + {xx N 00 xx 99} integer the numer of the digits 0,,,,, 5, 6, 7, 8, 9 tht do not pper s deiml digits of the integer ) the funtion tht ssigns to it string (00 ) N the numer of times the lok ppers d) the funtion tht ssigns to it string the numeril position of the first in the string nd tht ssigns the vlue 0 to it string onsisting of ll 0s. (00 ) N 7

18 5. Determine whether ff: Z Z is onto if Solution: Rell the definition of onto. DEFINITION 7 A funtion f from A to B is lled onto, or surjetive, if nd only if for every element BB there is n element AA with ff() =. A funtion f is lled surjetion if it is onto. Prt Funtion Onto Explntion ) ff(mm, nn) = mm + nn Yes Given ny integer nn, we hveff(0, nn) = nn, so the funtion is onto. ) ff(mm, nn) = mm + nn No Clerly the rnge ontins no negtive integers, so the funtion is not onto. ) ff(mm, nn) = mm Yes Given ny integer mm, we hve ff(mm, 5) = mm, so the funtion is onto. (We ould hve used ny onstnt in ple of 5 in this rgument.) d) ff(mm, nn) = nn No Clerly the rnge ontins no negtive integers, so the funtion is not onto. e) ff(mm, nn) = mm nn Yes Given ny integer mm, we hveff(mm, 0) = mm, so the funtion is onto.. Determine whether eh of these funtions is ijetion from R to R. Solution: If we n find n inverse, the funtion is ijetion. Otherwise we must explin why the funtion is not one-to-one or not onto. Prt Funtion Bijetion Inverse or Explntion ) ff(xx) = xx + Yes One wy to determine whether funtion is ijetion, is to try to onstrut its inverse. Solve yy = + for xx, otining gg(yy) = yy Alterntively, we n rgue diretly. To show tht the funtion is one-to-one, not tht if + = xx +, then xx = xx. To show tht the funtion is onto, not tht yy + = yy, so every numer is in the rnge. ) ff(xx) = xx + No Not one-to-one: ff() = ff( ) = Not onto, sine ff(xx). ) ff(xx) = xx Yes Yes, this funtion is ijetion, sine it hs n inverse funtion ff(yy) = yy (otined y solving yy = xx for xx). d) ff(xx) = (xx + ) (xx + ) No Not one-to-one: ff() = ff( ) = Not onto euse the rnge is the set {yy R yy < } 8

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

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

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Foundations of Computer Science Comp109

Foundations of Computer Science Comp109 Reding Foundtions o Computer Siene Comp09 University o Liverpool Boris Konev konev@liverpool..uk http://www.s.liv..uk/~konev/comp09 Prt. Funtion Comp09 Foundtions o Computer Siene Disrete Mthemtis nd Its

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

( ) { } [ ] { } [ ) { } ( ] { }

( ) { } [ ] { } [ ) { } ( ] { } Mth 65 Prelulus Review Properties of Inequlities 1. > nd > >. > + > +. > nd > 0 > 4. > nd < 0 < Asolute Vlue, if 0, if < 0 Properties of Asolute Vlue > 0 1. < < > or

More information

QUADRATIC EQUATION. Contents

QUADRATIC EQUATION. Contents QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,

More information

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

More information

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions. Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene

More information

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24 Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the

More information

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations) KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting. ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s

More information

AP Calculus AB Unit 4 Assessment

AP Calculus AB Unit 4 Assessment Clss: Dte: 0-04 AP Clulus AB Unit 4 Assessment Multiple Choie Identify the hoie tht best ompletes the sttement or nswers the question. A lultor my NOT be used on this prt of the exm. (6 minutes). The slope

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

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Non Right Angled Triangles

Non Right Angled Triangles Non Right ngled Tringles Non Right ngled Tringles urriulum Redy www.mthletis.om Non Right ngled Tringles NON RIGHT NGLED TRINGLES sin i, os i nd tn i re lso useful in non-right ngled tringles. This unit

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

University of Sioux Falls. MAT204/205 Calculus I/II

University of Sioux Falls. MAT204/205 Calculus I/II University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

Lecture 1 - Introduction and Basic Facts about PDEs

Lecture 1 - Introduction and Basic Facts about PDEs * 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,

More information

Can one hear the shape of a drum?

Can one hear the shape of a drum? Cn one her the shpe of drum? After M. K, C. Gordon, D. We, nd S. Wolpert Corentin Lén Università Degli Studi di Torino Diprtimento di Mtemti Giuseppe Peno UNITO Mthemtis Ph.D Seminrs Mondy 23 My 2016 Motivtion:

More information

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

CHENG Chun Chor Litwin The Hong Kong Institute of Education

CHENG Chun Chor Litwin The Hong Kong Institute of Education PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using

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

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

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

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More information

Chapter 8 Roots and Radicals

Chapter 8 Roots and Radicals Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi

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

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

The Riemann-Stieltjes Integral

The Riemann-Stieltjes Integral Chpter 6 The Riemnn-Stieltjes Integrl 6.1. Definition nd Eistene of the Integrl Definition 6.1. Let, b R nd < b. ( A prtition P of intervl [, b] is finite set of points P = { 0, 1,..., n } suh tht = 0

More information

Algebra 2 Semester 1 Practice Final

Algebra 2 Semester 1 Practice Final Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers

More information

Ch. 2.3 Counting Sample Points. Cardinality of a Set

Ch. 2.3 Counting Sample Points. Cardinality of a Set Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of

More information

K 7. Quadratic Equations. 1. Rewrite these polynomials in the form ax 2 + bx + c = 0. Identify the values of a, b and c:

K 7. Quadratic Equations. 1. Rewrite these polynomials in the form ax 2 + bx + c = 0. Identify the values of a, b and c: Qudrti Equtions The Null Ftor Lw Let's sy there re two numers nd. If # = then = or = (or oth re ) This mens tht if the produt of two epressions is zero, then t lest one of the epressions must e equl to

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES CHARLIE COLLIER UNIVERSITY OF BATH These notes hve been typeset by Chrlie Collier nd re bsed on the leture notes by Adrin Hill nd Thoms Cottrell. These

More information

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

This enables us to also express rational numbers other than natural numbers, for example:

This enables us to also express rational numbers other than natural numbers, for example: Overview Study Mteril Business Mthemtis 05-06 Alger The Rel Numers The si numers re,,3,4, these numers re nturl numers nd lso lled positive integers. The positive integers, together with the negtive integers

More information

TOPIC: LINEAR ALGEBRA MATRICES

TOPIC: LINEAR ALGEBRA MATRICES Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

More information

Polynomials. Polynomials. Curriculum Ready ACMNA:

Polynomials. Polynomials. Curriculum Ready ACMNA: Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!

Before we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!! Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble

More information

CALCULUS STUDY MATERIAL. B.Sc. MATHEMATICS III SEMESTER UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION

CALCULUS STUDY MATERIAL. B.Sc. MATHEMATICS III SEMESTER UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CALCULUS STUDY MATERIAL BS MATHEMATICS III SEMESTER UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CALICUT UNIVERSITY PO MALAPPURAM, KERALA, INDIA - 67 65 5 UNIVERSITY OF CALICUT SCHOOL OF DISTANCE

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013

15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013 15-451/651: Design & nlysis of lgorithms Deemer 3, 2013 Leture #28 lst hnged: Novemer 28, 2013 Lst time we strted tlking out mehnism design: how to llote n item to the person who hs the mximum vlue for

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

More 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

HS Pre-Algebra Notes Unit 9: Roots, Real Numbers and The Pythagorean Theorem

HS Pre-Algebra Notes Unit 9: Roots, Real Numbers and The Pythagorean Theorem HS Pre-Alger Notes Unit 9: Roots, Rel Numers nd The Pythgoren Theorem Roots nd Cue Roots Syllus Ojetive 5.4: The student will find or pproximte squre roots of numers to 4. CCSS 8.EE.-: Evlute squre roots

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

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1. Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

Logic, Set Theory and Computability [M. Coppenbarger]

Logic, Set Theory and Computability [M. Coppenbarger] 14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer

More information

10. AREAS BETWEEN CURVES

10. AREAS BETWEEN CURVES . AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in

More information

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2. Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot

More information

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle.

In right-angled triangles the square on the side subtending the right angle is equal to the squares on the sides containing the right angle. Mth 3329-Uniform Geometries Leture 06 1. Review of trigonometry While we re looking t Eulid s Elements, I d like to look t some si trigonometry. Figure 1. The Pythgoren theorem sttes tht if = 90, then

More information

QUADRATIC EQUATION EXERCISE - 01 CHECK YOUR GRASP

QUADRATIC EQUATION EXERCISE - 01 CHECK YOUR GRASP QUADRATIC EQUATION EXERCISE - 0 CHECK YOUR GRASP. Sine sum of oeffiients 0. Hint : It's one root is nd other root is 8 nd 5 5. tn other root 9. q 4p 0 q p q p, q 4 p,,, 4 Hene 7 vlues of (p, q) 7 equtions

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

MATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals.

MATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals. MATH 409 Advned Clulus I Leture 22: Improper Riemnn integrls. Improper Riemnn integrl If funtion f : [,b] R is integrble on [,b], then the funtion F(x) = x f(t)dt is well defined nd ontinuous on [,b].

More information

Lecture 8: Abstract Algebra

Lecture 8: Abstract Algebra Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this

More information

Lesson 1: Quadratic Equations

Lesson 1: Quadratic Equations Lesson 1: Qudrtic Equtions Qudrtic Eqution: The qudrtic eqution in form is. In this section, we will review 4 methods of qudrtic equtions, nd when it is most to use ech method. 1. 3.. 4. Method 1: Fctoring

More information

The graphs of Rational Functions

The graphs of Rational Functions Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information