Homework Homework due now. Reading: relations 2005 11 15.

Slides:



Advertisements
Similar presentations
Discrete Probability Rosen 5.1.
Advertisements

4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Chapter 8 Counting Principles: Further Probability Topics Section 8.3 Probability Applications of Counting Principles.
Describing Probability
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.
16.4 Probability Problems Solved with Combinations.
Section 16.1: Basic Principles of Probability
Unit 6: Probability. Expected values Ex 1: Flip a coin 10 times, paying $1 to play each time. You win $.50 (plus your $1) if you get a head. How much.
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.
Midterm Review Solutions Math 210G-04, Spring 2011.
1 Probability Parts of life are uncertain. Using notions of probability provide a way to deal with the uncertainty.
Basics of Probability. Trial or Experiment Experiment - a process that results in a particular outcome or “event”. Simple event (or sample point), E i.
1 Section 5.1 Discrete Probability. 2 LaPlace’s definition of probability Number of successful outcomes divided by the number of possible outcomes This.
Intro to Probability & Games
Chapter 7 - Part Two Counting Techniques Wednesday, March 18, 2009.
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
Laws of Probability What is the probability of throwing a pair of dice and obtaining a 5 or a 7? These are mutually exclusive events. You can’t throw.
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.
Week 10 - Monday.  What did we talk about last time?  More permutations  Addition rule  Inclusion and exclusion.
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.
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.
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.
Combinations Problems Problem 1: Sometimes we can use several counting techniques in the same problem, such as combinations and the addition principle.
Lecture Discrete Probability. 5.1 Probabilities Important in study of complexity of algorithms. Modeling the uncertain world: information, data.
Probability – Models for random phenomena
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Chapter 11: Counting Methods
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.
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.
Chapter 10: Counting Methods
Chapter 7 With Question/Answer Animations. Section 7.1.
Chapter  Determine how many different possibilities are possible:  1. There are 3 different ice cream flavors and 5 different toppings. You.
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.
15.3 Counting Methods: Combinations ©2002 by R. Villar All Rights Reserved.
Probability CSC 172 SPRING 2002 LECTURE 12 Probability Space Set of points, each with an attached probability (non- negative, real number) such that.
Quiz 10-1, Which of these are an example of a “descrete” set of data? 2.Make a “tree diagram” showing all the ways the letters ‘x’, ‘y’, and ‘z’
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:
Week 11 - Wednesday.  What did we talk about last time?  Exam 2 post-mortem  Combinations.
Week 9 - Wednesday.  What did we talk about last time?  Exam 2  Before that: review  Before that: relations.
September1999 CMSC 203 / 0201 Fall 2002 Week #9 – 21/23/25 October 2002 Prof. Marie desJardins.
Review Homework pages Example: Counting the number of heads in 10 coin tosses. 2.2/
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.
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.
What is the probability of picking an ace? Probability =
Algebra-2 Counting and Probability. Quiz 10-1, Which of these are an example of a “descrete” set of data? 2.Make a “tree diagram” showing all.
CS Lecture 8 Developing Your Counting Muscles.
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.
L14: Permutations, Combinations and Some Review EECS 203: Discrete Mathematics.
Chance We will base on the frequency theory to study chances (or probability).
Week 9 - Wednesday.  What did we talk about last time?  Exam 2  Before that: review  Before that: relations.
Sample Spaces and Probability Addition Rules Multiplication Rules and Conditional Probability Counting Rules Probability and Counting Rules
Quiz: Draw the unit circle: Include: (1)All “nice” angles in degrees (2) All “nice” angles in radians (3) The (x, y) pairs for each point on the unit circle.
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.
Probability Intro. Coin toss u Toss two coins 10 times keeping track of the results (head/tails) u Now toss 3 coins 10 times u Make a chart of all the.
Arrangements and Selections (and how they may be counted)
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
ICS 253: Discrete Structures I
The Pigeonhole Principle
BASIC PROBABILITY Probability – the chance of something (an event) happening # of successful outcomes # of possible outcomes All probability answers must.
WARMUP Lesson 10.3, For use with pages
Probability Section 19 NOTE: We are skipping Section 18. 2/21/2019
Presentation transcript:

Homework Homework due now. Reading: relations

