Section continued: Counting poker hands

Size: px
Start display at page:

Download "Section continued: Counting poker hands"

Transcription

1 1 Section continued: Counting poker hands

2 2 Example A poker hand consists of 5 cards drawn from a 52-card deck.

3 2 Example A poker hand consists of 5 cards drawn from a 52-card deck. a) How many different poker hands are there?

4 2 Example A poker hand consists of 5 cards drawn from a 52-card deck. a) How many different poker hands are there? b) How many different poker hands are there, with all the cards from the suit?

5 2 Example A poker hand consists of 5 cards drawn from a 52-card deck. a) How many different poker hands are there? b) How many different poker hands are there, with all the cards from the suit? c) How many different poker hands are there, with not all cards from the suit?

6 3 Solution Order of the cards in a hand does not matter, so we re dealing with combinations.

7 3 Solution Order of the cards in a hand does not matter, so we re dealing with combinations. a) We want to choose 5 items out of 52.

8 3 Solution Order of the cards in a hand does not matter, so we re dealing with combinations. a) We want to choose 5 items out of 52.There are C 5 = = 2, 598, 960 different poker hands.

9 4 Solution b) For the all- hand, we choose 5 items out of 13.

10 4 Solution b) For the all- hand, we choose 5 items out of 13.There are C 5 = = 1, 287 different poker hands with all cards.

11 5 Solution c) Finally, by the complement principle, there are 2, 598, 960 1, 287 = 2, 597, 673 different poker hands where not all cards are.

12 6 Harder! Example How many full house poker hands are there? (Pair + triple)

13 7 How to count?

14 7 How to count? Imagine having to describe your hand. What info must you relate?

15 7 How to count? Imagine having to describe your hand. What info must you relate? 1. Value of pair (e.g., 3, 7, J, A)

16 7 How to count? Imagine having to describe your hand. What info must you relate? 1. Value of pair (e.g., 3, 7, J, A) 2. (Different) value of triple

17 7 How to count? Imagine having to describe your hand. What info must you relate? 1. Value of pair (e.g., 3, 7, J, A) 2. (Different) value of triple 3. Suits of the 2 pair cards

18 7 How to count? Imagine having to describe your hand. What info must you relate? 1. Value of pair (e.g., 3, 7, J, A) 2. (Different) value of triple 3. Suits of the 2 pair cards 4. Suits of the 3 triple cards

19 7 How to count? Imagine having to describe your hand. What info must you relate? 1. Value of pair (e.g., 3, 7, J, A) 2. (Different) value of triple 3. Suits of the 2 pair cards 4. Suits of the 3 triple cards Independent!

20 8 1. Value of pair 2. (Different) value of triple 3. Suits of the 2 pair cards 4. Suits of the 3 triple cards

21 8 1. Value of pair 13 C 1 outcomes 2. (Different) value of triple 3. Suits of the 2 pair cards 4. Suits of the 3 triple cards

22 8 1. Value of pair 13 C 1 outcomes 2. (Different) value of triple 12 C 1 3. Suits of the 2 pair cards 4. Suits of the 3 triple cards

23 8 1. Value of pair 13 C 1 outcomes 2. (Different) value of triple 12 C 1 3. Suits of the 2 pair cards 4 C 2 4. Suits of the 3 triple cards

24 8 1. Value of pair 13 C 1 outcomes 2. (Different) value of triple 12 C 1 3. Suits of the 2 pair cards 4 C 2 4. Suits of the 3 triple cards 4 C 3

25 8 1. Value of pair 13 C 1 outcomes 2. (Different) value of triple 12 C 1 3. Suits of the 2 pair cards 4 C 2 4. Suits of the 3 triple cards 4 C 3 13C 1 12 C 1 4 C 2 4 C 3 =

26 9 So how many full house hands are there?

27 9 So how many full house hands are there? 13C 1 12 C 1 4 C 2 4 C 3 = = 3744

28 10 Example How many pair hands are there?

29 11 How to count?

