Combinatorics & Probability Section 3.4. Which Counting Technique? If the problem involves more than one category, use the Fundamental Principle of Counting.

Slides:

Advertisements

Similar presentations

Permutations and Combinations

Advertisements

Homework Answers 9) 6/24 + 6/24 = 12/24 or ½ 11) 12/ /24 = 24/24 or 1 23) P(2 and A) = (1/6 * 1/5) = 1/30 P(2 and B) = (1/6 * 1/5) = 1/30 P(2 and.

Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.

Permutations and Combinations

Discrete Probability Rosen 5.1.

1 Combination Symbols A supplement to Greenleafs QR Text Compiled by Samuel Marateck ©2009.

Combinations Examples

Counting and Gambling Section 4Objectives: Understand how to use the fundamental counting principle to analyze counting problems that occur in gambling.

Chris Morgan, MATH G160 January 30, 2012 Lecture 9 Chapter 4.1: Combinations 1.

Jacqueline Wroughton Joseph Nolan Northern Kentucky University.

Flashcards? Lets Get Started. Question 1 Get Answer.

HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Section 4.5.

Counting I: Choice Trees and Correspondences Great Theoretical Ideas In Computer Science Anupam Gupta Danny Sleator CS Fall 2010 Lecture 7Sep 14,

Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Midterms 2.Flushes 3.Hellmuth vs. Farha 4.Worst possible beat 5.Jackpot.

Counting. Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers ? How many steps.

Great Theoretical Ideas in Computer Science for Some.

6.1 Use Combinations and Binomial Theorem 378 What is a combination? How is it different from a permutation? What is the formula for n C r ?

Tucker, Applied Combinatorics1 SECTION 5.2 Simple Arrangements and Selections Aaron Desrochers and Ben Epstein.

10.2 Combinations and Binomial Theorem What you should learn: Goal1 Goal2 Use Combinations to count the number of ways an event can happen. Use the Binomial.

12.2 Combinations and Binomial Thm p In the last section we learned counting problems where order was important For other counting problems where.

Combinations A combination is a grouping of things ORDER DOES NOT MATTER.

Mock Objects. Unit-testing and TDD are challenging They require some effort to: – Write a test for a small functionality – Refactor production code and.

Probability and Casino Games

5.3 Permutations and Combinations

Chapter 10 Counting Techniques.

Discrete Mathematics Math 6A Homework 5 Solution.

Whiteboardmaths.com © 2004 All rights reserved

Index Student Activity 1: Questions to familiarise students with the

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.

Probability – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Probability Reading: Kolman, Section 3.4.

Counting Principles The Fundamental Counting Principle: If one event can occur m ways and another can occur n ways, then the number of ways the events.

5.4 Counting Methods Objectives: By the end of this section, I will be able to… 1) Apply the Multiplication Rule for Counting to solve certain counting.

Chapter 3b Counting Rules. Permutations  How many ways can 5 students in a class of 30 be assigned to the front row in the seating chart?  There are.

