Topic 5: Basics of Probability
|
|
- Daisy Walters
- 5 years ago
- Views:
Transcription
1 Topic 5: Jue 1, Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts ad the proofs of theorems. These axioms are ispired, i the istaces itroduced above, by our ituitive uderstadig, for example, of the ature of parallel lies or the real umbers. Probability is a brach of mathematics based o three axioms ispired origially by calculatig chaces from card ad dice games. Statistics, i its role as a facilitator of sciece, begis with the collectio of data. From this collectio, we are ased to mae iferece o the state of ature, that is to determie the coditios that are liely to produce these data. Probability, i udertaig the tas of ivestigatig differig states of ature, taes the complemetary perspective. It begis by examiig radom pheomea, i.e., those whose exact outcomes are ucertai. Cosequetly, i order to determie the scietific reality behid the data, we must sped some time worig with the cocepts i the theory of probability to ivestigate properties of the possible states of ature to assess which are most useful i maig iferece from data. We will motivate the axioms of probability through the case of equally liely outcomes for some simple games of chace ad loo at some of the direct cosequeces of the axioms. I order to exted our ability to use the axioms, we will lear coutig techiques, e.g, permutatios ad combiatios, based o the multiplicatio priciple. A probability model has two essetial pieces of its descriptio. Ω, the sample space, the set of possible outcomes. A evet is a collectio of outcomes. We ca give explicitly defie ad evet via its outcomes, A = {ω 1, ω 2,, ω } or with a descriptio A = {ω : ω has property P}. I either case, A is subset of the sample space, A Ω. P, the probability assigs a umber to each evet. Thus, a probability is a fuctio. We are familiar with fuctios i which both the domai ad rage are subsets of the real umbers. The domai of a probability fuctio is the collectio of all possible outcomes. The rage is still a umber. We will see soo which umbers we will accept as probabilities of evets. c 2011 Joseph C. Watis 1
2 Data Aalysis ad Probability 2 Set Theory - Probability Theory Dictioary Evet Laguage Set Laguage Set Notatio Ve Diagram sample space uiversal set Ω evet subset A, B, C, outcome elemet ω impossible evet empty set ot A A complemet A c A or B A uio B A B A ad B A itersect B A B A ad B are A ad B are A B = mutually exclusive disjoit if A the B A is a subset of B A B 2
3 Data Aalysis ad Probability Equally Liely Outcomes The essetial relatioship betwee evets ad the probability are described through the three axioms of probability. These axioms ca be motivated through the first uses of probability, amely the case of equal liely outcomes. If Ω is a fiite sample space, the if each outcome is equally liely, we defie the probability of A as the fractio of outcomes that are i A. P (A) = #(A) #(Ω). Thus, computig P (A) meas coutig the umber of outcomes i the evet A ad the umber of outcomes i the sample space Ω ad dividig. Exercise Toss a coi. The Ω = {H, T } A = {H} P {heads} = #(A) #(Ω) =. 2. Toss a coi three times. Ω = { HHH, HHT, HT H, HT T, T HH, T HT, T T H, T T T } P {toss at least two heads i a row} = #(A) #(Ω) =. Roll two dice. Ω = { (1, 1), (1, 2), (1, ), (1, 4), (1, 5), (1, 6) (2, 1), (2, 2), (2, ), (2, 4), (2, 5), (2, 6) (, 1), (, 2), (, ), (, 4), (, 5), (, 6) (4, 1), (4, 2), (4, ), (4, 4), (4, 5), (4, 6) (5, 1), (5, 2), (5, ), (5, 4), (5, 5), (5, 6) (6, 1), (6, 2), (6, ), (6, 4), (6, 5), (6, 6)} P {sum is 7} = #(A) #(Ω) = Because we always have 0 #(A) #(Ω), we always have ad P (A) 0 (1) P (Ω) = 1 (2) This gives us 2 of the three axioms, The third will require more developmet. Toss a coi 4 times. #(Ω) = 16 A = {exactly heads} = {HHHT, HHTH, HTHH, THHH} #(A) = 4
4 Data Aalysis ad Probability P (A) = 4 16 = 1 4 B = {exactly 4 heads} = {HHHH} #(B) = 1 P (B) = 1 16 Now let s defie the set C = {at least three heads}. If you are ased the supply the probability of C, your ituitio is liely to give you a immediate aswer. P (C) =. Let s have a loo at this ituitio. The evets A ad B have o outcomes i commo,. We say that the two evets are disjoit or mutually exclusive ad write A B =. I this situatio, #(A B) = #(A) + #(B). If we tae this additio priciple ad divide by #(Ω), the we obtai the followig idetity: If A B =, the P (A B) = P (A) + P (B). () Usig this property, we see that P {at least heads} = P {exactly heads} + P {exactly 4 heads} = = We are sayig that ay fuctio P that accepts evets as its domai ad returs umbers as its rage ad satisfies (1), (2), ad () ca be called a probability. If we iterate the procedure i Axiom, we ca also state that if the evets, A 1, A 2,, A, are mutually exclusive, the P (A 1 A 2 A ) = P (A 1 ) + P (A 2 ) + + P (A ). ( ) This is a sufficiet defiitio for a probability if the sample space Ω is fiite. Thus, statemets (1), (2), ad ( ) give us the complete axioms of probability for a fiite sample space. 4 Cosequeces of the Axioms Other properties that we associate with a probability ca be derived from the axioms. 1. The Complemet Rule. Because A ad its complemet A c = {ω; ω / A} are mutually exclusive P (A) + P (A c ) = P (A A c ) = P (Ω) = 1 or P (A c ) = 1 P (A). For example, if we toss a biased coi. We may wat to say that P {heads} = p where p is ot ecessarily equal to 1/2. By ecessity, P {tails} = 1 p. Toss a coi 4 times. P {fewer tha heads} = 1 P {at least heads} = =
5 Data Aalysis ad Probability A A B B Figure 1: (left) Mootoicity Rule. If A B, the P (B \ A) = P (B) P (A). (right) The Iclusio-Exclusio Rule. P (A B) = P (A) + P (B) P (A B). Usig area as a aalogy for probability, P (B \ A) is the area betwee the circles ad the area P (A) + P (B) double couts the les area P (A B). 2. The Differece Rule Write B \ A to deote the outcomes that are i B but ot i A. If A B, the P (B \ A) = P (B) P (A). Because P (B \ A) 0, we have the followig:. Mootoicity Rule If A B, the P (A) P (B) We already ow that for ay evet A, P (A) 0. The mootoicity rule adds to this the fact that P (A) P (Ω) = 1. This, the rage of a probability are the umbers betwee 0 ad The Iclusio-Exclusio Rule. For ay two evets A ad B, P (A B) = P (A) + P (B) P (A B) (4). (P (A) + P (B) accouts for the outcomes i A B twice, so remove P (A B).) Deal two cards. A = {ace o the secod card}, B = {ace o the first card} P (A B) = P (A) + P (B) P (A B) P {at least oe ace} = ? To complete this computatio, we will eed to compute P (A B) = P {both cards are aces}. 5. The Boferroi Iequality. For ay two evets A ad B, P (A B) P (A) + P (B). 5
6 Data Aalysis ad Probability 6. Cotiuity Property. Use the symbol to deote cotais i. If evets satisfy B 1 B 2 ad B = The, by the mootoicity rule, P (B i ) is a icreasig sequece satisfyig Similarly, use the symbol to deote cotais. If evets satisfy i=1 B i P (B) = lim i P (B i ). (5) C 1 C 2 ad C = Agai, by the mootoicity rule, P (C i ) is a decreasig sequece satisfyig Exercise 2 (odds). The statemet of a : b odds for a evet A idicates that Show that i=1 C i P (C) = lim i P (C i ). (6) P (A) P (A c ) = a b P (A) = a a + b. So, for example, 1 : 2 odds meas P (A) = 1/ ad 5 : odds meas P (A) = 5/8. 5 Coutig I the case of equally liely outcomes, fidig the probability of a evet A is the result of two coutig problems - amely fidig #(A), the umber of outcomes i A ad fidig #(Ω), the umber of outcomes i the probability space. These coutig problems ca become quite challegig ad advaced mathematical techiques have bee developed to address these problems.. However, havig some facility i coutig is ecessary to have a sufficietly rich umber of examples to give meaig to the axioms of probability. We begi this sectio o coutig with the multiplicatio priciple. Suppose that two experimets are to be performed. Experimet 1 ca have 1 possible outcomes ad for each outcome of experimet 1, experimet 2 has 2 possible outcomes. The together there are 1 2 possible outcomes. Example. For a group of idividuals, oe is chose to become the presidet ad a secod is chose to become the treasurer. By the multiplicatio priciple, if these positio are held by differet idividuals, the this tas ca be accomplished i ( 1) possible ways Exercise 4. Geeralize the multiplicatio priciple of coutig to experimets. 6
7 Data Aalysis ad Probability Assume that we have a collectio of objects ad we wish to mae a ordered arragemet of of these objects. Usig the geeralized priciple of coutig, the umber of possible outcomes is We will write this as () ad say fallig. Defiitio 5. The ordered arragemet of all objects is factorial. We tae 0! = 1. ( 1) ( + 1). () = ( 1) 1 =!, Exercise 6. () =! ( )!. 5.1 Combiatios Write ( ) for the umber of umber of differet groups of objects that ca be chose from a collectio of. We will ext fid a formula for this umber by coutig the umber of possible outcomes i two differet ways. To itroduce this with a cocrete example, suppose cities will be chose out of 8 uder cosideratio for a vacatio. If we thi of the vacatio as visitig three cities i a particular order, for example, The we are looig at permutatios. This results i New Yor the Bosto the Motreal choices. If we are just cosiderig the cities we visit, irrespective of order, the these uordered choices are combiatios. The umber of ways of doig this is writte ( ) 8, a umber that we do ot yet ow how to determie. After we have chose the three cities, we will also have to also pic a order to see the cities ad so usig the multiplicatio priciple, we have ( ) possible vacatios if the order of the cities is icluded i the choice. These two strategies are coutig the same possible outcomes ad so must be equal. ( ) ( ) = 2 1 or = Thus, we have a formula for ( 8 ). Let s do this more geerally. Theorem 7. ( ) = ()! The secod equality follows from the previous exercise. =!!( )!. 7
8 Data Aalysis ad Probability We will form a ordered arragemet of objects from a collectio of by: 1. First choosig a group of objects. The umber of possible outcomes for this experimet is ( ). 2. The, arragig this objects i order. The umber of possible outcomes for this experimet is!. So, by the multiplicatio priciple, () = ( )!. Now complete the argumetst by dividig both sides by!. Exercise 8 (biomial theorem). (x + y) = =0 ( ) x y. Exercise 9. ( ) ( 1 = ( 1) =. ) ( = ( ). Thus, we set ( ) = 0) = 1 The umber of combiatios is computed i R usig choose. For example, ( ) 8 > choose(8,) [1] 56 Theorem 10 (Pascal s triagle). ( ) = ( ) ( 1 ). To establish this idetity, distiguish oe of the objects i the collectio. Say that we are looig at a collectio of marbles, 1 are blue ad 1 is red. 1. For outcomes i which the red marble is chose, we must choose 1 marbles from the 1 blue marbles. Thus, ( 1 1) differet outcomes have the red marble. 2. If the red marble is ot chose, the we must choose blue marbles. Thus, ( ) 1 outcomes do ot have the red marbles.. These choices of groups of marbles have o overlap. Ad so ( ) is the sum of the values i 1 ad 2. To see this usig the example above, ( ) 8 = ( ) ( ) 7. Assume that oe of the 8 cities o the list icludes New Yor. The of the ( ( 8 ) vacatios, 7 2) iclude New Yor ad ( 7 ) do ot. This gives us a iterative way to compute the values of ( ). Build a table of values for (vertically) ad (horizotally). The, by the Pascal s triagle formula, a give table etry is the sum of the umber directly above it ad the umber above ad oe colum to the left. We ca get started by otig that ( ( 0) = ) = 1. 8
9 Data Aalysis ad Probability 1 1 ( ) ( 1 1 ) 1 ( ) Pascal s triagle the sum of these two umbers equals this umber Example 11. For the experimet o hoey bee quee - if we rear 60 of the 90 quee eggs, the we have > choose(90,60) [1] 6.71e+2 more tha 10 2 differet possible simple radom samples. Example 12. Deal out three cards. There are ( ) 52 possible outcomes. Let x be the umber of hearts. The we have chose x hearts out of 1 ad x cards that are ot hearts out of the remaiig 9. Thus, by the multiplicatio priciple there are ( ) ( ) 1 9 x x possible outcomes. To fid the probability of x hearts > x<-c(0:) > prob<-choose(1,x)*choose(9,-x)/choose(52,) > data.frame(x,prob) x prob Notice that > sum(prob) [1] 1 Exercise 1. Deal out 5 cards. Let x be the umber of fours. What values ca x tae? Fid the probability of x fours for each possible value. 6 Aswers to Selected Exercises /2, 2. /8,. 6/6 = 1/6 9
10 Data Aalysis ad Probability 7. If The, a b = P (A) P (A c ) = P (A) 1 P (A). a ap (A) = bp (A), a = (a + b)p (A), P (A) = a a + b. 9. Suppose that experimets are to be performed ad experimet i ca have i possible outcomes irrespective of the outcomes o the other 1 experimets. The together there are 1 2 possible outcomes. 12. () = ( 1) ( + 1) ( )! ( 1) ( + 1)( )!! = = ( )! ( )! ( )!. 14. Expasio of (x + y) = (x + y) (x + y) (x + y) will result i 2 terms. Each of the terms is achieved by oe choice of x or y from each of the factors i the product (x + y). Each oe of these terms will thus be a result i factors - some of them x ad the rest of them y. For a give from 0, 1,...,, we will see choices that will result i factors of x ad factors of y, i. e., x y. The umber of such choices is the combiatio ( ) Add these terms together to obtai ( ) x y. Next addig these values over the possible choices for results i (x + y) = =0 ( ) x y. 15. The formulas are easy to wor out. Oe way to cosider ( ) ( 1 = ( 1) is to ote that 1) is the umber of ways to choose 1 out of a possible. This is the same as ( 1), the umber of ways to exclude 1 out of a possible. A similar reasoig gives ( ) ( = ). 19. The possible values for x are 0, 1, 2,, ad 4. Whe we have chose x fours out of 4, we also have 5 x cards that are ot fours out of the remaiig 48. Thus, by the multiplicatio priciple, the probability of x fours is ( 4 ( x) 52 ) 5 x ( 52 5 ). 10
Math 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationWhat is Probability?
Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t kow what will happe o ay oe experimet, but has a log ru order. The cocept of probability
More informationTopic 8: Expected Values
Topic 8: Jue 6, 20 The simplest summary of quatitative data is the sample mea. Give a radom variable, the correspodig cocept is called the distributioal mea, the epectatio or the epected value. We begi
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationLectures 1 5 Probability Models
Lectures 1 5 Probability Models Aalogy with Geometry: abstract model for chace pheomea Laguage ad Symbols of Chace Experimets: Sample space S, cosistig of all possible outcomes (elemets e, f,..., evets
More informationCSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationUNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY
UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY Structure 2.1 Itroductio Objectives 2.2 Relative Frequecy Approach ad Statistical Probability 2. Problems Based o Relative Frequecy 2.4 Subjective Approach
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More informationAs stated by Laplace, Probability is common sense reduced to calculation.
Note: Hadouts DO NOT replace the book. I most cases, they oly provide a guidelie o topics ad a ituitive feel. The math details will be covered i class, so it is importat to atted class ad also you MUST
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationSome Basic Counting Techniques
Some Basic Coutig Techiques Itroductio If A is a oempty subset of a fiite sample space S, the coceptually simplest way to fid the probability of A would be simply to apply the defiitio P (A) = s A p(s);
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationChapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:
Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More information3.1 Counting Principles
3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout
More informationChapter 1 : Combinatorial Analysis
STAT/MATH 394 A - PROBABILITY I UW Autum Quarter 205 Néhémy Lim Chapter : Combiatorial Aalysis A major brach of combiatorial aalysis called eumerative combiatorics cosists of studyig methods for coutig
More informationIntroduction to Probability. Ariel Yadin. Lecture 2
Itroductio to Probability Ariel Yadi Lecture 2 1. Discrete Probability Spaces Discrete probability spaces are those for which the sample space is coutable. We have already see that i this case we ca take
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationCombinatorially Thinking
Combiatorially Thiig SIMUW 2008: July 4 25 Jeifer J Qui jjqui@uwashigtoedu Philosophy We wat to costruct our mathematical uderstadig To this ed, our goal is to situate our problems i cocrete coutig cotexts
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More information1. n! = n. tion. For example, (n+1)! working with factorials. = (n+1) n (n 1) 2 1
Biomial Coefficiets ad Permutatios Mii-lecture The followig pages discuss a few special iteger coutig fuctios You may have see some of these before i a basic probability class or elsewhere, but perhaps
More information1 Introduction. 1.1 Notation and Terminology
1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationINFINITE SEQUENCES AND SERIES
INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationLet us consider the following problem to warm up towards a more general statement.
Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More information7 Sequences of real numbers
40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are
More informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationPROBABILITY LOGIC: Part 2
James L Bec 2 July 2005 PROBABILITY LOGIC: Part 2 Axioms for Probability Logic Based o geeral cosideratios, we derived axioms for: Pb ( a ) = measure of the plausibility of propositio b coditioal o the
More informationPb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2
Axioms for Probability Logic Pb ( a ) = measure of the plausibility of propositio b coditioal o the iformatio stated i propositio a For propositios a, b ad c: P: Pb ( a) 0 P2: Pb ( a& b ) = P3: Pb ( a)
More informationChapter 9 Sequences, Series, and Probability Section 9.4 Mathematical Induction
Chapter 9 equeces, eries, ad Probability ectio 9. Mathematical Iductio ectio Objectives: tudets will lear how to use mathematical iductio to prove statemets ivolvig a positive iteger, recogize patters
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationPermutations, Combinations, and the Binomial Theorem
Permutatios, ombiatios, ad the Biomial Theorem Sectio Permutatios outig methods are used to determie the umber of members of a specific set as well as outcomes of a evet. There are may differet ways to
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationIf we want to add up the area of four rectangles, we could find the area of each rectangle and then write this sum symbolically as:
Sigma Notatio: If we wat to add up the area of four rectagles, we could fid the area of each rectagle ad the write this sum symbolically as: Sum A A A A Liewise, the sum of the areas of te triagles could
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Sprig 2018 (istructor Val Tae) Lecture 5 Thursday, Jauary 25 COUNTING We cotiue studyig how to use combiatios ad what are their properties. Example 5.1 How may 8-letter strigs ca be costructed
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationIntermediate Math Circles November 4, 2009 Counting II
Uiversity of Waterloo Faculty of Mathematics Cetre for Educatio i Mathematics ad Computig Itermediate Math Circles November 4, 009 Coutig II Last time, after lookig at the product rule ad sum rule, we
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter & Teachig Material.
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationMath 113 Exam 3 Practice
Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter 2 & Teachig
More informationPermutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination
Discrete Mathematic Chapter 3: C outig 3. The Basics of Coutig 3.3 Permutatios & Combiatios 3.5 Geeralized Permutatios & Combiatios 3.6 Geeratig Permutatios & Combiatios Dr Patrick Cha School of Computer
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationMath 220A Fall 2007 Homework #2. Will Garner A
Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationP1 Chapter 8 :: Binomial Expansion
P Chapter 8 :: Biomial Expasio jfrost@tiffi.kigsto.sch.uk www.drfrostmaths.com @DrFrostMaths Last modified: 6 th August 7 Use of DrFrostMaths for practice Register for free at: www.drfrostmaths.com/homework
More information4.1 Sigma Notation and Riemann Sums
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
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationIntroduction to Probability. Ariel Yadin. Lecture 7
Itroductio to Probability Ariel Yadi Lecture 7 1. Idepedece Revisited 1.1. Some remiders. Let (Ω, F, P) be a probability space. Give a collectio of subsets K F, recall that the σ-algebra geerated by K,
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal iversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationAP Calculus Chapter 9: Infinite Series
AP Calculus Chapter 9: Ifiite Series 9. Sequeces a, a 2, a 3, a 4, a 5,... Sequece: A fuctio whose domai is the set of positive itegers = 2 3 4 a = a a 2 a 3 a 4 terms of the sequece Begi with the patter
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio
More informationChapter 1. Probability
Chapter. Probability. Set defiitios 2. Set operatios 3. Probability itroduced through sets ad relative frequecy 4. Joit ad coditioal probability 5. Idepedet evets 6. Combied experimets 7. Beroulli trials
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationBasic Counting. Periklis A. Papakonstantinou. York University
Basic Coutig Periklis A. Papakostatiou York Uiversity We survey elemetary coutig priciples ad related combiatorial argumets. This documet serves oly as a remider ad by o ways does it go i depth or is it
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationREVIEW FOR CHAPTER 1
REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)
More informationSequences, Series, and All That
Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationConditional Probability. Given an event M with non zero probability and the condition P( M ) > 0, Independent Events P A P (AB) B P (B)
Coditioal robability Give a evet M with o zero probability ad the coditio ( M ) > 0, ( / M ) ( M ) ( M ) Idepedet Evets () ( ) ( ) () ( ) ( ) ( ) Examples ) Let items be chose at radom from a lot cotaiig
More informationMATHEMATICS. The assessment objectives of the Compulsory Part are to test the candidates :
MATHEMATICS INTRODUCTION The public assessmet of this subject is based o the Curriculum ad Assessmet Guide (Secodary 4 6) Mathematics joitly prepared by the Curriculum Developmet Coucil ad the Hog Kog
More informationSECTION 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 informationHere are some examples of algebras: F α = A(G). Also, if A, B A(G) then A, B F α. F α = A(G). In other words, A(G)
MATH 529 Probability Axioms Here we shall use the geeral axioms of a probability measure to derive several importat results ivolvig probabilities of uios ad itersectios. Some more advaced results will
More informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationWHAT COOL MATH! JULY CURRICULUM INSPIRATIONS: Math for America DC:
CURRICULUM INSPIRATIONS: www.maa.org/ci Math for America DC: www.mathforamerica.org/dc Iovative Olie Courses: www.gdaymath.com Tato Tidbits: www.jamestato.com WHAT COOL MATH! CURIOUS MATHEMATICS FOR FUN
More informationMassachusetts Institute of Technology
Solutios to Quiz : Sprig 006 Problem : Each of the followig statemets is either True or False. There will be o partial credit give for the True False questios, thus ay explaatios will ot be graded. Please
More informationA Proof of Birkhoff s Ergodic Theorem
A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationThe Binomial Theorem
The Biomial Theorem Lecture 47 Sectio 9.7 Robb T. Koether Hampde-Sydey College Fri, Apr 8, 204 Robb T. Koether (Hampde-Sydey College The Biomial Theorem Fri, Apr 8, 204 / 25 Combiatios 2 Pascal s Triagle
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationProbability, Expectation Value and Uncertainty
Chapter 1 Probability, Expectatio Value ad Ucertaity We have see that the physically observable properties of a quatum system are represeted by Hermitea operators (also referred to as observables ) such
More informationUSA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year
/3/27. Fill i each space of the grid with either a or a so that all sixtee strigs of four cosecutive umbers across ad dow are distict. You do ot eed to prove that your aswer is the oly oe possible; you
More informationPUTNAM TRAINING PROBABILITY
PUTNAM TRAINING PROBABILITY (Last udated: December, 207) Remark. This is a list of exercises o robability. Miguel A. Lerma Exercises. Prove that the umber of subsets of {, 2,..., } with odd cardiality
More information