# Chapter 3: The basic concepts of probability

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Chapter 3: The basic concepts of probability Experiment: a measurement process that produces quantifiable results (e.g. throwing two dice, dealing cards, at poker, measuring heights of people, recording proton-proton collisions) Outcome: a single result from a measurement (e.g. the numbers shown on the two dice) Sample space: the set of all possible outcomes from an experiment (e.g. the set of all possible five-card hands) The number of all possible outcomes may be (a) finite (e.g. all possible outcomes from throwing a single die; all possible 5-card poker hands) (b) countably infinite (e.g. number of proton-proton events to be made before a Higgs boson event is observed) or (c) constitute a continuum (e.g. heights of people) In case (a), the sample space is said to be finite in cases (a) and (b), the sample space is said to be discrete in case (c), the sample space is said to be continuous

2 In this chapter we consider discrete, mainly finite, sample spaces An event is any subset of a sample set (including the empty set, and the whole set) Two events that have no outcome in common are called mutually exclusive events. In discussing discrete sample spaces, it is useful to use Venn diagrams and basic settheory. Therefore we will refer to the union (A U B), intersection, (A B) and complement (Ᾱ) of events A and B. We will also use set-theory relations such as A U B = A B (Such relations are often proved using Venn diagrams) This is also called De Morgan s law, another half of De Mogan s law is: A B=A B

3 A dice has six sides, each side has a distinct number (1-6) dots

4 Some terminology used in card game Flush: A flush is a hand of playing cards where all cards are of the same suit. Straight: Three of a kind:

5 e.g.: outcome = 5-card poker hand Event C (straight flush) has 40 outcomes sample space S: 2,598,960 possible 5-card hands (2,598,960 outcomes) The sample space is drawn as a Venn diagram B: straights A : no numbers repeat A: at least 1 number repeats C: straight flushes D: a number repeats 2x D E: full house E: a number repeats 3x An experiment might consist of dealing 10, card hands

6

7

8 De Morgan s Law (1): A B=A B

9 De Morgan s Law (2): A B=A B

10 Example: U=(3,4,2,8,9,10,27,23,14) A=(2,4,8) B=(3,4,8,27) A =(3,9,10,27,23,14) B=(2,9,10,23,14) A B=(2,3,4,8,27) A B=(4,8) A B=(2) A B=(9,10,23,14) A B=(3,9,10,27,23,14,2)

11

12 The classical definition of probability (classical probability concept) states: If there are m outcomes in a sample space (universal set), and all are equally likely of being the result of an experimental measurement, then the probability of observing an event (a subset) that contains s outcomes is given by s m From the classical definition, we see that the ability to count the number of outcomes in an event, and the number of outcomes in the entire sample space (universal set) is of critical importance.

13 Counting principles: The addition principle: If there are n 1 outcomes in event A 1, n 2 outcomes in event A 2, n k outcomes in event A k and the events A 1, A 2, A k are mutually distinct (share no outcomes in common), then the total number of outcomes in A 1 U A 2 U U A k is n 1 + n n k A 1 A 2 A 3 A 4 A n A single outcome may consist of several distinct parts (e.g. an arrangement of 7 objects; throwing a red and a green die). Such outcomes are said to be composite

14 The multiplication principle: If a composite outcome can be described by a procedure that can be broken into k successive (ordered) stages such that there are n 1 outcomes in stage 1, n 2 outcomes in event 2, n k outcomes in event k and if the number of outcomes in each stage is independent of the choices in previous stages and if the composite outcomes are all distinct then the number of possible composite outcomes is n 1 n 2 n k e.g. suppose the composite outcomes of the trio (M.P,C) of class values for cars, where M denotes the mileage class (M 1, M 2, or M 3 ) P denotes the price class (P 1, or P 2 ) C denotes the operating cost class (C 1, C 2, or C 3 ) The outcome is clearly written as a 3-stage value There are 3 outcomes in class M, 2 in class P and 3 in class C The number of outcomes in class P does not depend on the choice made for M, etc Then there will be = 18 distinct composite outcomes for car classification.

15 When the number of composite outcomes is relatively small, the counting can also be done via a tree diagram as illustrated in Fig. 3.5 (page 50) of the text. Such a method is tedious and is much less efficient than using the multiplication principle. outcomes C 1 M 1 P 1 C 1 P 1 C 2 M 1 P 1 C 2 M 1 C 3 M 1 P 1 C 3 C 1 M 1 P 2 C 1 P 2 P 1 C 2 C 3 C 1 M 1 P 2 C 2 M 1 P 2 C 3 M 2 P 1 C 1 C 2 M 2 P 1 C 2 M 2 C 3 M 2 P 1 C 3

16 e.g. an outcome of an experiment consists of an operator using a machine to test a type of sample. If there are 4 different operators, 3 different machines, and 8 different types of samples, how many experimental outcomes are possible?

