4.1 Sigma Notation and Riemann Sums

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "4.1 Sigma Notation and Riemann Sums"

Transcription

1 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas together to get the area of the whole regio. Whe you use this approach with may sub-regios, it will be useful to have a otatio for addig may values together: the sigma (Σ) otatio. summatio sigma otatio how to read it k= k k the sum of k squared, from k equals to k equals the sum of divided by k, from k equals to k equals j=0 a + a + a + a + a 6 + a 7 7 = j the sum of to the j-th power, from j equals 0 to j equals a the sum of a sub, from equals to equals 7 The variable (typically i, j, k, m or ) used i the summatio is called the couter or idex variable. The fuctio to the right of the sigma is called the summad, while the umbers below ad above the sigma are called the lower ad upper limits of the summatio. Practice. Write the summatio deoted by each of the followig: (a) k (b) 7 ( ) j j j= (c) (m + ) m=0 I practice, we frequetly use sigma otatio together with the stadard fuctio otatio: x f (x) g(x) h(x) 0 f (k + ) = f ( + ) + f ( + ) + f ( + ) j= = f () + f () + f () Example. Use the table to evaluate f (x j ) = f (x ) + f (x ) + f (x ) + f (x ) f (k) ad [ + f (j )]. j= Solutio. Writig out the sum ad usig the table values: f (k) = f () + f () + f () + f () = =

2 . sigma otatio ad riema sums 0 while: [ + f (j )] = [ + f ( )] + [ + f ( )] + [ + f ( )] j= = [ + f ()] + [ + f ()] + [ + f ()] = [ + ] + [ + ] + [ + ] which adds up to. Practice. Use the values i the precedig margi table to evaluate: (a) g(k) (b) h(j) j= Example. For f (x) = x +, evaluate (c) [g(k) + f (k )] k= f (k). Solutio. Writig out the sum ad usig the fuctio values: f (k) = f (0) + f () + f () + f () = ( ) ( ) ( ) ( ) = which adds up to 8. Practice. For g(x) = x, evaluate g(k) ad g(k + ). The summad eed ot cotai the idex variable explicitly: you ca write a sum from k = to k = of the costat fuctio f (k) = as f (k) or = + + = =. Similarly: 7 = = = 0 k= Because the sigma otatio is simply a otatio for additio, it possesses all of the familiar properties of additio. Summatio Properties: Sum of Costats: Additio: Subtractio: Costat Multiple: C = C + C + C + + C = C (a k + b k ) = (a k b k ) = C a k = C a k a k + a k b k b k Problems 6 ad 7 illustrate that similar patters for sums of products ad quotiets are ot valid.

3 0 the itegral Sums of Areas of Rectagles I Sectio., we will approximate areas uder curves by buildig rectagles as high as the curve, calculatig the area of each rectagle, ad the addig the rectagular areas together. Example. Evaluate the sum of the rectagular areas i the margi figure, the write the sum usig sigma otatio. Solutio. The sum of the rectagular areas is equal to the sum of (base) (height) for each rectagle: () ( ) + () ( ) + () ( ) = 7 60 which we ca rewrite as k= usig sigma otatio. k Practice. Evaluate the sum of the rectagular areas i the margi figure, the write the sum usig sigma otatio. The bases of these rectagles eed ot be equal. For the rectagular areas associated with f (x) = x i the margi figure: rectagle base height area = f () = = 8 = f () = 6 6 = 6 6 = f () = = 0 so the sum of the rectagular areas is = 7. Example. Write the sum of the areas of the rectagles i the margi figure usig sigma otatio. Solutio. The area of each rectagle is (base) (height): rectagle base height area x x 0 f (x ) (x x 0 ) f (x ) x x f (x ) (x x ) f (x ) x x f (x ) (x x ) f (x ) The area of the k-th rectagle is (x k x k ) f (x k ), so we ca express the total area of the three rectagles as (x k x k ) f (x k ). Practice. Write the sum of the areas of the shaded rectagles i the margi figure usig sigma otatio.

4 . sigma otatio ad riema sums 0 Area Uder a Curve: Riema Sums Suppose we wat to calculate the area betwee the graph of a positive fuctio f ad the x-axis o the iterval [a, b] (see below left). Oe method to approximate the area ivolves buildig several rectagles with bases o the x-axis spaig the iterval [a, b] ad with sides that reach up to the graph of f (above right). We the compute the areas of the rectagles ad add them up to get a umber called a Riema sum of f o [a, b]. The area of the regio formed by the rectagles provides a approximatio of the area we wat to compute. Example. Approximate the area show i the margi betwee the graph of f ad the x-axis spaig the iterval [, ] by summig the areas of the rectagles show i the lower margi figure. Solutio. The total area is ()() + ()() = square uits. I order to effectively describe this process, some ew vocabulary is helpful: a partitio of a iterval ad the mesh of a partitio. A partitio P of a closed iterval [a, b] ito subitervals cosists of a set of + poits {x 0 = a, x, x, x,..., x, x = b} listed i icreasig order, so that a = x 0 < x < x < x <... < x < x = b. (A partitio is merely a collectio of poits o the horizotal axis, urelated to the fuctio f i ay way.) The poits of the partitio P divide [a, b] ito subitervals: These itervals are [x 0, x ], [x, x ], [x, x ],..., [x, x ] with legths x = x x 0, x = x x, x = x x,..., x = x x. The poits x k of the partitio P mark the locatios of the vertical lies for the sides of the rectagles, ad the bases of the rectagles have

