Math 3201 Notes Chapter 4: Rational Expressions & Equations

Size: px
Start display at page:

Download "Math 3201 Notes Chapter 4: Rational Expressions & Equations"

Transcription

1 Learig Goals: See p. tet.. Equivalet Ratioal Epressios ( classes) Read Goal p. 6 tet. Math 0 Notes Chapter : Ratioal Epressios & Equatios. Defie ad give a eample of a ratioal epressio. p. 6. Defie o-permissible values as they relate to ratioal epressios. p. 7. Determie the o-permissible values for a ratioal epressio. p. 7. Defie ad give eamples of equivalet ratioal epressios. p Fid a ratioal epressio that is equivalet to a give ratioal epressio usig multiplicatio or divisio. p Determie if two ratioal epressios are equivalet. p. 0 Def A ratioal epressio is a epressio of the form p, where p ad q are polyomials ad 0 q q. It is a fractio that has a polyomial i the umerator ad a polyomial i the deomiator ad the deomiator caot be 0. E.g.: t q 7t ;, r 0;, ;, t ;, q,;, y 0, r t q q 8y No e.g.:,, 0 w If you look back at the eamples of ratioal epressios, you should otice that ratioal epressios with oe or more variables i the deomiator had restrictios o the variable(s). The restrictios o the deomiator occur because divisio by zero is udefied, so we are ot permitted to substitute certai values for the variable(s) i the deomiator because they result i divisio by zero. These value(s) which caot be substituted for the variable(s) are called o-permissible values. These opermissible values lead to the restrictios o the ratioal epressio. Def : No-permissible values are those values of the variable that makes the deomiator of the ratioal epressios equal to zero. E.g.: For, the o-permissible values are, so the restrictios are. E.g.: For are ,. 7 See Need to Kow, bullets -, p., the o-permissible values are 5 ad, so the restrictios 7

2 Do # b, 9 a, 0 b, c, d, a(i) & a(ii), 6, CYU/Practisig pp. - tet i your homework booklet. Equivalet Ratioal Epressios Fidig equivalet ratioal epressios is the same as fidig equivalet umerical fractios. You must multiply (or divide) the umerator ad deomiator by the same umber or epressio. The origial ad resultig ratioal epressios are equivalet because multiplyig both the umerator ad the deomiator by the same umber or epressio meas you are multiplyig by oe. However, with ratioal epressios ivolvig variables, you have to pay close attetio to the restrictio(s) o the variable(s). E.g.: ad 6 are equivalet ratioal epressios. 8 E.g.: 5 ad 5 5 are equivalet ratioal epressios E.g.: ad are equivalet ratioal epressios for 0. E.g.: E.g.: t, 7. E.g.: ad 7 5tt 5t 5t t 5t 0t ad 7 t 7 t t 7 t t 5t t t t t ad t t t are equivalet ratioal epressios for. are equivalet ratioal epressios for are equivalet ratioal epressios for t. Note: If the ratioal epressios cotai at most oe variable, you ca determie if two ratioal epressios are equivalet by graphig both epressios. If oe epressio graphs o top of the other epressio, they are equivalet. E.g.: Determie if is equivalet to for 0. The graphs of y (left graph) ad ad are equivalet. y (right graph) graph o top of each other so

3 Sample Eam Questio 6a Idetify the ratioal epressio that is equivalet to. a a A. ; a,0 a B. ; a,0 a C. a ; a,0 a D. 6a ; a,0 a See Key Ideas, bullet, p. Do # a, b, c,, 5,, 5, CYU/Practisig pp. - tet i your homework booklet.

4 . Simplifyig Ratioal Epressios ( classes) Read Goal p. 5 tet.. Simplify ratioal epressios. pp Determie whe a ratioal epressio is simplified. p. 5. Determie whe to idetify the o-permissible values whe simplifyig a ratioal epressio. p. 5. Idetify errors i the simplificatio of a ratioal epressio. p. 0 Simplifyig Ratioal Epressios Simplifyig ratioal epressios is very similar to simplifyig umerical fractios. The idea is to factor both the umerator ad deomiator ad cacel like factors to get a equivalet epressio. Do t forget to pay attetio to the o-permissible values so you ca state the restrictio(s) o the variable(s). Remember that graphig ca be used to check your work if there is o more tha oe variable. You have simplified a ratioal epressio whe the umerator ad the deomiator have o commo factors (see TIP, p. 5). E.g.: E.g.: r 9 r r r ; r 0 6r 6 r r r E.g.: 8, Note that you determie the o-permissible values ad the restrictios after you factor but before you cacel (see TIP p. 5). E.g.: a a aa a a a a a ; a E.g.: E.g.:, ,