17 Note: the conditions of the multiplication principle must be strictly adhered to for it to work. e.g. the number of distinct outcomes obtained from throwing two identical six-sided dice cannot be obtained by considering this as a two stage process (the result from the first die and then the result from the second since the outcomes from the two stages are not distinct. There are not 36 possible outcomes from throwing two identical six-sided dice; there are only 21 distinct outcomes. e.g. the number of distinct outcomes obtained from throwing a red six-sided dice and a green six-sided dice can be determined by the multiplication principle. There are 36 possible outcomes in this case. e.g. the number of 5-card poker hands comprised of a full house can be computed using the multiplication principle. A full house can be considered a two-stage hand, the first stage being the pair, the second stage being the three-of-a-kind. Thus the number of possible full house hands = (the number of pairs) x (the number of threes-of-a-kind) e.g. the number of 5-card poker hands comprised of a full house that do not contain the 10 s as the three-of-a-kind cannot be computed using the multiplication principle since the number of choices for the three-of-a-kind depends on whether-or-not the pair consists of 10 s

18 Two common counting problems are a) r permutations of n distinct objects, b) r combinations of n distinct objects

19 r permutations Given n distinct objects, how many ways are there to arrange exactly r of the objects? An arrangement is a sequence (ordered stages) of successive objects. An arrangement can be thought of as putting objects in slots. There is a distinct first slot, second slot,., k th slot, and so on. Putting object A in the first slot and B in the second is a distinct outcome from putting B in the first and A in the second. The number of possible choices for slot k+1 does not depend on what choice is used for slot k. Therefore the multiplication principle can be used. Thus the number of ways to arrange r of the n distinct objects is np r = n n 1 n 2. n r + 1 Multiplying and dividing by (n r)!, this can be written np r = n n 1 n 2. n r+1 n r! n r! = n! n r! Theorem 3.2 The number of r permutations of n distinct objects (that is the number of ways to arrange exactly r objects out of a set of n distinct objects) is Note: np r = n! n r! The number of ways to arrange all n objects is np n = n! (as 0! 1) The number of ways to arrange zero of the n objects is np 0 = n! n! = 1

20 Yang Hui in 1305 Pascal in 1655 Tartaglia in 1600 s

21 n Pascal triangle: the n-th row and the r-th element: with n and r start r n from 0 (not 1). Pascal triangle is symmetric because r = n n r. Another property is that the summation of the n-th row is 2 n e.g. chose 3 people out of 180 to act as fire wardens = 180! 3!177! e.g select 5 new faculty consisting of 2 chemists (from a pool of 21 applicants) and 3 physicists (from a different pool of 47 applicants) 21 2 x 47 3 e.g. choose 5 people from a class of 143 and seat them in a row of 5 chairs at the front of the class 143P 5 = 143! 138!

22 The classical definition of probability If there are m outcomes in a sample space, and all are equally likely of being the result of an experimental measurement, then the probability of observing an event that contains s outcomes is given by s m e.g. Probability of drawing an ace from a deck of 52 cards. sample space consists of 52 outcomes. desired event (ace) is a set of 4 outcomes (number of desired outcomes is 4) therefore the probability of getting an ace is 4/52 = 1/ (7.69%) e.g. There are 10 motors, two of which do not work and eight which do. a) what is the probability of picking 2 working motors (8!/2!/6!)/(10!/2!/8!)=(8!2!8!)/(10!2!6!)=(8!8!)/(10!6!) b) what is the probability of picking 1 working and 1 non-working motors c) S=2*8, m=10!/2!/8! P=16*2!*8!/10!

23 Mathematically, in defining probabilities of events we are deriving a set function on a sample space. A set function assigns to each subset in the sample space a real number. Example: Consider the set function that assigns to each subset (event) A the number N(A) of outcomes in the set. This set function is additive, that is, if two events A and B have no outcomes in common (are mutually exclusive), then N(A U B) = N(A) + N(B). Counter-example: Fig. 3.7 Fig Measurements on 500 machine parts I = incompletely assembled, D = defective, S = satisfactory N(I D) N(I)+N(D) as N and D are not mutually exclusive

24 The axioms of probability Let S be a finite sample space, A an event in S. We define P(A), the probability of A, to be the value of an additive set function P( ) that satisfies the following three conditions Axiom 1 0 P A Axiom 2 P S = 1 1 for each event A in S (probabilities are real numbers on the interval [0,1]) (the probability of some event occurring from S is unity) Axiom 3 If A and B are mutually exclusive events in S, then P A U B = P A + P(B) (the probability function is an additive set function) Note: these axioms do not tell us what the set function P(A) is, only what properties it must satisfy The classical definition of probability defines the probability function as P A = N(A) N(S) for any event A in the sample space S Note that this definition satisfies all three axioms

25 Elementary properties of probability functions Theorem 3.4. If A 1, A 2,, A n are mutually exclusive events in a sample space S, then by induction on Axiom 3, P A 1 U A 2 U U A n = P A 1 + P A P(A n )

26 Theorem 3.7. If A is an event in S, then P A Proof: P A + P A = P A A = P S = 1 = 1 P(A) Example: drawing 5 card with at least one spade N(A) is very difficult to count, but N(A ) is easier, P A = 1 P A =

