DISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics

Similar documents
Counting integral solutions

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

CSC/MTH 231 Discrete Structures II Spring, Homework 5

Poker: Probabilities of the Various Hands

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?

Developed by Rashmi Kathuria. She can be reached at

Honors Precalculus Chapter 9 Summary Basic Combinatorics

Counting and Probability

Poker: Probabilities of the Various Hands

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

More Probability: Poker Hands and some issues in Counting

Unit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION

CSE 21 Mathematics for Algorithm and System Analysis

Introductory Probability


Discrete Random Variables Day 1

Week 1: Probability models and counting

Math 1324 Finite Mathematics Sections 8.2 and 8.3 Conditional Probability, Independent Events, and Bayes Theorem

Chapter 1. Probability

Discrete Finite Probability Probability 1

Foundations of Probability Worksheet Pascal

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)

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:

Discrete Mathematics. Spring 2017

Exam III Review Problems

Jong C. Park Computer Science Division, KAIST

CS 361: Probability & Statistics

Activity 1: Play comparison games involving fractions, decimals and/or integers.

Classical vs. Empirical Probability Activity

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

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology

STAT 311 (Spring 2016) Worksheet: W3W: Independence due: Mon. 2/1

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

Section continued: Counting poker hands

Probability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37

Probability Review 41

COUNTING AND PROBABILITY

Review. Natural Numbers: Whole Numbers: Integers: Rational Numbers: Outline Sec Comparing Rational Numbers

Reading 14 : Counting

Chapter 1. Probability

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza

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

Problem Set 2. Counting

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

Permutations and Combinations Practice Test

Pascal s Triangle: Flipping Coins & Binomial Coefficients. Robert Campbell 5/6/2014 1

Math Steven Noble. November 24th. Steven Noble Math 3790

Discrete probability and the laws of chance

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY

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

Math 1313 Section 6.2 Definition of Probability

Algebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations

Multiplication and Probability

Probability. A Mathematical Model of Randomness

Discrete Structures for Computer Science

Combinatorial Proofs

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

Final Exam, Math 6105

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

With Question/Answer Animations. Chapter 6

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

1. Determine whether the following experiments are binomial.

Week 3 Classical Probability, Part I

Discrete Structures Lecture Permutations and Combinations

8.2 Union, Intersection, and Complement of Events; Odds

Exceptional & Free Online Resources for Teaching Probability

NUMB3RS Activity: A Bit of Basic Blackjack. Episode: Double Down

The probability set-up

2 A fair coin is flipped 8 times. What is the probability of getting more heads than tails? A. 1 2 B E. NOTA

Math 152: Applicable Mathematics and Computing

LAMC Junior Circle February 3, Oleg Gleizer. Warm-up

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Counting. Chapter 6. With Question/Answer Animations

LISTING THE WAYS. getting a total of 7 spots? possible ways for 2 dice to fall: then you win. But if you roll. 1 q 1 w 1 e 1 r 1 t 1 y

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.)

n! = n(n 1)(n 2) 3 2 1

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

2.5 Sample Spaces Having Equally Likely Outcomes

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

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

POKER (AN INTRODUCTION TO COUNTING)

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?

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)

STATION 1: ROULETTE. Name of Guesser Tally of Wins Tally of Losses # of Wins #1 #2

A Probability Work Sheet

The probability set-up

Fundamental. If one event can occur m ways and another event can occur n ways, then the number of ways both events can occur is:.

Chapter 8: Probability: The Mathematics of Chance

Statistics Intermediate Probability

Diamond ( ) (Black coloured) (Black coloured) (Red coloured) ILLUSTRATIVE EXAMPLES

Combinatorics: The Fine Art of Counting

1. Expand (i.e., write without parentheses) each of the following.

Casino Lab AP Statistics

Chapter 2. Permutations and Combinations

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

Unit 9: Probability Assignments

Math 102 Practice for Test 3

Topics to be covered

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b

Transcription:

DISCUSSION #8 FRIDAY MAY 25 TH 2007 Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics

2 Homework 8 Hints and Examples

3 Section 5.4 Binomial Coefficients

Binomial Theorem 4 Example: j j n n j n y x j n y x 0 ) ( 2 2 2 0 1 1 0 2 2 2 0 2 2 2 2 1 2 0 2 2 ) ( y xy x y x y x y x y x j y x j j j

Binomial Theorem 5 ( x y) n n j0 n j x n j y j What is the coefficient of x 9 in (2 x) 19? Rewrite as ( (-x) + 2 ) 19 We encounter x 9 when n j = 9, or when j = 10 Therefore that term will look like: 19 (-x) 10 9 2 10 19 (-1) 10 Therefore coefficient is -94,595,072. 9 x 9 2 10-94,595,072 x 9

Example: Expanding (11 b ) 4 6 Suppose b is an integer such that b 7. Find the base-b expansion of (11 b ) 4. Hint 1: The numeral 11 in base b represents the number b + 1. 11 2 is 2 + 1 = 3 in binary 11 10 is 10 + 1 = 11 in decimal 11 16 is 16 + 1 = 17 in hexadecimal

Example: Expanding (11 b ) 4 7 Hint 1: The numeral 11 in base b represents the number b + 1. Hint 2: Therefore you want to find (b + 1) 4 Use Binomial Theorem to expand. Use Pascal s Triangle to find coefficients. Hint 3: As long as b 7, any integer < 7 in base b is that digit.

Example: Expanding (11 b ) 4 8 Hint 3: When i < b, then i = (i) b (meaning there is no change in the digits used. For example: 4 = (4) 16 and 6 = (6) 8 but 3 = (11) 2 Hint 4: The resulting numeral will be the concatenation of the coefficients. For example: 13 = 1 2 3 + 1 2 2 + 0 2 1 + 1 2 0 = (1101) 2

9 Section 6.1 Introduction to Discrete Probability

Finite Probability 10 S: Set of possible outcomes E: An event such that E S p(e): Probability of event E where p(e) = E S

Example: Choosing Cards 11 What is the probability you choose a king? A diamond? A king or a diamond?

Example: Choosing Cards 12 S: Deck of cards A 1 2 3 4 5 6 7 8 9 10 J Q K A 1 2 3 4 5 6 7 8 9 10 J Q K A 1 2 3 4 5 6 7 8 9 10 J Q K A 1 2 3 4 5 6 7 8 9 10 J Q K What is the size of S? S = 52 cards total

Example: Choosing Cards 13 S: Deck of cards A 1 2 3 4 5 6 7 8 9 10 J Q K A 1 2 3 4 5 6 7 8 9 10 J Q K A 1 2 3 4 5 6 7 8 9 10 J Q K A 1 2 3 4 5 6 7 8 9 10 J Q K E 1 : King Cards K K K K E 2 : Diamond Cards A 1 2 3 4 5 6 7 8 9 10 J Q K E 1 = 4 p(e 1 ) = 4 / 52 E 2 = 13 p(e 2 ) = 13 / 52

Example: Choosing Cards 14 p(e 1 ) gives probability we select a king. p(e 2 ) gives probability we select a diamond. What about the probability that we select a king or diamond? K K K K A 1 2 3 4 5 6 7 8 9 10 J Q K + K E 1 E 2 E 1 E 2

Example: Choosing Cards 15 What about the probability that we select a king or diamond? K K K K A 1 2 3 4 5 6 7 8 9 10 J Q K + K E 1 E 2 E 1 E 2 p(e 1 E 2 ) = p(e 1 ) + p(e 1 ) p(e 1 E 2 ) 4/52 + 13/52 1/52 = 16/52

Example: Two Pairs Poker Hands 16 What is the probability that a five-card poker hand contains two pairs? K 9

Example: Two Pairs Poker Hands 17 What about the probability that a five-card poker hand contains two pairs? Looking for two pairs, not a full house (etc.) What is a pair? 2 cards with: Same type or number Different suits 9

Example: Two Pairs Poker Hands 18 What about the probability that a five-card poker hand contains two pairs? What is our sample space S? Set of all poker hands S = C(52,5) How do we calculate E? 9

Example: Two Pairs Poker Hands 19 How do we calculate E? Use product rule to combine: Possible ways to choose two pairs Possible ways to choose last card How do we choose two pairs? How do we choose the last card? 10

Example: Two Pairs Poker Hands 20 How do we choose two pairs? (1) Choose two types 6 10 Types: { A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K } C(13,2) (2) For each type, choose two suits 6 6 10 Suits: {,,, } 10 C(4,2) (3) Combine using product rule C(13,2) C(4,2) C(4,2) 10

Example: Two Pairs Poker Hands 21 How do we choose the last card? 6 6 10 10? Number of choices reduced Can t choose cards already selected Can t choose types already selected (no full house) 10 10 K 6 6 10 10 6 6 10 10 = 52 4 4 = 44 cards Choose 1 out of remaining cards C(44,1) 10

Example: Two Pairs Poker Hands 22 What about the probability that a five-card poker hand contains two pairs? Combine all the results p(e) = C(13,2) C(4,2) C(4,2) C(44,1) choose 2 pairs last card 9

Example: Rolling Dice 23 Which is more likely: rolling a total of 9 when two dice are rolled when three dice are rolled?

Example: Rolling Dice 24 Which is more likely: rolling a 9 when two dice are rolled or when three dice are rolled? What is the probability of: Rolling a 9 when two dice are rolled? Rolling a 9 when three dice are rolled?

Example: Rolling Dice 25 Probability of rolling a 9 with two dice What is our sample space S? 6 6 = 36 possible outcomes rolling 2 dice What is our event E? Enumerate all pairs which sum to 9 ( 6, 3 ), ( 3, 6 ), ( 5, 4 ), and ( 4, 5 ) 4 possible ways to roll a 9 p(e) = 4 / 36 0.111

Example: Rolling Dice 26 Probability of rolling a 9 with three dice What is our sample space S? 6 6 6 = 216 possible outcomes rolling 3 dice What is our event E? Enumerate all triples which sum to 9 Zzzz 25 possible ways to roll a 9 See Section 5.5 Example 5, etc p(e) = 25 / 216 0.116

Example: Rolling Dice 27 Which is more likely: rolling a 9 when two dice are rolled or when three dice are rolled? Rolling a 9 with three dice is more likely.

Example: Monty Hall Problem 28 DOOR 1 DOOR 2 DOOR 3 You Host

Example: Monty Hall Problem 29 DOOR 1 DOOR 2 DOOR 3 Choose a door!

Example: Monty Hall Problem 30 DOOR 1 DOOR 2 DOOR 3 I choose door 2!

Example: Monty Hall Problem 31 DOOR 1 DOOR 2 DOOR 3 What s behind door 3?

Example: Monty Hall Problem 32 DOOR 1 DOOR 2 baaa

Example: Monty Hall Problem 33 DOOR 1 DOOR 2 Do you want to change?

Example: Monty Hall Problem 34 DOOR 1 DOOR 2 What is the best strategy?

Example: Monty Hall Problem 35 DOOR 1 DOOR 2 Always change doors!

Example: Monty Hall Problem 36 DOOR 1 DOOR 2 I choose door 1!

Example: Monty Hall Problem 37 DOOR 2 You won!

Example: Monty Hall Problem 38 Why is this the best strategy? Look at overall outcomes!

Example: Monty Hall Problem 39 Why is this the best strategy? Look at overall outcomes!

Example: Monty Hall Problem 40 Why is this the best strategy? Look at overall outcomes! Not Switching Wins Not Switching Loses Not Switching Loses

Example: Monty Hall Problem 41 Why is this the best strategy? Look at overall outcomes! Switching Loses Switching Wins Switching Wins

Example: Monty Hall Problem 42 Why is this the best strategy? Not switching wins 1/3 times Switching wins 2/3 times What happens when you have four doors? What is probability you win when switching? What is probability you win when not switching?