Counting, Using Permutations and Combinations PC13. In a competition among architects on emergency housing, a panel votes on the four top designs (labeled pop- top, cocoon, box, and dome). How many outcomes are possible? (You must consider ties, including multi-way ties.) Without ties, it’s P(4, 4) With ties, there are five cases: 1)No ties: 2)Two tie, other two don’t: 3)Two sets of two tie: 4)Three houses tie: 5)Four houses tie: With ties, there are five cases: 1)No ties: 2)Two tie, other two don’t: 3)Two sets of two tie: 4)Three houses tie: 5)Four houses tie: P(4,4) C(4,2) * P(3,3) C(4,2) C(4,3) * P(2,2) 1 P(4,4) C(4,2) * P(3,3) C(4,2) C(4,3) * P(2,2) 1 + SelectOrder

Binomial Coefficients

Pascal’s Triangle

Chu Shih-chieh’s Triangle?

Binomial Coefficients Theorem:

Binomial Coefficients BC1.Find the coefficients for the following terms a. the fifth term of (2x + 3y) 7 c. the coefficient of a 62 b 92 in (2a – b) 154 C(11, 4) or ( ) 11 4 b. the coefficient of x 4 y 7 in (x + y) 11

Binomial Coefficients BC6. Show that if p is a prime and k is an integer such that 1  k  p-1 then p divides ( ). pkpk

Binomial Coefficients BC10. Prove that in any row of Pascal’s triangle, the sum of the entries in the odd numbered positions equals the sum of the entries in the even numbered positions.

Beware! Coincidences Often Aren’t; The Obvious Often Isn’t. How many people must be in a room to make it likely two or more of them have the same birthday? How many people must be in a room to make it likely at least one of them has the same birthday you do? Monty Hall: N (>2) doors, one has what you want behind it. You choose a door. Before opening it, Monty opens one you didn’t choose to reveal it’s not the one you want. Now, should you stay with the door you selected, or switch? Or doesn’t it matter? Doesn’t matter

Discrete Probability p(E) = |E| / |S| –Events, E, equally likely; sample space, S, finite. If two dice are rolled once, what is the probability their sum is odd? –(Outcomes: 2, 4, 6, 8, 10, 12; 3, 5, 7, 9, 11) Using counting technique to find probabilities –Problem DP11 demonstrates well # of 5-card hands that have four of the same kind # of 5-card hands that are a full house Thm: p(E) = 1 - p(E) Thm: p(E 1  E 2 ) = p(E 1 ) + p(E 2 ) – p(E 1  E 2 )

Sum of Two Dice Odd: (1,2), (1,4), (1,6), (2,1), (2,3), (2,5), (3,2), (3,4), (3,6), (4,1), (4,3), (4,5), (5,2), (5,4), (5,6), (6,1), (6,3), (6,5) Even: (1,1), (1,3), (1,5), (2,2), (2,4), (2,6), (3,1), (3,3), (3,5), (4,2), (4,4), (4,6), (5,1), (5,3), (5,5), (6,2), (6,4), (6,6) p(E) = |E| / |S| = 18 / ( ) = 1/2 Odd: (1,2), (1,4), (1,6), (2,1), (2,3), (2,5), (3,2), (3,4), (3,6), (4,1), (4,3), (4,5), (5,2), (5,4), (5,6), (6,1), (6,3), (6,5) Even: (1,1), (1,3), (1,5), (2,2), (2,4), (2,6), (3,1), (3,3), (3,5), (4,2), (4,4), (4,6), (5,1), (5,3), (5,5), (6,2), (6,4), (6,6) p(E) = |E| / |S| = 18 / ( ) = 1/2 If two dice are rolled once, what is the probability their sum is odd? (Since the smallest sum is two and the largest is twelve, perhaps there are more even sums?)

Cards  Ace Jack Queen King “Kind” “Suit”

Discrete Probability DP7. What is the probability that a card dealt from the deck is a. a spade or a heart? b. a face card? 16 cards satisfy: “jack or spade”, so probability is: C(16,1) / C(52,1) 16 cards satisfy: “jack or spade”, so probability is: C(16,1) / C(52,1) Alternatively. 4/ /52 – 1/52 Alternatively. 4/ /52 – 1/52 c. a jack or a spade?