30 11 How to count? 1. Value of pair

31 11 How to count? 1. Value of pair 2. Suits of those two cards

32 11 How to count? 1. Value of pair 2. Suits of those two cards 3. Values of the other three cards (must be distinct!)

33 11 How to count? 1. Value of pair 2. Suits of those two cards 3. Values of the other three cards (must be distinct!) 4. Suits of the other three cards

34 11 How to count? 1. Value of pair 2. Suits of those two cards 3. Values of the other three cards (must be distinct!) 4. Suits of the other three cards Independent!

35 12 1. Value of pair 2. Suits of those two cards 3. Values of the other three cards (must be distinct!) 4. Suits of the other three cards

36 12 1. Value of pair 13 C 1 2. Suits of those two cards 3. Values of the other three cards (must be distinct!) 4. Suits of the other three cards

37 12 1. Value of pair 13 C 1 2. Suits of those two cards 4 C 2 3. Values of the other three cards (must be distinct!) 4. Suits of the other three cards

38 12 1. Value of pair 13 C 1 2. Suits of those two cards 4 C 2 3. Values of the other three cards (must be distinct!) 12 C 3 4. Suits of the other three cards

39 12 1. Value of pair 13 C 1 2. Suits of those two cards 4 C 2 3. Values of the other three cards (must be distinct!) 12 C 3 4. Suits of the other three cards ( 4 C 1 ) 3

40 12 1. Value of pair 13 C 1 2. Suits of those two cards 4 C 2 3. Values of the other three cards (must be distinct!) 12 C 3 4. Suits of the other three cards ( 4 C 1 ) 3 13C 1 4 C 2 12 C 3 ( 4 C 1 ) 3 =

41 13 So, the number of pair poker hands is:

42 13 So, the number of pair poker hands is: 13C 1 4 C 2 12 C 3 ( 4 C 1 ) 3 = = 1, 098, 240

43 14 Next time: Section 2.3: Probability

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

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 LISTING THE WAYS A pair of dice are to be thrown getting a total of 7 spots? There are What is the chance of possible ways for 2 dice to fall: 1 q 1 w 1 e 1 r 1 t 1 y 2 q 2 w 2 e 2 r 2 t 2 y 3 q 3 w 3

More information

Mixed Counting Problems

Mixed Counting Problems We have studied a number of counting principles and techniques since the beginning of the course and when we tackle a counting problem, we may have to use one or a combination of these principles. The

More information

2.5 Sample Spaces Having Equally Likely Outcomes

2.5 Sample Spaces Having Equally Likely Outcomes Sample Spaces Having Equally Likely Outcomes 3 Sample Spaces Having Equally Likely Outcomes Recall that we had a simple example (fair dice) before on equally-likely sample spaces Since they will appear

More information

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

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

More information

Discrete Finite Probability Probability 1

Discrete Finite Probability Probability 1 Discrete Finite Probability Probability 1 In these notes, I will consider only the finite discrete case. That is, in every situation the possible outcomes are all distinct cases, which can be modeled by

More information

Permutations: The number of arrangements of n objects taken r at a time is. P (n, r) = n (n 1) (n r + 1) =

Permutations: The number of arrangements of n objects taken r at a time is. P (n, r) = n (n 1) (n r + 1) = Section 6.6: Mixed Counting Problems We have studied a number of counting principles and techniques since the beginning of the course and when we tackle a counting problem, we may have to use one or a

More information

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.

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

More information

11.2. Counting Techniques and Probability

11.2. Counting Techniques and Probability 11.2. Counting Techniques and Probability 1 Objectives A. Draw and use a tree diagram to find the probability of an event. B. Use permutations and combinations to find the probability of an event. C. Solve

More information

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

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.

More information

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

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

More information

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

DISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics 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

More information

13.3 Permutations and Combinations

13.3 Permutations and Combinations 13.3 Permutations and Combinations There are 6 people who want to use an elevator. There is only room for 4 people. How many ways can 6 people try to fill this elevator (one at a time)? There are 6 people

