4.1 Sigma Notation and Riemann Sums

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

INFINITE SERIES KEITH CONRAD

INFINITE SERIES KEITH CONRAD INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal

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

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

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

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.

More information

Case Study. Normal and t Distributions. Density Plot. Normal Distributions

Case Study. Normal and t Distributions. Density Plot. Normal Distributions Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca

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

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

Lecture 4: Cheeger s Inequality

Lecture 4: Cheeger s Inequality Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

More information

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means) CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Confidence Intervals

Confidence Intervals Cofidece Itervals Cofidece Itervals are a extesio of the cocept of Margi of Error which we met earlier i this course. Remember we saw: The sample proportio will differ from the populatio proportio by more

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

Mathematical goals. Starting points. Materials required. Time needed

Mathematical goals. Starting points. Materials required. Time needed Level A1 of challege: C A1 Mathematical goals Startig poits Materials required Time eeded Iterpretig algebraic expressios To help learers to: traslate betwee words, symbols, tables, ad area represetatios

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

COMPUTER LABORATORY IMPLEMENTATION ISSUES AT A SMALL LIBERAL ARTS COLLEGE. Richard A. Weida Lycoming College Williamsport, PA 17701 weida@lycoming.

COMPUTER LABORATORY IMPLEMENTATION ISSUES AT A SMALL LIBERAL ARTS COLLEGE. Richard A. Weida Lycoming College Williamsport, PA 17701 weida@lycoming. COMPUTER LABORATORY IMPLEMENTATION ISSUES AT A SMALL LIBERAL ARTS COLLEGE Richard A. Weida Lycomig College Williamsport, PA 17701 weida@lycomig.edu Abstract: Lycomig College is a small, private, liberal

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P NOVEMBER 007 MARKS: 50 TIME: 3 hours This questio paper cosists of 9 pages, diagram sheet ad a -page formula sheet. Please tur over Mathematics/P DoE/November

More information

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized? 5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

Determining the sample size

Determining the sample size Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

More information

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

Chapter 7: Confidence Interval and Sample Size

Chapter 7: Confidence Interval and Sample Size Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum

More information

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas: Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 007 MARKS: 50 TIME: 3 hours This questio paper cosists of pages, 4 diagram sheets ad a -page formula sheet. Please tur over Mathematics/P DoE/Exemplar

More information

MATHEMATICS P1 COMMON TEST JUNE 2014 NATIONAL SENIOR CERTIFICATE GRADE 12

MATHEMATICS P1 COMMON TEST JUNE 2014 NATIONAL SENIOR CERTIFICATE GRADE 12 Mathematics/P1 1 Jue 014 Commo Test MATHEMATICS P1 COMMON TEST JUNE 014 NATIONAL SENIOR CERTIFICATE GRADE 1 Marks: 15 Time: ½ hours N.B: This questio paper cosists of 7 pages ad 1 iformatio sheet. Please

More information

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.

Lecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k. 18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The

More information

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 [C] Commuicatio Measuremet A1. Solve problems that ivolve liear measuremet, usig: SI ad imperial uits of measure estimatio strategies measuremet strategies.

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

Overview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals

Overview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals Overview Estimatig the Value of a Parameter Usig Cofidece Itervals We apply the results about the sample mea the problem of estimatio Estimatio is the process of usig sample data estimate the value of

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions

Chapter 5 Unit 1. IET 350 Engineering Economics. Learning Objectives Chapter 5. Learning Objectives Unit 1. Annual Amount and Gradient Functions Chapter 5 Uit Aual Amout ad Gradiet Fuctios IET 350 Egieerig Ecoomics Learig Objectives Chapter 5 Upo completio of this chapter you should uderstad: Calculatig future values from aual amouts. Calculatig

More information

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the. Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).

More information

Chapter 14 Nonparametric Statistics

Chapter 14 Nonparametric Statistics Chapter 14 Noparametric Statistics A.K.A. distributio-free statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they

More information

3. If x and y are real numbers, what is the simplified radical form

3. If x and y are real numbers, what is the simplified radical form lgebra II Practice Test Objective:.a. Which is equivalet to 98 94 4 49?. Which epressio is aother way to write 5 4? 5 5 4 4 4 5 4 5. If ad y are real umbers, what is the simplified radical form of 5 y

More information

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean 1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

More information

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern. 5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

SEQUENCES AND SERIES CHAPTER

SEQUENCES AND SERIES CHAPTER CHAPTER SEQUENCES AND SERIES Whe the Grat family purchased a computer for $,200 o a istallmet pla, they agreed to pay $00 each moth util the cost of the computer plus iterest had bee paid The iterest each

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

Building Blocks Problem Related to Harmonic Series

Building Blocks Problem Related to Harmonic Series TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite

More information

Baan Service Master Data Management

Baan Service Master Data Management Baa Service Master Data Maagemet Module Procedure UP069A US Documetiformatio Documet Documet code : UP069A US Documet group : User Documetatio Documet title : Master Data Maagemet Applicatio/Package :

More information

Elementary Theory of Russian Roulette

Elementary Theory of Russian Roulette Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some

More information

Normal Distribution.

Normal Distribution. Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

More information

Lesson 15 ANOVA (analysis of variance)

Lesson 15 ANOVA (analysis of variance) Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi

More information

5.3. Generalized Permutations and Combinations

5.3. Generalized Permutations and Combinations 53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information