27 Elementary properties of probability functions Theorem 3.6. If A and B are any (not necessarily mutually exclusive) events in S, then P A B = P A + P B P(A B) Example: Find the probability of drawing 5 card with one spade or one club. A: drawing 5 cards with one spade; B: drawing 5 card with one club N(A) = 1 4, N(B) = , N(A B) = P(A B) =

28 I I D D S Fig Measurements on 500 machine parts I = incompletely assembled, D = defective, S = satisfactory Probability of picking up a unsatisfactory part: I union D, P(I union D)=P(I) + P(D) P(I intersect D) =30/ /500-10/500 =25/500

29 Conditional Probability. The probability of an event is only meaningful if we know the sample space S under consideration. The probability that you are the tallest person changes if we are discussing being the tallest person in your family, or the tallest person in this class. This is clarified using the notation P(A S), the conditional probability of event A relative to the sample space S. (When S is understood we simply use P(A)) e.g. (using classical probability) From Fig. 3.7, P D = P D S = N(D) N(S) = N(D S) N(S) = = = 0.03 Note: P(D I) = P D I = N(D I) N(I) N(D I) N(S) N(I) N(S) = = 1 3 = = P(D I) P(I)

30 Conditional Probability. If A and B are any events in S and P(B) 0, the conditional probability of A relative to B (i.e. A often stated of A given B ) is P A B = P(A B) P(B) (CP) From the definition of conditional probability (CP) we see that P(B A) P B A = P(A) Since P B A = P A B, we have from (CP) and (*) ( ) Theorem 3.8. If A and B are events in S, then P A B = P(A) P B A if P A 0 (from ) P(B) P A B if P B 0 (from CP ) Theorem 3.8 is the general multiplication rule of probability

31 Theorem 3.8 is a rather shocking statement. The definition (CP) of conditional probability implies that we compute P(A B) by knowing P(A B) and P(B). However, Theorem 3.8 implies we can compute P(A B) by knowing P(A B) and P(B). This implies that we often have another means at hand for computing P(A B) rather than the definition (CP)!! (See next example) The Venn Diagram on Conditional probability

32 e.g. Use of the general multiplication rule 20 workers, 12 are For, 8 are Against. What is the probability of randomly picking 2 workers that are Against? (Assume classical probability). There are 4 classes out outcomes for the 2-picks: FF, FA, AF, AA A diagram of the sample space of all 2 picks is Set A: all outcomes where first worker is A Set B: all outcomes where second worker is A Desire P A B = P(A) P(B A) A A B B AF AA FA FF Therefore P A B = = S P(A) = the probability that the first is against = probability of picking one against from the 20 workers = N(against)/N(workers) = 8/20 P(B A) = the probability that the second is against given that the first pick is against = probability of picking one against from 19 workers (1 against removed) = N(against)/N(workers) = 7/19

33 Check by classical calculation of probability P A = = 8 20 A A B B N(AF) = 8 12 N(AA) = 8 7 N(FA) = 12 8 P B A = = 7 19 N(FF) = N(S) = P A B = N(A B) N(S) =

34 If we find that P A B = P(A), then we state that event A is independent of event B We will see that event A is independent of event B iff event B is independent of event A. It is therefore customary to state that A and B are independent events. Theorem 3.9. Two events A and B are independent events iff P A B Proof: If A and B are independent, that is P B A = P B Then, by Theorem 3.8, P A B = P A P B A = P(A) P(B) If P A B = P(A) P(B) Then, by definition of conditional probability, P A B = P(A B) P(B) = P(A) P(B) P(B) = P(A) = P(A) P(B) Theorem 3.9 is the special product rule of probability and states that the probability that two independent events will both occur is the product of the probabilities that each alone will occur.

35 Example: probability of getting two heads in two flips of a balanced coin (Assumption is that balance implies that the two flips are independent) Therefore P A B = P(A) P(B) A First flip is heads B Second flip is heads A First draw is Ace B Second draw is Ace S S Example: probability of selecting two aces at random from a deck of cards if first card replaced before second card drawn (Assumption is that replacing first card returns deck to original conditions making the two draws independent of each other ) Therefore P A B = P(A) P(B)

36 Example: probability of selecting two aces at random from a deck of cards if first card not replaced before second card drawn (Picking the second card is now dependent on the first card choice) Therefore P A B = P(A) P(B A) A First draw is Ace B Second draw is Ace S

37 Example: (false positives) 1% probability of getting a false reading on a test Assuming that each test is independent of the others: (a) probability of two tests receiving an accurate reading (0.99) 2 (b) probability of 1 test per week for 2 years all receiving accurate readings (0.99) (!) (65% chance that 1 or more of the 104 tests fail)

38 Example: redundancy in message transmission to reduce transmission errors probability p that a 0 1 or 1 0 error occurs in transmission sent reception probability read Probability possibility of reception as of reading (1 p) p(1 p) p(1 p) p 2 (1 + 2p) 011 p(1 p) p 2 (1 p) p 2 (1 p) p 2 (1 p) 000 p 2 (3 2p) 000 p p triple mode Prob of reading correct single mode

