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

Slides:



Advertisements
Similar presentations
Discrete Probability Rosen 5.1.
Advertisements

DM. 13. A method for counting outcomes of multi-stage processes If you want to perform a series of tasks and the first task can be done in (a) ways, the.
Counting Chapter 6 With Question/Answer Animations.
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 II: Recurring Problems And Correspondences Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 10Feb 12, 2004Carnegie.
Discrete Mathematics Lecture 7 More Probability and Counting Harper Langston New York University.
1 Section 5.1 Discrete Probability. 2 LaPlace’s definition of probability Number of successful outcomes divided by the number of possible outcomes This.
Combinations We should use permutation where order matters
Discrete Mathematics Lecture 5
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Thinking Mathematically
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.
Combinatorics 3/15 and 3/ Counting A restaurant offers the following menu: Main CourseVegetablesBeverage BeefPotatoesMilk HamGreen BeansCoffee.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Probability – Models for random phenomena
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 =
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.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Advanced Mathematics Counting Techniques. Addition Rule Events (tasks) A and B are mutually exclusive (no common elements/outcomes) and n(A) = a, n(B)
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Generalized Permutations and Combinations
Section 7.1. Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
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.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
Counting Subsets of a Set: Combinations Lecture 28 Section 6.4 Wed, Mar 2, 2005.
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:
Permutations – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Permutations Reading: Kolman, Section 3.1.
Probability and Odds Foundations of Algebra. Odds Another way to describe the chance of an event occurring is with odds. The odds in favor of an event.
ICS 253: Discrete Structures I Discrete Probability King Fahd University of Petroleum & Minerals Information & Computer Science Department.
WOULD YOU PLAY THIS GAME? Roll a dice, and win $1000 dollars if you roll a 6.
Counting II: Recurring Problems And Correspondences Great Theoretical Ideas In Computer Science John LaffertyCS Fall 2005 Lecture 7Sept 20, 2005Carnegie.
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.
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.
Classwork: wks Homework (day 7): Wks (1-17)/Quiz next block Bring in items to work on Project in class!
5.5 Generalized Permutations and Combinations
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Section The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must have more than 1 pigeon.
Counting Subsets of a Set: Combinations Lecture 28 Section 6.4 Thu, Mar 30, 2006.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
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.
Section 6.3. Section Summary Permutations Combinations.
Counting Principles Ex. Eight pieces of paper are numbered 1 to 8 and placed in a box. One piece of paper is drawn from the box, its number is written.
MAT 142 Lecture Video Series
ICS 253: Discrete Structures I
The Pigeonhole Principle
Discrete Mathematics Lecture 8 Probability and Counting
CSC 321: Data Structures Fall 2015 Counting and problem solving
Permutations and Combinations
Probability Axioms and Formulas
Generalized Permutations and Combinations
CSC 321: Data Structures Fall 2016 Counting and proofs
Permutations and Combinations
Permutations and Combinations
Basic Counting.
COUNTING AND PROBABILITY
CSC 321: Data Structures Fall 2018 Counting and proofs
Counting Discrete Mathematics.
Basic Counting Lecture 9: Nov 5, 6.
Counting II: Recurring Problems And Correspondences
Applied Combinatorics, 4th Ed. Alan Tucker
Presentation transcript:

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

Lotto South In Lotto South, a player chooses 6 numbers from 1 to 49. Then the state chooses at random 6 numbers from 1 to 49. The player wins according to how many of his numbers match the ones the state chooses. See the Lotto South web page.Lotto South web page

Lotto South There are C(49, 6) = 13,983,816 possible choices. Match all 6 numbers There is only 1 winning combination. Probability of winning is 1/ =

Lotto South Match 5 of 6 numbers There are 6 winning numbers and 43 losing numbers. Player chooses 5 winning numbers and 1 losing numbers. Number of ways is C(6, 5)  C(43, 1) = 258. Probability is

Lotto South Match 4 of 6 numbers Player chooses 4 winning numbers and 2 losing numbers. Number of ways is C(6, 4)  C(43, 2) = Probability is

Lotto South Match 3 of 6 numbers Player chooses 3 winning numbers and 3 losing numbers. Number of ways is C(6, 3)  C(43, 3) = Probability is

Lotto South Match 2 of 6 numbers Player chooses 2 winning numbers and 4 losing numbers. Number of ways is C(6, 2)  C(43, 4) = Probability is

Lotto South Match 1 of 6 numbers Player chooses 1 winning numbers and 5 losing numbers. Number of ways is C(6, 1)  C(43, 5) = Probability is

Lotto South Match 0 of 6 numbers Player chooses 6 losing numbers. Number of ways is C(43, 6) = Probability is

Lotto South Note also that the sum of these integers is Note also that the lottery pays out a prize only if the player matches 3 or more numbers. Match 3 – win $5. Match 4 – win $75. Match 5 – win $1000. Match 6 – win millions.

Lotto South Given that a lottery player wins a prize, what is the probability that he won the $5 prize? P(he won $5, given that he won) = P(match 3)/P(match 3, 4, 5, or 6) = / =

Example Theorem (The Vandermonde convolution): For all integers n  0 and for all integers r with 0  r  n, Proof: See p. 362, Sec. 6.6, Ex. 18.

Another Lottery In the previous lottery, the probability of winning a cash prize is Suppose that the prize for matching 2 numbers is… another lottery ticket! Then what is the probability of winning a cash prize?

Lotto South What is the average prize value of a ticket? Multiply each prize value by its probability and then add up the products: $10,000,000  = $1000  = $75  = $5  = $0  =

Lotto South The total is $0.8945, or cents (assuming that the big prize is ten million dollars). A ticket costs $1.00. How large must the grand prize be to make the average value of a ticket more than $1.00?

Another Lottery What is the average prize value if matching 2 numbers wins another lottery ticket?

Permutations of Sets with Repeated Elements Theorem: Suppose a set contains n 1 indistinguishable elements of one type, n 2 indistinguishable elements of another type, and so on, through k types, where n 1 + n 2 + … + n k = n. Then the number of (distinguishable) permutations of the n elements is n!/(n 1 !n 2 !…n k !).

Proof of Theorem Proof: Rather than consider permutations per se, consider the choices of where to put the different types of element. There are C(n, n 1 ) choices of where to place the elements of the first type.

Proof of Theorem Proof: Then there are C(n – n 1, n 2 ) choices of where to place the elements of the second type. Then there are C(n – n 1 – n 2, n 3 ) choices of where to place the elements of the third type. And so on.

Proof, continued Therefore, the total number of choices, and hence permutations, is C(n, n 1 )  C(n – n 1, n 2 )  C(n – n 1 – n 2, n 3 ) … C(n – n 1 – n 2 – … – n k – 1, n k ) = …(some algebra)… = n!/(n 1 !n 2 !…n k !).

Example How many different numbers can be formed by permuting the digits of the number ?

Example How many permutations are there of the letters in the word MISSISSIPPI? How many for VIRGINIA? How many for INDIVISIBILITY?

Poker Hands Two of a kind. Two pairs. Three of a kind. Straight. Flush. Full house. Four of a kind. Straight flush. Royal flush.