1 Section 5.1 Discrete Probability. 2 LaPlace’s definition of probability Number of successful outcomes divided by the number of possible outcomes This.

Slides:



Advertisements
Similar presentations
Discrete Probability Rosen 5.1.
Advertisements

5.3 Permutations and Combinations
Discrete Probability Chapter 7.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 6 Discrete Probability 歐亞書局.
Chapter 8 Counting Principles: Further Probability Topics Section 8.3 Probability Applications of Counting Principles.
Probability – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Probability Reading: Kolman, Section 3.4.
22C:19 Discrete Structures Discrete Probability Fall 2014 Sukumar Ghosh.
1 Discrete Structures & Algorithms Discrete Probability.
1 Many people debate basic questions of chance in games such as lotteries. The Monty Hall problem is a fun brain teaser that Marilyn vos Savant addressed.
1 Discrete Math CS 280 Prof. Bart Selman Module Probability --- Part a) Introduction.
1 Copyright M.R.K. Krishna Rao 2003 Chapter 5. Discrete Probability Everything you have learned about counting constitutes the basis for computing the.
Great Theoretical Ideas in Computer Science.
1 Permutations and Combinations CS/APMA 202 Epp section 6.4 Aaron Bloomfield.
1 The game of poker You are given 5 cards (this is 5-card stud poker) The goal is to obtain the best hand you can The possible poker hands are (in increasing.
Permutations and Combinations
4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Combinatorics.
1 9/8/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Stochastic Methods A Review (Mostly). Relationship between Heuristic and Stochastic Methods  Heuristic and stochastic methods useful where –Problem does.
1 Introduction to Discrete Probability Rosen, Section 6.1 Based on slides by Aaron Bloomfield and …
1 9/23/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Lecture Discrete Probability. 5.1 Probabilities Important in study of complexity of algorithms. Modeling the uncertain world: information, data.
Probability – Models for random phenomena
Counting. Techniques for counting Rule 1 Suppose we carry out have a sets A 1, A 2, A 3, … and that any pair are mutually exclusive (i.e. A 1  A 2 =
3.8 Counting Techniques: Combinations. If you are dealt a hand in poker (5 cards), does it matter in which order the cards are dealt to you? A  K  J.
EGR Sample Space, S The set of all possible outcomes of an experiment. Each outcome is an element or member or sample point. If the set is finite.
6.1 Probability exercises. Def Def: If S is a finite sample space of equally likely outcomes, and E is an event, that is, a subset of S, then the probability.
Section 7.1. Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Chapter 7 With Question/Answer Animations. Section 7.1.
Counting Subsets of a Set: Combinations Lecture 31 Section 6.4 Wed, Mar 21, 2007.
March 10, 2015Applied Discrete Mathematics Week 6: Counting 1 Permutations and Combinations How many different sets of 3 people can we pick from a group.
2 Permutations and Combinations Lesson 8 HAND OUT REFERENCE SHEET AND GO OVER IT.
Probability CSC 172 SPRING 2002 LECTURE 12 Probability Space Set of points, each with an attached probability (non- negative, real number) such that.
Basic Probability Section 7.1. Definitions Sample Space: The set of all possible outcomes in a given experiment or situation Often denoted by S Event:
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 5 Counting.
Homework Homework due now. Reading: relations
Week 9 - Wednesday.  What did we talk about last time?  Exam 2  Before that: review  Before that: relations.
Counting Subsets of a Set: Combinations Lecture 33 Section 6.4 Tue, Mar 27, 2007.
ICS 253: Discrete Structures I Discrete Probability King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Natural Language Processing Giuseppe Attardi Introduction to Probability IP notice: some slides from: Dan Jurafsky, Jim Martin, Sandiway Fong, Dan Klein.
Introduction Lecture 25 Section 6.1 Wed, Mar 22, 2006.
Introduction to Discrete Probability Epp, section 6.x CS 202.
Some other set notation We will use the notation to mean that e is an element of A. We will use the notation to mean that e is not an element of A.
1 Discrete Structures - CSIS2070 Text Discrete Mathematics and Its Applications Kenneth H. Rosen Chapter 4 Counting.
Section 7.1. Probability of an Event We first define these key terms: An experiment is a procedure that yields one of a given set of possible outcomes.
3/7/20161 Now it’s time to look at… Discrete Probability.
Ch 11.7 Probability. Definitions Experiment – any happening for which the result is uncertain Experiment – any happening for which the result is uncertain.
Probability and statistics - overview Introduction Basics of probability theory Events, probability, different types of probability Random variable, probability.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Introduction to probability (3) Definition: - The probability of an event A is the sum of the weights of all sample point in A therefore If A1,A2,…..,An.
Chapter 7. Section 7.1 Finite probability  In a lottery, players win a large prize when they pick four digits that match, in the correct order, four.
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
Now it’s time to look at…
Introduction to Discrete Probability
ICS 253: Discrete Structures I
The Pigeonhole Principle
What Is Probability?.
Chapter 6: Discrete Probability
Natural Language Processing
Applied Discrete Mathematics Week 7: Probability Theory
CS104:Discrete Structures
Natural Language Processing
Discrete Probability Chapter 7 With Question/Answer Animations
Introduction to Probability
Now it’s time to look at…
CSE 321 Discrete Structures
Now it’s time to look at…
Now it’s time to look at…
Presentation transcript:

1 Section 5.1 Discrete Probability

2 LaPlace’s definition of probability Number of successful outcomes divided by the number of possible outcomes This definition works when all outcomes are equally likely, and are finite in number

3 Finite Probability Experiment: a procedure that yields one of a given set of possible outcomes Sample space: set of possible outcomes Event: a subset of the sample space LaPlace’s definition, stated formally, is: The probability p of an event E, which is a subset of a finite sample space S of equally likely outcomes is p(E) = |E|/|S|

4 Example 1 What is the probability that you will draw an ace at random from a shuffled deck of cards? There are 4 aces, so |E| = 4 There are 52 cards, so |S| = 52 So p(E) = |4|/|52|, or 1/13

5 Example 2 What is the probability that at randomly- selected integer chosen from the first hundred positive integers is odd? S = 100, E = 50 So p(E) = 1/2

6 Example 3 What is the probability of winning the grand prize in the lottery, if to win you must pick 6 correct numbers, each of which is between 1 and 40? There is one winning combination The total number of ways to choose 6 numbers out of 40 is C(40,6) = 40!/(34!6!) So your chances of winning are 1/3,838,380

7 Example 4 What is the probability that a 5-card poker hand does not contain the ace of hearts? If all hands are equally likely, the probability of a hand NOT containing a particular card is the quotient of: –probability of picking 5 cards from the 51 remaining: C(51,5) and –probability of picking any 5 cards from entire deck: C(52,5)

8 Example 4 C(51,5) = 51!/5!46! C(52,5) = 52!/5!47! So C(51,5)/C(52,5) = (51!/5!46!)(5!47!/52!) Through cancellation, we get: 47/52 or ~.9

9 Example 5 There are C(52,5) = 52!/(47!5!) = 2,598,960 possible hands of 5 cards in a deck of 52 What is the probability of getting 4 of a kind in a hand of 5?

10 Example 5 Using the product rule, the number of ways to get 4 of a kind in a hand of 5 is the product of: –the number of ways to pick one kind: C(13,1) –the number of ways to pick 4 of this kind from the total number in the deck of this kind: C(4,4) –the number of ways to pick the 5th card: C(48,1) So the probability of being dealt 4 of a kind is: (C(13,1)C(4,4)C(48,1))/C(52,5) = 13*1*48/2,598,960 or.00024

11 Example 6 What is the probability of a 5-card poker hand containing a full house (3 of one kind, 2 of another)? By the product rule, the number of hands containing a full house is the product of: –ways to pick 2 kinds in order: P(13,2): order matters because 3 aces, 2 tens  3 tens, 2 aces –ways to pick 3 out of 4 of first kind: C(4,3) –ways to pick 2 out of 4 of second kind: C(4,2 )

12 Example 6 P(13,2) * C(4,3) * C(4,2): –P(n,r) = n(n-1) * … * (n-r+1); since 13-2 = 11, P(n,r) = 13 * 12 –C(4,3) = 4!/3!1! & C(4,2) = 4!/2!2! = 24/6 & 24/4 –So result is 156 * 4 * 6 = 3744 Because there are 2,598,960 possible poker hands, the probability of a full house is 3744/ = ~.0014

13 Example 7 What is the probability that a 5-card poker hand contains a straight (5 consecutive cards, any suit)? Assuming ace is always high, the 5 cards could start with any of: {2,3,4,5,6,7,8,9,10} So there are C(9,1) or 9 ways to start There are 4 suits, so there are 4 cards of each kind, so there are C(4,1) or 4 ways to make each of the 5 choices

14 Example 7 Putting this information together with the product rule, there are 9 * 4 5 = 9,216 different possible hands containing a straight Since there are 2,598,960 hands possible, the probability of a hand containing a straight is: 9,216/2,598,960 = ~.0035

15 Complement of an event Let E be an event in sample space S. The probability of E, the complementary event of E is: p(E) = 1 - p(E) Note that |E| = |S| - |E| So p(E) = (|S| - |E|)/|S| = 1-|E|/|S| = 1- p(E) Sometimes it’s easier to find the probability of a complement than the probability of the event itself

16 Example 8 A sequence of 10 bits is randomly generated. What is the probability that at least one bit is 0? –E: at least 1 of 10 bits is 0 –E: all bits are 1s –S: all strings of 10 bits

17 Example 8 Since p(E) = 1-p(E) and there are 2 10 possible bit combinations, but only 1 containing all 1s: p(E) = 1/2 10 = 1-1/1024 = 1023/1024, or 99.9% probability that at least one bit is 0 in a random 10-bit string

18 Probability of Union of 2 Events The probability of the union of 2 events is the sum of the probabilities of each of the events, less the probability of the intersection of the 2 events: p(E 1  E 2 ) = p(E 1 ) + p(E 2 ) - p(E 1  E 2 )

19 Probability of Union of 2 Events: proof of theorem Recall the formula for the number of elements in the union of 2 sets: |E 1  E 2 | = |E 1 | + |E 2 | - |E 1  E 2 | So, p |E 1  E 2 | = |E 1  E 2 |/|S| =(|E 1 | + |E 2 | - |E 1  E 2 |)/|S| = |E 1 |/|S| + |E 2 |/|S| - |E 1  E 2 |/|S| = p(E 1 )+p(E 2 )-p(E 1  E 2 )

20 Example 9 What is the probability that a positive integer selected at random from the set of positive integers not exceeding 100 is divisible by either 2 or 5? E 1 = selected integer divisible by 2; |E 1 |=50 E 2 = selected integer divisible by 5; |E 2 |=20

21 Example 9 So E 1  E 2 is the event that the number is divisible by either 2 or 5 and E 1  E 2 is the event that the number is divisible by both (divisible by 10): |E 1  E 2 |=10 So p(E 1  E 2 ) = p(E 1 ) + p(E 2 ) - p(E 1  E 2 ) = 50/ / /100 = 60/100 = 3/5

22 Probabilistic reasoning … is determining which of 2 events is more likely The Monty Hall 3-door puzzle is an example of such reasoning: –select one of 3 doors, one of which has the GRAND PRIZE!!!!! behind it –once selection is made, Monty opens one of the other doors (knowing it is a loser) –then he gives you the option to switch doors -should you?

23 Solution to Monty Hall 3-door puzzle Initial probability of selecting the grand prize door is 1/3 Monty always opens a door the prize is NOT behind The probability you selected incorrectly is 2/3 (since you only had a 1/3 chance of a correct selection)

24 Solution to Monty Hall 3-door puzzle If you selected incorrectly, when Monty selects another door (without prize), the prize must be behind the remaining door You will always win if you chose wrong the first time, then switch So by changing doors, you probability of winning is 2/3 Always change doors!

25 Section 4.4 Discrete Probability - ends -