39 Theorem 3.8 shows that P(A B) and P(B A) are related, specifically: P B A = P B P(A B) P(A) (B) A P(B A) A B B Remember, P(A B) is the ratio of the probability of event A B to the probability of event A and P(B A) is the ratio of the probability of event A B to the probability of event B P(A B) S Therefore to go from P(A B) to P(B A) one has to apply a correction, by multiplying and dividing respectively, by the probability of B and the probability of A. In the above Figure probabilities are represented by area. P(B A) is larger than P(A B) by the area fraction P(B)/P(A)

40 Example: each year about 1/1000 people will develop lung cancer. Suppose a diagnostic method is 99.9 percent accurate (if you have cancer, it will be 99.9 Percent being diagnosed as positive, if you don t have cancer, it will be 0.1 percent Being diagnosed as positive). If you are diagnosed as positive for lunge Cancer, what is the probability that you really have cancer? Solution: Your being not have lung cancer is A, your being diagnosed positive is B. If you are diagnosed positive, what is the probability of being healthy? That is P(A) = 0.999, P(B/A) = 0.001, P(B) =? P(A/B) = P(A) P(B) P(B/A) P(B) = P(B/A)P(A) + P(B/A )P(A ) = 0.001* *0.001 = Substituting into the calculation: P(A/B) = 0.999*0.001/ = 0.5

41 A B False positive: P(A B) = P(A B) P(B) = N(A B) N(B) A B

42

43 The evolution of thinking

44 The relation P B A = P B P(A B) P(A) is a specific example of Bayes Theorem. On the right hand side we have the (conditional) probability of getting outcome A considered as part of event B (having occurred). On the left hand side, we have the probability of getting outcome B considered as part of event A (having occurred). This can be diagrammed as follows: S P(A) A P(B A) P(A B) A B B P(B) S or more completely.

45 Partition all outcomes into those with and without property A and then subpartition into those with and without property B P A B P B = P A B = P B A P(A) P A B P B = P A B = P B A P(A ) Partition all outcomes into those with and without property B and then subpartition into those with and without property A

46 A B B A B A B A A B A B A B B A A B A A B B

47 Bayes result can be generalized. Consider three mutually exclusive events, B 1, B 2, and B 3, one of which must occur. e.g. B i are supply companies of voltage regulators to a single manufacturer. Let A be the event that a voltage regulator works satisfactorily. This might be diagrammed as follows for a hypothetical manufacturer B 1 P A B 1 = 0.95 A B 1 S all voltage regulators B 2 P B 2 = 0.3 P A B 2 = 0.80 A B 2 A P A B 3 = 0.65 A B 3 B 3 P B 1 = 0.6 is the probability of getting a regulator from company B 1 P A B 1 = 0.95 is the probability of getting a working regulator from company B 1 Choosing at random from all regulators, what is the probability of getting a working regulator? (i.e. what is P(A)?)

48 S all voltage regulators supplier B 1 A working voltage regulators supplier B 2 supplier B 3

49 From the diagram we see A = A B 1 B 2 B 3 = A B 1 A B 2 A B 3 As B 1, B 2, and B 3 are mutually exclusive so are A B 1, A B 2, and A B 3 (see diagram) By Theorem 3.4 P A = P A B 1 + P A B 2 + P A B 3 By Theorem 3.8 P A = P(B 1 ) P A B 1 + P(B 2 ) P A B 2 + P(B 3 ) P A B 3 Theorem 3.10 If B 1, B 2,, B n are mutually exclusive events of which one must occur, then for event A n P A = i=1 P(B i ) P A B i

50 Example: each year about 1/1000 people will develop lung cancer. Suppose a diagnostic method is 99.9 percent accurate (if you have cancer, it will be 99.9 Percent being diagnosed as positive, if you don t have cancer, it will be 0.1 percent Being diagnosed as positive). If you are diagnosed as positive for lunge Cancer, what is the probability that you really have cancer? Now let s change the question: what is the probability that a person is tested positive? Solution: If a person is sick, there is a probability of to be tested positive; If a person is healthy, there is a probability of to be testes positive. A: a person is healthy; A : a person has lung cancer. B: a person is tested positive. P A = 0.999; P A = 0.001; P B A = 0.001; P B A = P B = P A P B A + P A P B A = =

51 Theorem 3.10 expresses the probability of event A in terms of the probabilities that each of the constituent events B i provided event A (i.e. in our example, P(A) is expressed in terms of the probabilities that constituent B i provided a working regulator) Suppose, we want to know the probability that a working regulator came from a particular event B i? e.g. suppose we wanted to know P B 3 A By definition of conditional probability P B 3 A = P(B 3 A) P(A) = P(A B 3) P(A) = P(B 3) P(A B 3 ) P(A) P(B 3 ) P(A B 3 ) = 3 P(B i ) P A B i i=1 ) Theorem 3.8 Theorem From the tree diagram P B 3 A = = The probability that a regulator comes from B 3 is 0.1 The probability that a working regulator comes from B 3 is P B 3 A = 0.074