5 6 E.g.: Simplify E.g.: Simplify ; a a E.g.: Simplify 5a a a 5a 7a a 7a 5 a ; a 0 5 E.g.: Simplify ; 0, 5 5 Sample Eam Questio ; ; 0, 5 Simplify 6 7 ANS: ; 7 5

6 E.g.: Fid the error i the followig simplificato of ; 0 The error occurs i cacelig 0 ad 0to get. The correct simplificatio is ; 0 5 a E.g.: Fid the errors i the followig simplificato of a. a a a a a a a There are errors, oe i the simplificatio correct simplificatio is a a a a a a a a a a ; a istead of a a ad oe i the restrictios. The ; a a See Key Ideas & Need to Kow, p. 9 Do # s, b, c, d, a, c, c, d, 5 b, c, 6-8,, CYU/Practisig pp. 9- tet i your homework booklet. 6

7 . Multiplyig ad Dividig Ratioal Epressios ( classes) Read Goal o p. tet Outcomes:. Compare ad cotrast multiplyig ad dividig ratioal epressios with multiplyig ad dividig umerical fractios pp. -6. Determie the restrictio(s) o the variable(s) whe multiplyig or dividig ratioal epressios. pp. -6. Multiply ad divide ratioal epressios. pp. -6 Multiplyig Ratioal Epressios Multiplyig ratioal epressios is similar to multiplyig umerical fractios. However, you must watch for the restrictio(s) o the variable(s). E.g.: Simplify 5 7 We multiply across the top ad across the bottom to get Sometimes, we ca do some cacellig before we multiply. E.g.: Simplify Multiplyig ratioal epressios is similar ecept that we have to determie the o-permissible value(s) for the epressio ad use them to write the restrictios o the variable. 9 E.g.: Simplify We have to rewrite the epressio so that everythig is factored ad cacel like factors. Do t forget to fid the o-permissible values before you cacel. You could multiply across the top ad across the bottom ad the factor but this would greatly icrease the difficulty of the factorig. 9 ; 0,, 7

8 E.g.: Simplify ; 0, E.g.: Simplify See Key Ideas & Need to Kow, p ;,0 5 Do # s a, c, a, b, 5 a, 6, CYU/Practisig pp. 8-9 tet i your homework booklet. Dividig Ratioal Epressios Dividig ratioal epressios is similar to dividig umerical fractios. However, you must watch for the restrictio(s) o the variable(s). E.g.: Simplify 5 7 First we multiply the first fractio by the reciprocal of the secod fractio ad the we multiply across the top ad across the bottom to get Like multiplyig umerical fractios, sometimes we ca use cacellatio after we multiply by the reciprocal. E.g.: Simplify Dividig ratioal epressios is similar ecept that we have to determie the o-permissible value(s) for the epressio. This is a little bit trickier tha with multiplyig ratioal epressios. 8

9 E.g.: Simplify t t s s t t t s t s st, s 0, t 0 s s s t 6st Do you see why t 0? E.g.: Simplify ; E.g.: Simplify, E.g.: Simplify y y y y y y y y y y y y y y y y y y y y y y y, y,0 y a a E.g.: Simplify 5 a a5 a a 5 a a5 a a 5 a 5 a a 5 a a5 5 a 5 a a a a 5 5 a 5 a a ; a, 5 5 a y y y y 9

10 Note that divisio ad multiplicatio of ratioal epressios ca be combied as i the eample below. E.g.: Simplify 6 6 ;, Sample Eam Questio Simplify s s 5 9 s s 5 s s5 s s 5 s 9 s s5 9s s 5 s 5 s 5 ; 5, s 6 s 9 See Key Ideas & Need to Kow, p. 7 Do # s b, d, c, d, 5 b, 7, CYU/Practisig pp. 8-9 tet i your homework booklet. 0

11 . Addig ad Subtractig Ratioal Epressios ( classes) Read Goal o p. tet Outcomes:. Compare ad cotrast addig ad subtractig ratioal epressios with addig ad subtractig umerical fractios pp. -8. Determie the restrictio(s) o the variable(s) whe addig or subtractig ratioal epressios. pp. -8. Add ad subtract ratioal epressios with like deomiators. pp. -8. Add ad subtract ratioal epressios with ulike deomiators. pp. -8 Addig Ratioal Epressios Addig ratioal epressios is similar to addig umerical fractios. It ivolves factorig the deomiators ad fidig the LCM of the deomiators. E.g.: Simplify 5 Step : Fid the lowest Lowest commo deomiator is. Step : Write both umerators over a sigle 5 Step : Add the umerators. 8 Step : Reduce, if ecessary 8 Sometimes, we have to fid a commo deomiator before we add. E.g.: Simplify 5 7 Step : Fid the lowest Lowest commo deomiator is. Step : Write equivalet fractios with the 5 6 Step : Write both umerators over a sigle Step : Add the umerators Step 5: Reduce, if ecessary 7 7