5 06 the itegral legths x k for k =,,,...,. The mesh or orm of a partitio P is the legth of the logest of the subitervals [x k, x k ] or, equivaletly, the maximum value of x k for k =,,,...,. For example, the set P = {,,.6,., 6} is a partitio of the iterval [, 6] (see margi) that divides the iterval [, 6] ito four subitervals with legths x =, x =.6, x = 0. ad x = 0.9, so the mesh of this partitio is.6, the maximum of the legths of the subitervals. (If the mesh of a partitio is small, the the legth of each oe of the subitervals is the same or smaller.) Practice 6. P = {,.8,.8,., 6., 7, 8} is a partitio of what iterval? How may subitervals does it create? What is the mesh of the partitio? What are the values of x ad x? A fuctio, a partitio ad a poit chose from each subiterval determie a Riema sum. Suppose f is a positive fuctio o the iterval [a, b] (so that f (x) > 0 whe a x b), P = {x 0 = a, x, x, x,..., x, x = b} is a partitio of [a, b], ad c k is a x-value chose from the k-th subiterval [x k, x k ] (so x k c k x k ). The the area of the k-th rectagle is: f (c k ) (x k x k ) = f (c k ) x k Defiitio: A summatio of the form f (c k ) x k is called a Riema sum of f for the partitio P ad the chose poits {c, c,..., c }. This Riema sum is the total of the areas of the rectagular regios ad provides a approximatio of the area betwee the graph of f ad the x-axis o the iterval [a, b]. Example 6. Fid the Riema sum for f (x) = usig the partitio x {,, } ad the values c = ad c = (see margi). Solutio. The two subitervals are [, ] ad [, ], hece x = ad x =. So the Riema sum for this partitio is: f (c k ) x k = f (c ) x + f (c ) x The value of the Riema sum is.7. = f () + f () = + = 7 0 Practice 7. Calculate the Riema sum for f (x) = x {,, } usig the chose values c = ad c =. o the partitio

6 . sigma otatio ad riema sums 07 Practice 8. What is the smallest value a Riema sum for f (x) = x ca have usig the partitio {,, }? (You will eed to choose values for c ad c.) What is the largest value a Riema sum ca have for this fuctio ad partitio? The table below shows the output of a computer program that calculated Riema sums for the fuctio f (x) = with various umbers x of subitervals (deoted ) ad differet ways of choosig the poits c k i each subiterval. mesh c k = left edge = x k c k = radom poit c k = right edge = x k Whe the mesh of the partitio is small (ad the umber of subitervals,, is large), it appears that all of the ways of choosig the c k locatios result i approximately the same value for the Riema sum. For this decreasig fuctio, usig the left edpoit of the subiterval always resulted i a sum that was larger tha the area approximated by the sum. Choosig the right edpoit resulted i a value smaller tha that area. Why? As the mesh gets smaller, all of the Riema Sums seem to be approachig the same value, approximately.609. (As we shall soo see, these values are all approachig l() ) Example 7. Fid the Riema sum for the fuctio f (x) = si(x) o the iterval [0, π] usig the partitio {0, π, π }, π ad the chose poits c = π, c = π ad c = π. [ Solutio. The three subitervals (see margi) are 0, π ] [ π,, π ] ad [ π ], π so x = π, x = π ad x = π. The Riema sum for this partitio is: ( π ) f (c k ) x k = si π = or approximately.8. π + π + ( π ) + si π ( π + si π = ( + )π 8 ) π Practice 9. Fid the Riema sum for the fuctio ad partitio i the previous Example, but this time choose c = 0, c = π ad c = π.