52 The generalization of this three set example is Bayes theorem Theorem 3.11 If B 1, B 2,, B n are mutually exclusive events of which one must occur, then P(B r ) P(A B r ) P B r A = n i=1 P(B i ) P A B i ) for r = 1, 2,, n The numerator in Bayes theorem is the probability of achieving event A through the r th branch of the tree. The denominator is the sum of all probabilities of achieving event A.

53 e.g. Janet (B 1 ) handles 20% of the breakdowns in a computer system Tom (B 2 ) handles 60% Georgia (B 3 ) handles 15% Peter (B 4 ) handles 5% Janet makes an incomplete repair 1 time in 20 (i.e. 5% of the time) Tom: 1 time in 10 (10%) Georgia: 1 time in 10 (10%) Peter: 1 time in 20 (5%) If a system breakdown is incompletely repaired, what is the probability that Janet made the repair? (i.e. desire P(B 1 A)) B 1 P A B 1 = 0.05 A B 1 all breakdowns S B 2 P A B 2 = 0.10 A B 2 P A B 3 = 0.10 A B 3 B 3 A all incomplete repairs P A B 4 = 0.05 A B 4

54 The probability that the incomplete repair was made by Janet is P B 1 A = (0.2)(0.05)+(0.6)(0.1)+(0.15)(0.1)+(0.05)(0.05) = Therefore, although Janet makes an incomplete repair only 5% of the time, because she handles 20% of all breakdowns, she is the cause of 11.4% of all incomplete repairs

55 Summary of the chapter 1. Sample space, event, set operation, and Venn diagram 2. Counting principles, addition and multiplication 3. Permutation and combination 4. Classical probability, axioms 5. Independent events 6. Conditional probability 7. Bayes theorem

56 1. De Morgan s law 2. np r = n! n r! Formulas to remember n r = n! n r!r! A B = A B A B = A B 3. P A = N(A) N(S) 4. N A B = N A + N B N A B 5. P A B = P A + P B P A B 6. P A = 1 P(A ) 7. For independent events A and B: P A B = P A P(B) 8. Conditional probability: P A B = P(A B) P(B) 9. If A and B are independent, P A B = P(A), P B A = P(B) 10. Theorem 3.8 (bridge theorem) P A P B A = P A B = P B P(A B) 11. Total probability n P A = P B i P(A B i ) i=1 B i s are mutually exclusive partition of the sample space.

57 12. Bayes theorem: P B P(A B) P B A = P(A) = P B P A B P B P(A B) + P B P(A B) 13. This can be generalized to give: P B r A = P B r P(A B r ) P(A) = P B r P(A B r ) n P B i P(A B i ) i=1 r = 1,2,, n 14. Independent events are NOT exclusive events.

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University

Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University 1 Chapter 1 Probability 1.1 Basic Concepts In the study of statistics, we consider experiments

### Probability OPRE 6301

Probability OPRE 6301 Random Experiment... Recall that our eventual goal in this course is to go from the random sample to the population. The theory that allows for this transition is the theory of probability.

### Discrete Mathematics Lecture 5. Harper Langston New York University

Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = -1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of

### Basic Probability Concepts

page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes

### Lecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett

Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.

Probability Worksheet 2 NAME: Remember to leave your answers as unreduced fractions. We will work with the example of picking poker cards out of a deck. A poker deck contains four suits: diamonds, hearts,

### Jan 17 Homework Solutions Math 151, Winter 2012. Chapter 2 Problems (pages 50-54)