12 Addig ratioal epressios is similar ecept that we have to determie the o-permissible value(s) for the epressio so we ca write the restrictios. E.g.: Simplify m m Step : Fid the lowest Lowest commo deomiator is. Step : Write both umerators over a sigle mm Step : Combie like terms. m Step : Reduce, if ecessary m is already reduced. Step 5: Fid the o-permissible values. 0 Step 6: Write the aswer with ay restrictios m ; 0 E.g.: Simplify 0 m 8 m m m Step : Fid the lowest Lowest commo deomiator is m. Step : Write both umerators over a sigle 0m 8m m Step : Combie like terms. 8m 7 m Step : Reduce, if ecessary 8m 7 is already reduced. m Step 5: Fid the o-permissible values. m Step 6: Write the aswer with ay restrictios 8m 7 ; m m E.g.: Simplify 6 Step : Factor both deomiators. Both deomiators caot be factored.. Step : Fid the lowest Lowest commo deomiator is Step : Write both epressios with the commo 6 6 deomiator. Step : Write both umerators over a sigle 6

13 Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary is already reduced. Step 8: Fid the o-permissible values., Step 9: Write the aswer with ay restrictios 0 ;, For may ratioal epressios, the deomiators are NOT like, so we have to fid a commo deomiator before we ca add. We may have to factor the deomiators before we ca fid the E.g.: Simplify p p Step : Factor both deomiators. p p p p p p Step : Fid the lowest Lowest commo deomiator is p p Step : Write both epressios with the commo deomiator. p p p p p p p p p p Step : Write both umerators over a sigle p p p Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary p p p p 7 p p p 7 p p is already reduced. Step 8: Fid the o-permissible values. p Step 9: Write the aswer with ay restrictios p 7 ; p p p.

14 E.g.: Simplify Step : Factor both deomiators. Step : Fid the lowest Lowest commo deomiator is Step : Write both epressios with the commo deomiator. Step : Write both umerators over a sigle Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary is already reduced. Step 8: Fid the o-permissible values. 0, Step 9: Write the aswer with ay restrictios ; 0,. E.g.: Simplify Step : Factor both the umerators ad the deomiators ad cacel ay like factors Step : Fid the lowest Lowest commo deomiator is 7 0 Step : Write both epressios with the commo 0 0 deomiator Step : Write both umerators over a sigle

15 Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary is already reduced. Step 8: Fid the o-permissible values. 7,,5,0 Step 9: Write the aswer with ay restrictios 7 ; 7,,5,0 7 0 E.g.: Fid the error i the simplificatio below ad write the correct simplificatio The error occurs whe the deomiators are added. The correct simplificatio is E.g.: Chris purchased a motorboat ad used it to travel 6 km upstream ad the 6 km back dowstream. If the river s curret is costat at km/h, algebraically determie a equatio which models the time take to travel the km. Let v be the speed of the boat i still water. Let v be the speed of the boat goig dowstream. Let v be the speed of the boat goig upstream. Upstream Dowstream d 6km d 6km Speed v Speed v 6 t t 6 v v Sice the total time is the sum of the time goig upstream ad the dowstream, the epressio for the 6 6 total time take to travel km is v v See I Summary, p. 8 Do # s,, b, d, 5 b, d, 6 a, c, 7 a, 0, CYU/Practisig pp tet i your homework booklet. 5

16 Subtractig Ratioal Epressios Subtractig ratioal epressios is similar to subtractig umerical fractios. It ivolves factorig the deomiators ad fidig the LCM of the deomiators. However, you must watch for the restrictio(s) o the variable(s). E.g.: Simplify 5 Step : Fid the lowest Lowest commo deomiator is. Step : Write both umerators over a sigle 5 Step : Subtract the umerators. Step : Reduce, if ecessary Sometimes, we have to fid a commo deomiator before we subtract. E.g.: Simplify 5 7 Step : Fid the lowest Lowest commo deomiator is. Step : Write equivalet fractios with the 5 6 Step : Write both umerators over a sigle Step : Subtract the umerators Step 5: Reduce, if ecessary 9 is already reduced. Subtractig ratioal epressios is similar ecept that we have to determie the o-permissible value(s) for the epressio so we ca write the restrictios. E.g.: Simplify m m Step : Fid the lowest Lowest commo deomiator is. Step : Write both umerators over a sigle mm Use paretheses to show that you are subtractig all of the secod deomiator. 6