7 08 the itegral Two Special Riema Sums: Lower ad Upper Sums Two particular Riema sums are of special iterest because they represet the extreme possibilities for a give partitio. We eed f to be cotiuous i order to assure that it attais its miimum ad maximum values o ay closed subiterval of the partitio. If f is bouded but ot ecessarily cotiuous we ca geeralize this defiitio by replacig f (m k ) with the greatest lower boud of all f (x) o the iterval ad f (M k ) with the least upper boud of all f (x) o the iterval. Defiitio: If f is a positive, cotiuous fuctio o [a, b] ad P is a partitio of [a, b], let m k be the x-value i the k-th subiterval so that f (m k ) is the miimum value of f o that iterval, ad let M k be the x-value i the k-th subiterval so that f (M k ) is the maximum value of f o that subiterval. The: LS P = US P = f (m k ) x k is the lower sum of f for P f (M k ) x k is the upper sum of f for P Geometrically, a lower sum arises from buildig rectagles uder the graph of f (see first margi figure) ad every lower sum is less tha or equal to the exact area A of the regio bouded by the graph of f ad the x-axis o the iterval [a, b]: LS P A for every partitio P. Likewise, a upper sum arises from buildig rectagles over the graph of f (see secod margi figure) ad every upper sum is greater tha or equal to the exact area A of the regio bouded by the graph of f ad the x-axis o the iterval [a, b]: US P A for every partitio P. Together, the lower ad upper sums provide bouds o the size of the exact area: LS P A US P. For ay c k value i the k-th subiterval, f (m k ) f (c k ) f (M k ), so, for ay choice of the c k values, the Riema sum RS P = satisfies the iequality: f (c k ) x k f (m k ) x k f (c k ) x k f (M k ) x k or, equivaletly, LS P RS P US P. The lower ad upper sums provide bouds o the size of all Riema sums for a give partitio. The exact area A ad every Riema sum RS P for partitio P ad ay choice of poits {c k } both lie betwee the lower sum ad the upper sum for P (see margi). Therefore, if the lower ad upper sums are close together, the the area ad ay Riema sum for P (regardless of how you choose the poits c k ) must also be close together. If we kow that the upper ad lower sums for a partitio P are withi 0.00 uits of each other, the we ca be sure that every Riema sum for partitio P is withi 0.00 uits of the exact area A.

8 . sigma otatio ad riema sums 09 Ufortuately, fidig miimums ad maximums for each subiterval of a partitio ca be a time-cosumig (ad tedious) task, so it is usually ot practical to determie lower ad upper sums for wiggly fuctios. If f is mootoic, however, the it is easy to fid the values for m k ad M k, ad sometimes we ca eve explicitly calculate the limits of the lower ad upper sums. For a mootoic, bouded fuctio we ca guaratee that a Riema sum is withi a certai distace of the exact value of the area it is approximatig. Theorem: If f is a positive, mootoic, bouded fuctio o [a, b] the for ay partitio P ad ay Riema sum for f usig P, RS P A US P LS P f (b) f (a) (mesh of P) Proof. The Riema sum ad the exact area are both betwee the upper ad lower sums, so the distace betwee the Riema sum ad the exact area is o bigger tha the distace betwee the upper ad lower sums. If f is mootoically icreasig, we ca slide the areas represetig the differece of the upper ad lower sums ito a rectagle: Recall from Sectio. that mootoic meas always icreasig or always decreasig o the iterval i questio. I words, this strig of iequalities says that the distace betwee ay Riema sum ad the area beig approximated is o bigger tha the differece betwee the upper ad lower Riema sums for the same partitio, which i tur is o bigger tha the distace betwee the values of the fuctio at the edpoits of the iterval times the mesh of the partitio. See Problem 6 for the mootoically decreasig case. whose height equals f (b) f (a) ad whose base equals the mesh of P. So the total differece of the upper ad lower sums is smaller tha the area of that rectagle, [ f (b) f (a)] (mesh of P).. Problems I Problems 6, rewrite the sigma otatio as a summatio ad perform the idicated additio.. ( + ). = si(πk). k. ( + j) j=. cos(πj) 6. j=0 k

9 0 the itegral I Problems 7, rewrite each summatio usig the sigma otatio. Do ot evaluate the sums I Problems, use this table: k a k b k to verify the equality for these values of a k ad b k. (a k + b k ) = (a k b k ) = a k = a k a k + a k For Problems 6 8, use the values of a k ad b k i the table above to verify the iequality b k b k ( ) ( ) a k b k = a k b k ( ) a k = a k a k b k = a k b k g (j) 6. j= h(k) 8. = f () h() 0. k g(k) h(i) i= 7 g(k) h(k) I 6, write out each summatio ad simplify the result. These are examples of telescopig sums [ k (k ) ]. 8 [ k ] k + [ k + k ] [k (k ) ] [(k + ) k ] [x k x k ] I 7, (a) list the subitervals determied by the partitio P, (b) fid the values of x k, (c) fid the mesh of P ad (d) calculate x k. 7. P = {,,., 6, 7} 8. P = {,.6,,.,,., 6} 9. P = {,, 0,., } 0. P as show below:. P as show below: For 9 0, f (x) = x, g(x) = x ad h(x) = x. Evaluate each sum f (k) 0. f (j). j=0 g(m). m= i=0 f (k) f ( + i) g ( f (k)). P as show below:

