The Fundamental Counting Principle is the guiding rule for finding the number of ways to accomplish two tasks.

A combination is an arrangement of objects, without repetition, and order not being important. Another definition of combination is the number of such arrangements that are possible. A permutation is an arrangement of objects, without repetition, and order being important. Another definition of permutation is the number of such arrangements that are possible. For dinner, Marsha can choose from 2 proteins (beef and fish), 4 vegetables (beans, broccoli, carrots, and corn), and 2 breads (rolls and biscuits). How many different protein-vegetable-bread selections can she make for dinner? 2 Proteins X 4 Vegetables X 2 Breads = 16 So, Marsha can choose from 16 selections.

Solutions to Fundamental Counting Principle Exercises

These are the solutions to the fundamental counting principle exercises. You are strongly advised to work out your own solutions before you look at these. 1. Suppose that the graduation requirement for some college was that a student take one course in mathematics and one course in computer science. If there were 5 math courses and 4 computer science courses available, in how many different ways could a student meet this requirement? There are different ways that this requirement could be met.

2. How many telephone numbers are possible for the Wilmore exchange of 858? Assume that there are no restrictions on the remaining four digits. There are exchange. different phone numbers possible for the 858

3. How many telephone numbers are possible for the area code 859? Assume that there are no restrictions on the digits in the phone number.

There are the 859 area code.

different phone numbers possible for

4. A traveling salesperson has a route that includes several cities one of which is her home city. To save money, she wants to visit these cities in such a way that the mileage traveled is as small as possible. She knows the mileage between each pair of cities. To find the shortest route, she will list the cities in every possible order (always starting and ending at home) and calculate the mileage for each. The order that results in the smallest mileage will be the order in which the salesperson will visit the cities. How many routes are possible if her territory is comprised of four cities? How many routes are possible if her territory consists of 10 cities? Given any set of cities, is it possible that there will be only one route with the lowest mileage? Four Cities Since the trip always starts and ends at the home city, there are only three cities left to arrange. There are different orders in which these three cities could be listed. Ten Cities Since the trip always starts and ends at the home city, there are only 9 cities left to arrange. There are different orders in which the nine other cities can be listed. Given a territory consisting of three or more cities there will always be at least two routes that will have the same low mileage. One route will visit the cities in the opposite order of the other. 5. If an objective test consists of 10 true/false questions and 10 multiple-choice questions (each with four options), in how many different ways could the answer sheet be filled out? There are ways in which the answer sheet could be filled out. different

6. Three friends want to spent the evening (and night) watching videos. One wants to watch a chick flick, another an action/adventure video, and the third a comedy. If there are 20 chick flicks, 1,000 action/adventure videos, and 35 comedies, how many different sets of three videos could these three select? There are different sets of three videos that could be selected.

Combination...!!! Applied Example: Five people are in a club and three are going to be in the 'planning committee,' to determine how many different ways this committee can be created we use our combination formula as follows:

Point of Contrast: The committee is a common theme for combination problems because, often, it does not matter how your committee is arranged. In other words, it generally does not matter whether you think about your committee as Sue, John and Jimmy or as John, Sue and Jimmy. In either case, the same three people are in the committee. Contrast this withpermutations and our example of a locker pass code. Unlike a committee, a pass code of a lock depends on the order which will dictate whether or not you can open up your lock!

Directions: Apply the combination formula to solve the problems below. Problem 1) In a class of 10 students, how many ways can a club of 4 students be arranged?

Practice Problems: combinations

Problem 2) Eleven students put their names on slips of paper inside a box. Three names are going to be taken out. How many different ways can the three names be chosen?

Problem 3) Over the weekend, your family is going on vacation, and your mom is letting you bring your favorite video game console as well as five of

your games. How many ways can you choose the five games if you have 12 games in all?
12

C5 = (12)!/(5!(12-5)!)=(12)!/(5!(7)!) (12 1110987!) /(5!7!) = 792

EXAMPLE: In the previous problem where 20 boys were available, how many different basketball teams could be formed? SOLUTION: If the choice of which boy played center, guard, or forward is not considered, we find the number of combinations of 20 boys taken 5 at a time by writing

where n=20 and r=5 Then, by substitution, we have