17 Step : Chage to additio ad chage the sigs of m m mm all the terms iside the paretheses. Step : Add like terms. Step 5: Reduce, if ecessary is already reduced. Step 6: Fid the o-permissible values. 0 Step 7: Write the aswer with ay restrictios ; 0 E.g.: Simplify 0 m 8 m m m Step : Fid the lowest Lowest commo deomiator is m. Step : Write both umerators over a sigle 0m 8 m Use paretheses to show m that you are subtractig all of the secod deomiator. Step : Chage to additio ad chage the sigs of 0m 8 m 0m8 m all the terms iside the paretheses. m m Step : Combie like terms. m 9 m Step 5: Reduce, if ecessary m 9 m m m Step 6: Fid the o-permissible values. m Step 7: Write the aswer with ay restrictios ; m E.g.: Simplify 6 Step : Factor both deomiators. The deomiators caot be factored.. Step : Fid the lowest Lowest commo deomiator is Step : Write both epressios with the commo 6 6 deomiator. Step : Write both umerators over a sigle 6 7

18 Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary 6 is already reduced. Step 8: Fid the o-permissible values., Step 9: Write the aswer with ay restrictios ;, For may ratioal epressios, the deomiators are NOT like, so we have to fid a commo deomiator before we ca subtract. We may have to factor the deomiators before we ca fid the E.g.: Simplify p p Step : Factor both deomiators. p p p p p p Step : Fid the lowest Lowest commo deomiator is p p Step : Write both epressios with the commo deomiator. p p p p p p p p p p Step : Write both umerators over a sigle p p p Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary p p p p p p p p p is already reduced. Step 8: Fid the o-permissible values. p Step 9: Write the aswer with ay restrictios p ; p p p. 8

19 E.g.: Simplify Step : Factor both deomiators. Step : Fid the lowest Lowest commo deomiator is Step : Write both epressios with the commo deomiator. Step : Write both umerators over a sigle Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary is already reduced. Step 8: Fid the o-permissible values. 0, Step 9: Write the aswer with ay restrictios ; 0,. E.g.: Simplify Step : Factor both the umerators ad the deomiators ad cacel ay like factors Step : Fid the lowest Lowest commo deomiator is 7 0 Step : Write both epressios with the commo 0 0 deomiator Step : Write both umerators over a sigle

20 Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary is already reduced. Step 8: Fid the o-permissible values. 7,,5,0 Step 9: Write the aswer with ay restrictios ; 7,,5,0 7 0 E.g.: Simplify 6 Step : Factor both the umerators ad the deomiators ad cacel ay like factors. 6 Step : Fid the lowest Step : Write both epressios with the commo deomiator. Step : Write both umerators over a sigle Lowest commo deomiator is. Step 5: Epad the umerator, if ecessary. Step 6: Combie like terms. Step 7: Reduce, if ecessary 5 5 is already reduced. Step 8: Fid the o-permissible values.,, Step 9: Write the aswer with ay restrictios 5 ;,,, 0

21 E.g.: Fid the error i the simplificatio below ad write the correct simplificatio. 6 ; The error occurs i the subtractio of. The correct simplificatio is ; Do # s a, c, 5 a, c, 6 b, d, 7 b, 8, 9, CYU/Practisig pp tet i your homework booklet.

