1. Lesson 5 - 5 Counting Techniques

2. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting problems using combinations Solve counting problems involving permutations with nondistinct items Compute probabilities involving permutations and combinations

3. Vocabulary Factorial – n! is defined to be n! = n∙(n-1)∙(n-2)∙(n- 3)….. (3)∙(2)∙(1) Permutation – is an ordered arrangement in which r objects are chosen from n distinct (different) objects and repetition is not allowed. The symbol n P r represents the number of permutations of r objects selected from n objects. Combination – is a collection, without regard to order, of n distinct objects without repetition. The symbol n C r represents the number of combinations of n objects taken r at a time..

4. Multiplication Rule of Counting If a task consists of a sequence of choices in which there are p selections for the first item, q selections for the second item, and r choices for the third item, and so on, then the task of making these selections can be done in p ∙ q ∙ r ∙ ….. different ways The classical method, when all outcomes are equally likely, involves counting the number of ways something can occur This section includes techniques for counting the number of results in a series of choices, under several different scenarios

5. Example 1 If there are 3 different colors of paint (red, blue, green) that can be used to paint 2 different types of toy cars (race car, police car), then how many different toys can there be?

6. Example 1 Illustrated A tree diagram of the different possibilities Red Blue Green Blue Race Car Blue Police Car Green Race Car Green Police CarRed Race CarRed Police Car Race Police Race PoliceRacePolice PaintCarPossibilities

7. Permutations without replacement Number of Permutations of n Distinct Objects taken r at a time: N objects are distinct Once used an object cannot be repeated Order is important n! n P r = ----------- (n – r)!

8. Example 2 In a horse racing “Trifecta”, a gambler must pick which horse comes in first, which second, and which third. If there are 8 horses in the race, and every order of finish is equally likely, what is the chance that any ticket is a winning ticket? The probability that any one ticket is a winning ticket is 1 out of 8 P 3, or 1 out of 336 Look at example 7 in the book, page 298, for 10 horses!

9. Permutations with replacement Number of Permutations of n Distinct Items taken r at a time with replacement: N objects are distinct Once used an object can be repeated (replacement) Order is important P = n r

10. Example 3 Suppose a computer requires 8 characters for a password. The first character must be a letter, but the remaining seven characters can be either a letter or a digit (0 thru 9). The password is not case-sensitive. How many passwords are possible on this computer? 26 36 7 = 2.037 x 10 12

11. Combinations Number of Combinations of n Distinct Objects taken r at a time: N objects are distinct Once used an object cannot be repeated (no repetition) Order is not important n! n C r = ----------- r!(n – r)!

12. Example 4 If there are 8 researchers and 3 of them are to be chosen to go to a meeting, how many different groupings can be chosen?

13. Permutations – non-distinct items Number of Permutations with Non-distinct Items: N objects are not distinct K different groups n! P = --------------------- where n = n 1 + n 2 + … + n k n 1 !∙n 2 !∙ ….∙n k !

14. Example 5 How many different vertical arrangements are there of 9 flags if 4 are white, 3 are blue and 2 are red? 9! 987654! 98765 ----------- = ------------------ = --------------- = 1260 4!3!2! 4!3!2! 32121

15. Permutation vs Combination Comparing the description of a permutation with the description of a combination The only difference is whether order matters PermutationCombination Order mattersOrder does not matter Choose r objects Out of n objects No repetition

16. How to Tell ●Is a problem a permutation or a combination? ●One way to tell  Write down one possible solution (i.e. Roger, Rick, Randy)  Switch the order of two of the elements (i.e. Rick, Roger, Randy) ●Is this the same result?  If no – this is a permutation – order matters  If yes – this is a combination – order does not matter

17. Summary and Homework Summary –The Multiplication Rule counts the number of possible sequences of items –Permutations and combinations count the number of ways of arranging items, with permutations when the order matters and combinations when the order does not matter –Permutations and combinations are used to compute probabilities in the classical method Homework –pg 304-306: 5, 7, 9, 12, 13, 16, 20, 21, 40, 42, 64