EXAMPLE: A man has, in his pocket, a silver dollar, a halfdollar, a quarter, a dime, a nickel, and a penny. If he reaches into his pocket and pulls out three coins, how many different sums may he have? SOLUTION: The order is not important; therefore, the number of combinations of coins possible is

EXAMPLE: Find the value of

SOLUTION: We use the formula given and find that

This seems to violate the rule, division by zero is not allowed, but we define 0! to equal 1. Then

which is obvious if we list the combinations of three things taken three at a time. PRACTICE PROBLEMS: Find the value of problems 1 through 6 and solve problems 7, 8, and 9.

7. We want to paint three rooms in a house, each a different color, and we may choose from seven different colors of paint. How many color combinations are possible for the three rooms? 8. If 20 boys go out for the football team, how many different teams may be formed, one at a time? 9. Two girls and their dates go to the drive-in, and each wants a different flavored ice cream cone. The drive-in has 24 flavors of ice cream. How many combinations of flavors may be chosen among the four of them if each one selects one flavor? ANSWERS:

The principle of choice is discussed in relation to combinations, although it is also discussed later in this chapter in relation to permutations. It is stated as follows: If a selection can be made in n, ways, and after this selection is made, a second selection can be made in nz ways; and after this selection is made, a third selection can be made in n, ways; and so forth for r selections, then the r selections can be made together in

EXAMPLE: In how many ways can a coach choose first a football team and then a basketball team from 18 boys? SOLUTION: First let the coach choose a football team; that is,

The coach now must choose a basketball team from the remaining seven boys; that is,

Then, together, the two teams can be chosen in (31,824)(21) = 668,304 ways The same answer would be achieved if the coach chose the basket ball team first and then the football team; that is,

which is the same number as before. EXAMPLE: A woman ordering dinner has a choice of one meat dish from four, four vegetables from seven, one salad from three, and one dessert from four. How many different menus are possible? SOLUTION: The individual combinations are as follows:

The values of these combinations are

and

and

Therefore, the woman has a choice of (4)(35)(3)(4) = 1,680 different menus. PRACTICE PROBLEMS: Solve the following problems: 1. A man has 12 different colored shirts and 20 different ties. How many shirt and tie combinations can he select to take on a trip if he takes 3 shirts and 5 ties? 2. A petty officer in charge of posting the watch has 12 men in his duty section. He must post 3 different fire watches and then post 4 aircraft guards on different aircraft. How many different assignments of men can he make? 3. If 10 third class and 14 second class petty officers are in a division that must furnish 2 second class and 6 third class petty officers for shore patrol, how many different shore patrol parties can be made? ANSWERS: 1. 3,410,880 2. 27,720 3. 19,110

Peermutation..!!!! Find the answers to the following:

a. A and B must be boys and C and D must be girls? b. two of the officers must be boys and two of the officers must be girls? ANSWERS:

If we were asked how many different arrangements of the letters in the word STOP can be made, we would write

We would be correct since all letters are different. If some of the letters were the same, we would reason as given in the following problem. EXAMPLE: How many different arrangements of the letters in the word ROOM can be made? SOLUTION: We have two letters alike. If we list the possible arrangements, using subscripts to make a distinction between the O's, we have

but we cannot distinguish between the O's; RO1O2M and RO2O1M would be the same arrangement without the subscript. Only half as many arrangements are possible without the use of subscripts (a total of 12 arrangements). This leads to the statement: The number of arrangements of n items, where there are k groups of like items of size r1,r2, . . . rk, respectively, is given by

in the previous example n was equal to 4 and two letters were alike; therefore, we would write

EXAMPLE: How many arrangements can be made using the letters in the word ADAPTATION? SOLUTION: We use

where n=10 and r1 = 2 (two T's) and r2 = 3 (three A's) Then

PRACTICE PROBLEMS: Find the number of possible arrangements of the letters in the following words: 1. WRITE 2. STRUCTURE

3. HERE 4. MILLIAMPERE 5. TENNESSEE ANSWERS:

Although the previous discussions have been associated with formulas, problems dealing with combinations and permutations may be analyzed and solved in a more meaningful way without complete reliance upon the formulas. EXAMPLE: How many four-digit numbers can be formed from the digits 2, 3, 4, 5, 6, and 7 a. without repetition? b. with repetition? SOLUTION: The (a) part of the question is a straightforward permutation problem, and we reason that we want the number of permutations of six items taken four at a time. Therefore,