More information

Probability and Statistics. Copyright Cengage Learning. All rights reserved.

Probability and Statistics. Copyright Cengage Learning. All rights reserved. Probability and Statistics Copyright Cengage Learning. All rights reserved. 14.2 Probability Copyright Cengage Learning. All rights reserved. Objectives What Is Probability? Calculating Probability by

More information

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

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC) 2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are

More information

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

n! = n(n 1)(n 2) 3 2 1 A Counting A.1 First principles If the sample space Ω is finite and the outomes are equally likely, then the probability measure is given by P(E) = E / Ω where E denotes the number of outcomes in the event

More information

CSE 21 Mathematics for Algorithm and System Analysis

CSE 21 Mathematics for Algorithm and System Analysis CSE 21 Mathematics for Algorithm and System Analysis Unit 1: Basic Count and List Section 3: Set CSE21: Lecture 3 1 Reminder Piazza forum address: http://piazza.com/ucsd/summer2013/cse21/hom e Notes on

More information

Discrete Structures Lecture Permutations and Combinations

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

More information

A Probability Work Sheet

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

More information

Compound Probability. Set Theory. Basic Definitions

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

More information

{ a, b }, { a, c }, { b, c }

{ a, b }, { a, c }, { b, c } 12 d.) 0(5.5) c.) 0(5,0) h.) 0(7,1) a.) 0(6,3) 3.) Simplify the following combinations. PROBLEMS: C(n,k)= the number of combinations of n distinct objects taken k at a time is COMBINATION RULE It can easily

More information

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

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

More information

Counting Poker Hands

Counting Poker Hands Counting Poker Hands George Ballinger In a standard deck of cards there are kinds of cards: ce (),,,,,,,,,, ack (), ueen () and ing (). Each of these kinds comes in four suits: Spade (), Heart (), Diamond

More information

CISC-102 Fall 2017 Week 8

CISC-102 Fall 2017 Week 8 Week 8 Page! of! 34 Playing cards. CISC-02 Fall 207 Week 8 Some of the following examples make use of the standard 52 deck of playing cards as shown below. There are 4 suits (clubs, spades, hearts, diamonds)

More information

Example 1. An urn contains 100 marbles: 60 blue marbles and 40 red marbles. A marble is drawn from the urn, what is the probability that the marble

Example 1. An urn contains 100 marbles: 60 blue marbles and 40 red marbles. A marble is drawn from the urn, what is the probability that the marble Example 1. An urn contains 100 marbles: 60 blue marbles and 40 red marbles. A marble is drawn from the urn, what is the probability that the marble is blue? Assumption: Each marble is just as likely to

More information

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

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

More information

Board Question 1. There are 5 Competitors in 100m final. How many ways can gold silver and bronze be awarded? May 27, / 28

Board Question 1. There are 5 Competitors in 100m final. How many ways can gold silver and bronze be awarded? May 27, / 28 Board Question 1 There are 5 Competitors in 100m final. How many ways can gold silver and bronze be awarded? Photograph of Usain Bolt running a race removed due to copyright restrictions. May 27, 2014

More information

Counting and Probability Math 2320

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

More information

EECS 203 Spring 2016 Lecture 15 Page 1 of 6

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

More information

Section : Combinations and Permutations

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

More information

CSC/MATA67 Tutorial, Week 12

CSC/MATA67 Tutorial, Week 12 CSC/MATA67 Tutorial, Week 12 November 23, 2017 1 More counting problems A class consists of 15 students of whom 5 are prefects. Q: How many committees of 8 can be formed if each consists of a) exactly

More information

Chapter 1. Probability

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.

More information

Lecture 6 Probability

Lecture 6 Probability Lecture 6 Probability Example: When you toss a coin, there are only two possible outcomes, heads and tails. What if we toss a coin two times? Figure below shows the results of tossing a coin 5000 times

More information

Probability: Terminology and Examples Spring January 1, / 22

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

More information

