# Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13

Size: px
Start display at page:

Download "Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13"

Transcription

1 CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13 Introduction to Discrete Probability In the last note we considered the probabilistic experiment where we flipped a fair coin 10,000 times and counted the number of Hs. We asked "what is the chance that we get between 4900 and 5100 Hs". One of the lessons was that the remarkable concentration of the fraction of Hs had something to do with the astronomically large number of possible outcomes of 10,000 coin flips. In this note we will formalize all these notions for an arbitrary probabilistic experiment. We will start by introducing the space of all possible outcomes of the experiment, called a sample space. Each element of the sample space is assigned a probability - which tells us how likely it is to occur when we actually perform the experiment. The mathematical formalism we introduce might take you some time to get used to. But you should remember that ultimately it is just a precise way to say what we mean when we describe a probabilistic experiment like flipping a coin n times. Random Experiments In general, a probabilistic experiment consists of drawing a sample of k elements from a set S of cardinality n. The possible outcomes of such an experiment are exactly the objects that we counted in the last note. Recall from the last note that we considered four possible scenarios for counting, depending upon whether we sampled with or without replacement, and whether the order in which the k elements are chosen does or does not matter. The same will be the case for our probabilistic experiments. The outcome of the random experiment is called a sample point. The sample space, often denoted by Ω, is the set of all possible outcomes. An example of such an experiment is tossing a coin 4 times. In this case, S = {H,T } and we are drawing 4 elements with replacement. HT HT is an example of a sample point and the sample space has 16 elements: How do we determine the chance of each particular outcome, such as HHT, of our experiment? In order to do this, we need to define the probability for each sample point, as we will do below. CS 70, Spring 2016, Note 13 1

2 Probability Spaces A probability space is a sample space Ω, together with a probability Pr[ω] for each sample point ω, such that 0 Pr[ω] 1 for all ω Ω. Pr[ω] = 1, i.e., the sum of the probabilities of all outcomes is 1. ω Ω The easiest way to assign probabilities to sample points is uniformly: if Ω = N, then Pr[x] = 1 N x Ω. For example, if we toss a fair coin 4 times, each of the 16 sample points (as pictured above) is assigned probability We will see examples of non-uniform probability distributions soon. After performing an experiment, we are often interested in knowing whether an event occurred. For example, we might be interested in the event that there were exactly 2 H s in four tosses of the coin". How do we formally define the concept of an event in terms of the sample space Ω? Here is a beautiful answer. We will identify the event exactly 2 H s in four tosses of the coin" with the subset consisting of those outcomes in which there are exactly two H s: {HHT T,HT HT,HT T H,T HHT,T HT H,T T HH} Ω. Now we turn this around and say that formally an event A is just a subset of the sample space, A Ω. How should we define the probability of an event A? Naturally, we should just add up the probabilities of the sample points in A. For any event A Ω, we define the probability of A to be Pr[A] = Pr[ω]. ω A Thus the probability of getting exactly two H s in four coin tosses can be calculated using this definition as follows. A consists of all sequences that have exactly two H s, and so A = ( 4 2) = 6. For this example, there are 2 4 = 16 possible outcomes for flipping four coins. Thus, each sample point ω A has probability 1 16 ; and, as we saw above, there are six sample points in A, giving us Pr[A] = = 3 8. Examples We will now look at examples of random experiments and their corresponding sample spaces, along with possible probability spaces and events. Coin Flipping Suppose we have a coin of bias p, and our experiment consists of flipping the coin 4 times. The sample space Ω consists of the sixteen possible sequences of H s and T s shown in the figure on the last page. The probability space depends on p. If p = 1 2 the probabilities are assigned uniformly; the probability of each sample point is What if the coin comes up heads with probability 2 3 and tails with probability 1 3 (i.e. the bias is p = 2 3 )? Then the probabilities are different. For example, Pr[HHHH] = = 16 81, while Pr[T T HH] = = [Note: We have cheerfully multiplied probabilities here; we ll explain why this is OK later. It is not always OK!] CS 70, Spring 2016, Note 13 2