22 .5 Solvig Ratioal Equatios ( classes) Read Goal p. 5 tet Outcomes:. Defie ad give a eample of a ratioal equatio. p. 5. Solve ratioal equatios algebraically. pp Idetify the restrictio(s) o the variable(s) i a ratioal equatio. pp Idetify etraeous roots whe solvig a ratioal equatio. p Idetify iadmissible roots whe solvig a ratioal equatio. p. 5 Def : A ratioal equatio is a equatio that cotais oe or more ratioal epressios. E.g.: d d t t, 8, v v 0 0 We ca ofte solve ratioal equatios by multiplyig each term of the equatio by the LCD of all the deomiators i the equatio. We have to determie the restrictios o the variables i the ratioal equatios to idetify ay etraeous roots or iadmissible solutios. Def :A etraeous root is a solutio to the equatio that is ot permissible i the origial equatio. Def :A iadmissible solutio is a solutio to the equatio that is ot valid i the cotet of the problem. E.g.: Solve 6 t, t 0 t Step : Fid the lowest The LCD is t. Step : Multiply each term of the equatio by the 6 t t t t LCD. t Step : Simplify each term. There should be o t 8t fractios remaiig. Step : Rearrage to get a quadratic equatio. t 8t 0 t6 t 0 Step 5: Factor or use the quadratic formula. Step 6: Use ZPP to get the solutios. Step 7: Check for etraeous roots or iadmissible solutios. ZPP t 6 0 or t 0 t 6 or t The restrictio is t 0 so both ad 6 are solutios. Aother way to solve ratioal equatios is to combie epressios o each side of the equal side ad cross-multiplyig. E.g.: Solve 6 t, t 0 t

23 Step : Fid the lowest The LCD is t. Step : Write each term o the left with a 6 t t deomiator of t. t t t t t Step : Write both epressios o the left over the t t Step : Cross multiply. t 8t Step 5: Rearrage to get a quadratic equatio. t 8t 0 t6 t 0 Step 6: Factor or use the quadratic formula. Step 7: Use ZPP to get the solutios. Step 8: Check for etraeous roots or iadmissible solutios. ZPP t 6 0 or t 0 t 6 or t The restrictio is t 0 so both ad 6 are solutios. E.g.: Solve,,0 5 Step : Fid the lowest The LCD is 5. Step : Multiply each term of the equatio by the 5 LCD Step : Simplify each term. There should be o 5 5 fractios remaiig. Step : Epad ad combie like terms Step 5: Solve the equatio. 9 Step 6: Check for etraeous roots or The restrictios are,0 so is a solutio. iadmissible solutios. E.g.: Solve 0 5, 0, Step : Fid the lowest The LCD is. Step : Multiply each term of the equatio by the LCD. 0 5

24 Step : Simplify each term. There should be o fractios remaiig. 0 5 Step : Epad ad combie like terms Step 5: Solve the equatio. Step 6: Check for etraeous roots or The restrictios are 0, so is a etraeous iadmissible solutios. root. Therefore we write. 9 8 E.g.: Solve,,6 y y 6 y 9y 8 Step : Factor the deomiators. Step : Fid the lowest commo deomiator. Step : Multiply each term of the equatio by the LCD. Step : Simplify each term. There should be o fractios remaiig. Step 5: Epad ad combie like terms. Step 6: Solve the equatio. Step 7: Check for etraeous roots or iadmissible solutios. y y y6 y6 y 9y 8 y y 6 The LCD is y y y y 6 y y 6 y y 6 y y 6 y y 6 y y y5 y 8 5y 8 5y 60 y The restrictios are,6 so is a solutio. 5 5 E.g.: Solve,, 6 Step : Factor the deomiators. Step : Fid the lowest commo deomiator. 6 The LCD is.

25 Step : Multiply each term of the equatio by the LCD. Step : Simplify each term. There should be o fractios remaiig. Step 5: Epad ad combie like terms. Step 6: Factor or use the quadratic formula. Step 7: Use ZPP to get the solutios. Step 7: Check for etraeous roots or iadmissible solutios ZPP 0 or or The restrictios are,, so we kow that oly 5 is a solutio. See I Summary, p. 57 See for practice questios. Do # s,, 5 c, d, 6 b, d, CYU/Practisig p. 58 tet i your homework booklet. Solvig Problems Usig Ratioal Equatios ( classes) It costs Mr. Williams $500 to take some of his seior high Eglish studets to Triity to see a play. O the day of the trip, 0 studets do t show up which meas that each studet must pay a etra $.50 to cover the cost of the trip. How may studets actually wet o the trip? Let be the umber of studets who actually wet to see the play. Let 0 be the umber of studets who were origially goig to see the play. The smaller cost per studet with 0 studets who were origially goig is The larger cost per studet with oly the studets who actually wet is 500. Sice the differece i cost is.50 we ca write ; 0,0 0 5

26 We multiply each term by 0 to get rid of the fractios. This gives ZPP or 0 So 0 studets actually wet to see the play. Do you see that 50 is a iadmissible solutio because it is a root of ; 0,0 but does ot make sese i the cotet of this problem because the 0 umber of studets goig o the trip caot be egative? Do # 7 Practisig p. 60 tet i your homework booklet. E.g.: Chris purchased a motorboat ad used it to travel 6 km upstream ad the 6 km back dowstream i a total of hours. If the river s curret is costat at km/h, algebraically determie a equatio which models this situatio ad use it to fid the speed of the boat i still water. Let v be the speed of the boat i still water. Let v be the speed of the boat goig dowstream. Let v be the speed of the boat goig upstream. Upstream Dowstream d 6km d 6km Speed v Speed v 6 t t 6 v v Sice the total time is hrs, we ca write 6