10 . sigma otatio ad riema sums. For x k = x k x k, verify that: x k = legth of the iterval [a, b] For 8, sketch a graph of f, draw vertical lies at each poit of the partitio, evaluate each f (c k ) ad sketch the correspodig rectagle, ad calculate ad add up the areas of those rectagles.. f (x) = x +, P = {,,, } (a) c =, c =, c = (b) c =, c =, c =. f (x) = x, P = {0,,., } (a) c = 0, c =, c = (b) c =, c =., c =. 6. f (x) = x, P = {0,,, 0} (a) c =, c =, c = 9 (b) c = 0, c =, c = 7 7. f (x) = si(x), P = { 0, π, π, π} (a) c = 0, c = π, c = π (b) c = π, c = π, c = π 8. f (x) = x, P = {0,, } (a) c = 0, c = (b) c =, c = For 9, sketch the fuctio ad fid the smallest possible value ad the largest possible value for a Riema sum for the give fuctio ad partitio. 9. f (x) = + x (a) P = {,,, } (b) P = {,,,, } (c) P = {,.,,,, } 0. f (x) = 7 x (a) P = {0,, } (b) P = {0,,, } (c) P = {0,.,,.,, }. f (x) = si(x) (a) P = { 0, π, π} (b) P = { 0, π, π, π} (c) P = { 0, π, π, π}. f (x) = x x + (a) P = {0,, } (b) P = {0,,, } (c) P = {0, 0.,,,., }. Suppose LS P = 7.6 ad US P = 7.0 for a positive fuctio f ad a partitio P of [, ]. (a) You ca be certai that every Riema sum for the partitio P is withi what distace of the exact value of the area betwee the graph of f ad the x-axis o the iterval [, ]? (b) What if LS P = 7.7 ad US P = 7.90?. Suppose you divide the iterval [, ] ito 00 equally wide subitervals ad calculate a Riema sum for f (x) = + x by radomly selectig a poit c k i each subiterval. (a) You ca be certai that the value of the Riema sum is withi what distace of the exact value of the area betwee the graph of f ad the x-axis o iterval [, ]? (b) What if you use 00 equally wide subitervals?. If you divide [, ] ito 0 equally wide subitervals ad calculate a Riema sum for f (x) = + x by radomly selectig a poit c k i each subiterval, the you ca be certai that the Riema sum is withi what distace of the exact value of the area betwee f ad the x-axis o the iterval [, ]? 6. If f is mootoic decreasig o [a, b] ad you divide [a, b] ito equally wide subitervals: the you ca be certai that the Riema sum is withi what distace of the exact value of the area betwee f ad the x-axis o the iterval [a, b]?

11 the itegral Summig Powers of Cosecutive Itegers The formulas below are icluded here for your referece. They will ot be used i the followig sectios, except for a hadful of exercises i Sectio.. Formulas for some commoly ecoutered summatios ca be useful for explicitly evaluatig certai special Riema sums. The summatio formula for the first positive itegers is relatively well kow, has several easy but clever proofs, ad eve has a iterestig story behid it ( ) + = ( + ) k = Proof. Let S = ( ) + ( ) +, which we ca also write as S = + ( ) + ( ) Addig these two represetatios of S together: S = ( ) + ( ) + + S = + ( ) + ( ) S = ( + ) + ( + ) + ( + ) + + ( + ) + ( + ) + ( + ) Karl Friedrich Gauss (777 8), a Germa mathematicia sometimes called the price of mathematics. So S = ( + ) S = ( + ), the desired formula. Gauss supposedly discovered this formula for himself at the age of five whe his teacher, plaig to keep the class busy for a while, asked the studets to add up the itegers from to 00. Gauss thought a few miutes, wrote his aswer o his slate, ad tured it i, the sat smugly while his classmates struggled with the problem. 7. Fid the sum of the first 00 positive itegers i two ways: (a) usig Gauss formula, ad (b) usig Gauss method (from the proof). 8. Fid the sum of the first 0 odd itegers. (Each odd iteger ca be writte i the form k for k =,,,....) 9. Fid the sum of the itegers from 0 to 0. Formulas for other iteger powers of the first itegers are also kow: k = k = k = + ( + ) = + + ( + )( + ) = ( ) ( + ) = k = = ( + )( + )( + ) 0

12 . sigma otatio ad riema sums I Problems 60 6, use the properties of summatio ad the formulas for powers give above to evaluate each sum ( + k + k ) 6. 0 ( ) k k k (k ). Practice Aswers. (a) (b) (c). (a) (b) (c) k = ( ) j j = j= (m + ) = m=0 g(k) = g() + g() + g() + g() = + ( ) + + = 7 h(j) = h() + h() + h() + h() = = j= (g(k) + f (k )) = (g() + f ()) + (g() + f ()) + (g() + f ()) k= = ( + ) + ( + ) + ( + 0) = 0. g(k) = g() + g() + g() = + + = g(k + ) = g() + g() + g() = + + =. Rectagular areas = = = j=. f (x 0 ) (x x 0 ) + f (x ) (x x ) + f (x ) (x x ) = or f (x k ) (x k+ x k ) j j= f ( x j ) ( xj x j ) 6. Iterval is [, 8]; six subitervals; mesh =.; x =.8; x = x x =.8.8 =. ( ) ( ) 7. RS = () + () =. ( ) ( ) 8. smallest RS = () + () = 0.9 ( ) largest RS = ()() + () =. 9. RS = (0) ( π ) + () ( π ) + () ( π ).6

