9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
|
|
- Howard Jennings
- 6 years ago
- Views:
Transcription
1 _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 write sums. Fid the sums of ifiite series. Use sequeces ad series to model ad solve real-life problems. Why you should lear it Sequeces ad series ca be used to model real-life problems. For istace, i Exercise 9 o page, sequeces are used to model the umber of Best Buy stores from 99 through. Sequeces I mathematics, the word sequece is used i much the same way as i ordiary Eglish. Sayig that a collectio is listed i sequece meas that it is ordered so that it has a first member, a secod member, a third member, ad so o. Mathematically, you ca thik of a sequece as a fuctio whose domai is the set of positive itegers. f a, f a, f a, f a,..., f a,... Rather tha usig fuctio otatio, however, sequeces are usually writte usig subscript otatio, as idicated i the followig defiitio. Defiitio of Sequece A ifiite sequece is a fuctio whose domai is the set of positive itegers. The fuctio values a, a, a, a,..., a,... are the terms of the sequece. If the domai of the fuctio cosists of the first positive itegers oly, the sequece is a fiite sequece. O occasio it is coveiet to begi subscriptig a sequece with istead of so that the terms of the sequece become a, a, a, a,.... Example Writig the Terms of a Sequece Scott Olso /Getty Images The HM mathspace CD-ROM ad Eduspace for this text cotai additioal resources related to the cocepts discussed i this chapter. Write the first four terms of the sequeces give by a. a b. a. Solutio a. The first four terms of the sequece give by a are a a a 7 a. st term d term rd term th term b. The first four terms of the sequece give by a are a a a a. st term d term rd term th term Now try Exercise.
2 _9.qxd // : AM Page Sectio 9. Sequeces ad Series Exploratio Write out the first five terms of the sequece whose th term is a. Are they the same as the first five terms of the sequece i Example? If ot, how do they differ? Additioal Example Write a expressio for the apparet th term a of the sequece...,,,, Solutio: :... Terms:... a Apparet patter: Each term has a umerator that is greater tha its deomiator, which implies that a. To graph a sequece usig a graphig utility, set the mode to sequece ad dot ad eter the sequece. The graph of the sequece i Example (a) is show below. You ca use the trace feature or value feature to idetify the terms. Techology Example A Sequece Whose Terms Alterate i Sig Write the first five terms of the sequece give by Solutio The first five terms of the sequece are as follows. a a a a a 7 9 Now try Exercise 7. st term d term rd term th term th term Simply listig the first few terms is ot sufficiet to defie a uique sequece the th term must be give. To see this, cosider the followig sequeces, both of which have the same first three terms.,,,,...,,...,,,,...,,... Example Fidig the th Term of a Sequece Write a expressio for the apparet th term a of each sequece. a.,,, 7,... b.,,, 7,... Solutio a. :... Terms: 7... a Apparet patter: Each term is less tha twice a., which implies that b. :... Terms: 7... a Apparet patter: The terms have alteratig sigs with those i the eve positios beig egative. Each term is more tha the square of, which implies that a Now try Exercise 7. a.
3 _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability Some sequeces are defied recursively. To defie a sequece recursively, you eed to be give oe or more of the first few terms. All other terms of the sequece are the defied usig previous terms. A well-kow example is the Fiboacci sequece show i Example. Example The Fiboacci Sequece: A Recursive Sequece The subscripts of a sequece make up the domai of the sequece ad they serve to idetify the locatio of a term withi the sequece. For example, a is the fourth term of the sequece, ad a is the th term of the sequece. Ay variable ca be used as a subscript. The most commoly used variable subscripts i sequece ad series otatio are i, j, k, ad. The Fiboacci sequece is defied recursively, as follows. a, a, a k a k a k, where k Write the first six terms of this sequece. Solutio a th term is give. a st term is give. a a a a a Use recursio formula. a a a a a Use recursio formula. a a a a a Use recursio formula. a a a a a Use recursio formula. Now try Exercise. Factorial Notatio Some very importat sequeces i mathematics ivolve terms that are defied with special types of products called factorials. Defiitio of Factorial If is a positive iteger, factorial is defied as!.... As a special case, zero factorial is defied as!. Here are some values of! for the first several oegative itegers. Notice that! is by defiitio.!!!!!! The value of does ot have to be very large before the value of! becomes extremely large. For istace,!,,.
4 _9.qxd // : AM Page Factorials follow the same covetios for order of operatios as do expoets. For istace, whereas!!...!.... Sectio 9. Sequeces ad Series Example Writig the Terms of a Sequece Ivolvig Factorials Write the first five terms of the sequece give by a!. Begi with. The graph the terms o a set of coordiate axes. Solutio a! th term a! st term a FIGURE 9. Additioal Examples! a.!! b.!! c.! You may wat to poit out to your studets that!! Note i Example (a) that you ca simplify the computatio as follows.! 7!!!!! 7 d term rd term th term Figure 9. shows the first five terms of the sequece. Now try Exercise 9. Whe workig with fractios ivolvig factorials, you will ofte fid that the fractios ca be reduced to simplify the computatios. Evaluatig Factorial Expressios Evaluate each factorial expressio.!!! a. b. c.!!!! Solutio a. b. c. a! a! a! Example! 7 7!!!!!!!! Now try Exercise 9.!!
5 _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability Techology Most graphig utilities are able to sum the first terms of a sequece. Check your user s guide for a sum sequece feature or a series feature. Readig ad writig the upper ad lower limits of summatio correctly will help with problems ivolvig upper ad lower limits i calculus. Summatio Notatio There is a coveiet otatio for the sum of the terms of a fiite sequece. It is called summatio otatio or sigma otatio because it ivolves the use of the uppercase Greek letter sigma, writte as. Defiitio of Summatio Notatio The sum of the first terms of a sequece is represeted by a i a a a a... a where i is called the idex of summatio, is the upper limit of summatio, ad is the lower limit of summatio. Example 7 Summatio Notatio for Sums Summatio otatio is a istructio to add the terms of a sequece. From the defiitio at the right, the upper limit of summatio tells you where to ed the sum. Summatio otatio helps you geerate the appropriate terms of the sequece prior to fidig the actual sum, which may be uclear. Fid each sum. a. i b. k c. Solutio a. b. i k k k i i! c. i i!!!!!!!! 7!! 7,.7 For this summatio, ote that the sum is very close to the irratioal umber e.7. It ca be show that as more terms of the sequece whose th term is! are added, the sum becomes closer ad closer to e. Now try Exercise 7. I Example 7, ote that the lower limit of a summatio does ot have to be. Also ote that the idex of summatio does ot have to be the letter i. For istace, i part (b), the letter k is the idex of summatio.
6 _9.qxd // : AM Page 7 Sectio 9. Sequeces ad Series 7 Variatios i the upper ad lower limits of summatio ca produce quite differet-lookig summatio otatios for the same sum. For example, the followig two sums have the same terms. i i Properties of Sums. c c, c is a costat.. a i, c is a costat... a i b i a i a i b i a i For proofs of these properties, see Proofs i Mathematics o page 7. Series b i May applicatios ivolve the sum of the terms of a fiite or ifiite sequece. Such a sum is called a series. Defiitio of Series ca i c b i Cosider the ifiite sequece a, a, a,..., a i,.... The sum of the first terms of the sequece is called a fiite series or the th partial sum of the sequece ad is deoted by a a a... a a i.. The sum of all the terms of the ifiite sequece is called a ifiite series ad is deoted by a a a... a i... a i. Example Fidig the Sum of a Series For the series Solutio a. The third partial sum is b. The sum of the series is i, i fid (a) the third partial sum ad (b) the sum i Now try Exercise
7 _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability Applicatio Sequeces have may applicatios i busiess ad sciece. Oe such applicatio is illustrated i Example 9. Example 9 Populatio of the Uited States Activities. Write the first five terms of the sequece. (Assume that begis with.) a 7 9 Aswer:,,,,. Write a expressio for the apparet th term of the sequece,,.,, Aswer:!. Fid the sum. k k k Aswer: For the years 9 to, the residet populatio of the Uited States ca be approximated by the model a.9..,,,..., where a is the populatio (i millios) ad represets the year, with correspodig to 9. Fid the last five terms of this fiite sequece, which represet the U.S. populatio for the years 999 to. (Source: U.S. Cesus Bureau) Solutio The last five terms of this fiite sequece are as follows. a populatio a populatio a.9... populatio a populatio a populatio Now try Exercise. Exploratio A cube is created usig 7 uit cubes (a uit cube has a legth, width, ad height of uit) ad oly the faces of each cube that are visible are paited blue (see Figure 9.). Complete the table below to determie how may uit cubes of the cube have blue faces, blue face, blue faces, ad blue faces. Do the same for a cube, a cube, ad a cube ad add your results to the table below. What type of patter do you observe i the table? Write a formula you could use to determie the colum values for a cube. Number of blue cube faces FIGURE 9.
8 _9.qxd // : AM Page 9 Sectio 9. Sequeces ad Series 9 9. Exercises The HM mathspace CD-ROM ad Eduspace for this text cotai step-by-step solutios to all odd-umbered exercises. They also provide Tutorial Exercises for additioal help. VOCABULARY CHECK: Fill i the blaks.. A is a fuctio whose domai is the set of positive itegers.. The fuctio values a, a, a, a,... are called the of a sequece.. A sequece is a sequece if the domai of the fuctio cosists of the first positive itegers.. If you are give oe or more of the first few terms of a sequece, ad all other terms of the sequece are defied usig previous terms, the the sequece is said to be defied.. If is a positive iteger, is defied as!..... The otatio used to represet the sum of the terms of a fiite sequece is or sigma otatio. 7. For the sum a i, i is called the of summatio, is the limit of summatio, ad is the limit of summatio.. The sum of the terms of a fiite or ifiite sequece is called a. 9. The of a sequece is the sum of the first terms of the sequece. PREREQUISITE SKILLS REVIEW: Practice ad review algebra skills eeded for this sectio at a I Exercises, write the first five terms of the sequece. (Assume that begis with.). a.. a. a. a. a 7. a. a 9.. a a. a. a. a.. a. 7. a. a 9. a. a.. a. a I Exercises, fid the idicated term of the sequece.. a. a a. a. a a a a a a I Exercises 7, use a graphig utility to graph the first terms of the sequece. (Assume that begis with.) 7. a. a 9. a. a.7.. a. a I Exercises, match the sequece with the graph of its first terms. [The graphs are labeled (a), (b), (c), ad (d).] (a) a (b) a (c) a (d). a. a. a. a.! a
9 _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability I Exercises 7, write a expressio for the apparet th term of the sequece. (Assume that begis with.). 7.,, 7,,,...., 7,,, 9,... 9.,,,,,....,,,,,....,,,,,,, 7,...,....., 9, 7,,,, 7, 9,...,....,, 9,,,....,,,,,... 7.,,,,, ,,,,,....,, 7,,,... I Exercises, write the first five terms of the sequece defied recursively.. a,. a, a k a k a k a k.. a, a, a k a k a k a k I Exercises, write the first five terms of the sequece defied recursively. Use the patter to write the th term of the sequece as a fuctio of. (Assume that begis with.). a,. a, a k a k a k a k 7.. a, a, a k a k a k a k,,,,,,... I Exercises 9, write the first five terms of the sequece. (Assume that begis with.) 9. a. a!!. a. a!!. a. a!! I Exercises 7, simplify the factorial expressio..!!.!! 7.!!.!! 9.!! 7.!! 7.!! 7.!! I Exercises 7, fid the sum. 7. i i i i i 79.. k k j j. k k. i i k.. i j j I Exercises, use a calculator to fid the sum.. j. 7.. I Exercises 9 9, use sigma otatio to write the sum k j k k k k k k! j... 9 i k j I Exercises 99, fid the idicated partial sum of the series. 99. i. i Fourth partial sum Fifth partial sum.. Third partial sum Fourth partial sum
10 _9.qxd // : AM Page Sectio 9. Sequeces ad Series I Exercises, fid the sum of the ifiite series..... i k k 7 k k i 7. Compoud Iterest A deposit of $ is made i a accout that ears % iterest compouded quarterly. The balace i the accout after quarters is give by A., (a) Write the first eight terms of this sequece. (b) Fid the balace i this accout after years by fidig the th term of the sequece.. Compoud Iterest A deposit of $ is made each moth i a accout that ears % iterest compouded mothly. The balace i the accout after moths is give by A.,,,,....,,,.... (a) Write the first six terms of this sequece. (b) Fid the balace i this accout after years by fidig the th term of the sequece. (c) Fid the balace i this accout after years by fidig the th term of the sequece. Model It 9. Data Aalysis: Number of Stores The table shows the umbers a of Best Buy stores for the years 99 to. (Source: Best Buy Compay, Ic.) Year Number of stores, a Model It (cotiued) (a) Use the regressio feature of a graphig utility to fid a liear sequece that models the data. Let represet the year, with correspodig to 99. (b) Use the regressio feature of a graphig utility to fid a quadratic sequece that models the data. (c) Evaluate the sequeces from parts (a) ad (b) for, 9,...,. Compare these values with those show i the table. Which model is a better fit for the data? Explai. (d) Which model do you thik would better predict the umber of Best Buy stores i the future? Use the model you chose to predict the umber of Best Buy stores i.. Medicie The umbers (i thousads) of AIDS cases reported from 99 to ca be approximated by the model a ,,,..., where is the year, with correspodig to 99. (Source: U.S. Ceters for Disease Cotrol ad Prevetio) (a) Fid the terms of this fiite sequece. Use the statistical plottig feature of a graphig utility to costruct a bar graph that represets the sequece. (b) What does the graph i part (a) say about reported cases of AIDS?. Federal Debt From 99 to, the federal debt of the Uited States rose from just over $ trillio to almost $7 trillio. The federal debt a (i billios of dollars) from 99 to is approximated by the model a ,,,..., a where is the year, with correspodig to 99. (Source: U.S. Office of Maagemet ad Budget) (a) Fid the terms of this fiite sequece. Use the statistical plottig feature of a graphig utility to costruct a bar graph that represets the sequece. (b) What does the patter i the bar graph i part (a) say about the future of the federal debt?
11 _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability. Reveue The reveues (i millios of dollars) for Amazo.com for the years 99 through are show i the figure. The reveues ca be approximated by the model Reveue (i millios of dollars) where is the year, with correspodig to 99. Use this model to approximate the total reveue from 99 through. Compare this sum with the result of addig the reveues show i the figure. (Source: Amazo.com) Sythesis True or False? I Exercises ad, determie whether the statemet is true or false. Justify your aswer.. i i i i. Fiboacci Sequece I Exercises ad, use the Fiboacci sequece. (See Example.). Write the first terms of the Fiboacci sequece a ad the first terms of the sequece give by. Usig the defiitio for b i Exercise, show that ca be defied recursively by Arithmetic Mea I Exercises 7, use the followig defiitio of the arithmetic mea x of a set of measuremets x, x, x,..., x. x x i a b a a, b b.. 7. Fid the arithmetic mea of the six checkig accout balaces $7., $7.9, $., $., $., ad $9.. Use the statistical capabilities of a graphig utility to verify your result. a a.9 9..,, 7,..., 7 9 Year ( 99) j j j j b. Fid the arithmetic mea of the followig prices per gallo for regular uleaded gasolie at five gasolie statios i a city: $.99, $.99, $.99, $.99, ad $.999. Use the statistical capabilities of a graphig utility to verify your result. 9. Proof Prove that. Proof Prove that I Exercises, fid the first five terms of the sequece.. a x!.. a x!. Skills Review I Exercises, determie whether the fuctio has a iverse fuctio. If it does, fid its iverse fuctio.. f x x. gx x 7. hx x. f x x I Exercises 9, fid (a) A B, (b) B A, (c) AB, ad (d) BA I Exercises, fid the determiat of the matrix... A A. A A A. A A A 9, , 7 B 7,, x i x. x i x B B B 7 xi a x a x! x i.
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 informationNTH, 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 informationPolynomial 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 informationCh 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 informationLecture 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 informationRecursive 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 informationAn (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 informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationMath 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 information1. 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 informationArea As A Limit & Sigma Notation
Area As A Limit & Sigma Notatio SUGGESTED REFERENCE MATERIAL: As you work through the problems listed below, you should referece Chapter 5.4 of the recommeded textbook (or the equivalet chapter i your
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationAlpha 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 information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More information1.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 informationOnes 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 informationIt 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 information9 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 informationHow 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 informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationCSC 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 informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationCSC165H1 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 information2) 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 informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationSouth 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 informationModule 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 informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationThe 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 informationCS : 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 informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationMath 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 informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationInvestigation Monitoring Inventory
Ivestigatio Moitorig Ivetory Name Period Date Art Smith has bee providig the prits of a egravig to FieArt Gallery. He plas to make just 2000 more prits. FieArt has already received 70 of Art s prits. The
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationThe 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 informationCIS 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 informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationChapter 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 informationMath 3201 Notes Chapter 4: Rational Expressions & Equations
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
More informationAnalysis of Algorithms
Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Aalysis of Algorithms Iput 2015 Goodrich ad Tamassia Algorithm Aalysis of Algorithms
More informationThe 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 information4.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 informationENGI 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 information12-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 informationLecture 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 informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationTest 4 Review. dy du 9 5. sin5 zdz. dt. 5 Ê. x 2 È 1, 3. 2cos( x) dx is less than using Simpson's. ,1 t 5 t 2. ft () t2 4.
Name: Class: Date: ID: A Test Review Short Aswer. Fid the geeral solutio of the differetial equatio below ad check the result by differetiatio. dy du 9 u. Use the error formula to estimate the error i
More informationThe 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 informationPython 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 informationElementary 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 informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationWhat 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 informationWebAssign 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 informationHomework 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 informationPattern 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 informationSEQUENCES 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 informationChapter 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 informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationGC05: Algorithmic Complexity & Computability
GC05: Algorithmic Complexity & Computability This part of the course deals with assessig the time-demad of algorithmic procedures with the aim, where possible, of fidig efficiet solutios to problems. We
More informationOCR 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 informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationA 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 informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationChapter 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 informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationcondition 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 informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationRecursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:
Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical
More information. 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 informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationNumerical 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 informationFURTHER 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 information1.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 informationCOMP Parallel Computing. PRAM (1): The PRAM model and complexity measures
COMP 633 - Parallel Computig Lecture 2 August 24, 2017 : The PRAM model ad complexity measures 1 First class summary This course is about parallel computig to achieve high-er performace o idividual problems
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationEVALUATION 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 informationName 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 informationMathematical 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 informationtop() Applications of Stacks
CS22 Algorithms ad Data Structures MW :00 am - 2: pm, MSEC 0 Istructor: Xiao Qi Lecture 6: Stacks ad Queues Aoucemets Quiz results Homework 2 is available Due o September 29 th, 2004 www.cs.mt.edu~xqicoursescs22
More informationUNIT 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 informationSAMPLE 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 informationCOP4020 Programming Languages. Functional Programming Prof. Robert van Engelen
COP4020 Programmig Laguages Fuctioal Programmig Prof. Robert va Egele Overview What is fuctioal programmig? Historical origis of fuctioal programmig Fuctioal programmig today Cocepts of fuctioal programmig
More informationData Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types
Data Aalysis Cocepts ad Techiques Chapter 2 1 Chapter 2: Gettig to Kow Your Data Data Objects ad Attribute Types Basic Statistical Descriptios of Data Data Visualizatio Measurig Data Similarity ad Dissimilarity
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationChapter 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 informationExamples 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 informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More informationName 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 informationSolution 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