Discrete Probability DP8. Assume you are dealt a 13 card hand. What is the probability that you have a. the ace of spades? b. at least two aces? There are C(4,2) ways to choose the two aces. The number of ways to choose the remaining three cards from 48 is C(48,3), so the probability is: C(4,2) C(48,3) / C(52,5) where C(52,5) is the number of all five card hands. There are C(4,2) ways to choose the two aces. The number of ways to choose the remaining three cards from 48 is C(48,3), so the probability is: C(4,2) C(48,3) / C(52,5) where C(52,5) is the number of all five card hands. c. exactly two aces?

Flush DP11.Compute the probability of each of the following types of poker hands: The number of ways to create a flush is: C(4,1) * C(13,5) The number of ways to create a flush is: C(4,1) * C(13,5) So the requested probability is: C(4,1) * C(13,5) / C(52,5) So the requested probability is: C(4,1) * C(13,5) / C(52,5) a.flush

Flush – an alluring incorrect answer DP11.Compute the probability of each of the following types of poker hands: What about: C(52,1) * C(12,4) / C(52,5) ??? What about: C(52,1) * C(12,4) / C(52,5) ??? Choose a first card Choose 4 more to match its suit Answer is off by a factor equal to the number of cards in the hand. Why? a.flush

Five Card Hand with Four Same Rank Choose a kind: C(13,1) Choose four out of four of a kind: C(4,4) Any fifth card: C(48,1) Number of possible five card hands: C(52,5) Desired probability: C(13,1) * C(4,4) * C(48,1) ~ C(52,5) Choose a kind: C(13,1) Choose four out of four of a kind: C(4,4) Any fifth card: C(48,1) Number of possible five card hands: C(52,5) Desired probability: C(13,1) * C(4,4) * C(48,1) ~ C(52,5) DP11.Compute the probability of each of the following types of poker hands: d. 4 of a kind

Full House Arrange 2 out of 13 kinds: P(13,2) Choose 3 out of four of the first kind: C(4,3) Choose 2 out of four of second kind: C(4,2) Desired probability: P(13,2) * C(4,3) * C(4,2) ~ C(52,5) Arrange 2 out of 13 kinds: P(13,2) Choose 3 out of four of the first kind: C(4,3) Choose 2 out of four of second kind: C(4,2) Desired probability: P(13,2) * C(4,3) * C(4,2) ~ C(52,5) DP11.Compute the probability of each of the following types of poker hands: f. full house (3 of a kind + one pair)

Lottery DP15.To play the Big Bang lottery, the contestant guesses 7 numbers out of the integers from 1 to 77, no repetitions allowed. To win, the set of guessed numbers must be a subset of the 12 integers from the same range drawn by a lottery official. (Assume on each draw, any number in the range has an equal probability of being selected.) a. What is the probability that a contestant who plays once wins the Big Bang lottery? Number of ways to select 7 of 12 numbers: C(12,7) divided by number of ways to select 7: C(77,7) Number of ways to select 7 of 12 numbers: C(12,7) divided by number of ways to select 7: C(77,7) - OR - Number of ways for lottery to select 12 when drawing our 7: C(70,5) divided by number of ways to select 12: C(80,12) - OR - Number of ways for lottery to select 12 when drawing our 7: C(70,5) divided by number of ways to select 12: C(80,12)

Defining Independence Two events, E 1 and E 2, are called independent if p(E 1  E 2 ) = p(E 1 ) * p(E 2 ). It’s very important to know whether two events are independent. - If events are treated as independent, and they’re not, it can seriously degrade the quality of any analysis that assumes they are. Analysis in which events can be assumed independent is often simplified considerably.

Evaluating Independence DP18. Let E 1, E 2, … E n be events in the sample space S. For each of the following propositions, restate it in English, say whether it is true or false, and give an argument supporting your answer. b. P(E 1  E 1 ) = 1 c. If E 1, E 2, and E 3 are independent events, then P(E 1  E 2  E 3 ) = P(E 1 ) P(E 2 ) P(E 3 ). d. P(E 1  E 2 ) = P(E 1 ) + P(E 2 ) e. P(E 1  E 2 )  P(E 1 ) + P(E 2 ) E 1  E 2  P(E 1 )  P(E 2 ) TRUE. Why? E 1  E 2  |E 1 |  |E 2 |  |E 1 | / |S|  |E 2 | / |S|  P(E 1 )  P(E 2 ) E 1  E 2  P(E 1 )  P(E 2 ) TRUE. Why? E 1  E 2  |E 1 |  |E 2 |  |E 1 | / |S|  |E 2 | / |S|  P(E 1 )  P(E 2 ) a. E 1  E 2  P(E 1 )  P(E 2 )