Riemann Sums y = f (x)

Riemann Sums y = f (x) Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

Math 113 HW #11 Solutions

Math 113 HW #11 Solutions Math 3 HW # Solutios 5. 4. (a) Estimate the area uder the graph of f(x) = x from x = to x = 4 usig four approximatig rectagles ad right edpoits. Sketch the graph ad the rectagles. Is your estimate a uderestimate

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Math 105: Review for Final Exam, Part II - SOLUTIONS

Math 105: Review for Final Exam, Part II - SOLUTIONS Math 5: Review for Fial Exam, Part II - SOLUTIONS. Cosider the fuctio fx) =x 3 l x o the iterval [/e, e ]. a) Fid the x- ad y-coordiates of ay ad all local extrema ad classify each as a local maximum or

More information

8.1 Arithmetic Sequences

8.1 Arithmetic Sequences MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first

More information

Section 9.2 Series and Convergence

Section 9.2 Series and Convergence Sectio 9. Series ad Covergece Goals of Chapter 9 Approximate Pi Prove ifiite series are aother importat applicatio of limits, derivatives, approximatio, slope, ad cocavity of fuctios. Fid challegig atiderivatives

More information

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is 0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

4.3. The Integral and Comparison Tests

4.3. The Integral and Comparison Tests 4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece

More information

http://www.webassign.net/v4cgijeff.downs@wnc/control.pl

http://www.webassign.net/v4cgijeff.downs@wnc/control.pl Assigmet Previewer http://www.webassig.et/vcgijeff.dows@wc/cotrol.pl of // : PM Practice Eam () Questio Descriptio Eam over chapter.. Questio DetailsLarCalc... [] Fid the geeral solutio of the differetial

More information

Sequences II. Chapter 3. 3.1 Convergent Sequences

Sequences II. Chapter 3. 3.1 Convergent Sequences Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,

More information

1 The Binomial Theorem: Another Approach

1 The Binomial Theorem: Another Approach The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

More information

Section IV.5: Recurrence Relations from Algorithms

Section IV.5: Recurrence Relations from Algorithms Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

Review for College Algebra Final Exam

Review for College Algebra Final Exam Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 1-4. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i

More information

AP Calculus AB 2006 Scoring Guidelines Form B

AP Calculus AB 2006 Scoring Guidelines Form B AP Calculus AB 6 Scorig Guidelies Form B The College Board: Coectig Studets to College Success The College Board is a ot-for-profit membership associatio whose missio is to coect studets to college success

More information

8.3 POLAR FORM AND DEMOIVRE S THEOREM

8.3 POLAR FORM AND DEMOIVRE S THEOREM SECTION 8. POLAR FORM AND DEMOIVRE S THEOREM 48 8. POLAR FORM AND DEMOIVRE S THEOREM Figure 8.6 (a, b) b r a 0 θ Complex Number: a + bi Rectagular Form: (a, b) Polar Form: (r, θ) At this poit you ca add,

More information

Basic Elements of Arithmetic Sequences and Series

Basic Elements of Arithmetic Sequences and Series MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

Approximating the Sum of a Convergent Series

Approximating the Sum of a Convergent Series Approximatig the Sum of a Coverget Series Larry Riddle Ages Scott College Decatur, GA 30030 lriddle@agesscott.edu The BC Calculus Course Descriptio metios how techology ca be used to explore covergece

More information

NPTEL STRUCTURAL RELIABILITY

NPTEL STRUCTURAL RELIABILITY NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics

More information

Module 4: Mathematical Induction

Module 4: Mathematical Induction Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Section 7-3 Estimating a Population. Requirements

Section 7-3 Estimating a Population. Requirements Sectio 7-3 Estimatig a Populatio Mea: σ Kow Key Cocept This sectio presets methods for usig sample data to fid a poit estimate ad cofidece iterval estimate of a populatio mea. A key requiremet i this sectio

More information

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers . Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients

BINOMIAL EXPANSIONS 12.5. In this section. Some Examples. Obtaining the Coefficients 652 (12-26) Chapter 12 Sequeces ad Series 12.5 BINOMIAL EXPANSIONS I this sectio Some Examples Otaiig the Coefficiets The Biomial Theorem I Chapter 5 you leared how to square a iomial. I this sectio you

More information

Confidence Intervals for One Mean with Tolerance Probability

Confidence Intervals for One Mean with Tolerance Probability Chapter 421 Cofidece Itervals for Oe Mea with Tolerace Probability Itroductio This procedure calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) with

More information

ARITHMETIC AND GEOMETRIC PROGRESSIONS