27 6 6 v v We multiply each term by v v 6 6 v v 6 6 to get rid of the fractios. This gives v v v v v v v v v v 6v 6v v vv 6 0 v v 6 0 v v v v 0 ZPP v or v Sice speed is positive, we kow that v (iadmissible root), so the speed of the boat i still water is km/h. Do #, Practisig p. 59 tet i your homework booklet. E.g.: Pria, workig aloe, ca pait a room i hours. If Paul works aloe, he ca pait the same room i hours. How log would it take to pait the room if they work together? Pria Paul Both Time to Pait Room (hrs) Fractio of Room Paited i Hour Fractio of Room Paited i Hours The equatio that models this situatio is or Multiplyig all the terms by 6 ad solvig gives 7

28 hrs or hr, miutes 5 It will take. hrs to pait the room if they both work together. Do # 0 Practisig p. 59 tet i your homework booklet. E.g.: Pria, workig aloe, ca pait a room i hours. If Pria ad Paul work together, they ca pait the same room i. hours. How log would it take Paul to pait the room if he works aloe? Pria Paul Both Time to Pait Room (hrs) Fractio of Room Paited i Hour.. Fractio of Room Paited i. Hours The equatio that models this situatio is. or. Multiplyig all the terms by ad solvig gives It will take 6 hrs for Paul to pait the room aloe. Do # s, 8, Practisig p. 59 tet i your homework booklet. 8

29 E.g.: Mrs Harum bought a bo of cheer-leader T-shirts for $50. She kept oe for herself ad oe for her daughter ad sold the rest for $560, makig a profit of $5 o each T-shirt. How may T-shirts were i the case? Let represet the umber of T-shirts i the bo. Profit/shirt = Reveue/shirt Cost/shirt so we ca write the equatio ,,0 Multiplyig both sides by gives or or 6 Sice 6 is a iadmissible root, the there were 0 shirts i the bo. Do # s 5, 8, Practisig p. 60 tet i your homework booklet. Do # s, d, b, d, 5 c, d, 6 a, d, 7, 9 a, c, 0 b, d,, Practisig p tet i your homework booklet. 9

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

Here are the coefficients of the terms listed above: 3,5,2,1,1 respectively.

Here are the coefficients of the terms listed above: 3,5,2,1,1 respectively. *. Operatios with Poloials: Let s start b defiig soe words. Ter: A ter is a uber, variable or the product of a uber ad variable(s). For eaple:,, z, a Coefficiet: A coefficiet is the ueric factor of the

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)

FURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS) Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

12-5A. Equivalent Fractions and Decimals. 1 Daily Common Core Review. Common Core. Lesson. Lesson Overview. Math Background

12-5A. Equivalent Fractions and Decimals. 1 Daily Common Core Review. Common Core. Lesson. Lesson Overview. Math Background Lesso -A Equivalet Fractios ad Decimals Commo Core Lesso Overview Domai Number ad Operatios Fractios Cluster Uderstad decimal otatio for fractios, ad compare decimal fractios. Stadards.NF. Use decimal

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES SEQUENCES AND SERIES U N I The umber of gifts set i the popular Christmas Carol days of Christmas form a sequece. A part of the sog goes this way O the th day of Christmas my true love gave to me drummers

More information

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system.

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system. Commo Core Math 3 Notes Uit Day Systems I. Systems of Liear Equatios A system of two liear equatios i two variables is two equatios cosidered together. To solve a system is to fid all the ordered pairs

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

1.8 What Comes Next? What Comes Later?

1.8 What Comes Next? What Comes Later? 35 1.8 What Comes Next? What Comes Later? A Practice Uderstadig Task For each of the followig tables, CC BY Hiroaki Maeda https://flic.kr/p/6r8odk describe how to fid the ext term i the sequece, write

More information

It just came to me that I 8.2 GRAPHS AND CONVERGENCE

It just came to me that I 8.2 GRAPHS AND CONVERGENCE 44 Chapter 8 Discrete Mathematics: Fuctios o the Set of Natural Numbers (a) Take several odd, positive itegers for a ad write out eough terms of the 3N sequece to reach a repeatig loop (b) Show that ot

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

