CEE Lee eras Eco roicicn Combination . &Lesson Objectives = ‘You will be able to > determine the difference between permutations and combinations, that is, that order is disregarded for a combination, ‘n _"Pe (nn le > evaluate simple expressions involving combinations, > use combinations to solve counting problems (e.g., How many teams of 4 can be selected from a group of 202), » find the value of an unknown in equations involving combinations, for example, n or k, > link the fundamental counting principle and combinations. > recall that "Cy,Introduction The combination "C;, represents the number of different ways to select k objects out of n total distinct objects. ‘The order of the k objects does not matter for combinations. For this definition to be feasible, we need the parameters n and k to be nonnegative integers and to satisfy n > k ‘We recall that the permutation "P, represents the number of different ways to order k objects from n total distinct objects. ‘The order of the k objects matters for the permutation "P,, which distinguishes it from the combination "C,Introduction (Continued) To put the distinction between combinations and permutations in context, let us consider two different types of races with n participants. In the first race, the top k finishers receive medals with their ranks printed on the medals. For example, two different possible ways to assign medals with k= 3are shown here. Lobna Dalia Even though the same three runners took the top three spots in both cases, they ended up winning different medals. This is because the order of the three finishers matters since they receive different medals based on their rank. The number of different ways to assign medals for this race is the same as the number of different ways to order k objects from n total objects. ‘This is given by the permutation "P.Introduction (Continued) Let us modify the award system of the race so that the top three finishers receive, instead of different medals, identical trophies with the word “WINNER” engraved. Under this system, the order of the top k finishers does not lead to different results. For example, if we apply the modified award system to the two results above, we would have the same set of trophy winners as pictured next. ‘The number of different sets of trophy winners from this, race is the same as the number of different ways to select k objects out of 7 total objects. This is given by the combination "C;,. WINNER WINNER Dalia ‘Lobna WINNER Lobna WINNER Dalia WINNER AmerTheorem: Fundamental Counting Principle If'we have two independent events A and B such that the number of possible outcomes for event A is x and the number of possible outcomes for event B is y, the total number of distinct possible outcomes of these two events together is the product x x y.The Relation Between Combinations and Permutations Let us apply the fundamental counting principle to our example. We let A be the event of selecting the top k runners from n total runners and B be the event of ordering the top k runners, ‘These are independent events, and applying both gives us the number of ways of ordering k runners from 1. Nest, by the fundamental counting principle, we have 4# ways to select k from n x # ways to order k runners = # ways to order k runners from 7. As stated before, "C; represents the number of ways to select k runners from m, and there are "Pi ways to order k runners from n total runners. ‘We aslo recall that there are |k ways to order k runners. So, "Cx lk ="P.The Relation Between Combinations and Permutations (Continued) Dividing each side by |k , we get "C= “rk This is an important identity relating combinations to permutations. Since "P=Definition: Combination Given nonnegative integers n and k satisfying n > k, the combination "C; represents the number of different ways to select k objects from n total distinct objects. ‘The order of the k objects does not matter. Its formula is given by _ ww nek leSymmetry Identity Looking at the formula "C; es n—kin only has one factor in the denominator, The extra factor in the denominator for We note that there are two factors in the denominator, whereas the lw In=k the combination allows for an identity due to the symmetry: A = In-@—W|ln—k kln-k "Cue: For instance, "C5 = "*Cyp. permutation "Py "Cnt Cee Hence, we have the identity "Cy ‘We can also understand this identity from a counting perspective. The combination "Cy, represents the number of different ways to select k objects from n total objects. But when we select k objects, we create a group of n— kobjects as a by-product. So, each way of choosing k objects out of n total objects produces a unique way to choose rt — k objects from. n total objects. In short, this implies "Cy ="C,Example 1: Writing Combinations in terms of Permutations ‘Which of the following is equal to ™C,? “Pp, 5 stp, BS CPs x |S D*P.xs A Answer ‘We present two methods to answer this example, For the first method, we use the formula for permutation and combination to find their relationship. For the second method, we use the fundamental counting principle to find the solution. Method 1 Let us first recall the formula for permutation and, combination.Example 1 (Continued) sip, = HL We then substitute with n = 41 and k = 5. oT ass - ~ a (an lau Cs= => ~(ai=5|5 3615 ‘We note that there is an extra |5_ in the denominator of “'C.. 4 (4a. (aL ; Csx [5 = — x [5 = We the Itiply (5. by "Cs. s Bes Be fe then multiply (5. by "Cs. ‘We note that the resulting expression is the same as the one for "P,. So, we have the identity Mo. x [5 =P... eet is Hence, the answer is option A. Finally, we divide both sides by [5 .Example 1 (Continued) Method 2 ‘We recall that the combination “'C, represents the number of different ways to select 5 objects from 41 total objects. We also recall that the permutation “"P represents the number of different ways to order 5 objects from 41 total objects. We recall the fundamental counting principle, which states that the total number of distinct outcomes of multiple independent events is the product of their individual number of possible outcomes. From the definitions given above, we note that the task associated with permutation can be decomposed into two stages. The first stage is to select 5 objects from a total of 41 objects, and there are “'C; different ways to do this. The second stage is to order the 5 objects, and there are |5_ different ways to achieve this. Then, by the fundamental counting principle, Ales x [5 = “Ps. 4G, “Ps ‘Ss Hence, the answer is option A. Finally, we divide both sides by (5 .Example 2: Evaluating Combinations Evaluate 7Cjg. Answer ‘q=—4 Let us first recall the formula for combination. In—k |k. 2, (23. (23. 19 Then, we substitute with n = 23 and k = 19. “p19 als ‘We can write [23 = 23 x 22x 21 x 20x [19 and|4 =4x3x2x1. (2323x2221 x20x 19. = ‘Then, we use the previous results to rewrite Cio, 419 [4 19, = 23x22 21 «20 = ~GxSx2x1 23x 11X7x 5 =8855 Finally, we reduce the factors: 2 2 = 11 and rewrite the previous result. ‘Therefore, 7C\, = 8855.Example 3: Evaluating Combinations 2 Evaluate ,2 Ses Answer "co, = — In—k lk. 1 zo _@ “rk BR a ee “jp-6 ble 7 _ el 6 Ga 5 Let us first recall the formula for combination. = 2 to calculate ’C,. ‘Then, we substitute with n = 7 and ‘We then substitute with n = 8 and k = 6 tocalculate*C, Now, let us calculate the given expression.Example 3 (Continued) Finally, we use [8 = 8x [7 and [6 = 6x |S. to rewrite the previous resultExample 4: Solving a Simple Counting Problem Involving Combinations How many 3-card hands can be chosen from a deck of 52 cards? Answer ‘We recall that the combination "Cy represents the number of different ways to select k objects from n total distinct objects. We are counting the different collections of three cards selected from 52 distinct cards. We note that the order of the three selected cards does not matter, So, the number of ways to select 3 cards from 52 distinct cards is given by the combination **C;, be "= us first recall the formula for combination. moe Let us first recall the formula for combinati sig, 2 se. C= Fa ‘We want to choose 3 cards from 52, so we set a=3B Wwe n= S2andk=3. ‘We can write [52. = 52 51x 50x [49 and [3 = 3X21. [s2__52x51x50x 49 _ 52x 51x50 ‘i 2 ioe woh 3x21 Wethenuse the previous resultsto rewrite °C,Example 4 (Continued) 26x17 50= 22100 Finally, we reduce the factors 2 = I7and 2 = 26 and rewrite the previous result. Therefore, C; = 22100. So, 22 100 different 3-card hands can be chosen from a deck of 52 cards.Example 5: Evaluating Combinations to Find the Value of an Unknown IE"Cs = "C5, then n = Answer met ="Cy Let us first recall the symmetry identity. ‘This identity can be understood in the context of a counting problem. "C, counts the number of ways to select k objects out of n total objects. However, when we select k objects out of 7 total objects, we automatically create a group of n — k remaining objects. So, the number of ways to form a group of size k should be exactly the same as the number of ways to form a group of size n — k. ‘The former number is given by "C;, and the latter is given by "Cy_ In this example, we are given "C, = "Cy. If we let n = 3+ 9 = 12, then the number of ways to form a group of size 3 would be identical to the number of ways to form a group of size 12-3 = 9, So, n = 12 should be the correct answer.Example 5 (continued) ‘We can verify this answer by computing both combinations. —a_ na kk U2, 2, 12—3 [3 93 ng U2 °" (p=9)9 Bis ‘This verifies our answer: n = 12. So, if "Cy = "Co, then n= 12, First, let us recall the formula for combination. Then, we substitute with n = 12. and k= 3. We then substitute with = 12 and k = 9.Example 6: Evaluating Combinations to Find the Value of an Unknown. If"C, = 120, find n. Answer bn "= ake Let us first recall the formula for combination. Recall that we require n > k when defining "C,. We are given k = 3, so we need n> 3. Now, we substitute k = 3 into the combination formula. Then, we multiply both sides by |3. = 3x2x1=6. nx(n=1)x (n= 2) n= 3 PROD) sre can rewrite im = nx<(n—1) X(n=2) x N= a8 n> 3 and rewrite the left-hand side of the previous equation. n(n 1)(n-2)Example 6 (Continued) n(n —1(n—2) = 720 (2) ‘We rewrite equation (1) using the previous result, (n-2) 2. (n= 2) < 720 n < 10.96, n.can beat most 10. So, n must be either 9 or 10. Also, n must satisfy the equation n(n — 1)(n— 2) = 720. ‘We can substitute n = 9 and n = 10 into this equation to see which one is the correct value of n. n(n—1(n—2)=9x8X7= 504 —Thisisforn =9. Since this is not equal to 720, n #9, n(a—1(n-2)=10x9x8=720 — Thisisforn = 10. 20. To agrees with "CyKey Points »> The combination "C, represents the number of different ways to choose k objects from n total distinct objects. The order of the k objects does not matter for combinations. > The notations "Cy, Cp, and C(n, k) are all equivalent. > The permutation "P, represents the number of different ways to order k objects from n total distinct objects. The order of the k objects matters for permutations. . ww in "Py > "C, = ——— and "P, Note that "C, = —, ““ln=kke ke > The combination "C;, satisfies the identity "Cy ="Cy_y-