ARITHMETIC AND GEOMETRIC PROGRESSIONS Arithmetic Ad Geometric Progressios Sequeces Ad ARITHMETIC AND GEOMETRIC PROGRESSIONS Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives

More information

AP Calculus BC 2003 Scoring Guidelines Form B

AP Calculus BC 2003 Scoring Guidelines Form B AP Calculus BC Scorig Guidelies Form B The materials icluded i these files are iteded for use by AP teachers for course ad exam preparatio; permissio for ay other use must be sought from the Advaced Placemet

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

The second difference is the sequence of differences of the first difference sequence, 2

The second difference is the sequence of differences of the first difference sequence, 2 Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

0,1 is an accumulation

0,1 is an accumulation Sectio 5.4 1 Accumulatio Poits Sectio 5.4 Bolzao-Weierstrass ad Heie-Borel Theorems Purpose of Sectio: To itroduce the cocept of a accumulatio poit of a set, ad state ad prove two major theorems of real

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

Geometric Sequences and Series. Geometric Sequences. Definition of Geometric Sequence. such that. a2 4

Geometric Sequences and Series. Geometric Sequences. Definition of Geometric Sequence. such that. a2 4 3330_0903qxd /5/05 :3 AM Page 663 Sectio 93 93 Geometric Sequeces ad Series 663 Geometric Sequeces ad Series What you should lear Recogize, write, ad fid the th terms of geometric sequeces Fid th partial

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series 8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

Math 152 Final Exam Review

Math 152 Final Exam Review Math 5 Fial Eam Review Problems Math 5 Fial Eam Review Problems appearig o your i-class fial will be similar to those here but will have umbers ad fuctios chaged. Here is a eample of the way problems selected

More information

8.5 Alternating infinite series

8.5 Alternating infinite series 65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,

More information

2.7 Sequences, Sequences of Sets

2.7 Sequences, Sequences of Sets 2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For

More information

3. Greatest Common Divisor - Least Common Multiple

3. Greatest Common Divisor - Least Common Multiple 3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

Page 2 of 14 = T(-2) + 2 = [ T(-3)+1 ] + 2 Substitute T(-3)+1 for T(-2) = T(-3) + 3 = [ T(-4)+1 ] + 3 Substitute T(-4)+1 for T(-3) = T(-4) + 4 After i

Page 2 of 14 = T(-2) + 2 = [ T(-3)+1 ] + 2 Substitute T(-3)+1 for T(-2) = T(-3) + 3 = [ T(-4)+1 ] + 3 Substitute T(-4)+1 for T(-3) = T(-4) + 4 After i Page 1 of 14 Search C455 Chapter 4 - Recursio Tree Documet last modified: 02/09/2012 18:42:34 Uses: Use recursio tree to determie a good asymptotic boud o the recurrece T() = Sum the costs withi each level

More information

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on. Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Math Discrete Math Combinatorics MULTIPLICATION PRINCIPLE:

Math Discrete Math Combinatorics MULTIPLICATION PRINCIPLE: Math 355 - Discrete Math 4.1-4.4 Combiatorics Notes MULTIPLICATION PRINCIPLE: If there m ways to do somethig ad ways to do aother thig the there are m ways to do both. I the laguage of set theory: Let

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Descriptive Statistics

Descriptive Statistics Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote

More information

A Gentle Introduction to Algorithms: Part II

A Gentle Introduction to Algorithms: Part II A Getle Itroductio to Algorithms: Part II Cotets of Part I:. Merge: (to merge two sorted lists ito a sigle sorted list.) 2. Bubble Sort 3. Merge Sort: 4. The Big-O, Big-Θ, Big-Ω otatios: asymptotic bouds

More information

Figure 40.1. Figure 40.2

Figure 40.1. Figure 40.2 40 Regular Polygos Covex ad Cocave Shapes A plae figure is said to be covex if every lie segmet draw betwee ay two poits iside the figure lies etirely iside the figure. A figure that is ot covex is called

More information

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,

More information

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1 1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

7 b) 0. Guided Notes for lesson P.2 Properties of Exponents. If a, b, x, y and a, b, 0, and m, n Z then the following properties hold: 1 n b

7 b) 0. Guided Notes for lesson P.2 Properties of Exponents. If a, b, x, y and a, b, 0, and m, n Z then the following properties hold: 1 n b Guided Notes for lesso P. Properties of Expoets If a, b, x, y ad a, b, 0, ad m, Z the the followig properties hold:. Negative Expoet Rule: b ad b b b Aswers must ever cotai egative expoets. Examples: 5

More information

ME 101 Measurement Demonstration (MD 1) DEFINITIONS Precision - A measure of agreement between repeated measurements (repeatability).

ME 101 Measurement Demonstration (MD 1) DEFINITIONS Precision - A measure of agreement between repeated measurements (repeatability). INTRODUCTION This laboratory ivestigatio ivolves makig both legth ad mass measuremets of a populatio, ad the assessig statistical parameters to describe that populatio. For example, oe may wat to determie