Evaluating Independence DP18. Let E 1, E 2, … E n be events in the sample space S. For each of the following propositions, restate it in English, say whether it is true or false, and give an argument supporting your answer. a.E 1  E 2  P(E 1 )  P(E 2 ) b. P(E 1  E 1 ) = 1 c. If E 1, E 2, and E 3 are independent events, then P(E 1  E 2  E 3 ) = P(E 1 ) P(E 2 ) P(E 3 ). d. P(E 1  E 2 ) = P(E 1 ) + P(E 2 ) P(E 1  E 2 )  P(E 1 ) + P(E 2 ) TRUE. Why? |E 1  E 2 |  |E 1 | + |E 2 | by def of   |E 1  E 2 | / |S|  |E 1 | / |S| + |E 2 | / |S|  P(E 1  E 2 )  P(E 1 ) + P(E 2 ) P(E 1  E 2 )  P(E 1 ) + P(E 2 ) TRUE. Why? |E 1  E 2 |  |E 1 | + |E 2 | by def of   |E 1  E 2 | / |S|  |E 1 | / |S| + |E 2 | / |S|  P(E 1  E 2 )  P(E 1 ) + P(E 2 ) e. P(E 1  E 2 )  P(E 1 ) + P(E 2 )

In a room with 82 people in it, what are the odds two or more of them have the same birthday?

In a room with 82 people in it, what are the odds one of them has the same birthday you do? - different question! Look here

X ??? Stick, or switch?

Monty Hall with N Doors DP17. Generalize the Monty Hall problem to n  4 doors. After you’ve selected a door and Monty opens one with a valueless prize behind it, should you switch doors if offered the opportunity? Compute the probability that you win if you stick with your original choice and the probability that you win if you switch to another unopened door. ¼ chance of winning initially, and if you do not change. Thus, ¾ chance it’s one of the other doors. Since there are only two equally likely choices, chances if you change are 3/8. ¼ chance of winning initially, and if you do not change. Thus, ¾ chance it’s one of the other doors. Since there are only two equally likely choices, chances if you change are 3/8.

Beware! Coincidences Often Aren’t; The obvious often isn’t. How many people must be in a room to make it likely two or more of them have the same birthday? How many people must be in a room to make it likely at least one of them has the same birthday you do? Monty Hall: N (>2) doors, one has what you want behind it. You choose a door. Before opening it, Monty opens one you didn’t choose to reveal it’s not the one you want. Now, should you stay with the door you selected, or switch? Or doesn’t it matter? Doesn’t matter

An Empirical Test of Our Theory Everybody write down a number: 1, 2, or 3 Loop until my point is made Student a: Tell us your number (pick a door) Student b: Tell us a number that is not the number “a” chose, and not the number you wrote down (open a door that is not the one “a” selected and not the one with the prize) Student a: Pick the remaining number (switch!) Student b: Is this the number you wrote down? yes -> switching paid off no -> didn’t pay off Student a: Tell us your number (pick a door) Student b: Tell us a number that is not the number “a” chose, and not the number you wrote down (open a door that is not the one “a” selected and not the one with the prize) Student a: Pick the remaining number (switch!) Student b: Is this the number you wrote down? yes -> switching paid off no -> didn’t pay off

Transition

Match Some DP16.Consider a lottery in which the contestant selects 6 numbers from among 40 possible, and 6 numbers are also chosen randomly by the state. What is the probability that exactly 5 (i.e. not 6) of the numbers chosen by the contestant match 5 of the 6 chosen by the state? Ways to select 5 out of 6: C(6,5) Ways to select remaining number: * C(34,1) divided by number of ways to select 6: C(40,6) Ways to select 5 out of 6: C(6,5) Ways to select remaining number: * C(34,1) divided by number of ways to select 6: C(40,6)