4.1: Equivalent and Rational Expressions

4.1: Equivalent and Rational Expressions Math 3201 Chapter 4: Rational Expressions and Equations 12 Hours 4.1: Equivalent and Rational Expressions A Rational Expression is any expression that can be written as the quotient of two polynomials,

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Civil Engineering Computation

Civil Engineering Computation Civil Egieerig Computatio Fidig Roots of No-Liear Equatios March 14, 1945 World War II The R.A.F. first operatioal use of the Grad Slam bomb, Bielefeld, Germay. Cotets 2 Root basics Excel solver Newto-Raphso

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

An (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the.

An (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the. Sectio.2 Arithmetic Sequeces ad Series -.2 Arithmetic Sequeces ad Series Arithmetic Sequeces Arithmetic Series Key Terms: arithmetic sequece (arithmetic progressio), commo differece, arithmetic series

More information

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure. SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie

More information

Counting Regions in the Plane and More 1

Counting Regions in the Plane and More 1 Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o

More information

Module 8-7: Pascal s Triangle and the Binomial Theorem

Module 8-7: Pascal s Triangle and the Binomial Theorem Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions

Lecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets

More information

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.

Computer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria. Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must

More information

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #1

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #1 Name Date Hr. ALGEBRA - SPRING FINAL MULTIPLE CHOICE REVIEW #. The high temperatures for Phoeix i October of 009 are listed below. Which measure of ceter will provide the most accurate estimatio of the

More information

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS :

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS : J-Mathematics. CONTINUOUS FUNCTIONS : CONTINUI TY A fuctio for which a small chage i the idepedet variable causes oly a small chage ad ot a sudde jump i the depedet variable are called cotiuous fuctios.

More information

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions: CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70

Major CSL Write your name and entry no on every sheet of the answer script. Time 2 Hrs Max Marks 70 NOTE:. Attempt all seve questios. Major CSL 02 2. Write your ame ad etry o o every sheet of the aswer script. Time 2 Hrs Max Marks 70 Q No Q Q 2 Q 3 Q 4 Q 5 Q 6 Q 7 Total MM 6 2 4 0 8 4 6 70 Q. Write a

More information

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 ) EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders

More information

4.3 Modeling with Arithmetic Sequences

4.3 Modeling with Arithmetic Sequences Name Class Date 4.3 Modelig with Arithmetic Sequeces Essetial Questio: How ca you solve real-world problems usig arithmetic sequeces? Resource Locker Explore Iterpretig Models of Arithmetic Sequeces You

More information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

Algorithm Design Techniques. Divide and conquer Problem

Algorithm Design Techniques. Divide and conquer Problem Algorithm Desig Techiques Divide ad coquer Problem Divide ad Coquer Algorithms Divide ad Coquer algorithm desig works o the priciple of dividig the give problem ito smaller sub problems which are similar

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015

15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015 15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:

More information

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis

n Some thoughts on software development n The idea of a calculator n Using a grammar n Expression evaluation n Program organization n Analysis Overview Chapter 6 Writig a Program Bjare Stroustrup Some thoughts o software developmet The idea of a calculator Usig a grammar Expressio evaluatio Program orgaizatio www.stroustrup.com/programmig 3 Buildig

More information

Mathematical Stat I: solutions of homework 1

Mathematical Stat I: solutions of homework 1 Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Content: Learning Area: Mathematics. Integration: Grade: 9. Lesson: Module 2: Algebra and geometry. Teaching methods and Lesson Progression:

Content: Learning Area: Mathematics. Integration: Grade: 9. Lesson: Module 2: Algebra and geometry. Teaching methods and Lesson Progression: Learig Area: Mathematics Lesso: Module 2: Algebra ad geometry Grade: 9 Itegratio: Cotet: Duratio: Date/Week: Learig LEARNING UNIT 1 - ASSESSMENT Multiply ad divide polyomials umbers ad their relatioships,

More information

Examples and Applications of Binary Search

Examples and Applications of Binary Search Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

CS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June

CS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that

More information

One advantage that SONAR has over any other music-sequencing product I ve worked

One advantage that SONAR has over any other music-sequencing product I ve worked *gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

ENGR Spring Exam 1

ENGR Spring Exam 1 ENGR 300 Sprig 03 Exam INSTRUCTIONS: Duratio: 60 miutes Keep your eyes o your ow work! Keep your work covered at all times!. Each studet is resposible for followig directios. Read carefully.. MATLAB ad

More information

CMPT 125 Assignment 2 Solutions

CMPT 125 Assignment 2 Solutions CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address

More information

2) Give an example of a polynomial function of degree 4 with leading coefficient of -6