More information

Notes on Hypothesis Testing

Notes on Hypothesis Testing Probability & Statistics Grishpa Notes o Hypothesis Testig A radom sample X = X 1,..., X is observed, with joit pmf/pdf f θ x 1,..., x. The values x = x 1,..., x of X lie i some sample space X. The parameter

More information

2-3 The Remainder and Factor Theorems

2-3 The Remainder and Factor Theorems - The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x

More information

M06/5/MATME/SP2/ENG/TZ2/XX MATHEMATICS STANDARD LEVEL PAPER 2. Thursday 4 May 2006 (morning) 1 hour 30 minutes INSTRUCTIONS TO CANDIDATES

M06/5/MATME/SP2/ENG/TZ2/XX MATHEMATICS STANDARD LEVEL PAPER 2. Thursday 4 May 2006 (morning) 1 hour 30 minutes INSTRUCTIONS TO CANDIDATES IB MATHEMATICS STANDARD LEVEL PAPER 2 DIPLOMA PROGRAMME PROGRAMME DU DIPLÔME DU BI PROGRAMA DEL DIPLOMA DEL BI 22067304 Thursday 4 May 2006 (morig) 1 hour 30 miutes INSTRUCTIONS TO CANDIDATES Do ot ope

More information

Measurable Functions

Measurable Functions Measurable Fuctios Dug Le 1 1 Defiitio It is ecessary to determie the class of fuctios that will be cosidered for the Lebesgue itegratio. We wat to guaratee that the sets which arise whe workig with these

More information

Fourier Series and the Wave Equation Part 2

Fourier Series and the Wave Equation Part 2 Fourier Series ad the Wave Equatio Part There are two big ideas i our work this week. The first is the use of liearity to break complicated problems ito simple pieces. The secod is the use of the symmetries

More information

TAYLOR SERIES, POWER SERIES

TAYLOR SERIES, POWER SERIES TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the

More information

Example Consider the following set of data, showing the number of times a sample of 5 students check their per day:

Example Consider the following set of data, showing the number of times a sample of 5 students check their  per day: Sectio 82: Measures of cetral tedecy Whe thikig about questios such as: how may calories do I eat per day? or how much time do I sped talkig per day?, we quickly realize that the aswer will vary from day

More information

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number. GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea - add up all

More information

This document contains a collection of formulas and constants useful for SPC chart construction. It assumes you are already familiar with SPC.

This document contains a collection of formulas and constants useful for SPC chart construction. It assumes you are already familiar with SPC. SPC Formulas ad Tables 1 This documet cotais a collectio of formulas ad costats useful for SPC chart costructio. It assumes you are already familiar with SPC. Termiology Geerally, a bar draw over a symbol

More information