6/24/14. The Poker Manipulation. The Counting Principle. MAFS.912.S-IC.1: Understand and evaluate random processes underlying statistical experiments

6/24/14. The Poker Manipulation. The Counting Principle. MAFS.912.S-IC.1: Understand and evaluate random processes underlying statistical experiments The Poker Manipulation Unit 5 Probability 6/24/14 Algebra 1 Ins1tute 1 6/24/14 Algebra 1 Ins1tute 2 MAFS. 7.SP.3: Investigate chance processes and develop, use, and evaluate probability models MAFS. 7.SP.3:

More information

Problem Set 2. Counting

Problem Set 2. Counting Problem Set 2. Counting 1. (Blitzstein: 1, Q3 Fred is planning to go out to dinner each night of a certain week, Monday through Friday, with each dinner being at one of his favorite ten restaurants. i

More information

MGF 1106: Exam 2 Solutions

MGF 1106: Exam 2 Solutions MGF 1106: Exam 2 Solutions 1. (15 points) A coin and a die are tossed together onto a table. a. What is the sample space for this experiment? For example, one possible outcome is heads on the coin and

More information

Finite Math Section 6_4 Solutions and Hints

Finite Math Section 6_4 Solutions and Hints Finite Math Section 6_4 Solutions and Hints by Brent M. Dingle for the book: Finite Mathematics, 7 th Edition by S. T. Tan. DO NOT PRINT THIS OUT AND TURN IT IN!!!!!!!! This is designed to assist you in

More information

Today s Topics. Sometimes when counting a set, we count the same item more than once

Today s Topics. Sometimes when counting a set, we count the same item more than once Today s Topics Inclusion/exclusion principle The pigeonhole principle Sometimes when counting a set, we count the same item more than once For instance, if something can be done n 1 ways or n 2 ways, but

More information

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

More information

Permutations and Combinations Section

Permutations and Combinations Section A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Permutations and Combinations Section 13.3-13.4 Dr. John Ehrke Department of Mathematics Fall 2012 Permutations A permutation

More information

Name Date. Sample Spaces and Probability For use with Exploration 12.1

Name Date. Sample Spaces and Probability For use with Exploration 12.1 . Sample Spaces and Probability For use with Exploration. Essential Question How can you list the possible outcomes in the sample space of an experiment? The sample space of an experiment is the set of

More information

Chapter 1. Probability

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.

More information

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

More information

Today s Topics. Next week: Conditional Probability

Today s Topics. Next week: Conditional Probability Today s Topics 2 Last time: Combinations Permutations Group Assignment TODAY: Probability! Sample Spaces and Event Spaces Axioms of Probability Lots of Examples Next week: Conditional Probability Sets

More information

4.3 Rules of Probability

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:

More information

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

More information

Basic Probability Models. Ping-Shou Zhong

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

More information

Finite Math - Fall 2016

Finite Math - Fall 2016 Finite Math - Fall 206 Lecture Notes - /28/206 Section 7.4 - Permutations and Combinations There are often situations in which we have to multiply many consecutive numbers together, for example, in examples

More information

CSE 21: Midterm 1 Solution

CSE 21: Midterm 1 Solution CSE 21: Midterm 1 Solution August 16, 2007 No books, no calculators. Two double-sided 3x5 cards with handwritten notes allowed. Before starting the test, please write your test number on the top-right

More information

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

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.

More information

Elementary Combinatorics CE 311S

Elementary Combinatorics CE 311S CE 311S INTRODUCTION How can we actually calculate probabilities? Let s assume that there all of the outcomes in the sample space S are equally likely. If A is the number of outcomes included in the event

More information

Discrete Random Variables Day 1

Discrete Random Variables Day 1 Discrete Random Variables Day 1 What is a Random Variable? Every probability problem is equivalent to drawing something from a bag (perhaps more than once) Like Flipping a coin 3 times is equivalent to

More information

PROBABILITY. 1. Introduction. Candidates should able to:

PROBABILITY. 1. Introduction. Candidates should able to: PROBABILITY Candidates should able to: evaluate probabilities in simple cases by means of enumeration of equiprobable elementary events (e.g for the total score when two fair dice are thrown), or by calculation

More information

Solutions for Exam I, Math 10120, Fall 2016

Solutions for Exam I, Math 10120, Fall 2016 Solutions for Exam I, Math 10120, Fall 2016 1. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} A = {1, 2, 3} B = {2, 4, 6, 8, 10}. C = {4, 5, 6, 7, 8}. Which of the following sets is equal to (A B) C? {1, 2, 3,

More information

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5.

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5. Math 166 Spring 2007 c Heather Ramsey Page 1 Math 166 - Exam 2 Review NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5. Section 7.1 - Experiments, Sample Spaces,

More information

Stat 19, Probability and Poker. Rick Paik Schoenberg Outline for the day: 1. Discuss Addiction.

Stat 19, Probability and Poker. Rick Paik Schoenberg Outline for the day: 1. Discuss Addiction. Stat 19, Probability and Poker. Rick Paik Schoenberg Outline for the day: 1. Discuss Addiction. 2. R. 3. Ly vs. Negreanu. 4. Counting and combinations. 5. P(A after first ace). Read harrington1.pdf for

More information

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5.

Math Exam 2 Review. NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5. Math 166 Spring 2007 c Heather Ramsey Page 1 Math 166 - Exam 2 Review NOTE: For reviews of the other sections on Exam 2, refer to the first page of WIR #4 and #5. Section 7.1 - Experiments, Sample Spaces,

More information

Chapter 5 - Elementary Probability Theory

Chapter 5 - Elementary Probability Theory Chapter 5 - Elementary Probability Theory Historical Background Much of the early work in probability concerned games and gambling. One of the first to apply probability to matters other than gambling

More information

Section 5.4 Permutations and Combinations

Section 5.4 Permutations and Combinations Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to

More information

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

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

More information

Section 5.4 Permutations and Combinations

Section 5.4 Permutations and Combinations Section 5.4 Permutations and Combinations Definition: n-factorial For any natural number n, n! = n( n 1)( n 2) 3 2 1. 0! = 1 A combination of a set is arranging the elements of the set without regard to

More information

Name Instructor: Uli Walther

Name Instructor: Uli Walther Name Instructor: Uli Walther Math 416 Fall 2016 Practice Exam Questions You are not allowed to use books or notes. Calculators are permitted. Full credit is given for complete correct solutions. Please

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #22: Generalized Permutations and Combinations Based on materials developed by Dr. Adam Lee Counting

More information

Theory of Probability - Brett Bernstein

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

More information

PROBABILITY TOPIC TEST MU ALPHA THETA 2007

PROBABILITY TOPIC TEST MU ALPHA THETA 2007 PROBABILITY TOPI TEST MU ALPHA THETA 00. Richard has red marbles and white marbles. Richard s friends, Vann and Penelo, each select marbles from the bag. What is the probability that Vann selects red marble

More information

The probability set-up

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

More information

Section The Multiplication Principle and Permutations

Section The Multiplication Principle and Permutations Section 2.1 - The Multiplication Principle and Permutations Example 1: A yogurt shop has 4 flavors (chocolate, vanilla, strawberry, and blueberry) and three sizes (small, medium, and large). How many different

More information

, -the of all of a probability experiment. consists of outcomes. (b) List the elements of the event consisting of a number that is greater than 4.

, -the of all of a probability experiment. consists of outcomes. (b) List the elements of the event consisting of a number that is greater than 4. 4-1 Sample Spaces and Probability as a general concept can be defined as the chance of an event occurring. In addition to being used in games of chance, probability is used in the fields of,, and forecasting,

More information

Combinatorics: The Fine Art of Counting

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

More information

Basic Concepts of Probability and Counting Section 3.1

Basic Concepts of Probability and Counting Section 3.1 Basic Concepts of Probability and Counting Section 3.1 Summer 2013 - Math 1040 June 17 (1040) M 1040-3.1 June 17 1 / 12 Roadmap Basic Concepts of Probability and Counting Pages 128-137 Counting events,

More information

18.05 Problem Set 1, Spring 2014 Solutions

18.05 Problem Set 1, Spring 2014 Solutions 18.05 Problem Set 1, Spring 201 Solutions Problem 1. (10 pts.) answer: (reasons below) P (two-pair) =.07539, P (three-of-a-kind) = 0.021128, two pairs is more likely We create each hand by a sequence of

More information

Math 166: Topics in Contemporary Mathematics II

Math 166: Topics in Contemporary Mathematics II Math 166: Topics in Contemporary Mathematics II Xin Ma Texas A&M University September 30, 2017 Xin Ma (TAMU) Math 166 September 30, 2017 1 / 11 Last Time Factorials For any natural number n, we define

More information

Chapter 5: Probability: What are the Chances? Section 5.2 Probability Rules

Chapter 5: Probability: What are the Chances? Section 5.2 Probability Rules + Chapter 5: Probability: What are the Chances? Section 5.2 + Two-Way Tables and Probability When finding probabilities involving two events, a two-way table can display the sample space in a way that

More information

CSE 312: Foundations of Computing II Quiz Section #1: Counting (solutions)

CSE 312: Foundations of Computing II Quiz Section #1: Counting (solutions) CSE 31: Foundations of Computing II Quiz Section #1: Counting (solutions Review: Main Theorems and Concepts 1. Product Rule: Suppose there are m 1 possible outcomes for event A 1, then m possible outcomes

More information

Simulations. 1 The Concept

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

More information

Math 227 Elementary Statistics. Bluman 5 th edition

Math 227 Elementary Statistics. Bluman 5 th edition Math 227 Elementary Statistics Bluman 5 th edition CHAPTER 4 Probability and Counting Rules 2 Objectives Determine sample spaces and find the probability of an event using classical probability or empirical

More information

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

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7 CSCI 00 Foundations of Computer Science (FoCS) Solutions for Homework 7 Homework Problems. [0 POINTS] Problem.4(e)-(f) [or F7 Problem.7(e)-(f)]: In each case, count. (e) The number of orders in which a

More information

If you roll a die, what is the probability you get a four OR a five? What is the General Education Statistics

If you roll a die, what is the probability you get a four OR a five? What is the General Education Statistics If you roll a die, what is the probability you get a four OR a five? What is the General Education Statistics probability that you get neither? Class Notes The Addition Rule (for OR events) and Complements

More information

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

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

More information

More Probability: Poker Hands and some issues in Counting

More Probability: Poker Hands and some issues in Counting More Probability: Poker Hands and some issues in Counting Data From Thursday Everybody flipped a pair of coins and recorded how many times they got two heads, two tails, or one of each. We saw that the

More information

Optimal, Approx. Optimal, and Fair Play of the Fowl Play

Optimal, Approx. Optimal, and Fair Play of the Fowl Play Optimal, Approximately Optimal, and Fair Play of the Fowl Play Card Game Todd W. Neller Marcin Malec Clifton G. M. Presser Forrest Jacobs ICGA Conference, Yokohama 2013 Outline 1 Introduction to the Fowl

More information

Poker: Further Issues in Probability. Poker I 1/29

Poker: Further Issues in Probability. Poker I 1/29 Poker: Further Issues in Probability Poker I 1/29 How to Succeed at Poker (3 easy steps) 1 Learn how to calculate complex probabilities and/or memorize lots and lots of poker-related probabilities. 2 Take

More information

"Well, statistically speaking, you are for more likely to have an accident at an intersection, so I just make sure that I spend less time there.

Well, statistically speaking, you are for more likely to have an accident at an intersection, so I just make sure that I spend less time there. 6.2 Probability Models There was a statistician who, when driving his car, would always accelerate hard before coming to an intersection, whiz straight through it, and slow down again once he was beyond

More information

Name: 1. Match the word with the definition (1 point each - no partial credit!)

Name: 1. Match the word with the definition (1 point each - no partial credit!) Chapter 12 Exam Name: Answer the questions in the spaces provided. If you run out of room, show your work on a separate paper clearly numbered and attached to this exam. SHOW ALL YOUR WORK!!! Remember

More information

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

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza Probability Theory Mohamed I. Riffi Islamic University of Gaza Table of contents 1. Chapter 1 Probability Properties of probability Counting techniques 1 Chapter 1 Probability Probability Theorem P(φ)

More information

CSE 312: Foundations of Computing II Quiz Section #1: Counting

CSE 312: Foundations of Computing II Quiz Section #1: Counting CSE 312: Foundations of Computing II Quiz Section #1: Counting Review: Main Theorems and Concepts 1. Product Rule: Suppose there are m 1 possible outcomes for event A 1, then m 2 possible outcomes for

More information

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH1301 DISCRETE MATHEMATICS. Time Allowed: 2 hours

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH1301 DISCRETE MATHEMATICS. Time Allowed: 2 hours NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION 206-207 DISCRETE MATHEMATICS May 207 Time Allowed: 2 hours INSTRUCTIONS TO CANDIDATES. This examination paper contains FOUR (4) questions and comprises

More information

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. C) 1 6

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. C) 1 6 Math 300 Exam 4 Review (Chapter 11) Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Give the probability that the spinner shown would land on

