Section 5.5

1. Section 5.5 Counting Techniques

2. Suppose the license plates in a state take the form: NLLLNNN, where N’s are an integer 0-9 and L’s are letters A-Z. How many unique license plates are possible? • 10+26+26+26+10+10+10 • () + ()

3. Multiplication rule: If a task consists of a sequence of choices in which there are p selections for the first choice, q selections for the second choice, r selections for the third choice, etc., then task can be done in different ways.

4. = 175,760,000

5. An airport shuttle bus driver needs to pick up 4 separate passengers: a,b,c,d. How many different ways can the driver pick up the passengers? For example: abcd, abdc, dcba, etc. • 10 • 16 • 24 • 120

6. Solve the following: 4!=? • 0 • 4 • 10 • 24

7. An IRS agent only has time to perform 3 audits, yet has 6 people whom need to be audited. How many ways can the agent schedule her 3 appointments? (e.g. abc, cba , abe, abf, eba, … ) • 6 • 24 • 120 • 720

8. Number of permutations of n Distinct Objects Taken r at a Time • The number of arrangements of r objects chosen from n objects, in which • the n objects are distinct, • repetition of objects is not allowed, and • order is important, is given by the formula

9. EXAMPLE Betting on the Trifecta In how many ways can horses in a 10-horse race finish first, second, and third? The 10 horses are distinct. Once a horse crosses the finish line, that horse will not cross the finish line again, and, in a race, order is important. We have a permutation of 10 objects taken 3 at a time. The top three horses can finish a 10-horse race in

10. Suppose an IRS agent has time to audit 3 people out of a pool of 6 to audit. If order does not matter, how many pools of 3 people can be chosen? (abe=eab since order does not matter.) • 6 • 20 • 120 • 720 These pools are called combinations.

11. A combination is a collection, without regard to order, of n distinct objects without repetition. The symbol nCr represents the number of combinations of n distinct objects taken r at a time.

12. Number of Combinations of n Distinct Objects Taken r at a Time • The number of different arrangements of r objects chosen from n objects, in which • the n objects are distinct, • repetition of objects is not allowed, and • order is not important, is given by the formula

13. EXAMPLE Simple Random Samples How many different simple random samples of size 4 can be obtained from a population whose size is 20? The 20 individuals in the population are distinct. In addition, the order in which individuals are selected is unimportant. Thus, the number of simple random samples of size 4 from a population of size 20 is a combination of 20 objects taken 4 at a time. Use combination with n = 20 and r = 4: There are 4,845 different simple random samples of size 4 from a population whose size is 20.

14. Suppose a car dealer has 3 car models to arrange in a line for show. There are 3 cars of model A, 2 cars of model B, and 1 car of model C. How many ways can the cars be arranged where the cars within a model are not distinct? For example: AAABBC, ABACAB, etc. • 12 • 24 • 60 • 720

15. Permutations with nondistinct items The number of permutations of n objects of which n1 are of one kind, n2are of a second kind, . . . , and nk are of a kth kind is given by where n = n1 + n2 + … + nk.

16. EXAMPLE Arranging Flags How many different vertical arrangements are there of 10 flags if 5 are white, 3 are blue, and 2 are red? We seek the number of permutations of 10 objects, of which 5 are of one kind (white), 3 are of a second kind (blue), and 2 are of a third kind (red). Using Formula (3), we find that there are different vertical arrangements