2) Give an example of a polynomial function of degree 4 with leading coefficient of -6 Math 165 Read ahead some cocepts from sectios 4.1 Read the book or the power poit presetatios for this sectio to complete pages 1 ad 2 Please, do ot complete the other pages of the hadout If you wat to

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

A Resource for Free-standing Mathematics Qualifications

A Resource for Free-standing Mathematics Qualifications Ope.ls The first sheet is show elow. It is set up to show graphs with equatios of the form = m + c At preset the values of m ad c are oth zero. You ca chage these values usig the scroll ars. Leave the

More information

UNIT 1 RECURRENCE RELATIONS

UNIT 1 RECURRENCE RELATIONS UNIT RECURRENCE RELATIONS Structure Page No.. Itroductio 7. Objectives 7. Three Recurret Problems 8.3 More Recurreces.4 Defiitios 4.5 Divide ad Coquer 7.6 Summary 9.7 Solutios/Aswers. INTRODUCTION I the

More information

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY

BACHMANN-LANDAU NOTATIONS. Lecturer: Dr. Jomar F. Rabajante IMSP, UPLB MATH 174: Numerical Analysis I 1 st Sem AY BACHMANN-LANDAU NOTATIONS Lecturer: Dr. Jomar F. Rabajate IMSP, UPLB MATH 174: Numerical Aalysis I 1 st Sem AY 018-019 RANKING OF FUNCTIONS Name Big-Oh Eamples Costat O(1 10 Logarithmic O(log log, log(

More information

The Inverse z-transform

The Inverse z-transform The Iverse -Trasfor I sciece oe tries to tell people, i such a way as to be uderstood by everyoe, soethig that o oe ever ew before. But i poetry, it's the eact opposite. Paul Dirac Cotet ad Figures are

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #2

Name Date Hr. ALGEBRA 1-2 SPRING FINAL MULTIPLE CHOICE REVIEW #2 Name Date Hr. ALGEBRA - SPRING FINAL MULTIPLE CHOICE REVIEW # 5. Which measure of ceter is most appropriate for the followig data set? {7, 7, 75, 77,, 9, 9, 90} Mea Media Stadard Deviatio Rage 5. The umber

More information

Graceful Labelings of Pendant Graphs

Graceful Labelings of Pendant Graphs Rose-Hulma Udergraduate Mathematics Joural Volume Issue Article 0 Graceful Labeligs of Pedat Graphs Alessadra Graf Norther Arizoa Uiversity, ag@au.edu Follow this ad additioal works at: http://scholar.rose-hulma.edu/rhumj

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

IJESMR International Journal OF Engineering Sciences & Management Research

IJESMR International Journal OF Engineering Sciences & Management Research [Geetha, (10): October, 015] ISSN 39-6193 Impact Factor (PIF):.3 Iteratioal Joural OF Egieerig Scieces & Maagemet Research CONSTRUCTION OF DIOPHANTINE QUADRUPLES WITH PROPERTY D(A PERFECT SQUARE) V.Geetha

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

More information

WebAssign Lesson 6-1b Geometric Series (Homework)

WebAssign Lesson 6-1b Geometric Series (Homework) WebAssig Lesso 6-b Geometric Series (Homework) Curret Score : / 49 Due : Wedesday, July 30 204 :0 AM MDT Jaimos Skriletz Math 75, sectio 3, Summer 2 204 Istructor: Jaimos Skriletz. /2 poitsrogac alcet2

More information

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)

More information

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

Chapter 2. C++ Basics. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 2. C++ Basics. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 2 C++ Basics Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 2.1 Variables ad Assigmets 2.2 Iput ad Output 2.3 Data Types ad Expressios 2.4 Simple Flow of Cotrol 2.5 Program

More information

The Graphs of Polynomial Functions

The Graphs of Polynomial Functions Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where

More information

27 Refraction, Dispersion, Internal Reflection

27 Refraction, Dispersion, Internal Reflection Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet

More information

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering

EE University of Minnesota. Midterm Exam #1. Prof. Matthew O'Keefe TA: Eric Seppanen. Department of Electrical and Computer Engineering EE 4363 1 Uiversity of Miesota Midterm Exam #1 Prof. Matthew O'Keefe TA: Eric Seppae Departmet of Electrical ad Computer Egieerig Uiversity of Miesota Twi Cities Campus EE 4363 Itroductio to Microprocessors

More information

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information