More information

Most of the time we deal with theoretical probability. Experimental probability uses actual data that has been collected.

Most of the time we deal with theoretical probability. Experimental probability uses actual data that has been collected. AFM Unit 7 Day 3 Notes Theoretical vs. Experimental Probability Name Date Definitions: Experiment: process that gives a definite result Outcomes: results Sample space: set of all possible outcomes Event:

More information

The probability set-up

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

More information

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

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

More information

Lotto! Online Product Guide

Lotto! Online Product Guide BCLC Lotto! Online Product Guide Resource Manual for Lottery Retailers October 18, 2016 The focus of this document is to provide retailers the tools needed in order to feel knowledgeable when selling and

More information

THREE CARD POKER. Game Rules. Definitions Mode of Play How to Play Settlement Irregularities

THREE CARD POKER. Game Rules. Definitions Mode of Play How to Play Settlement Irregularities THREE CARD POKER Game Rules 1. Definitions 2. Mode of Play 3. 4. How to Play Settlement 5. Irregularities 31 1. Definitions 1.1. The games are played with a standard 52 card deck. The cards are distributed

More information

INDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2

INDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2 INDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2 WARM UP Students in a mathematics class pick a card from a standard deck of 52 cards, record the suit, and return the card to the deck. The results

More information

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

NUMB3RS Activity: A Bit of Basic Blackjack. Episode: Double Down Teacher Page 1 : A Bit of Basic Blackjack Topic: Probability involving sampling without replacement Grade Level: 8-12 and dependent trials. Objective: Compute the probability of winning in several blackjack

More information

Chapter 2. Permutations and Combinations

Chapter 2. Permutations and Combinations 2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find

More information

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:

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

More information

Def: The intersection of A and B is the set of all elements common to both set A and set B

Def: The intersection of A and B is the set of all elements common to both set A and set B Def: Sample Space the set of all possible outcomes Def: Element an item in the set Ex: The number "3" is an element of the "rolling a die" sample space Main concept write in Interactive Notebook Intersection:

More information

When a number cube is rolled once, the possible numbers that could show face up are

When a number cube is rolled once, the possible numbers that could show face up are C3 Chapter 12 Understanding Probability Essential question: How can you describe the likelihood of an event? Example 1 Likelihood of an Event When a number cube is rolled once, the possible numbers that

More information

1 of 5 7/16/2009 6:57 AM Virtual Laboratories > 13. Games of Chance > 1 2 3 4 5 6 7 8 9 10 11 3. Simple Dice Games In this section, we will analyze several simple games played with dice--poker dice, chuck-a-luck,

More information