Discrete Random Variables Class 4, Jeremy Orloff and Jonathan Bloom
|
|
- Lucinda Harper
- 6 years ago
- Views:
Transcription
1 Lerning Gols Discrete Rndom Vribles Clss 4, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of discrete rndom vrible. 2. Know the Bernoulli, binomil, nd geometric distributions nd exmples of wht they model. 3. Be ble to describe the probbility mss function nd cumultive distribution function using tbles nd formuls. 4. Be ble to construct new rndom vribles from old ones. 5. Know how to compute expected vlue (men). 2 Rndom Vribles This topic is lrgely bout introducing some useful terminology, building on the notions of smple spce nd probbility function. The key words re. Rndom vrible 2. Probbility mss function (pmf) 3. Cumultive distribution function (cdf) 2. Recp A discrete smple spce Ω is finite or listble set of outcomes {ω, ω 2...}. The probbility of n outcome ω is denoted P (ω). An event E is subset of Ω. The probbility of n event E is P (E) = ω E P (ω). 2.2 Rndom vribles s pyoff functions Exmple. A gme with 2 dice. Roll die twice nd record the outcomes s (i, j), where i is the result of the first roll nd j the result of the second. We cn tke the smple spce to be Ω = {(, ), (, 2), (, 3),..., (6, 6)} = {(i, j) i, j =,... 6}. The probbility function is P (i, j) = /36.
2 8.05 clss 4, Discrete Rndom Vribles, Spring In this gme, you win $500 if the sum is 7 nd lose $00 otherwise. We give this pyoff function the nme X nd describe it formlly by { 500 if i + j = 7 X(i, j) = 00 if i + j 7. Exmple 2. We cn chnge the gme by using different pyoff function. For exmple Y (i, j) = ij 0. In this exmple if you roll (6, 2) then you win $2. If you roll (2, 3) then you win -$4 (i.e., lose $4). Question: Which gme is the better bet? nswer: We will come bck to this once we lern bout expecttion. These pyoff functions re exmples of rndom vribles. number to ech outcome in smple spce. More formlly: A rndom vrible ssigns Definition: Let Ω be smple spce. A discrete rndom vrible is function X : Ω R tht tkes discrete set of vlues. (Recll tht R stnds for the rel numbers.) Why is X clled rndom vrible? It s rndom becuse its vlue depends on rndom outcome of n experiment. And we tret X like we would usul vrible: we cn dd it to other rndom vribles, squre it, nd so on. 2.3 Events nd rndom vribles For ny vlue we write X = to men the event consisting of ll outcomes ω with X(ω) =. Exmple 3. In Exmple we rolled two dice nd X ws the rndom vrible { 500 if i + j = 7 X(i, j) = 00 if i + j 7. The event X = 500 is the set {(,6), (2,5), (3,4), (4,3), (5,2), (6,)}, i.e. outcomes tht sum to 7. So P (X = 500) = /6. the set of ll We llow to be ny vlue, even vlues tht X never tkes. In Exmple, we could look t the event X = 000. Since X never equls 000 this is just the empty event (or empty set) X = 000 = {} = P (X = 000) = 0.
3 8.05 clss 4, Discrete Rndom Vribles, Spring Probbility mss function nd cumultive distribution function It gets tiring nd hrd to red nd write P (X = ) for the probbility tht X =. When we know we re tlking bout X we will simply write p(). If we wnt to mke X explicit we will write p X (). We spell this out in definition. Definition: The probbility mss function (pmf) of discrete rndom vrible is the function p() = P (X = ). Note:. We lwys hve 0 p(). 2. We llow to be ny number. If is vlue tht X never tkes, then p() = 0. Exmple 4. Let Ω be our erlier smple spce for rolling 2 dice. Define the rndom vrible M to be the mximum vlue of the two dice: M(i, j) = mx(i, j). For exmple, the roll (3,5) hs mximum 5, i.e. M(3, 5) = 5. We cn describe rndom vrible by listing its possible vlues nd the probbilities ssocited to these vlues. For the bove exmple we hve: vlue : pmf p(): /36 3/36 5/36 7/36 9/36 /36 For exmple, p(2) = 3/36. Question: Wht is p(8)? nswer: p(8) = 0. Think: Wht is the pmf for Z(i, j) = i + j? Does it look fmilir? 2.5 Events nd inequlities Inequlities with rndom vribles describe events. For exmple X is the set of ll outcomes ω such tht X(w). Exmple 5. If our smple spce is the set of ll pirs of (i, j) coming from rolling two dice nd Z(i, j) = i + j is the sum of the dice then Z 4 = {(, ), (, 2), (, 3), (2, ), (2, 2), (3, )} 2.6 The cumultive distribution function (cdf) Definition: The cumultive distribution function (cdf) of rndom vrible X is the function F given by F () = P (X ). We will often shorten this to distribution function. Note well tht the definition of F () uses the symbol less thn or equl. importnt for getting your clcultions exctly right. Exmple. Continuing with the exmple M, we hve vlue : pmf p(): /36 3/36 5/36 7/36 9/36 /36 cdf F (): /36 4/36 9/36 6/36 25/36 36/36 This will be
4 8.05 clss 4, Discrete Rndom Vribles, Spring F () is clled the cumultive distribution function becuse F () gives the totl probbility tht ccumultes by dding up the probbilities p(b) s b runs from to. For exmple, in the tble bove, the entry 6/36 in column 4 for the cdf is the sum of the vlues of the pmf from column to column 4. In nottion: As events: M 4 = {, 2, 3, 4}; F (4) = P (M 4) = /36+3/36+5/36+7/36 = 6/36. Just like the probbility mss function, F () is defined for ll vlues. exmple, F (8) =, F ( 2) = 0, F (2.5) = 4/36, nd F (π) = 9/36. In the bove 2.7 Grphs of p() nd F () We cn visulize the pmf nd cdf with grphs. For exmple, let X be the number of heds in 3 tosses of fir coin: vlue : pmf p(): /8 3/8 3/8 /8 cdf F (): /8 4/8 7/8 The colored grphs show how the cumultive distribution function is built by ccumulting probbility s increses. The blck nd white grphs re the more stndrd presenttions. 3/8 3/8 / / Probbility mss function for X 7/8 7/8 4/8 4/8 / / Cumultive distribution function for X
5 8.05 clss 4, Discrete Rndom Vribles, Spring /36 30/36 26/36 2/36 5/36 0/36 6/36 5/36 4/36 3/36 2/36 / /36 3/36 / pmf nd cdf for the mximum of two dice (Exmple 4) Histogrms: Lter we will see nother wy to visulize the pmf using histogrms. These require some cre to do right, so we will wit until we need them. 2.8 Properties of the cdf F The cdf F of rndom vrible stisfies severl properties:. F is non-decresing. Tht is, its grph never goes down, or symboliclly if b then F () F (b) F (). 3. lim F () =, lim F () = 0. In words, () sys the cumultive probbility F () increses or remins constnt s increses, but never decreses; (2) sys the ccumulted probbility is lwys between 0 nd ; (3) sys tht s gets very lrge, it becomes more nd more certin tht X nd s gets very negtive it becomes more nd more certin tht X >. Think: Why does cdf stisfy ech of these properties? 3 Specific Distributions 3. Bernoulli Distributions Model: The Bernoulli distribution models one tril in n experiment tht cn result in either success or filure This is the most importnt distribution is lso the simplest. A rndom vrible X hs Bernoulli distribution with prmeter p if:
6 8.05 clss 4, Discrete Rndom Vribles, Spring X tkes the vlues 0 nd. 2. P (X = ) = p nd P (X = 0) = p. We will write X Bernoulli(p) or Ber(p), which is red X follows Bernoulli distribution with prmeter p or X is drwn from Bernoulli distribution with prmeter p. A simple model for the Bernoulli distribution is to flip coin with probbility p of heds, with X = on heds nd X = 0 on tils. The generl terminology is to sy X is on success nd 0 on filure, with success nd filure defined by the context. Mny decisions cn be modeled s binry choice, such s votes for or ginst proposl. If p is the proportion of the voting popultion tht fvors the proposl, thn the vote of rndom individul is modeled by Bernoulli(p). Here re the tble nd grphs of the pmf nd cdf for the Bernoulli(/2) distribution nd below tht for the generl Bernoulli(p) distribution. vlue : 0 pmf p(): /2 /2 cdf F (): /2 /2 p() 0 Tble, pmf nd cmf for the Bernoulli(/2) distribution /2 F () 0 vlues : 0 pmf p(): -p p cdf F (): -p p p p() 0 p Tble, pmf nd cmf for the Bernoulli(p) distribution F () Binomil Distributions The binomil distribution Binomil(n,p), or Bin(n,p), models the number of successes in n independent Bernoulli(p) trils. There is hierrchy here. A single Bernoulli tril is, sy, one toss of coin. A single binomil tril consists of n Bernoulli trils. For coin flips the smple spce for Bernoulli tril is {H, T }. The smple spce for binomil tril is ll sequences of heds nd tils of length n. Likewise Bernoulli rndom vrible tkes vlues 0 nd nd binomil rndom vribles tkes vlues 0,, 2,..., n. Exmple 6. Binomil(,p) is the sme s Bernoulli(p).
7 8.05 clss 4, Discrete Rndom Vribles, Spring Exmple 7. The number of heds in n flips of coin with probbility p of heds follows Binomil(n, p) distribution. We describe X Binomil(n, p) by giving its vlues nd probbilities. For nottion we will use k to men n rbitrry number between 0 nd n. ( ) n We remind you tht n choose k = = n C k is the number of wys to choose k things k out of collection of n things nd it hs the formul ( ) n n! = k k! (n k)!. () (It is lso clled binomil coefficient.) Here is tble for the pmf of Binomil(n, k) rndom vrible. We will explin how the binomil coefficients enter the pmf for the binomil distribution fter simple exmple. vlues : 0 2 k n ( ) ( ) ( ) n pmf p(): ( p) n p ( p) n n p 2 ( p) n 2 n p k ( p) n k p n 2 k Exmple 8. Wht is the probbility of 3 or more heds in 5 tosses of fir coin? nswer: The binomil coefficients ssocited with n = 5 re ( ) ( ) 5 5 =, = 5! 0! 4! = ( ) = 5, = 5! 2 2! 3! = = = 0, nd similrly ( ) 5 = 0, 3 ( ) 5 = 5, 4 ( ) 5 =. 5 Using these vlues we get the following tble for X Binomil(5,p). vlues : pmf p(): ( p) 5 5p( p) 4 0p 2 ( p) 3 0p 3 ( p) 2 5p 4 ( p) p 5 We were told p = /2 so P (X 3) = 0 ( 2 ) 3 ( ) ( 2 Think: Why is the vlue of /2 not surprising? ) 4 ( ) + 2 ( ) 5 = = Explntion of the binomil probbilities For concreteness, let n = 5 nd k = 2 (the rgument for rbitrry n nd k is identicl.) So X binomil(5, p) nd we wnt to compute p(2). The long wy to compute p(2) is to list ll the wys to get exctly 2 heds in 5 coin flips nd dd up their probbilities. The list hs 0 entries: HHTTT, HTHTT, HTTHT, HTTTH, THHTT, THTHT, THTTH, TTHHT, TTHTH, TTTHH
8 8.05 clss 4, Discrete Rndom Vribles, Spring Ech entry hs the sme probbility of occurring, nmely p 2 ( p) 3. This is becuse ech of the two heds hs probbility p nd ech of the 3 tils hs probbility p. Becuse the individul tosses re independent we cn multiply probbilities. Therefore, the totl probbility of exctly 2 heds is the sum of 0 identicl probbilities, i.e. p(2) = 0p 2 ( p) 3, s shown in the tble. This guides us to the shorter wy to do the computtion. We hve to count the number of sequences with exctly 2 heds. To do this we need to choose 2 of the tosses to be heds nd the remining 3 to be tils. The number of such sequences is the number of wys to choose 2 out of 5 things, tht is ( 5 2). Since ech such sequence hs the sme probbility, p 2 ( p) 3, we get the probbility of exctly 2 heds p(2) = ( 5 2) p 2 ( p) 3. Here re some binomil probbility mss function (here, frequency is the sme s probbility). 3.4 Geometric Distributions A geometric distribution models the number of tils before the first hed in sequence of coin flips (Bernoulli trils). Exmple 9. () Flip coin repetedly. Let X be the number of tils before the first heds. So, X cn equl 0, i.e. the first flip is heds,, 2,.... In principle it tke ny nonnegtive integer vlue. (b) Give flip of tils the vlue 0, nd heds the vlue. In this cse, X is the number of 0 s before the first.
9 8.05 clss 4, Discrete Rndom Vribles, Spring (c) Give flip of tils the vlue, nd heds the vlue 0. In this cse, X is the number of s before the first 0. (d) Cll flip of tils success nd heds filure. So, X is the number of successes before the first filure. (e) Cll flip of tils filure nd heds success. So, X is the number of filures before the first success. You cn see this models mny different scenrios of this type. The most neutrl lnguge is the number of tils before the first hed. Forml definition. The rndom vrible X follows geometric distribution with prmeter p if X tkes the vlues 0,, 2, 3,... its pmf is given by p(k) = P (X = k) = ( p) k p. We denote this by X geometric(p) or geo(p). In tble form we hve: vlue : k... pmf p(): p ( p)p ( p) 2 p ( p) 3 p... ( p) k p... Tble: X geometric(p): X = the number of 0s before the first. We will show how this tble ws computed in n exmple below. The geometric distribution is n exmple of discrete distribution tht tkes n infinite number of possible vlues. Things cn get confusing when we work with successes nd filure since we might wnt to model the number of successes before the first filure or we might wnt the number of filures before the first success. To keep stright things stright you cn trnslte to the neutrl lnguge of the number of tils before the first heds pmf nd cdf for the geometric(/3) distribution Exmple 0. Computing geometric probbilities. Suppose tht the inhbitnts of n islnd pln their fmilies by hving bbies until the first girl is born. Assume the probbility of hving girl with ech pregnncy is 0.5 independent of other pregnncies, tht ll bbies survive nd there re no multiple births. Wht is the probbility tht fmily hs k boys?
10 8.05 clss 4, Discrete Rndom Vribles, Spring nswer: In neutrl lnguge we cn think of boys s tils nd girls s heds. Then the number of boys in fmily is the number of tils before the first heds. Let s prctice using stndrd nottion to present this. So, let X be the number of boys in (rndomly-chosen) fmily. So, X is geometric rndom vrible. We re sked to find p(k) = P (X = k). A fmily hs k boys if the sequence of children in the fmily from oldest to youngest is BBB... BG with the first k children being boys. The probbility of this sequence is just the product of the probbility for ech child, i.e. (/2) k (/2) = (/2) k+. (Note: The ssumptions of equl probbility nd independence re simplifictions of relity.) Think: Wht is the rtio of boys to girls on the islnd? More geometric confusion. Another common definition for the geometric distribution is the number of tosses until the first heds. In this cse X cn tke the vlues, i.e. the first flip is heds, 2, 3,.... This is just our geometric rndom vrible plus. The methods of computing with it re just like the ones we used bove. 3.5 Uniform Distribution The uniform distribution models ny sitution where ll the outcomes re eqully likely. X uniform(n). X tkes vlues, 2, 3,..., N, ech with probbility /N. We hve lredy seen this distribution mny times when modeling to fir coins (N = 2), dice (N = 6), birthdys (N = 365), nd poker hnds (N = ( 52 5 ) ). 3.6 Discrete Distributions Applet The pplet t gives dynmic view of some discrete distributions. The grphs will chnge smoothly s you move the vrious sliders. Try plying with the different distributions nd prmeters. This pplet is crefully color-coded. Two things with the sme color represent the sme or closely relted notions. By understnding the color-coding nd other detils of the pplet, you will cquire stronger intuition for the distributions shown. 3.7 Other Distributions There re million other nmed distributions rising is vrious contexts. We don t expect you to memorize them (we certinly hve not!), but you should be comfortble using resource like Wikipedi to look up pmf. For exmple, tke look t the info box t the top right ofhttp://en.wikipedi.org/wiki/hypergeometric_distribution. The info box lists mny (surely unfmilir) properties in ddition to the pmf.
11 8.05 clss 4, Discrete Rndom Vribles, Spring Arithmetic with Rndom Vribles We cn do rithmetic with rndom vribles. For exmple, we cn dd subtrct, multiply or squre them. There is simple, but extremely importnt ide for counting. It sys tht if we hve sequence of numbers tht re either 0 or then the sum of the sequence is the number of s. Exmple. Consider the sequence with five s, 0, 0,, 0, 0, 0,, 0, 0, 0, 0,, 0, 0, 0,, 0, 0. It is esy to see tht the sum of this sequence is 5 the number of s. We illustrtes this ide by counting the number of heds in n tosses of coin. Exmple 2. Toss fir coin n times. Let X j be if the jth toss is heds nd 0 if it s tils. So, X j is Bernoulli(/2) rndom vrible. Let X be the totl number of heds in the n tosses. Assuming the tosses re independence we know X binomil(n, /2). We cn lso write X = X + X 2 + X X n. Agin, this is becuse the terms in the sum on the right re ll either 0 or. So, the sum is exctly the number of X j tht re, i.e. the number of heds. The importnt thing to see in the exmple bove is tht we ve written the more complicted binomil rndom vrible X s the sum of extremely simple rndom vribles X j. This will llow us to mnipulte X lgebriclly. Think: Suppose X nd Y re independent nd X binomil(n, /2) nd Y binomil(m, /2). Wht kind of distribution does X + Y follow? (Answer: binomil(n + m, /2). Why?) Exmple 3. tbles. Suppose X nd Y re independent rndom vribles with the following Vlues of X x: pmf p X (x): /0 2/0 3/0 4/0 Vlues of Y y: pmf p Y (y): /5 2/5 3/5 4/5 5/5 Check tht the totl probbility for ech rndom vrible is. Mke tble for the rndom vrible X + Y. nswer: The first thing to do is mke two-dimensionl tble for the product smple spce consisting of pirs (x, y), where x is possible vlue of X nd y one of Y. To help do the computtion, the probbilities for the X vlues re put in the fr right column nd those for Y re in the bottom row. Becuse X nd Y re independent the probbility for (x, y) pir is just the product of the individul probbilities.
12 8.05 clss 4, Discrete Rndom Vribles, Spring Y vlues /50 2/50 3/50 4/50 5/50 /0 X vlues 2 3 2/50 4/50 6/50 8/50 0/50 3/50 6/50 9/50 2/50 5/50 2/0 3/0 4 4/50 8/50 2/50 6/50 20/50 4/0 /5 2/5 3/5 4/5 5/5 The digonl stripes show sets of squres where X + Y is the sme. All we hve to do to compute the probbility tble for X + Y is sum the probbilities for ech stripe. X + Y vlues: pmf: /50 4/50 0/50 20/50 30/50 34/50 3/50 20/50 When the tbles re too big to write down we ll need to use purely lgebric techniques to compute the probbilities of sum. We will lern how to do this in due course. 5 Expected Vlue In the R reding questions for this lecture, you simulted the verge vlue of rolling die mny times. You should hve gotten vlue close to the exct nswer of 3.5. To motivte the forml definition of the verge, or expected vlue, we first consider some exmples. Exmple 4. Suppose we hve six-sided die mrked with five 5 3 s nd one 6. (This ws the red one from our non-trnsitive dice.) Wht would you expect the verge of 6000 rolls to be? nswer: If we knew the vlue of ech roll, we could compute the verge by summing the 6000 vlues nd dividing by Without knowing the vlues, we cn compute the expected verge s follows. Since there re five 3 s nd one six we expect roughly 5/6 of the rolls will give 3 nd /6 will give 6. Assuming this to be exctly true, we hve the following tble of vlues nd counts: vlue: 3 6 expected counts:
13 8.05 clss 4, Discrete Rndom Vribles, Spring The verge of these 6000 vlues is then = = 3.5 We consider this the expected verge in the sense tht we expect ech of the possible vlues to occur with the given frequencies. Exmple 5. We roll two stndrd 6-sided dice. You win $000 if the sum is 2 nd lose $00 otherwise. How much do you expect to win on verge per tril? nswer: The probbility of 2 is /36. If you ply N times, you cn expect N of the 36 trils to give 2 nd N of the trils to give something else. Thus your totl expected winnings re 000 N 35N To get the expected verge per tril we divide the totl by N: expected verge = = Think: Would you be willing to ply this gme one time? Multiple times? Notice tht in both exmples the sum for the expected verge consists of terms which re vlue of the rndom vrible times its probbilitiy. This leds to the following definition. Definition: Suppose X is discrete rndom vrible tht tkes vlues x, x 2,..., x n with probbilities p(x ), p(x 2 ),..., p(x n ). The expected vlue of X is denoted E(X) nd defined by n E(X) = p(x j ) x j = p(x )x + p(x 2 )x p(x n )x n. Notes: j=. The expected vlue is lso clled the men or verge of X nd often denoted by µ ( mu ). 2. As seen in the bove exmples, the expected vlue need not be possible vlue of the rndom vrible. Rther it is weighted verge of the possible vlues. 3. Expected vlue is summry sttistic, providing mesure of the loction or centrl tendency of rndom vrible. 4. If ll the vlues re eqully probble then the expected vlue is just the usul verge of the vlues. Exmple 6. Find E(X) for the rndom vrible X with tble: vlues of X: 3 5 pmf: /6 /6 2/3 nswer: E(X) = = 24 6 = 4
14 8.05 clss 4, Discrete Rndom Vribles, Spring Exmple 7. Let X be Bernoulli(p) rndom vrible. Find E(X). nswer: X tkes vlues nd 0 with probbilities p nd p, so E(X) = p + ( p) 0 = p. Importnt: This is n importnt exmple. Be sure to remember tht the expected vlue of Bernoulli(p) rndom vrible is p. Think: Wht is the expected vlue of the sum of two dice? 5. Men nd center or mss You my hve wondered why we use the nme probbility mss function. Here s the reson: if we plce n object of mss p(x j ) t position x j for ech j, then E(X) is the position of the center of mss. Let s recll the ltter notion vi n exmple. Exmple 8. Suppose we hve two msses long the x-xis, mss m = 500 t position x = 3 nd mss m 2 = 00 t position x 2 = 6. Where is the center of mss? nswer: Intuitively we know tht the center of mss is closer to the lrger mss. m m x From physics we know the center of mss is x = m x + m 2 x = = 3.5. m + m We cll this formul weighted verge of the x nd x 2. Here x is weighted more hevily becuse it hs more mss. Now look t the definition of expected vlue E(X). It is weighted verge of the vlues of X with the weights being probbilities p(x i ) rther thn msses! We might sy tht The expected vlue is the point t which the distribution would blnce. Note the similrity between the physics exmple nd Exmple. 5.2 Algebric properties of E(X) When we dd, scle or shift rndom vribles the expected vlues do the sme. shorthnd mthemticl wy of sying this is tht E(X) is liner.. If X nd Y re rndom vribles on smple spce Ω then The E(X + Y ) = E(X) + E(Y ) 2. If nd b re constnts then E(X + b) = E(X) + b. We will think of X + b s scling X by nd shifting it by b.
15 8.05 clss 4, Discrete Rndom Vribles, Spring Before proving these properties, let s consider few exmples. Exmple 9. Roll two dice nd let X be the sum. Find E(X). nswer: Let X be the vlue on the first die nd let X 2 be the vlue on the second die. Since X = X + X 2 we hve E(X) = E(X ) + E(X 2 ). Erlier we computed tht E(X ) = E(X 2 ) = 3.5, therefore E(X) = 7. Exmple 20. Let X binomil(n, p). Find E(X). nswer: Recll tht X models the number of successes in n Bernoulli(p) rndom vribles, which we ll cll X,... X n. The key fct, which we highlighted in the previous reding for this clss, is tht n X = X j. Now we cn use the Algebric Property () to mke the clcultion simple. X = n j= j= X j E(X) = j We could hve computed E(X) directly s E(X) = n kp(k) = k=0 k=0 E(X j ) = j p = np. n ( ) n k p k ( p) n k. k It is possible to show tht the sum of this series is indeed np. We think you ll gree tht the method using Property () is much esier. Exmple 2. (For infinite rndom vribles the men does not lwys exist.) X hs n infinite number of vlues ccording to the following tble vlues x: k... pmf p(x): /2 /2 2 / /2 k Try to compute the men.... nswer: The men is E(X) = 2 k 2 k = =. k= k= The men does not exist! This cn hppen with infinite series. Suppose 5.3 Proofs of the lgebric properties of E(X) The proof of Property () is simple, but there is some subtlety in even understnding wht it mens to dd two rndom vribles. Recll tht the vlue of rndom vrible is number determined by the outcome of n experiment. To dd X nd Y mens to dd the vlues of X nd Y for the sme outcome. In tble form this looks like: outcome ω: ω ω 2 ω 3... ω n vlue of X: x x 2 x 3... x n vlue of Y : y y 2 y 3... y n vlue of X + Y : x + y x 2 + y 2 x 3 + y 3... x n + y n prob. P (ω): P (ω ) P (ω 2 ) P (ω 3 )... P (ω n )
16 8.05 clss 4, Discrete Rndom Vribles, Spring The proof of () follows immeditely: E(X + Y ) = (x i + y i )P (ω i ) = x i P (ω i ) + y i P (ω i ) = E(X) + E(Y ). The proof of Property (2) only tkes one line. E(X + b) = p(x i )(x i + b) = p(x i )x i + b p(x i ) = E(X) + b. The b term in the lst expression follows becuse p(x i ) =. Exmple 22. Men of geometric distribution Let X geo(p). Recll this mens X tkes vlues k = 0,, 2,... with probbilities p(k) = ( p) k p. (X models the number of tils before the first heds in sequence of Bernoulli trils.) The men is given by E(X) = p p. To see this requires clever trick. Mthemticins love this sort of thing nd we hope you re ble to follow the logic. In this clss we will not sk you to come up with something like this on n exm. Here s the trick.: to compute E(X) we hve to sum the infinite series E(X) = k( p) k p. k=0 Here is the trick. We know the sum of the geometric series: Differentite both sides: Multiply by x: kx k = k=0 Replce x by p: Multiply by p: k=0 k=0 kx k = k=0 x ( x) 2. ( x) 2. k( p) k = p p 2. k( p) k p = p p. This lst expression is the men. E(X) = p p. k=0 x k = x. Exmple 23. Flip fir coin until you get heds for the first time. Wht is the expected number of times you flipped tils? nswer: The number of tils before the first hed is modeled by X geo(/2). From the previous exmple E(X) = /2 =. This is surprisingly smll number. /2
17 8.05 clss 4, Discrete Rndom Vribles, Spring Exmple 24. Michel Jordn, the gretest bsketbll plyer ever, mde 80% of his free throws. In gme wht is the expected number he would mke before his first miss. nswer: Here is n exmple where we wnt the number of successes before the first filure. Using the neutrl lnguge of heds nd tils: success is tils (probbility p) nd filure is heds (probbility = p). Therefore p =.2 nd the number of tils (mde free throws) before the first heds (missed free throw) is modeled by X geo(.2). We sw in Exmple 22 tht this is E(X) = p p =.8.2 = Expected vlues of functions of rndom vrible (The chnge of vribles formul.) If X is discrete rndom vrible tking vlues x, x 2,... nd h is function the h(x) is new rndom vrible. Its expected vlue is E(h(X)) = j h(x j )p(x j ). We illustrte this with severl exmples. Exmple 25. Let X be the vlue of roll of one die nd let Y = X 2. Find E(Y ). nswer: Since there re smll number of vlues we cn mke tble. X Y prob /6 /6 /6 /6 /6 /6 Notice the probbility for ech Y vlue is the sme s tht of the corresponding X vlue. So, E(Y ) = E(X 2 ) = = Exmple 26. Roll two dice nd let X be the sum. Suppose the pyoff function is given by Y = X 2 6X +. Is this good bet? 2 nswer: We hve E(Y ) = (j 2 6j + )p(j), where p(j) = P (X = j). j=2 We show the tble, but relly we ll use R to do the clcultion. X Y prob /36 2/36 3/36 4/36 5/36 6/36 5/36 4/36 3/36 2/36 /36 Here s the R code I used to compute E(Y ) = x = 2:2 y = x^2-6*x + p = c( )/36 ve = sum(p*y) It gve ve = To nswer the question bove: since the expected pyoff is positive it looks like bet worth tking.
18 8.05 clss 4, Discrete Rndom Vribles, Spring Quiz: If Y = h(x) does E(Y ) = h(e(x))? nswer: NO!!! This is not true in generl! Think: Is it true in the previous exmple? Quiz: If Y = 3X + 77 does E(Y ) = 3E(X) + 77? nswer: Yes. By property (2), scling nd shifting does behve like this.
Infinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationMath 426: Probability Final Exam Practice
Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by
More informationCS667 Lecture 6: Monte Carlo Integration 02/10/05
CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationContinuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom
Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationDISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS
DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationLecture 3 Gaussian Probability Distribution
Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationChapter 5 : Continuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationSolution for Assignment 1 : Intro to Probability and Statistics, PAC learning
Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (
More informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More informationLine and Surface Integrals: An Intuitive Understanding
Line nd Surfce Integrls: An Intuitive Understnding Joseph Breen Introduction Multivrible clculus is ll bout bstrcting the ides of differentition nd integrtion from the fmilir single vrible cse to tht of
More informationOverview of Calculus I
Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,
More informationFor the percentage of full time students at RCC the symbols would be:
Mth 17/171 Chpter 7- ypothesis Testing with One Smple This chpter is s simple s the previous one, except it is more interesting In this chpter we will test clims concerning the sme prmeters tht we worked
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationThe First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).
The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples
More informationCS 188 Introduction to Artificial Intelligence Fall 2018 Note 7
CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2019
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS MATH00030 SEMESTER 208/209 DR. ANTHONY BROWN 7.. Introduction to Integrtion. 7. Integrl Clculus As ws the cse with the chpter on differentil
More informationArithmetic & Algebra. NCTM National Conference, 2017
NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible
More informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationand that at t = 0 the object is at position 5. Find the position of the object at t = 2.
7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
More informationProblem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:
(x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationTopic 1 Notes Jeremy Orloff
Topic 1 Notes Jerem Orloff 1 Introduction to differentil equtions 1.1 Gols 1. Know the definition of differentil eqution. 2. Know our first nd second most importnt equtions nd their solutions. 3. Be ble
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More informationLecture 2: Fields, Formally
Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More informationMATH 144: Business Calculus Final Review
MATH 144: Business Clculus Finl Review 1 Skills 1. Clculte severl limits. 2. Find verticl nd horizontl symptotes for given rtionl function. 3. Clculte derivtive by definition. 4. Clculte severl derivtives
More informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More informationf(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral
Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationDiscrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17
EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,
More informationLesson 25: Adding and Subtracting Rational Expressions
Lesson 2: Adding nd Subtrcting Rtionl Expressions Student Outcomes Students perform ddition nd subtrction of rtionl expressions. Lesson Notes This lesson reviews ddition nd subtrction of frctions using
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationExponentials - Grade 10 [CAPS] *
OpenStx-CNX module: m859 Exponentils - Grde 0 [CAPS] * Free High School Science Texts Project Bsed on Exponentils by Rory Adms Free High School Science Texts Project Mrk Horner Hether Willims This work
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationScientific notation is a way of expressing really big numbers or really small numbers.
Scientific Nottion (Stndrd form) Scientific nottion is wy of expressing relly big numbers or relly smll numbers. It is most often used in scientific clcultions where the nlysis must be very precise. Scientific
More informationMonte Carlo method in solving numerical integration and differential equation
Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The
More informationEquations and Inequalities
Equtions nd Inequlities Equtions nd Inequlities Curriculum Redy ACMNA: 4, 5, 6, 7, 40 www.mthletics.com Equtions EQUATIONS & Inequlities & INEQUALITIES Sometimes just writing vribles or pronumerls in
More informationChapters 4 & 5 Integrals & Applications
Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions
More informationECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance
Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between
More informationHow can we approximate the area of a region in the plane? What is an interpretation of the area under the graph of a velocity function?
Mth 125 Summry Here re some thoughts I ws hving while considering wht to put on the first midterm. The core of your studying should be the ssigned homework problems: mke sure you relly understnd those
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationAppendix 3, Rises and runs, slopes and sums: tools from calculus
Appendi 3, Rises nd runs, slopes nd sums: tools from clculus Sometimes we will wnt to eplore how quntity chnges s condition is vried. Clculus ws invented to do just this. We certinly do not need the full
More informationIntroduction to Mathematical Reasoning, Saylor 111
Frction versus rtionl number. Wht s the difference? It s not n esy question. In fct, the difference is somewht like the difference between set of words on one hnd nd sentence on the other. A symbol is
More information1 Online Learning and Regret Minimization
2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationLesson 1: Quadratic Equations
Lesson 1: Qudrtic Equtions Qudrtic Eqution: The qudrtic eqution in form is. In this section, we will review 4 methods of qudrtic equtions, nd when it is most to use ech method. 1. 3.. 4. Method 1: Fctoring
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 17
CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking
More informationBefore we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!
Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationReview of basic calculus
Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below
More information7 - Continuous random variables
7-1 Continuous rndom vribles S. Lll, Stnford 2011.01.25.01 7 - Continuous rndom vribles Continuous rndom vribles The cumultive distribution function The uniform rndom vrible Gussin rndom vribles The Gussin
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationHere we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.
Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous
More informationRiemann Integrals and the Fundamental Theorem of Calculus
Riemnn Integrls nd the Fundmentl Theorem of Clculus Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University September 16, 2013 Outline Grphing Riemnn Sums
More informationAdministrivia CSE 190: Reinforcement Learning: An Introduction
Administrivi CSE 190: Reinforcement Lerning: An Introduction Any emil sent to me bout the course should hve CSE 190 in the subject line! Chpter 4: Dynmic Progrmming Acknowledgment: A good number of these
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationES.182A Topic 30 Notes Jeremy Orloff
ES82A opic 3 Notes Jerem Orloff 3 Non-independent vribles: chin rule Recll the chin rule: If w = f, ; nd = r, t, = r, t then = + r t r t r t = + t t t r nfortuntel, sometimes there re more complicted reltions
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationPART 1 MULTIPLE CHOICE Circle the appropriate response to each of the questions below. Each question has a value of 1 point.
PART MULTIPLE CHOICE Circle the pproprite response to ech of the questions below. Ech question hs vlue of point.. If in sequence the second level difference is constnt, thn the sequence is:. rithmetic
More informationReinforcement learning II
CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationMath 231E, Lecture 33. Parametric Calculus
Mth 31E, Lecture 33. Prmetric Clculus 1 Derivtives 1.1 First derivtive Now, let us sy tht we wnt the slope t point on prmetric curve. Recll the chin rule: which exists s long s /. = / / Exmple 1.1. Reconsider
More informationNormal Distribution. Lecture 6: More Binomial Distribution. Properties of the Unit Normal Distribution. Unit Normal Distribution
Norml Distribution Lecture 6: More Binomil Distribution If X is rndom vrible with norml distribution with men µ nd vrince σ 2, X N (µ, σ 2, then P(X = x = f (x = 1 e 1 (x µ 2 2 σ 2 σ Sttistics 104 Colin
More informationImproper Integrals. Type I Improper Integrals How do we evaluate an integral such as
Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationNUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
More informationOperations with Polynomials
38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils
More informationSYDE 112, LECTURES 3 & 4: The Fundamental Theorem of Calculus
SYDE 112, LECTURES & 4: The Fundmentl Theorem of Clculus So fr we hve introduced two new concepts in this course: ntidifferentition nd Riemnn sums. It turns out tht these quntities re relted, but it is
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationThe graphs of Rational Functions
Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior
More informationdifferent methods (left endpoint, right endpoint, midpoint, trapezoid, Simpson s).
Mth 1A with Professor Stnkov Worksheet, Discussion #41; Wednesdy, 12/6/217 GSI nme: Roy Zho Problems 1. Write the integrl 3 dx s limit of Riemnn sums. Write it using 2 intervls using the 1 x different
More informationMath Lecture 23
Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of
More information