Warm up How many ways can 8 children be placed on a 8- horse Merry-Go-Round? 7! = 5 040 What if Simone insisted on riding the red horse? Here we are only.

Slides:



Advertisements
Similar presentations
4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Advertisements

Chapter 8 Counting Principles: Further Probability Topics Section 8.3 Probability Applications of Counting Principles.
Great Theoretical Ideas in Computer Science.
CSCE 2100: Computing Foundations 1 Combinatorics Tamara Schneider Summer 2013.
Counting (Combinatorics) 1.
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.
Chapter 2 Section 2.4 Permutations and Combinations.
4/5/05Tucker, Sec Applied Combinatorics, 4rth Ed. Alan Tucker Section 5.4 Distributions Prepared by Jo Ellis-Monaghan.
Chapter Probability © 2010 Pearson Prentice Hall. All rights reserved 3 5.
College Algebra Fifth Edition
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.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
Warm up A ferris wheel holds 12 riders. If there are 20 people waiting to ride it, how many ways can they ride it?
Math Duels Competition of Scholars. Rules  The class must be split into 2 groups.  Each group must select a team captain and they must do Rock-Paper-Scissors.
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 =
Mixed arrangements There are five different ways to systematically determine the number of outcomes in a multi stage event: * Write a list of all possibilities.
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,
Finding Probability Using Tree Diagrams and Outcome Tables
Advanced Mathematics Counting Techniques. Addition Rule Events (tasks) A and B are mutually exclusive (no common elements/outcomes) and n(A) = a, n(B)
Warm up The Leafs have won 45% of their games this season. When Phil Kessel scores, the Leafs win 30% of the time. What is the probability that Phil Kessel.
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
Counting Techniques 0.4.
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations
Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
Prob/Stats Definition A permutation is an ordered arrangement of objects. (For example, consider the permutations of the letters A, B, C and D.)
1 CSC 321: Data Structures Fall 2013 Counting and problem solving  mappings, bijection rule  sequences, product rule, sum rule  generalized product.
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
Lesson 10.8 AIM: Drawing Tree Diagrams and solving Permutations.
Probability What are the chances?.
Combinatorics Sep. 23, 2013.
Chapter 4 Review MDM 4U Gary Greer.
6.7 Permutations & Combinations. Factorial: 4! = 4*3*2*1 On calculator: math ==> PRB ==> 4 7! = 5040 Try 12!
Chapter 4 Review MDM 4U Mr. Lieff.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
Warm up A Ferris wheel holds 12 riders. If there are 20 people waiting in line, how many different ways can 12 people ride it? You may write your answer.
Introduction to probability (2) Combinations التوافيق Definition of combination: It is a way of selecting items from a collection, such that the order.
6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Section 6.3. Section Summary Permutations Combinations.
Minds on! If you shuffled a standard deck of cards once per second, how long do you think it would take before every possible order appeared? A) Before.
The Multiplication Rule
Multiplication Rule Combinations Permutations
The Pigeonhole Principle
Discrete Mathematics Lecture 8 Probability and Counting
MATH 2311 Section 2.1.
CSC 321: Data Structures Fall 2015 Counting and problem solving
Probability and Combinatorics
Combinations.
CSC 321: Data Structures Fall 2016 Counting and proofs
Permutations 10.5 Notes.
Unit 4 – Combinatorics and Probability Section 4
Minds on! If you choose an answer to this question at random, what is the probability you will be correct? A) 25% B) 50% C) 100% D) 25%
4.5 – Finding Probability Using Tree Diagrams and Outcome Tables
Chapter 0.4 Counting Techniques.
How to Count Things “There are three kinds of people in the world: those who can count and those who cannot.” 11/21/2018.
Combinations Lesson 4.7.
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Basic Counting.
COUNTING AND PROBABILITY
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
Combinations.
Applied Combinatorics, 4th Ed. Alan Tucker
Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.
Presentation transcript:

Warm up How many ways can 8 children be placed on a 8- horse Merry-Go-Round? 7! = What if Simone insisted on riding the red horse? Here we are only arranging 7 children on 7 horses, so 6! = 720

Counting Techniques and Probability Strategies - Combinations Chapter 4.7 – Introduction to Probability Mathematics of Data Management (Nelson) MDM 4U

