Quiz 3 Counting: 4.3, 4.4, 4.5. Quiz3: April 27, 3.30-3.45 pm Your answers should be expressed in terms of factorials and/or powers. A lonely gambler.

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

Chapter 10 Counting Techniques.
4.5 Generalized Permutations and Combinations
HAWKES LEARNING SYSTEMS Students Matter. Success Counts. Copyright © 2013 by Hawkes Learning Systems/Quant Systems, Inc. All rights reserved. Chapter 4.
Counting Chapter 6 With Question/Answer Animations.
Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.
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.
Chapter 10 Counting Techniques.
Today Today: Reading: –Read Chapter 1 by next Tuesday –Suggested problems (not to be handed in): 1.1, 1.2, 1.8, 1.10, 1.16, 1.20, 1.24, 1.28.
Permutations r-permutation (AKA “ordered r-selection”) An ordered arrangement of r elements of a set of n distinct elements. permutation of a set of n.
Chapter 2 Section 2.4 Permutations and Combinations.
Chapter 5 Section 5 Permutations and Combinations.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.
Combinatorics Chapter 3 Section 3.3 Permutations Finite Mathematics – Stall.
Quiz 4 Counting: 4.3, 4.4, 4.5. Quiz4: May 5, pm Your answers should be expressed in terms of factorials and/or powers. Imagine you want to.
Permutations and Combinations
How many ways are there to pass through city A where the arrows represent one-way streets? Answer: mn ways The counting principal: Suppose two experiments.
Counting Unit Review Sheet. 1. There are five choices of ice cream AND three choices of cookies. a)How many different desserts are there if you have one.
Do Now: Make a tree diagram that shows the number of different objects that can be created. T-shirts: Sizes: S, M, L and T-shirts: Sizes: S, M, L and Type:
Math 2 Honors - Santowski
PROBABILITY. FACTORIALS, PERMUTATIONS AND COMBINATIONS.
Think About Ten 3-2 Carlos Suzy x
Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
10.3 – Using Permutations and Combinations Permutation: The number of ways in which a subset of objects can be selected from a given set of objects, where.
1 Combinations. 2 Permutations-Recall from yesterday The number of possible arrangements (order matters) of a specific size from a group of objects is.
Warm Up Evaluate  4  3  2   6  5  4  3  2 
Section 10-3 Using Permutations and Combinations.
Conditional Probability The probability that event B will occur given that A will occur (or has occurred) is denoted P(B|A) (read the probability of B.
Chapter 12 – Probability and Statistics 12.2 – Permutations and Combinations.
Whiteboardmaths.com © 2004 All rights reserved
Combinations A combination is an unordered collection of distinct elements. To find a combination, the general formula is: Where n is the number of objects.
The quiz game that makes a difference … How to play… 1.Decide if you want to play as groups or individuals 2.Get your bingo cards ready 3.Click enter to.
Permutations and Combinations Section 2.2 & 2.3 Finite Math.
Permutations and Combinations
Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.
How many ways can we arrange 3 objects A, B, and C: Using just two How many ways can we arrange 4 objects, A, B, C, & D: Using only two Using only three.
Lesson 0.4 (Counting Techniques)
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.
Permutations Counting where order matters If you have two tasks T 1 and T 2 that are performed in sequence. T 1 can be performed in n ways. T 2 can be.
Quiz 3 Counting: 4.3, 4.4.
Honors Analysis.  Fundamental Counting Principle  Factorial Calculations (No Calculator!)  Permutation Calculation (No Calculator!)  Arrangement Problems.
5.5 Generalized Permutations and Combinations
Section 6.3. Section Summary Permutations Combinations.
Permutations and Combinations
Chapter 10 Counting Methods.
Counting, Permutations, & Combinations
Permutations 10.5 Notes.
Permutations and Combinations
Chapter 10: Counting Methods
Counting Principles NOTES Coach Bridges.
Counting, Permutations, & Combinations
Combinations, Enumerations without Repetitions
Counting Permutations When Indistinguishable Objects May Exist
Counting, Permutations, & Combinations
Permutations and Combinations
Lesson 11-1 Permutations and Combinations
Permutations and Combinations
Permutations and Combinations
First lecture fsalamri Faten alamri.
Combinations.
Counting, Permutations, & Combinations
Using Permutations and Combinations
Bellwork Practice Packet 10.3 B side #3.
Permutations and Combinations
Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.
Permutations and Combinations
10.3 – Using Permutations and Combinations
Presentation transcript:

Quiz 3 Counting: 4.3, 4.4, 4.5

Quiz3: April 27, pm Your answers should be expressed in terms of factorials and/or powers. A lonely gambler sits at a table with one deck of cards (one deck has 52 distinct cards). He draws himself a hand of 5 cards (without replacing the cards). a) How many different hands are possible if the order in which he draws is important? b) How many different hands are possible when the order does not matter? He now adds 9 new identical decks of cards (i.e. the total number of decks is now 10). He again draws himself a hand of 5 cards (without replacing the cards). c) How many different hands are possible with repetition when the order matters? d) How many different hands are possible with repetition when the order does not matter? A second player enters the game. e) What is the total number of ways they can draw 2 hands of 5 cards each, when the order in a hand does not matter (but the players are different)? f) In how many ways can we draw all the cards when the order matters (recall that the decks were indistinguishable)?

Quiz3: April 27, answers a) How many different hands are possible if the order in which he draws is important?  52 different balls in 5 distinguishable slots: P(52,5)=52! / 47! b) How many different hands are possible when the order does not matter?  52 different balls in 5 indistinguishable slots: C(52,5)=52! / 47! 5! c) How many different hands are possible with repetition when the order matters?  52 classes of balls with repetition in distinguishable slots: 52^5. d) How many different hands are possible when the order does not matter?  52 classes of balls with repetition in indistinguishable slots: C(56,5)=56! /51! 5!. e) What is the total number of ways they can draw 2 hands of 5 cards each, when the order does not matter?  Hand player 1: C(56,5). Hand player 2: C(56,5): total (56! / 51! 5!)^2. f) In how many ways can we draw all the cards when the order matters?  Number of permutations of 520 cards when the order matters but 52 sets of 10 cards are indistinguishable: (520)! / (10!)^52