3 What type of events can we consider in this setting? Let event A be the event that all four coin tosses are the same. Then A = {HHHH,T T T T }. HHHH has probability and T T T T has probability Thus, Pr[A] = Pr[HHHH] + Pr[T T T T ] = = Next, consider event B: the event that there are exactly two heads. The probability of any particular outcome with two heads (such as HT HT ) is ( 3 3. How many such outcomes are there? There are 4 ) 2 = 6 ways of = choosing the positions of the heads, and these choices completely specify the sequence. So Pr[B] = = More generally, if we flip the coin n times, we get a sample space Ω of cardinality 2 n. The sample points are all possible sequences of n H s and T s. If the coin has bias p, and if we consider any sequence of n coin flips with exactly r H s, then the the probability of this sequence is p r (1 p) n r. Now consider the event C that we get exactly r H s when we flip the coin n times. This event consists of exactly ( n ) r) sample points. Each has probability p r (1 p) n r. So the probability of this event, P[C] = p r (1 p) n r. ( n r Biased coin-tossing sequences show up in many contexts: for example, they might model the behavior of n trials of a faulty system, which fails each time with probability p. Rolling Dice The next random experiment we will discuss consists of rolling two dice. In this experiment, Ω = {(i, j) : 1 i, j 6}. The probability space is uniform, i.e. all of the sample points have the same probability, which must be 1 1 Ω. In this case, Ω = 36, so each sample point has probability 36. In such circumstances, the probability of any event A is clearly just Pr[A] = # of sample points in A # of sample points in Ω = A Ω. So for uniform spaces, computing probabilities reduces to counting sample points! Now consider two events: the event A that the sum of the dice is at least 10 and the event B that there is at least one 6. By writing out the number of sample points in each event, we can determine the number of sample points in each event; A = 6 and B = 11. By the observation above, it follows that Pr[A] = 6 36 = 1 6 and Pr[B] = Card Shuffling The random experiment consists of shuffling a deck of cards. Ω is equal to the set of the 52! permutations of the deck. The probability space is uniform. Note that we re really talking about an idealized mathematical model of shuffling here; in real life, there will always be a bit of bias in our shuffling. However, the mathematical model is close enough to be useful. Poker Hands Here s another experiment: shuffling a deck of cards and dealing a poker hand. In this case, S is the set of 52 cards and our sample space Ω = {all possible poker hands}, which corresponds to choosing k = 5 objects without replacement from a set of size n = 52 where order does not matter. Hence, as we saw in the previous Note, Ω = ( ) 52 5 = = 2, 598, 960. Since the deck is assumed to be randomly shuffled, the probability of each outcome is equally likely and we are therefore dealing with a uniform probability space. CS 70, Spring 2016, Note 13 3

4 Let A be the event that the poker hand is a flush. [For those who are not addicted to gambling, a flush is a hand in which all cards have the same suit, say Hearts.] Since the probability space is uniform, computing Pr[A] reduces to simply computing A, or the number of poker hands which are flushes. There are 13 cards in each suit, so the number of flushes in each suit is ( ) ( The total number of flushes is therefore 4 13 ) 5. Then we have Pr[hand is a flush] = 4 (13 ) 5 ) = ( ! 5! 47! 5! 8! 52! = Balls and Bins In this experiment, we will throw 20 (labeled) balls into 10 (labeled) bins. Assume that each ball is equally likely to land in any bin, regardless of what happens to the other balls. If you wish to understand this situation in terms of sampling a sequence of k elements from a set S of cardinality n: here the set S consists of the 10 bins, and we are sampling with replacement k = 20 times. The order of sampling matters, since the balls are labeled. The sample space Ω is equal to {(b 1,b 2,...,b 20 ) : 1 b i 10}, where the component b i denotes the bin in which ball i lands. The cardinality of the sample space, Ω, is equal to each element b i in the sequence has 10 possible choices, and there are 20 elements in the sequence. More generally, if we throw m balls into n bins, we have a sample space of size n m. The probability space is uniform; as we said earlier, each ball is equally likely to land in any bin. Let A be the event that bin 1 is empty. Since the probability space is uniform, we simply need to count how many outcomes have this property. This is exactly the number of ways all 20 balls can fall into the remaining nine bins, which is Hence, Pr[A] = 920 = ( ) Let B be the event that bin 1 contains at least one ball. This event is the complement Ā of A, i.e., it consists of precisely those sample points which are not in A. So Pr[B] = 1 Pr[A].88. More generally, if we throw m balls into n bins, we have: ( ) n 1 m ( Pr[bin 1 is empty] = = 1 1 m. n n) As we shall see, balls and bins is another probability space that shows up very often in Computer Science: for example, we can think of it as modeling a load balancing scheme, in which each job is sent to a random processor. It is also a more general model for problems we have previously considered. For example, flipping a fair coin 3 times is a special case in which the number of balls (m) is 3 and the number of bins (n) is 2. Rolling two dice is a special case in which m = 2 and n = 6. Birthday Paradox The birthday paradox is a remarkable phenomenon that examines the chances that two people in a group have the same birthday. It is a paradox not because of a logical contradiction, but because it goes against intuition. For ease of calculation, we take the number of days in a year to be 365. Then U = {1,...,365}, and the random experiment consists of drawing a sample of n elements from U, where the elements are the birth dates of n people in a group. Then Ω = 365 n. This is because each sample point is a sequence of possible birthdays for n people; so there are n points in the sequence and each point has 365 possible values. CS 70, Spring 2016, Note 13 4

5 Let A be the event that at least two people have the same birthday. If we want to determine Pr[A], it might be simpler to instead compute the probability of the complement of A, Pr[Ā]. Ā is the event that no two people have the same birthday. Since Pr[A] = 1 Pr[Ā], we can then easily compute Pr[A]. We are again working in a uniform probability space, so we just need to determine Ā. Equivalently, we are computing the number of ways there are for no two people to have the same birthday. There are 365 choices for the first person, 364 for the second,..., 365 n + 1 choices for the n th person, for a total of (365 n + 1). Note that this is simply an application of the first rule of counting; we are sampling without replacement and the order matters. Thus we have Pr[Ā] = Ā Ω = (365 n+1) 365 n. Then Pr[A] = (365 n+1) 365 n. This allows us to compute Pr[A] as a function of the number of people, n. Of course, as n increases Pr[A] increases. In fact, with n = 23 people you should be willing to bet that at least two people do have the same birthday, since then Pr[A] is larger than 50%! For n = 60 people, Pr[A] is over 99%. The Monty Hall Problem In an (in)famous 1970s game show hosted by one Monty Hall, a contestant was shown three doors; behind one of the doors was a prize, and behind the other two were goats. The contestant picks a door (but doesn t open it). Then Hall s assistant (Carol), opens one of the other two doors, revealing a goat (since Carol knows where the prize is, she can always do this). The contestant is then given the option of sticking with his current door, or switching to the other unopened one. He wins the prize if and only if his chosen door is the correct one. The question, of course, is: Does the contestant have a better chance of winning if he switches doors? Intuitively, it seems obvious that since there are only two remaining doors after the host opens one, they must have equal probability. So you may be tempted to jump to the conclusion that it should not matter whether or not the contestant stays or switches. Yet there are other people whose intuition cries out that the contestant is better off switching. So who s correct? As a matter of fact, the contestant has a better chance of picking the car if he uses the switching strategy. How can you convince yourself that this is true? One way you can do this is by doing a rigorous analysis. You would start by writing out the sample space, and then assign probabilities to each sample point. Finally you would calculate the probability of the event that the contestant wins under the sticking strategy. This is an excellent exercise if you wish to make sure you understand the formalism of probability theory we introduced above. Let us instead give a more intuitive pictorial argument. Initially when the contestant chooses the door, he has a 1 3 chance of picking the car. This must mean that the other doors combined have a 2 3 chance of winning. But after Carol opens a door with a goat behind it, how do the probabilities change? Well, everyone knows that there is a goat behind one of the doors that the contestant did not pick. So no matter whether the contestant is winning or not, Carol is always able to open one of the other doors to reveal a goat. This means that the contestant still has a 1 3 chance of winning. Also the door that Carol opened has no chance of winning. What about the last door? It must have a 2 3 chance of containing the car, and so the contestant has a higher chance of winning if he or she switches doors. This argument can be summed up nicely in the following picture: CS 70, Spring 2016, Note 13 5

6 You will be able to formalize this intuitive argument once we cover conditional probability. In the meantime, to approach this problem formally, first determine the sample space and the probability space. Just a hint: it is not a uniform probability space! Then formalize the event we have described above (as a subspace of the sample space), and compute the probability of the event. Good luck! Summary The examples above illustrate the importance of doing probability calculations systematically, rather than intuitively." Recall the key steps in all our calculations: What is the sample space (i.e., the experiment and its set of possible outcomes)? What is the probability of each outcome (sample point)? What is the event we are interested in (i.e., which subset of the sample space)? Finally, compute the probability of the event by adding up the probabilities of the sample points inside it. Whenever you meet a probability problem, you should always go back to these basics to avoid potential pitfalls. Even experienced researchers make mistakes when they forget to do this witness many erroneous proofs, submitted by mathematicians to newspapers at the time, of the fact that the switching strategy in the Monty Hall problem does not improve the odds. CS 70, Spring 2016, Note 13 6

### 1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000.

CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 15 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette wheels. Today

### The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following:

CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 17 Introduction to Probability The topic for the third and final major portion of the course is Probability. We will aim to make sense of

### The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:

CS 70 Discrete Mathematics for CS Fall 2004 Rao Lecture 14 Introduction to Probability The next several lectures will be concerned with probability theory. We will aim to make sense of statements such

### CSC/MTH 231 Discrete Structures II Spring, Homework 5

CSC/MTH 231 Discrete Structures II Spring, 2010 Homework 5 Name 1. A six sided die D (with sides numbered 1, 2, 3, 4, 5, 6) is thrown once. a. What is the probability that a 3 is thrown? b. What is the

### The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability

The study of probability is concerned with the likelihood of events occurring Like combinatorics, the origins of probability theory can be traced back to the study of gambling games Still a popular branch

### Discrete Structures for Computer Science

Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #23: Discrete Probability Based on materials developed by Dr. Adam Lee The study of probability is

### Probability. Dr. Zhang Fordham Univ.

Probability! Dr. Zhang Fordham Univ. 1 Probability: outline Introduction! Experiment, event, sample space! Probability of events! Calculate Probability! Through counting! Sum rule and general sum rule!

### Section Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning

Section 7.1 Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Probability of an Event Pierre-Simon Laplace (1749-1827) We first study Pierre-Simon

### Week 1: Probability models and counting

Week 1: Probability models and counting Part 1: Probability model Probability theory is the mathematical toolbox to describe phenomena or experiments where randomness occur. To have a probability model

Probability Paradoxes Washington University Math Circle February 20, 2011 1 Introduction We re all familiar with the idea of probability, even if we haven t studied it. That is what makes probability so

### CS 361: Probability & Statistics

January 31, 2018 CS 361: Probability & Statistics Probability Probability theory Probability Reasoning about uncertain situations with formal models Allows us to compute probabilities Experiments will

### The probability set-up

CHAPTER 2 The probability set-up 2.1. Introduction and basic theory We will have a sample space, denoted S (sometimes Ω) that consists of all possible outcomes. For example, if we roll two dice, the sample

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

Section 6.1 #16 What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit? page 1 Section 6.1 #38 Two events E 1 and E 2 are called independent if p(e 1

### Junior Circle Meeting 5 Probability. May 2, ii. In an actual experiment, can one get a different number of heads when flipping a coin 100 times?

Junior Circle Meeting 5 Probability May 2, 2010 1. We have a standard coin with one side that we call heads (H) and one side that we call tails (T). a. Let s say that we flip this coin 100 times. i. How

### The probability set-up

CHAPTER The probability set-up.1. Introduction and basic theory We will have a sample space, denoted S sometimes Ω that consists of all possible outcomes. For example, if we roll two dice, the sample space

### Probability (Devore Chapter Two)

Probability (Devore Chapter Two) 1016-351-01 Probability Winter 2011-2012 Contents 1 Axiomatic Probability 2 1.1 Outcomes and Events............................... 2 1.2 Rules of Probability................................

### Compound Probability. Set Theory. Basic Definitions

Compound Probability Set Theory A probability measure P is a function that maps subsets of the state space Ω to numbers in the interval [0, 1]. In order to study these functions, we need to know some basic

### EECS 203 Spring 2016 Lecture 15 Page 1 of 6

EECS 203 Spring 2016 Lecture 15 Page 1 of 6 Counting We ve been working on counting for the last two lectures. We re going to continue on counting and probability for about 1.5 more lectures (including

### Intermediate Math Circles November 1, 2017 Probability I

Intermediate Math Circles November 1, 2017 Probability I Probability is the study of uncertain events or outcomes. Games of chance that involve rolling dice or dealing cards are one obvious area of application.

### 23 Applications of Probability to Combinatorics

November 17, 2017 23 Applications of Probability to Combinatorics William T. Trotter trotter@math.gatech.edu Foreword Disclaimer Many of our examples will deal with games of chance and the notion of gambling.

### Counting and Probability

Counting and Probability Lecture 42 Section 9.1 Robb T. Koether Hampden-Sydney College Wed, Apr 9, 2014 Robb T. Koether (Hampden-Sydney College) Counting and Probability Wed, Apr 9, 2014 1 / 17 1 Probability

### STOR 155 Introductory Statistics. Lecture 10: Randomness and Probability Model

The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL STOR 155 Introductory Statistics Lecture 10: Randomness and Probability Model 10/6/09 Lecture 10 1 The Monty Hall Problem Let s Make A Deal: a game show

### November 6, Chapter 8: Probability: The Mathematics of Chance

Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern

### STAT 155 Introductory Statistics. Lecture 11: Randomness and Probability Model

The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL STAT 155 Introductory Statistics Lecture 11: Randomness and Probability Model 10/5/06 Lecture 11 1 The Monty Hall Problem Let s Make A Deal: a game show

### Combinatorics: The Fine Art of Counting

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

### RANDOM EXPERIMENTS AND EVENTS

Random Experiments and Events 18 RANDOM EXPERIMENTS AND EVENTS In day-to-day life we see that before commencement of a cricket match two captains go for a toss. Tossing of a coin is an activity and getting

### The Teachers Circle Mar. 20, 2012 HOW TO GAMBLE IF YOU MUST (I ll bet you \$5 that if you give me \$10, I ll give you \$20.)

The Teachers Circle Mar. 2, 22 HOW TO GAMBLE IF YOU MUST (I ll bet you \$ that if you give me \$, I ll give you \$2.) Instructor: Paul Zeitz (zeitzp@usfca.edu) Basic Laws and Definitions of Probability If

### A Probability Work Sheet

A Probability Work Sheet October 19, 2006 Introduction: Rolling a Die Suppose Geoff is given a fair six-sided die, which he rolls. What are the chances he rolls a six? In order to solve this problem, we

### STAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes

STAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes Pengyuan (Penelope) Wang May 25, 2011 Review We have discussed counting techniques in Chapter 1. (Principle

### Probability and the Monty Hall Problem Rong Huang January 10, 2016

Probability and the Monty Hall Problem Rong Huang January 10, 2016 Warm-up: There is a sequence of number: 1, 2, 4, 8, 16, 32, 64, How does this sequence work? How do you get the next number from the previous

### Statistics Intermediate Probability

Session 6 oscardavid.barrerarodriguez@sciencespo.fr April 3, 2018 and Sampling from a Population Outline 1 The Monty Hall Paradox Some Concepts: Event Algebra Axioms and Things About that are True Counting

### COUNTING AND PROBABILITY

CHAPTER 9 COUNTING AND PROBABILITY It s as easy as 1 2 3. That s the saying. And in certain ways, counting is easy. But other aspects of counting aren t so simple. Have you ever agreed to meet a friend

### Such a description is the basis for a probability model. Here is the basic vocabulary we use.

5.2.1 Probability Models When we toss a coin, we can t know the outcome in advance. What do we know? We are willing to say that the outcome will be either heads or tails. We believe that each of these

### From Probability to the Gambler s Fallacy

Instructional Outline for Mathematics 9 From Probability to the Gambler s Fallacy Introduction to the theme It is remarkable that a science which began with the consideration of games of chance should

### November 8, Chapter 8: Probability: The Mathematics of Chance

Chapter 8: Probability: The Mathematics of Chance November 8, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Crystallographic notation The first symbol

### Introduction to Probability

6.04/8.06J Mathematics for omputer Science Srini Devadas and Eric Lehman pril 4, 005 Lecture Notes Introduction to Probability Probability is the last topic in this course and perhaps the most important.

### 4.1 Sample Spaces and Events

4.1 Sample Spaces and Events An experiment is an activity that has observable results. Examples: Tossing a coin, rolling dice, picking marbles out of a jar, etc. The result of an experiment is called an

### I. WHAT IS PROBABILITY?

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

### Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11

EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11 Counting As we saw in our discussion for uniform discrete probability, being able to count the number of elements of

### CS 787: Advanced Algorithms Homework 1

CS 787: Advanced Algorithms Homework 1 Out: 02/08/13 Due: 03/01/13 Guidelines This homework consists of a few exercises followed by some problems. The exercises are meant for your practice only, and do

### CS1800: Intro to Probability. Professor Kevin Gold

CS1800: Intro to Probability Professor Kevin Gold Probability Deals Rationally With an Uncertain World Using probabilities is the only rational way to deal with uncertainty De Finetti: If you disagree,

### 1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building?

1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building? 2. A particular brand of shirt comes in 12 colors, has a male version and a female version,

### Introductory Probability

Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts

### CS 361: Probability & Statistics

February 7, 2018 CS 361: Probability & Statistics Independence & conditional probability Recall the definition for independence So we can suppose events are independent and compute probabilities Or we

### Foundations of Computing Discrete Mathematics Solutions to exercises for week 12

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Agata Murawska (agmu@itu.dk) November 13, 2013 Exercise (6.1.2). A multiple-choice test contains 10 questions. There are

### Probability: Terminology and Examples Spring January 1, / 22

Probability: Terminology and Examples 18.05 Spring 2014 January 1, 2017 1 / 22 Board Question Deck of 52 cards 13 ranks: 2, 3,..., 9, 10, J, Q, K, A 4 suits:,,,, Poker hands Consists of 5 cards A one-pair

### CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions)

CSE 31: Foundations of Computing II Quiz Section #: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) Review: Main Theorems and Concepts Binomial Theorem: x, y R, n N: (x + y) n

### Theory of Probability - Brett Bernstein

Theory of Probability - Brett Bernstein Lecture 3 Finishing Basic Probability Review Exercises 1. Model flipping two fair coins using a sample space and a probability measure. Compute the probability of

### CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability Review: Main Theorems and Concepts Binomial Theorem: Principle of Inclusion-Exclusion

### Section : Combinations and Permutations

Section 11.1-11.2: Combinations and Permutations Diana Pell A construction crew has three members. A team of two must be chosen for a particular job. In how many ways can the team be chosen? How many words

### MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

MATH DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Counting and Probability Suggested Problems Basic Counting Skills, Inclusion-Exclusion, and Complement. (a An office building contains 7 floors and has 7 offices

### Probability. Ms. Weinstein Probability & Statistics

Probability Ms. Weinstein Probability & Statistics Definitions Sample Space The sample space, S, of a random phenomenon is the set of all possible outcomes. Event An event is a set of outcomes of a random

### Counting and Probability Math 2320

Counting and Probability Math 2320 For a finite set A, the number of elements of A is denoted by A. We have two important rules for counting. 1. Union rule: Let A and B be two finite sets. Then A B = A

### November 11, Chapter 8: Probability: The Mathematics of Chance

Chapter 8: Probability: The Mathematics of Chance November 11, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Probability Rules Probability Rules Rule 1.

### Probability with Set Operations. MATH 107: Finite Mathematics University of Louisville. March 17, Complicated Probability, 17th century style

Probability with Set Operations MATH 107: Finite Mathematics University of Louisville March 17, 2014 Complicated Probability, 17th century style 2 / 14 Antoine Gombaud, Chevalier de Méré, was fond of gambling

### Exercise Class XI Chapter 16 Probability Maths

Exercise 16.1 Question 1: Describe the sample space for the indicated experiment: A coin is tossed three times. A coin has two faces: head (H) and tail (T). When a coin is tossed three times, the total

### 8.2 Union, Intersection, and Complement of Events; Odds

8.2 Union, Intersection, and Complement of Events; Odds Since we defined an event as a subset of a sample space it is natural to consider set operations like union, intersection or complement in the context

### Important Distributions 7/17/2006

Important Distributions 7/17/2006 Discrete Uniform Distribution All outcomes of an experiment are equally likely. If X is a random variable which represents the outcome of an experiment of this type, then

### 3 The multiplication rule/miscellaneous counting problems

Practice for Exam 1 1 Axioms of probability, disjoint and independent events 1 Suppose P (A 0, P (B 05 (a If A and B are independent, what is P (A B? What is P (A B? (b If A and B are disjoint, what is

### Raise your hand if you rode a bus within the past month. Record the number of raised hands.

166 CHAPTER 3 PROBABILITY TOPICS Raise your hand if you rode a bus within the past month. Record the number of raised hands. Raise your hand if you answered "yes" to BOTH of the first two questions. Record

### Random Variables. A Random Variable is a rule that assigns a number to each outcome of an experiment.

Random Variables When we perform an experiment, we are often interested in recording various pieces of numerical data for each trial. For example, when a patient visits the doctor s office, their height,

### Random Variables. Outcome X (1, 1) 2 (2, 1) 3 (3, 1) 4 (4, 1) 5. (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6) }

Random Variables When we perform an experiment, we are often interested in recording various pieces of numerical data for each trial. For example, when a patient visits the doctor s office, their height,

### Finite Mathematics MAT 141: Chapter 8 Notes

Finite Mathematics MAT 4: Chapter 8 Notes Counting Principles; More David J. Gisch The Multiplication Principle; Permutations Multiplication Principle Multiplication Principle You can think of the multiplication

### Name. Is the game fair or not? Prove your answer with math. If the game is fair, play it 36 times and record the results.

Homework 5.1C You must complete table. Use math to decide if the game is fair or not. If Period the game is not fair, change the point system to make it fair. Game 1 Circle one: Fair or Not 2 six sided

### Combinatorics and Intuitive Probability

Chapter Combinatorics and Intuitive Probability The simplest probabilistic scenario is perhaps one where the set of possible outcomes is finite and these outcomes are all equally likely. A subset of the

### Lecture 2: Sum rule, partition method, difference method, bijection method, product rules

Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers

### If a regular six-sided die is rolled, the possible outcomes can be listed as {1, 2, 3, 4, 5, 6} there are 6 outcomes.

Section 11.1: The Counting Principle 1. Combinatorics is the study of counting the different outcomes of some task. For example If a coin is flipped, the side facing upward will be a head or a tail the

### 3. Discrete Probability. CSE 312 Spring 2015 W.L. Ruzzo

3. Discrete Probability CSE 312 Spring 2015 W.L. Ruzzo 2 Probability theory: an aberration of the intellect and ignorance coined into science John Stuart Mill 3 sample spaces Sample space: S is a set of

### Before giving a formal definition of probability, we explain some terms related to probability.

probability 22 INTRODUCTION In our day-to-day life, we come across statements such as: (i) It may rain today. (ii) Probably Rajesh will top his class. (iii) I doubt she will pass the test. (iv) It is unlikely

### Probability & Expectation. Professor Kevin Gold

Probability & Expectation Professor Kevin Gold Review of Probability so Far (1) Probabilities are numbers in the range [0,1] that describe how certain we should be of events If outcomes are equally likely

### Class XII Chapter 13 Probability Maths. Exercise 13.1

Exercise 13.1 Question 1: Given that E and F are events such that P(E) = 0.6, P(F) = 0.3 and P(E F) = 0.2, find P (E F) and P(F E). It is given that P(E) = 0.6, P(F) = 0.3, and P(E F) = 0.2 Question 2:

### Basic Probability Models. Ping-Shou Zhong

asic Probability Models Ping-Shou Zhong 1 Deterministic model n experiment that results in the same outcome for a given set of conditions Examples: law of gravity 2 Probabilistic model The outcome of the

### 1. How to identify the sample space of a probability experiment and how to identify simple events

Statistics Chapter 3 Name: 3.1 Basic Concepts of Probability Learning objectives: 1. How to identify the sample space of a probability experiment and how to identify simple events 2. How to use the Fundamental

### CS1802 Week 9: Probability, Expectation, Entropy

CS02 Discrete Structures Recitation Fall 207 October 30 - November 3, 207 CS02 Week 9: Probability, Expectation, Entropy Simple Probabilities i. What is the probability that if a die is rolled five times,

### Grade 6 Math Circles Fall Oct 14/15 Probability

1 Faculty of Mathematics Waterloo, Ontario Centre for Education in Mathematics and Computing Grade 6 Math Circles Fall 2014 - Oct 14/15 Probability Probability is the likelihood of an event occurring.

### Lesson 10: Using Simulation to Estimate a Probability

Lesson 10: Using Simulation to Estimate a Probability Classwork In previous lessons, you estimated probabilities of events by collecting data empirically or by establishing a theoretical probability model.

### Chapter 8: Probability: The Mathematics of Chance

Chapter 8: Probability: The Mathematics of Chance Free-Response 1. A spinner with regions numbered 1 to 4 is spun and a coin is tossed. Both the number spun and whether the coin lands heads or tails is

### 4.3 Rules of Probability

4.3 Rules of Probability If a probability distribution is not uniform, to find the probability of a given event, add up the probabilities of all the individual outcomes that make up the event. Example:

### 02. Probability: Intuition - Ambiguity - Absurdity - Puzzles

University of Rhode Island DigitalCommons@URI Nonequilibrium Statistical Physics Physics Course Materials 10-19-2015 02. Probability: Intuition - Ambiguity - Absurdity - Puzzles Gerhard Müller University

### CIS 2033 Lecture 6, Spring 2017

CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,

### 1. A factory makes calculators. Over a long period, 2 % of them are found to be faulty. A random sample of 100 calculators is tested.

1. A factory makes calculators. Over a long period, 2 % of them are found to be faulty. A random sample of 0 calculators is tested. Write down the expected number of faulty calculators in the sample. Find

### Key Concepts. Theoretical Probability. Terminology. Lesson 11-1

Key Concepts Theoretical Probability Lesson - Objective Teach students the terminology used in probability theory, and how to make calculations pertaining to experiments where all outcomes are equally

### Simulations. 1 The Concept

Simulations In this lab you ll learn how to create simulations to provide approximate answers to probability questions. We ll make use of a particular kind of structure, called a box model, that can be

### Problems for Recitation 17

6.042/18.062J Mathematics for Computer Science November 10, 2010 Tom Leighton and Marten van Dijk Problems for Recitation 17 The Four-Step Method This is a good approach to questions of the form, What

### Probability and Counting Techniques

Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each

### Outcome X (1, 1) 2 (2, 1) 3 (3, 1) 4 (4, 1) 5 {(1, 1) (1, 2) (1, 3) (1, 4) (1, 5) (1, 6) (6, 1) (6, 2) (6, 3) (6, 4) (6, 5) (6, 6)}

Section 8: Random Variables and probability distributions of discrete random variables In the previous sections we saw that when we have numerical data, we can calculate descriptive statistics such as

### Math 1313 Section 6.2 Definition of Probability

Math 1313 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

### Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand HW 8

CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand HW 8 1 Sundry Before you start your homewor, write down your team. Who else did you wor with on this homewor? List names and

### Simple Probability. Arthur White. 28th September 2016

Simple Probability Arthur White 28th September 2016 Probabilities are a mathematical way to describe an uncertain outcome. For eample, suppose a physicist disintegrates 10,000 atoms of an element A, and

### COMPOUND EVENTS. Judo Math Inc.

COMPOUND EVENTS Judo Math Inc. 7 th grade Statistics Discipline: Black Belt Training Order of Mastery: Compound Events 1. What are compound events? 2. Using organized Lists (7SP8) 3. Using tables (7SP8)

### Math116Chapter15ProbabilityProbabilityDone.notebook January 08, 2012

15.4 Probability Spaces Probability assignment A function that assigns to each event E a number between 0 and 1, which represents the probability of the event E and which we denote by Pr (E). Probability

### Contents of this Document [ntc2]

Contents of this Document [ntc2] 2. Probability: Intuition - Ambiguity - Absurdity - Puzzles Regular versus random schedules [nln40] Pick the winning die [nex2] Educated guess [nex4] Coincident birthdays

### Discrete Structures Lecture Permutations and Combinations

Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these

### Chapter 1. Probability

Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.

### Chapter 1. Probability

Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.

### Probability. March 06, J. Boulton MDM 4U1. P(A) = n(a) n(s) Introductory Probability

Most people think they understand odds and probability. Do you? Decision 1: Pick a card Decision 2: Switch or don't Outcomes: Make a tree diagram Do you think you understand probability? Probability Write

### Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1:

Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.