Jan 17 Homework Solutions Math 11, Winter 01 Chapter Problems (pages 0- Problem In an experiment, a die is rolled continually until a 6 appears, at which point the experiment stops. What is the sample

### 4.3. Addition and Multiplication Laws of Probability. Introduction. Prerequisites. Learning Outcomes. Learning Style

Addition and Multiplication Laws of Probability 4.3 Introduction When we require the probability of two events occurring simultaneously or the probability of one or the other or both of two events occurring

### IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION 1 WHAT IS STATISTICS? Statistics is a science of collecting data, organizing and describing it and drawing conclusions from it. That is, statistics

### What is the probability of throwing a fair die and receiving a six? Introduction to Probability. Basic Concepts

Basic Concepts Introduction to Probability A probability experiment is any experiment whose outcomes relies purely on chance (e.g. throwing a die). It has several possible outcomes, collectively called

### Elements of probability theory

2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted

### Definition and Calculus of Probability

In experiments with multivariate outcome variable, knowledge of the value of one variable may help predict another. For now, the word prediction will mean update the probabilities of events regarding the

### Probability. Sample space: all the possible outcomes of a probability experiment, i.e., the population of outcomes

Probability Basic Concepts: Probability experiment: process that leads to welldefined results, called outcomes Outcome: result of a single trial of a probability experiment (a datum) Sample space: all

### Probability - Part I. Definition : A random experiment is an experiment or a process for which the outcome cannot be predicted with certainty.

Probability - Part I Definition : A random experiment is an experiment or a process for which the outcome cannot be predicted with certainty. Definition : The sample space (denoted S) of a random experiment

### Probability. Section 9. Probability. Probability of A = Number of outcomes for which A happens Total number of outcomes (sample space)

Probability Section 9 Probability Probability of A = Number of outcomes for which A happens Total number of outcomes (sample space) In this section we summarise the key issues in the basic probability

### + Section 6.2 and 6.3

Section 6.2 and 6.3 Learning Objectives After this section, you should be able to DEFINE and APPLY basic rules of probability CONSTRUCT Venn diagrams and DETERMINE probabilities DETERMINE probabilities

### Chapter 4: Probability and Counting Rules

Chapter 4: Probability and Counting Rules Learning Objectives Upon successful completion of Chapter 4, you will be able to: Determine sample spaces and find the probability of an event using classical

### Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

### PROBABILITY NOTIONS. Summary. 1. Random experiment

PROBABILITY NOTIONS Summary 1. Random experiment... 1 2. Sample space... 2 3. Event... 2 4. Probability calculation... 3 4.1. Fundamental sample space... 3 4.2. Calculation of probability... 3 4.3. Non

### Lesson 1. Basics of Probability. Principles of Mathematics 12: Explained! www.math12.com 314

Lesson 1 Basics of Probability www.math12.com 314 Sample Spaces: Probability Lesson 1 Part I: Basic Elements of Probability Consider the following situation: A six sided die is rolled The sample space

### P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

### E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

### Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

### A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

### Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 22

CS 70 Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 22 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette

### Math/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability

Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock

### Probability. A random sample is selected in such a way that every different sample of size n has an equal chance of selection.

1 3.1 Sample Spaces and Tree Diagrams Probability This section introduces terminology and some techniques which will eventually lead us to the basic concept of the probability of an event. The Rare Event

### Statistics 100A Homework 2 Solutions

Statistics Homework Solutions Ryan Rosario Chapter 9. retail establishment accepts either the merican Express or the VIS credit card. total of percent of its customers carry an merican Express card, 6

### Combinatorial Proofs

Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A

### Bayesian Tutorial (Sheet Updated 20 March)

Bayesian Tutorial (Sheet Updated 20 March) Practice Questions (for discussing in Class) Week starting 21 March 2016 1. What is the probability that the total of two dice will be greater than 8, given that

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### Section 6-5 Sample Spaces and Probability

492 6 SEQUENCES, SERIES, AND PROBABILITY 52. How many committees of 4 people are possible from a group of 9 people if (A) There are no restrictions? (B) Both Juan and Mary must be on the committee? (C)

### SECTION 10-5 Multiplication Principle, Permutations, and Combinations

10-5 Multiplication Principle, Permutations, and Combinations 761 54. Can you guess what the next two rows in Pascal s triangle, shown at right, are? Compare the numbers in the triangle with the binomial

### A Few Basics of Probability

A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study

### Worked examples Basic Concepts of Probability Theory

Worked examples Basic Concepts of Probability Theory Example 1 A regular tetrahedron is a body that has four faces and, if is tossed, the probability that it lands on any face is 1/4. Suppose that one

### Probabilities and Random Variables

Probabilities and Random Variables This is an elementary overview of the basic concepts of probability theory. 1 The Probability Space The purpose of probability theory is to model random experiments so

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 7, due Wedneday, March 14 Happy Pi Day! (If any errors are spotted, please email them to morrison at math dot berkeley dot edu..5.10 A croissant

### Probability and Counting

Probability and Counting Basic Counting Principles Permutations and Combinations Sample Spaces, Events, Probability Union, Intersection, Complements; Odds Conditional Probability, Independence Bayes Formula

### Chapter 4. Probability and Probability Distributions

Chapter 4. robability and robability Distributions Importance of Knowing robability To know whether a sample is not identical to the population from which it was selected, it is necessary to assess the

### MATHEMATICS FOR ENGINEERS STATISTICS TUTORIAL 4 PROBABILITY DISTRIBUTIONS

MATHEMATICS FOR ENGINEERS STATISTICS TUTORIAL 4 PROBABILITY DISTRIBUTIONS CONTENTS Sample Space Accumulative Probability Probability Distributions Binomial Distribution Normal Distribution Poisson Distribution

### CONTINGENCY (CROSS- TABULATION) TABLES

CONTINGENCY (CROSS- TABULATION) TABLES Presents counts of two or more variables A 1 A 2 Total B 1 a b a+b B 2 c d c+d Total a+c b+d n = a+b+c+d 1 Joint, Marginal, and Conditional Probability We study methods

### Basic concepts in probability. Sue Gordon

Mathematics Learning Centre Basic concepts in probability Sue Gordon c 2005 University of Sydney Mathematics Learning Centre, University of Sydney 1 1 Set Notation You may omit this section if you are

### Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?

ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the

### Basic Probability Theory I

A Probability puzzler!! Basic Probability Theory I Dr. Tom Ilvento FREC 408 Our Strategy with Probability Generally, we want to get to an inference from a sample to a population. In this case the population

### Statistical Inference. Prof. Kate Calder. If the coin is fair (chance of heads = chance of tails) then

Probability Statistical Inference Question: How often would this method give the correct answer if I used it many times? Answer: Use laws of probability. 1 Example: Tossing a coin If the coin is fair (chance

### AP Stats - Probability Review

AP Stats - Probability Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. I toss a penny and observe whether it lands heads up or tails up. Suppose

### Lecture 4: Probability Spaces

EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 4: Probability Spaces Lecturer: Dr. Krishna Jagannathan Scribe: Jainam Doshi, Arjun Nadh and Ajay M 4.1 Introduction

### The concept of probability is fundamental in statistical analysis. Theory of probability underpins most of the methods used in statistics.

Elementary probability theory The concept of probability is fundamental in statistical analysis. Theory of probability underpins most of the methods used in statistics. 1.1 Experiments, outcomes and sample

### Probability & Probability Distributions

Probability & Probability Distributions Carolyn J. Anderson EdPsych 580 Fall 2005 Probability & Probability Distributions p. 1/61 Probability & Probability Distributions Elementary Probability Theory Definitions

### Section 6.2 Definition of Probability

Section 6.2 Definition of Probability Probability is a measure of the likelihood that an event occurs. For example, if there is a 20% chance of rain tomorrow, that means that the probability that it will

### Fundamentals of Probability

Fundamentals of Probability Introduction Probability is the likelihood that an event will occur under a set of given conditions. The probability of an event occurring has a value between 0 and 1. An impossible

### Question of the Day. Key Concepts. Vocabulary. Mathematical Ideas. QuestionofDay

QuestionofDay Question of the Day What is the probability that in a family with two children, both are boys? What is the probability that in a family with two children, both are boys, if we already know

### PROBABILITIES AND PROBABILITY DISTRIBUTIONS

Published in "Random Walks in Biology", 1983, Princeton University Press PROBABILITIES AND PROBABILITY DISTRIBUTIONS Howard C. Berg Table of Contents PROBABILITIES PROBABILITY DISTRIBUTIONS THE BINOMIAL

### Probability definitions

Probability definitions 1. Probability of an event = chance that the event will occur. 2. Experiment = any action or process that generates observations. In some contexts, we speak of a data-generating

### Math 2001 Homework #10 Solutions

Math 00 Homework #0 Solutions. Section.: ab. For each map below, determine the number of southerly paths from point to point. Solution: We just have to use the same process as we did in building Pascal

### Contemporary Mathematics Online Math 1030 Sample Exam I Chapters 12-14 No Time Limit No Scratch Paper Calculator Allowed: Scientific

Contemporary Mathematics Online Math 1030 Sample Exam I Chapters 12-14 No Time Limit No Scratch Paper Calculator Allowed: Scientific Name: The point value of each problem is in the left-hand margin. You

### 8.3 Probability Applications of Counting Principles

8. Probability Applications of Counting Principles In this section, we will see how we can apply the counting principles from the previous two sections in solving probability problems. Many of the probability

### I. WHAT IS PROBABILITY?

C HAPTER 3 PROBABILITY Random Experiments I. WHAT IS PROBABILITY? The weatherman on 0 o clock news program states that there is a 20% chance that it will snow tomorrow, a 65% chance that it will rain and

### 4.4 Conditional Probability

4.4 Conditional Probability It is often necessary to know the probability of an event under restricted conditions. Recall the results of a survey of 100 Grade 12 mathematics students in a local high school.

### It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

### The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

### Chapter 1 Axioms of Probability. Wen-Guey Tzeng Computer Science Department National Chiao University

Chapter 1 Axioms of Probability Wen-Guey Tzeng Computer Science Department National Chiao University Introduction Luca Paccioli(1445-1514), Studies of chances of events Niccolo Tartaglia(1499-1557) Girolamo

### Probability and Statistics Vocabulary List (Definitions for Middle School Teachers)

Probability and Statistics Vocabulary List (Definitions for Middle School Teachers) B Bar graph a diagram representing the frequency distribution for nominal or discrete data. It consists of a sequence

### Probability Using Dice

Using Dice One Page Overview By Robert B. Brown, The Ohio State University Topics: Levels:, Statistics Grades 5 8 Problem: What are the probabilities of rolling various sums with two dice? How can you

### 2Probability CHAPTER OUTLINE LEARNING OBJECTIVES

2Probability CHAPTER OUTLINE 2-1 SAMPLE SPACES AND EVENTS 2-1.1 Random Experiments 2-1.2 Sample Spaces 2-1.3 Events 2-1.4 Counting Techniques (CD Only) 2-2 INTERPRETATIONS OF PROBABILITY 2-2.1 Introduction

### Probabilistic Strategies: Solutions

Probability Victor Xu Probabilistic Strategies: Solutions Western PA ARML Practice April 3, 2016 1 Problems 1. You roll two 6-sided dice. What s the probability of rolling at least one 6? There is a 1

### ECE302 Spring 2006 HW1 Solutions January 16, 2006 1

ECE302 Spring 2006 HW1 Solutions January 16, 2006 1 Solutions to HW1 Note: These solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in italics

### Open and Closed Sets

Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 13. Random Variables: Distribution and Expectation

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 3 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected

### MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

### 1 Combinations, Permutations, and Elementary Probability

1 Combinations, Permutations, and Elementary Probability Roughly speaking, Permutations are ways of grouping things where the order is important. Combinations are ways of grouping things where the order

### Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

### Discrete Math in Computer Science Homework 7 Solutions (Max Points: 80)

Discrete Math in Computer Science Homework 7 Solutions (Max Points: 80) CS 30, Winter 2016 by Prasad Jayanti 1. (10 points) Here is the famous Monty Hall Puzzle. Suppose you are on a game show, and you

### Probability is concerned with quantifying the likelihoods of various events in situations involving elements of randomness or uncertainty.

Chapter 1 Probability Spaces 11 What is Probability? Probability is concerned with quantifying the likelihoods of various events in situations involving elements of randomness or uncertainty Example 111

### Probability distributions

Probability distributions (Notes are heavily adapted from Harnett, Ch. 3; Hayes, sections 2.14-2.19; see also Hayes, Appendix B.) I. Random variables (in general) A. So far we have focused on single events,

### Ch. 13.3: More about Probability

Ch. 13.3: More about Probability Complementary Probabilities Given any event, E, of some sample space, U, of a random experiment, we can always talk about the complement, E, of that event: this is the

### HMMT February Saturday 21 February Combinatorics

HMMT February 015 Saturday 1 February 015 1. Evan s analog clock displays the time 1:13; the number of seconds is not shown. After 10 seconds elapse, it is still 1:13. What is the expected number of seconds

### Probability Theory, Part 4: Estimating Probabilities from Finite Universes

8 Resampling: The New Statistics CHAPTER 8 Probability Theory, Part 4: Estimating Probabilities from Finite Universes Introduction Some Building Block Programs Problems in Finite Universes Summary Introduction

### Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of sample space, event and probability function. 2. Be able to

### An Introduction to Basic Statistics and Probability

An Introduction to Basic Statistics and Probability Shenek Heyward NCSU An Introduction to Basic Statistics and Probability p. 1/4 Outline Basic probability concepts Conditional probability Discrete Random

### number of favorable outcomes total number of outcomes number of times event E occurred number of times the experiment was performed.

12 Probability 12.1 Basic Concepts Start with some Definitions: Experiment: Any observation of measurement of a random phenomenon is an experiment. Outcomes: Any result of an experiment is called an outcome.

### Poker Probability from Wikipedia. Frequency of 5-card poker hands 36 0.00139% 0.00154% 72,192.33 : 1

Poker Probability from Wikipedia Frequency of 5-card poker hands The following enumerates the frequency of each hand, given all combinations of 5 cards randomly drawn from a full deck of 52 without replacement.

### Math/Stat 360-1: Probability and Statistics, Washington State University

Math/Stat 360-1: Probability and Statistics, Washington State University Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 2 Haijun Li Math/Stat 360-1: Probability and

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 7 Lecture Notes Discrete Probability Continued Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. The Bernoulli

### 6.042/18.062J Mathematics for Computer Science. Expected Value I

6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you

### MATH 140 Lab 4: Probability and the Standard Normal Distribution

MATH 140 Lab 4: Probability and the Standard Normal Distribution Problem 1. Flipping a Coin Problem In this problem, we want to simualte the process of flipping a fair coin 1000 times. Note that the outcomes

### Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Colin Stirling Informatics Slides originally by Kousha Etessami Colin Stirling (Informatics) Discrete Mathematics (Chapter 6) Today 1 /

### S(A) X α for all α Λ. Consequently, S(A) X, by the definition of intersection. Therefore, X is inductive.

MA 274: Exam 2 Study Guide (1) Know the precise definitions of the terms requested for your journal. (2) Review proofs by induction. (3) Be able to prove that something is or isn t an equivalence relation.

### Topic 1 Probability spaces

CSE 103: Probability and statistics Fall 2010 Topic 1 Probability spaces 1.1 Definition In order to properly understand a statement like the chance of getting a flush in five-card poker is about 0.2%,

### Probabilities of Poker Hands with Variations

Probabilities of Poker Hands with Variations Jeff Duda Acknowledgements: Brian Alspach and Yiu Poon for providing a means to check my numbers Poker is one of the many games involving the use of a 52-card

### 3. Discrete Probability. CSE 312 Autumn 2011 W.L. Ruzzo

3. Discrete Probability CSE 312 Autumn 2011 W.L. Ruzzo sample spaces Sample space: S is the set of all possible outcomes of an experiment (Ω in your text book Greek uppercase omega) Coin flip: S = {Heads,

### In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

### The Story. Probability - I. Plan. Example. A Probability Tree. Draw a probability tree.

Great Theoretical Ideas In Computer Science Victor Adamchi CS 5-5 Carnegie Mellon University Probability - I The Story The theory of probability was originally developed by a French mathematician Blaise

### frequency of E sample size

Chapter 4 Probability (Page 1 of 24) 4.1 What is Probability? Probability is a numerical measure between 0 and 1 that describes the likelihood that an event will occur. Probabilities closer to 1 indicate