Contents. 7 Sequences and Series. 7.1 Sequences and Convergence. Calculus II (part 3): Sequences and Series (by Evan Dummit, 2015, v. 2.

Contents. 7 Sequences and Series. 7.1 Sequences and Convergence. Calculus II (part 3): Sequences and Series (by Evan Dummit, 2015, v. 2. Calculus II (part 3): Sequeces ad Series (by Eva Dummit, 05, v..00) Cotets 7 Sequeces ad Series 7. Sequeces ad Covergece......................................... 7. Iite Series.................................................

More information

1. C. The formula for the confidence interval for a population mean is: x t, which was

1. C. The formula for the confidence interval for a population mean is: x t, which was s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

More information

Definition. Definition. 7-2 Estimating a Population Proportion. Definition. Definition

Definition. Definition. 7-2 Estimating a Population Proportion. Definition. Definition 7- stimatig a Populatio Proportio I this sectio we preset methods for usig a sample proportio to estimate the value of a populatio proportio. The sample proportio is the best poit estimate of the populatio

More information

Lesson 12. Sequences and Series

Lesson 12. Sequences and Series Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or

More information

Math C067 Sampling Distributions

Math C067 Sampling Distributions Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Algebra Vocabulary List (Definitions for Middle School Teachers)

Algebra Vocabulary List (Definitions for Middle School Teachers) Algebra Vocabulary List (Defiitios for Middle School Teachers) A Absolute Value Fuctio The absolute value of a real umber x, x is xifx 0 x = xifx < 0 http://www.math.tamu.edu/~stecher/171/f02/absolutevaluefuctio.pdf

More information

The Limit of a Sequence

The Limit of a Sequence 3 The Limit of a Sequece 3. Defiitio of limit. I Chapter we discussed the limit of sequeces that were mootoe; this restrictio allowed some short-cuts ad gave a quick itroductio to the cocept. But may importat

More information

a 4 = 4 2 4 = 12. 2. Which of the following sequences converge to zero? n 2 (a) n 2 (b) 2 n x 2 x 2 + 1 = lim x n 2 + 1 = lim x

a 4 = 4 2 4 = 12. 2. Which of the following sequences converge to zero? n 2 (a) n 2 (b) 2 n x 2 x 2 + 1 = lim x n 2 + 1 = lim x 0 INFINITE SERIES 0. Sequeces Preiary Questios. What is a 4 for the sequece a? solutio Substitutig 4 i the expressio for a gives a 4 4 4.. Which of the followig sequeces coverge to zero? a b + solutio

More information

Arithmetic Sequences and Partial Sums. Arithmetic Sequences. Definition of Arithmetic Sequence. Example 1. 7, 11, 15, 19,..., 4n 3,...

Arithmetic Sequences and Partial Sums. Arithmetic Sequences. Definition of Arithmetic Sequence. Example 1. 7, 11, 15, 19,..., 4n 3,... 3330_090.qxd 1/5/05 11:9 AM Page 653 Sectio 9. Arithmetic Sequeces ad Partial Sums 653 9. Arithmetic Sequeces ad Partial Sums What you should lear Recogize,write, ad fid the th terms of arithmetic sequeces.

More information

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required.

S. Tanny MAT 344 Spring 1999. be the minimum number of moves required. S. Tay MAT 344 Sprig 999 Recurrece Relatios Tower of Haoi Let T be the miimum umber of moves required. T 0 = 0, T = 7 Iitial Coditios * T = T + $ T is a sequece (f. o itegers). Solve for T? * is a recurrece,

More information

Key Ideas Section 8-1: Overview hypothesis testing Hypothesis Hypothesis Test Section 8-2: Basics of Hypothesis Testing Null Hypothesis

Key Ideas Section 8-1: Overview hypothesis testing Hypothesis Hypothesis Test Section 8-2: Basics of Hypothesis Testing Null Hypothesis Chapter 8 Key Ideas Hypothesis (Null ad Alterative), Hypothesis Test, Test Statistic, P-value Type I Error, Type II Error, Sigificace Level, Power Sectio 8-1: Overview Cofidece Itervals (Chapter 7) are

More information

Statistical inference: example 1. Inferential Statistics

Statistical inference: example 1. Inferential Statistics Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either

More information

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2 74 (4 ) Chapter 4 Sequeces ad Series 4. SEQUENCES I this sectio Defiitio Fidig a Formula for the th Term The word sequece is a familiar word. We may speak of a sequece of evets or say that somethig is

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say

More information

COMP 251 Assignment 2 Solutions

COMP 251 Assignment 2 Solutions COMP 251 Assigmet 2 Solutios Questio 1 Exercise 8.3-4 Treat the umbers as 2-digit umbers i radix. Each digit rages from 0 to 1. Sort these 2-digit umbers ith the RADIX-SORT algorithm preseted i Sectio

More information

AQA STATISTICS 1 REVISION NOTES

AQA STATISTICS 1 REVISION NOTES AQA STATISTICS 1 REVISION NOTES AVERAGES AND MEASURES OF SPREAD www.mathsbox.org.uk Mode : the most commo or most popular data value the oly average that ca be used for qualitative data ot suitable if

More information

Grade 7. Strand: Number Specific Learning Outcomes It is expected that students will:

Grade 7. Strand: Number Specific Learning Outcomes It is expected that students will: Strad: Number Specific Learig Outcomes It is expected that studets will: 7.N.1. Determie ad explai why a umber is divisible by 2, 3, 4, 5, 6, 8, 9, or 10, ad why a umber caot be divided by 0. [C, R] [C]

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

ORDERS OF GROWTH KEITH CONRAD

ORDERS OF GROWTH KEITH CONRAD ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus

More information

Equation of a line. Line in coordinate geometry. Slope-intercept form ( 斜 截 式 ) Intercept form ( 截 距 式 ) Point-slope form ( 點 斜 式 )

Equation of a line. Line in coordinate geometry. Slope-intercept form ( 斜 截 式 ) Intercept form ( 截 距 式 ) Point-slope form ( 點 斜 式 ) Chapter : Liear Equatios Chapter Liear Equatios Lie i coordiate geometr I Cartesia coordiate sstems ( 卡 笛 兒 坐 標 系 統 ), a lie ca be represeted b a liear equatio, i.e., a polomial with degree. But before

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

1 Correlation and Regression Analysis

1 Correlation and Regression Analysis 1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

More information

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S, Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σ-algebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio

More information

f(x + T ) = f(x), for all x. The period of the function f(t) is the interval between two successive repetitions.

f(x + T ) = f(x), for all x. The period of the function f(t) is the interval between two successive repetitions. Fourier Series. Itroductio Whe the Frech mathematicia Joseph Fourier (768-83) was tryig to study the flow of heat i a metal plate, he had the idea of expressig the heat source as a ifiite series of sie

More information

Measures of Central Tendency

Measures of Central Tendency Measures of Cetral Tedecy A studet s grade will be determied by exam grades ( each exam couts twice ad there are three exams, HW average (couts oce, fial exam ( couts three times. Fid the average if the

More information