When Order is Not Important A combination is an unordered selection of elements from a set There are many times when order is not important Suppose Mr. Russell has 10 basketball players and must choose a starting lineup of 5 players (without specifying positions) Order of players is not important We use the notation C(n,r) or n C r where n is the number of elements in the set and r is the number we are choosing

Combinations A combination of 5 players from 10 is calculated the following way, giving 252 ways for Mr. Russell to choose his starting lineup

An Example of a Restriction on a Combination Suppose that one of Mr. Russell’s players is the superintendent’s daughter, and so must be one of the 5 starting players Here there are really only 4 choices from 9 players So the calculation is C(9,4) = 126 Now there are 126 possible combinations for the starting lineup

Combinations from Complex Sets If you can choose of 1 of 3 entrees, 3 of 6 vegetables and 2 of 4 desserts for a meal, how many possible combinations are there? Combinations of entrees = C(3,1) = 3 Combinations of vegetables = C(6,3) = 20 Combinations of desserts = C(4,2) = 6 Possible combinations =  C(3,1) x C(6,3) x C(4,2) = 3 x 20 x 6 = 360 You have 360 possible dinner combinations, so you had better get eating!

Calculating the Number of Combinations Suppose you are playing coed volleyball, with a team of 4 men and 5 women The rules state that you must have at least 3 women on the floor at all times (6 players) How many combinations of team lineups are there? You need to take into account team combinations with 3, 4, or 5 women

Solution 1: Direct Reasoning In direct reasoning, you determine the number of possible combinations of suitable outcomes and add them Find the combinations that have 3, 4 and 5 women and add them

Solution 2: Indirect Reasoning In indirect reasoning, you determine the total possible combinations of outcomes and subtract unsuitable combinations Find the total combinations and subtract those with 2 women

Finding Probabilities Using Combinations What is the probability of drawing a Royal Flush (10-J-Q-K-A from the same suit) from a deck of cards? There are C(52,5) ways to draw 5 cards There are 4 ways to draw a royal flush P(Royal Flush) = 4 / C(52,5) = 1 / You will likely need to play a lot of poker to get one of these hands!

Finding Probability Using Combinations What is the probability of drawing 4 of a kind? There are 13 different cards that can be used to make up the 4 of a kind, and the last card can be any other card remaining

Probability and Odds These two terms have different uses in math Probability involves comparing the number of favorable outcomes with the total number of possible outcomes If you have 5 green socks and 8 blue socks in a drawer the probability of drawing a green sock is 5/13 Odds compare the number of favorable outcomes with the number of unfavorable With 5 green and 8 blue socks, the odds of drawing a green sock is 5 to 8 (or 5:8)

Combinatorics Summary In Permutations, order matters e.g., President In Combinations, order doesn’t matter e.g., Committee

How many routes are there to the top right-hand corner?

Permutation AND Combination?? As a permutation:  There are 9 moves  9! However, 4 are identical Up moves and 5 are identical Across moves  Divide by 4! due to identical arrangements of Up  Divide by 5! due to identical arrangements of Across   9! ÷ 4!5! = 126 As a combination:  There are 9 moves required _ _ _ _ _ _ _ _ _  Choose 4 to be Up, the rest are Across  C(9, 4) = 126  Choose 5 to be Across, the rest are Up  C(9, 5) = 126

Therefore you can use a permutations and or combinations to solve counting problems.

Homework p. 262 – 265 # 1, 2, 3, 5, 7, 9, 18, 23 1 abc, 3, 4, 6a,8

References –The Birthday Paradox Wikipedia (2004). Online Encyclopedia. Retrieved September 1, 2004 from

The Birthday Paradox I will bet any takers $1 that two people in the room have the same birthday (I didn’t check beforehand). In the long run, will I win money? lose money? break even?

The Birthday Paradox Assume all birthdays are equally likely Find the probability that no two birthdays are the same: because the second person cannot have the same birthday as the first (364/365), the third cannot have the same birthday as the first two (363/365), etc.

The Birthday Paradox The event of at least two of the n persons having the same birthday is complementary to all n birthdays being different. Therefore, its probability p(n) is The approximate probability that no two people share a birthday in a group of n people. This probability surpasses 1/2 for n = 23 (with value about 50.7%).

The Birthday Paradox np(n) % % % % % % % %