Counting Principles. I. Basic Counting Problem  Say that I have a jar with 7 balls in it numbered 1 through 7. How many ways can 10 be made (by addition.

Counting II: Recurring Problems And Correspondences Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 10Feb 12, 2004Carnegie.

Intro to Probability & Games

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.

Chapter 8 Counting Principles: Further Probability Topics Section 8.2 Combinations.

Chapter 11: Counting Methods

Poker Solutions.

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 =

Basic Counting Lecture 12: Oct 28. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations,

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.

Advanced Mathematics Counting Techniques. Addition Rule Events (tasks) A and B are mutually exclusive (no common elements/outcomes) and n(A) = a, n(B)

Counting Subsets of a Set: Combinations Lecture 31 Section 6.4 Wed, Mar 21, 2007.

Probability Permutations and Combinations.  Permutations are known as any arrangement of distinct objects in a particular _________. Permutations order.

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:

Homework Homework due now. Reading: relations

Discrete Mathematics for Computer Science. + + ( ) + ( ) = ? Counting II: Recurring Problems and Correspondences Chapter 9 slides 1-54.

Counting Subsets of a Set: Combinations Lecture 33 Section 6.4 Tue, Mar 27, 2007.

Counting II: Recurring Problems And Correspondences Great Theoretical Ideas In Computer Science John LaffertyCS Fall 2005 Lecture 7Sept 20, 2005Carnegie.

Use the Counting Rules to compute Probabilities. 2 of these and 4 of those A classic type of problem You have various subgroups. When you pick 6, what.

Probability and Counting Rules

Counting Techniques. Multiplication Principle (also called the Fundamental Counting Principle) Combinations Permutations Number of subsets of a given.

MATH 2311 Section 2.1. Counting Techniques Combinatorics is the study of the number of ways a set of objects can be arranged, combined, or chosen; or.

8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.

CS Lecture 8 Developing Your Counting Muscles.

MAT 142 Lecture Video Series. Combinatorics and Probability.

Texas Holdem A Poker Variant vs. Flop TurnRiver. How to Play Everyone is dealt 2 cards face down (Hole Cards) 5 Community Cards Best 5-Card Hand Wins.

Week 9 - Friday.  What did we talk about last time?  Permutations  Counting elements in sets  Brief introduction to combinations.

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.

MAT 142 Lecture Video Series

MATH 2311 Section 2.1.

4-6 Probability and Counting Rules

Unit 4 – Combinatorics and Probability Section 4

Chapter 10: Counting Methods

Mathematics for Computer Science MIT 6.042J/18.062J

Applied Combinatorics, 4th Ed. Alan Tucker

Presentation transcript:

Combinatorics & Probability Section 3.4

Which Counting Technique? If the problem involves more than one category, use the Fundamental Principle of Counting. Within any one category, if the order of selection is important use Permutations. Within any one category, if the order of selection is not important, use Combinations.

A Full House What is a full house? An example would be three Ks and two 8s. We would call this Kings full eights. How many full houses are there when playing 5 card poker? First think of the example: How many ways to choose 3 kings? ANSWER 4 choose 3, 4 C 3 =4. How many ways to choose the 8s? ANSWER 4 choose 2, 4 C 2 =6. Now multiply 6 and 4 and you get the number of ways of getting Kings full of 8s which is 24. A full house is any three of kind with a pair. So take 24 and multiply by 13 (13 ranks for the three of a kind) and by 12 (12 ranks for the pair, note you used one rank to make the three of a kind). So the number of full house hands is 13x4x12x6=3744. What is the probability of getting a full house? ANSWER 3744/ = =0.144%

Lets Go Further and talk about a three of a kind What is the probability of having exactly three Kings in a 5-card poker hand. First, how many 5-card poker hands are there? ANSWER: 52 choose 5 or 52 C 5 = which is 2,598,960 Now how do we figure out a hand that has exactly 3 kings? ANSWER: There are 4 kings so we choose 3. The other 2 cards cant be kings so 48 choose 2. Thus we have 4 C 3 =4 and 48 C 2 =1128 Therefore the probability of having a poker hand with exactly 3 kings is =4512/ =

Lets go further What is the probability of being dealt a three of a kind. This is a little different from the last problem. Last problem we had a specific three of a kind, so now we can multiply the result by 13 (since there are 13 ranks). So the number of hands that have a three of a kind in them is Some of these hands are actually full houses. So we should subtract from this result. Which would give Hence the probability of being dealt a three of a kind (not a full house) is 54912/ =0.0211=2.11%.

FLUSH Figure out the number of ways you can get a Royal Straight Flush (A,K,Q,J,10 of the same suit) in 5 card poker. Figure out how many straight flushes you can get in 5 card poker. (example 8,7,6,5,4 of the same suit and dont recount the royal flushes.) NOTE THIS IS NOT A STRAIGHT Q,K,A,2,3 NO WRAPAROUND. Figure out how many flushes in a 5 card poker hand. (Note dont re count the straight flushes and royal flushes.) Compute the probability and odds of each.