{"id":162,"date":"2023-12-06T10:57:04","date_gmt":"2023-12-06T15:57:04","guid":{"rendered":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/?post_type=chapter&p=162"},"modified":"2024-05-10T17:39:04","modified_gmt":"2024-05-10T21:39:04","slug":"counting-rules","status":"publish","type":"chapter","link":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/chapter\/counting-rules\/","title":{"raw":"Counting Rules","rendered":"Counting Rules"},"content":{"raw":"
\r\n

Learning Objectives<\/p>\r\n\r\n<\/header>\r\n

\r\n\r\nCalculate and understand the counting rules (multiplication, combinations, and permutations).\r\n\r\n<\/div>\r\n<\/div>\r\n
    \r\n \t
  • We have covered Descriptive Statistics where we summarize data.<\/li>\r\n \t
  • The other branch of Statistics is called Inferential Statistics,<\/li>\r\n \t
  • Inferential stats is where we draw conclusion, or make a decision, from the set of data.<\/li>\r\n \t
  • When we make a decision, we usually make it under uncertainty, because the future is unknown to us.<\/li>\r\n \t
  • This is why we have to study Probability.<\/li>\r\n \t
  • Even before we can study Probability, we need to know how many different things can happen.<\/li>\r\n<\/ul>\r\n

    Intro Counting Rule Example (Lotto 6\/49)<\/h1>\r\n

    Example 14.1<\/h2>\r\nA well known example is Lotto 6\/49:\r\n
      \r\n \t
    • You may have heard of the following statement:<\/li>\r\n \t
    • \"When you play Lotto 6\/49, there is a 14 million to 1 chance of hitting the jackpot\", or words to that effect.<\/li>\r\n \t
    • Where did the number 14 million come from?<\/li>\r\n \t
    • We make use of the counting rules of course. B<\/li>\r\n \t
    • y the end of this chapter, you will know where the 14 million come from.<\/li>\r\n<\/ul>\r\nThere are essentially 3 counting rules.\r\n

      Counting Rule One - Multiplication<\/h1>\r\nThis rule can be loosely stated as follows:\r\n\r\nIf a \"process\" can be divided into stages, and there are [latex]n_1[\/latex] possible outcomes in stage 1, [latex]n_2[\/latex] possible outcomes in stage 2, and so on, then the total number of possible outcomes equals\r\n\r\n\\[n_1\\times n_2 \\times \\cdot\\]\r\n

      Example 14.2<\/h2>\r\nSetup:<\/strong> <\/span>\r\n
        \r\n \t
      • A salesman calls on 2 clients every day.<\/li>\r\n \t
      • Each call can result in a sale (s),. or in a no sale (n).<\/li>\r\n<\/ul>\r\nQuestion:<\/strong> <\/span>How many different things can happen at the end of the day?\r\n\r\nInstructions:<\/strong> <\/span>\r\n
          \r\n \t
        • We can equate \"the process\" with his calling on clients,<\/li>\r\n \t
        • stage 1 with calling on the first client with [latex]n_1 = 2[\/latex] (s or n),<\/li>\r\n \t
        • stage 2 with calling on the second client with [latex]n_2= 2[\/latex] (s or n).<\/li>\r\n \t
        • Total possible outcomes [latex]= 2 \\times 2 = 4[\/latex].<\/li>\r\n \t
        • Note: 'S' is defined as a 'success'<\/li>\r\n<\/ul>\r\nSolutions:<\/strong> <\/span>What are these 4 possible outcomes?\r\n
            \r\n \t
          • We can see them better if we draw a TREE DIAGRAM.<\/li>\r\n \t
          • Every tree has a root, representing the start of the \"process\".<\/li>\r\n \t
          • From this root, we draw the same number of branches as there are possible outcomes in stage 1.<\/li>\r\n \t
          • We then draw a vertical line to represent the end of the first stage.<\/li>\r\n \t
          • This is to be followed by more branches and a vertical line to represent the second stage, and so on.<\/li>\r\n \t
          • The tree diagram representing this first example looks like so.<\/li>\r\n<\/ul>\r\n\"\"\r\n\r\nGoing along the different branches, we can see that the four different things are:\r\n
              \r\n \t
            • ss, sn, ns, nn.<\/li>\r\n \t
            • ss means sale to the first, sale to the second.<\/li>\r\n \t
            • sn means sale to the first, no sale to the second.<\/li>\r\n \t
            • ns means no sale to the first, sale to the second.<\/li>\r\n \t
            • nn means no sale to both.<\/li>\r\n<\/ul>\r\nIn the jargon of Statistics, these 4 things are called Sample Points. Together, they make up a Sample Space (SS):\r\n
                \r\n \t
              • We write it like this<\/li>\r\n \t
              • \\[SS = \\{ss, sn, ns, nn\\}\\]<\/li>\r\n<\/ul>\r\n

                Example 14.3<\/h2>\r\nSetup:<\/strong> <\/span>Suppose this salesman calls on 3 clients every day.\r\n\r\nQuestion:<\/span> <\/strong>How many different things can happen by the end of the day?\r\n\r\nSolution:<\/span> <\/strong>\r\n
                  \r\n \t
                • It is easy to be tempted to say the answer is [latex]3 \\times 2 = 6[\/latex].<\/li>\r\n \t
                • But remember there are now 3 stages to represent the 3 calls, and each call has 2 outcomes.<\/li>\r\n \t
                • The total possible outcomes [latex]= 2 \\times 2 \\times 2 = 8[\/latex].<\/li>\r\n \t
                • The tree diagram is like this<\/li>\r\n<\/ul>\r\n\"\"\r\n\r\n\\[SS = \\{sss, ssn, sns, snn, nss, nsn ,nns, nnn\\}\\]\r\n

                  Example 14.4<\/h2>\r\nSetup: <\/strong><\/span>A Product Manager is asked to evaluate 2 new products. He is to give it a rating:\r\n
                    \r\n \t
                  • P if he thinks the new product is Profitable in the first year<\/li>\r\n \t
                  • N if he thinks it is Not profitable<\/li>\r\n \t
                  • B if he thinks it will Breakeven.<\/li>\r\n<\/ul>\r\nQuestion:<\/strong> <\/span>In how many ways can he evaluate these 2 new products?\r\n\r\nSolutions:<\/strong> <\/span>\r\n
                      \r\n \t
                    • Again, it is easy to be tempted to say the answer is 3 x 2 = 6.<\/li>\r\n \t
                    • But remember there are 2 products, and each can be evaluated in 3 different ways.<\/li>\r\n \t
                    • The correct answer is [latex]3\\times 3 = 9[\/latex].<\/li>\r\n \t
                    • And the Sample Space is \\[SS = \\{PP, PN, PB, NP, NN, NB, BP, BN, BB\\}\\]<\/li>\r\n<\/ul>\r\n

                      Example 14.5<\/h2>\r\nSetup<\/span>: <\/strong>BC license plates have the following setup:\r\n
                        \r\n \t
                      • It has 6 characters,<\/li>\r\n \t
                      • 3 letters,<\/li>\r\n \t
                      • followed by a 3 digit number,<\/li>\r\n \t
                      • \\[LLL \\, \u00a0 DDD\\]<\/span><\/li>\r\n<\/ul>\r\nQuestion:<\/strong><\/span> How many different regular licence plates for passenger vehicles can the BC government issue?\r\n\r\nSolution: <\/span><\/strong>Assuming there are no restrictions,\r\n
                          \r\n \t
                        • There are 26 letters, and 10 (0 to 9) digits.<\/li>\r\n \t
                        • So the total \\[= 26 \\times 26\\times 26 \\times 10 \\times 10\\times 10 = 17,576,000 \\text{ different plates.}\\]<\/li>\r\n<\/ul>\r\n

                          Example 14.6<\/h2>\r\nSetup: <\/strong>How many different postal codes can there be in Canada?<\/span>\r\n\r\nQuestion: <\/strong><\/span>What does a Canadian postal code look like? Do you get the exact same answer as in the example above?\r\n\r\nSolution: <\/span><\/strong>\r\n
                            \r\n \t
                          • Before we study the second and the third Counting Rules, we have to introduce another Mathematical Notation.<\/li>\r\n \t
                          • It is the idea of a FACTORIAL, which is represented by the exclamation mark, i.e. !.<\/li>\r\n \t
                          • We write it like this n!, where n is an integer, i.e., a whole number. By definition,<\/li>\r\n \t
                          • \\[n! = n\\cdot(n-1)\\cdot (n -2) \\cdots (2)\\cdot(1)\\]<\/li>\r\n<\/ul>\r\nIn other words, we start from the number [latex]n[\/latex]:\r\n
                              \r\n \t
                            • multiply by it 1 less than [latex]n[\/latex],<\/li>\r\n \t
                            • multiply by 1. less again,<\/li>\r\n \t
                            • ...until we come to the number 1.<\/li>\r\n<\/ul>\r\nFor instance, \\[4! = 4\\times 3\\times 2\\times 1 = 24\\]\r\n\r\nWe can also make use of our calculator:\r\n
                                \r\n \t
                              • We see that [x!] is on top of the multiplication sign, [latex]\\times[\/latex], key.<\/li>\r\n \t
                              • Remember anything on top of a key, we have to access it by pressing the 2ND key first.<\/li>\r\n<\/ul>\r\nOne more thing to remember, [latex]0! = 1[\/latex].\r\n

                                RULE TWO - Permutations<\/h1>\r\nThis rule is so important it has a special name. It is called a PERMUTATION. A permutation is an ARRANGEMENT of objects into ORDER. We have emphasized the 2 key words, arrangement and order.\r\n

                                Example 14.7<\/h2>\r\nSetup<\/span>: <\/strong>There are 3 candidates in a Federal Election:\r\n
                                  \r\n \t
                                • a Liberal (LIB),<\/li>\r\n \t
                                • a Conservative (CON),<\/li>\r\n \t
                                • and an NDP (NDP).<\/li>\r\n<\/ul>\r\nIn this example, it should be clear that there is an ORDER:\r\n
                                    \r\n \t
                                  • One person will get the most number of votes,<\/li>\r\n \t
                                  • and they become MP.<\/li>\r\n \t
                                  • A second person will get the second largest number of votes.<\/li>\r\n \t
                                  • A third person will get the least number of votes.<\/li>\r\n \t
                                  • There is an ORDER, and it is:<\/li>\r\n<\/ul>\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n
                                    LIB<\/td>\r\nCON<\/td>\r\nNDP<\/td>\r\n<\/tr>\r\n
                                    LIB<\/td>\r\nNDP<\/td>\r\nCON<\/td>\r\n<\/tr>\r\n
                                    CON<\/td>\r\nLIB<\/td>\r\nNDP<\/td>\r\n<\/tr>\r\n
                                    CON<\/td>\r\nNDP<\/td>\r\nLIB<\/td>\r\n<\/tr>\r\n
                                    NDP<\/td>\r\nLIB<\/td>\r\nCON<\/td>\r\n<\/tr>\r\n
                                    NDP<\/td>\r\nCON<\/td>\r\nLIB<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\nSolution:\u00a0<\/span><\/strong>As we can see from the above listing, there are 6, no more. Let us obtain this same answer, 6, from a mathematical formula. It is\r\n\r\n\\[{}_n P_r = \\frac{n!}{(n-r)!}\\]\r\n\r\nwhere\r\n
                                      \r\n \t
                                    • [latex]r\\leq n[\/latex].<\/li>\r\n \t
                                    • [latex]n[\/latex] is the total number of objects to be arranged. In this example, [latex]n = 3[\/latex].<\/li>\r\n \t
                                    • [latex]P[\/latex] simply stands for Permutation. It has NO numeric value.<\/li>\r\n \t
                                    • [latex]r[\/latex] is the number of objects to be arranged into order. In this example, [latex]r = 3 [\/latex] also.<\/li>\r\n<\/ul>\r\nAccording to the formula given above, we have\r\n\r\n\\[{}_n P_r = {}_3P_3 = \\frac{3!}{(3-3)!}=\\frac{3!}{0!}=\\frac{6}{1}=6\\]\r\n

                                      Example 14.8<\/h2>\r\nSetup<\/span>: <\/strong>\r\n
                                        \r\n \t
                                      • There are 15 people in a contest (a beauty pageant, blueberry pie in a country fair, whatever)and<\/li>\r\n \t
                                      • A winner, a first runner-up, and a second runner-up are to be declared.<\/li>\r\n \t
                                      • Again, in this example, the words winner, first, second suggest ORDER.<\/li>\r\n \t
                                      • It is, therefore, also a permutation, with [latex]n = 15[\/latex] and [latex]r =3[\/latex].<\/li>\r\n<\/ul>\r\n\\[{}_n P_r = {}_{15}P_3 = \\frac{15!}{(15-3)!}=\\frac{15!}{12!}=\\frac{15\\times 14 \\times 13 \\times 12!}{12!}=15\\times 14 \\times 13 =2730\\]\r\n\r\nYou may find it easier to do by your calculator:\r\n
                                          \r\n \t
                                        • You will find the nPr key on top of the MINUS sign.<\/li>\r\n \t
                                        • First, enter n, which is 15,<\/li>\r\n \t
                                        • Then, press 2ND nPr,<\/li>\r\n \t
                                        • Then enter r, which is 3.<\/li>\r\n \t
                                        • Now press the EQUAL sign.<\/li>\r\n \t
                                        • You should get the same answer of 2,730.<\/li>\r\n<\/ul>\r\n

                                          RULE THREE - Combinations<\/h1>\r\nThis rule also has a special name. It is called a COMBINATION. A combination is a SELECTION of objects WITHOUT REGARD TO ORDER. Again, we have emphasized the key phrases.\r\n

                                          Example 14.9.1<\/h2>\r\nSetup<\/span>: <\/strong>Five people, call them A, B, C, D, and E for convenience, are running to become vice presidents of an organization. Two are to be chosen.\r\n\r\nQuestion<\/span><\/strong>: In how many ways can the president choose 2 from the 5 to become his vice presidents?\r\n\r\nSolution:<\/strong> <\/span>\r\n\r\nLet us list them first of all, and then we will give the mathematical formula. The president can choose\r\n\r\n\r\n\r\n\r\n\r\n\r\n
                                          AB<\/td>\r\nAC<\/td>\r\nAD\u00a0\u00a0\u00a0\u00a0 AE<\/td>\r\n<\/tr>\r\n
                                          BC<\/td>\r\nBD<\/td>\r\nBE<\/td>\r\n<\/tr>\r\n
                                          CD<\/td>\r\nCE<\/td>\r\n<\/td>\r\n<\/tr>\r\n
                                          DE<\/td>\r\n<\/td>\r\n<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n
                                            \r\n \t
                                          • We can see that there are 10.<\/li>\r\n \t
                                          • The general formula is: \\[{}_n C_{r}= \\binom{n}{r}= \\frac{n!}{r!(n-r)!}\\]<\/li>\r\n<\/ul>\r\nwhere\r\n
                                              \r\n \t
                                            • [latex]r\\leq n[\/latex].<\/li>\r\n \t
                                            • [latex]n[\/latex] is the total number of objects to be arranged. In this example, [latex]n = 5[\/latex].<\/li>\r\n \t
                                            • [latex]C[\/latex] simply stands for Combination. It has NO numeric value.<\/li>\r\n \t
                                            • [latex]r[\/latex] is the number of objects to be arranged into order. In this example, [latex]r = 2[\/latex] also.<\/li>\r\n<\/ul>\r\nFor our example then,\r\n\r\n\\[{}_n C_{r}={}_5 C_{2} = \\binom{5}{2}= \\frac{5!}{2!(5-2)!}=\\frac{5!}{2!(3)!}=\\frac{120}{2\\times 6}=10\\]\r\n\r\nAgain, the calculator can do the same thing for us:\r\n
                                                \r\n \t
                                              • See that nCr is located on top of the PLUS sign.<\/li>\r\n \t
                                              • Enter 5, 2ND nCr, enter 2, and the EQUAL sign.<\/li>\r\n \t
                                              • The answer is again 10.<\/li>\r\n<\/ul>\r\nIn this example, it should be made clear that the 2 positions are exactly the SAME:\r\n
                                                  \r\n \t
                                                • The 2 people chosen will have the exact SAME title, Vice President (VP):<\/li>\r\n \t
                                                • In other word, AB is the same as BA, for both A and B will become vice presidents.<\/li>\r\n \t
                                                • AC is the same as CA, for both A and C will be vice presidents,<\/li>\r\n \t
                                                • And so on...<\/li>\r\n<\/ul>\r\n

                                                  Example 14.9.2<\/h2>\r\nSetup:\u00a0<\/strong><\/span>Let us suppose the 2 positions are not the same:\r\n
                                                    \r\n \t
                                                  • Suppose the first person to be chosen is to become VP Finance,<\/li>\r\n \t
                                                  • and the second person chosen is to be VP Marketing.<\/li>\r\n \t
                                                  • Then AB is not the same as BA.<\/li>\r\n \t
                                                  • AB would mean that A is to be VP Finance, and B is to be VP Marketing. .<\/li>\r\n \t
                                                  • And BA would mean B is to be VP Finance, and A is to be VP Marketing.<\/li>\r\n<\/ul>\r\nIn other words, the ORDER is now important. And this becomes a problem of Permutation. We now have [latex] {}_5 P_{2}= 20 [\\latex].\r\n\r\nWe should expect 20 as our answer, because for every AB, there is a different BA. For every AC, there is a CA, and so on.\r\n\r\nIn summary then, when we select 2 objects out of 5, there are 10 different combinations when the order of selection is NOT important, and there are 20 different permutations when the order of selection IS important.\r\n\r\nNow that we have considered all three counting rules, let us look at several more examples, so we can be sure which rule applies in the situations described below.\r\n

                                                    Example 14.10<\/h2>\r\nSetup<\/span>: <\/strong>A stock broker is asked to rate 5 different stocks. He is to give each of the 5 stocks ratings of A, B, C, or D.\r\n\r\nQuestion:<\/strong> <\/span>In how many ways can he rate these 5 stocks?\r\n\r\nSolution:<\/span> <\/strong>Is it Rule 1, or 2, or 3 that applies?\u00a0 If you have any doubts, go back to Example 3 under Rule 1:\r\n
                                                      \r\n \t
                                                    • There, we have a Product Manager, here a stock broker.<\/li>\r\n \t
                                                    • There, we have 2 new products, here 5 stocks.<\/li>\r\n \t
                                                    • There, he can evaluate each of the new products in 3 ways, here in 4 ways.<\/li>\r\n \t
                                                    • It is Rule 1 that applies.<\/li>\r\n<\/ul>\r\nConclusion<\/strong><\/span>: The total number of ways the stock broker can rate these 5 stocks [latex]= 4 \\times 4 \\times 4\\times 4 \\times4 = 1,024[\/latex]\r\n

                                                      Example 14.11<\/h2>\r\nSetup<\/span>: <\/strong>An auditor has 12 Income Tax Returns in front of him. He has to select 3 of them at random to audit.\r\n\r\nQuestion:<\/span> <\/strong>In how many ways can he select 3 from the 12?\r\n\r\nSolution:<\/span> <\/strong>Here, he has to choose 3 from 12. The order is not important and, therefore, a combination: 12<\/sub>C3<\/sub> = <\/em>220.\r\n\r\nUsing the calculator:\r\n\r\n\\[{}_{12} C_{3}=\\frac{12!}{3!}{9!}=\\frac{12\\cdot 11\\cdot 10\\cdot 9!}{9!\\cdot 3!}=\\frac{12\\cdot 11\\cdot 10}{6}=220\\]\r\n

                                                      Example 14.12<\/h2>\r\nSetup<\/span>: <\/strong>In Lotto 6\/49, as long as you have the 6 correct numbers, you hit the jackpot.\r\n\r\nQuestion<\/strong><\/span>: How many possible tickets can be given out for each draw?\r\n\r\nSolution:<\/strong> <\/span>The order is not important and, therefore, a combination:\r\n\r\n\\[{}_{49} C_{6}=13,983,816\\]\r\n

                                                      Example 14.13<\/h2>\r\nSetup<\/span>: <\/strong>There are 10 people, 4 accountants and 6 Salespeople. Four of them, 2 accountants and 2 salespeople, are to be chosen to form a committee.\r\n\r\nQuestion:<\/strong> <\/span>In how many ways can this committee be formed?\r\n\r\nSolution:<\/strong> <\/span>Here we have to choose:\r\n
                                                        \r\n \t
                                                      • 2 accountants from 4, and<\/li>\r\n \t
                                                      • 2 salespeople from 6,<\/li>\r\n \t
                                                      • Order does not appear to be important.<\/li>\r\n \t
                                                      • So we have: \\[{}_4 C_2=6\\text{\u00a0 and\u00a0 } {}_6 C_{2}=15\\]<\/li>\r\n<\/ul>\r\nNow, what do you do to these 2 numbers, 6 and 15?\r\n
                                                          \r\n \t
                                                        • Do you add them?<\/li>\r\n \t
                                                        • NO. According to Rule 1, you multiply.<\/li>\r\n \t
                                                        • In the first stage, you choose 2 accountants from 4, and there are 6 ways to do so.<\/li>\r\n \t
                                                        • In the second stage, you choose 2 salespeople from 6, and there are 15 ways to do so.<\/li>\r\n \t
                                                        • All together, there are [latex]6 \\times15 = 90[\/latex] ways to have this committee formed.<\/li>\r\n<\/ul>","rendered":"
                                                          \n
                                                          \n

                                                          Learning Objectives<\/p>\n<\/header>\n

                                                          \n

                                                          Calculate and understand the counting rules (multiplication, combinations, and permutations).<\/p>\n<\/div>\n<\/div>\n

                                                            \n
                                                          • We have covered Descriptive Statistics where we summarize data.<\/li>\n
                                                          • The other branch of Statistics is called Inferential Statistics,<\/li>\n
                                                          • Inferential stats is where we draw conclusion, or make a decision, from the set of data.<\/li>\n
                                                          • When we make a decision, we usually make it under uncertainty, because the future is unknown to us.<\/li>\n
                                                          • This is why we have to study Probability.<\/li>\n
                                                          • Even before we can study Probability, we need to know how many different things can happen.<\/li>\n<\/ul>\n

                                                            Intro Counting Rule Example (Lotto 6\/49)<\/h1>\n

                                                            Example 14.1<\/h2>\n

                                                            A well known example is Lotto 6\/49:<\/p>\n

                                                              \n
                                                            • You may have heard of the following statement:<\/li>\n
                                                            • “When you play Lotto 6\/49, there is a 14 million to 1 chance of hitting the jackpot”, or words to that effect.<\/li>\n
                                                            • Where did the number 14 million come from?<\/li>\n
                                                            • We make use of the counting rules of course. B<\/li>\n
                                                            • y the end of this chapter, you will know where the 14 million come from.<\/li>\n<\/ul>\n

                                                              There are essentially 3 counting rules.<\/p>\n

                                                              Counting Rule One – Multiplication<\/h1>\n

                                                              This rule can be loosely stated as follows:<\/p>\n

                                                              If a “process” can be divided into stages, and there are [latex]n_1[\/latex] possible outcomes in stage 1, [latex]n_2[\/latex] possible outcomes in stage 2, and so on, then the total number of possible outcomes equals<\/p>\n

                                                              \\[n_1\\times n_2 \\times \\cdot\\]<\/p>\n

                                                              Example 14.2<\/h2>\n

                                                              Setup:<\/strong> <\/span><\/p>\n

                                                                \n
                                                              • A salesman calls on 2 clients every day.<\/li>\n
                                                              • Each call can result in a sale (s),. or in a no sale (n).<\/li>\n<\/ul>\n

                                                                Question:<\/strong> <\/span>How many different things can happen at the end of the day?<\/p>\n

                                                                Instructions:<\/strong> <\/span><\/p>\n

                                                                  \n
                                                                • We can equate “the process” with his calling on clients,<\/li>\n
                                                                • stage 1 with calling on the first client with [latex]n_1 = 2[\/latex] (s or n),<\/li>\n
                                                                • stage 2 with calling on the second client with [latex]n_2= 2[\/latex] (s or n).<\/li>\n
                                                                • Total possible outcomes [latex]= 2 \\times 2 = 4[\/latex].<\/li>\n
                                                                • Note: ‘S’ is defined as a ‘success’<\/li>\n<\/ul>\n

                                                                  Solutions:<\/strong> <\/span>What are these 4 possible outcomes?<\/p>\n

                                                                    \n
                                                                  • We can see them better if we draw a TREE DIAGRAM.<\/li>\n
                                                                  • Every tree has a root, representing the start of the “process”.<\/li>\n
                                                                  • From this root, we draw the same number of branches as there are possible outcomes in stage 1.<\/li>\n
                                                                  • We then draw a vertical line to represent the end of the first stage.<\/li>\n
                                                                  • This is to be followed by more branches and a vertical line to represent the second stage, and so on.<\/li>\n
                                                                  • The tree diagram representing this first example looks like so.<\/li>\n<\/ul>\n

                                                                    \"\"<\/p>\n

                                                                    Going along the different branches, we can see that the four different things are:<\/p>\n

                                                                      \n
                                                                    • ss, sn, ns, nn.<\/li>\n
                                                                    • ss means sale to the first, sale to the second.<\/li>\n
                                                                    • sn means sale to the first, no sale to the second.<\/li>\n
                                                                    • ns means no sale to the first, sale to the second.<\/li>\n
                                                                    • nn means no sale to both.<\/li>\n<\/ul>\n

                                                                      In the jargon of Statistics, these 4 things are called Sample Points. Together, they make up a Sample Space (SS):<\/p>\n

                                                                        \n
                                                                      • We write it like this<\/li>\n
                                                                      • \\[SS = \\{ss, sn, ns, nn\\}\\]<\/li>\n<\/ul>\n

                                                                        Example 14.3<\/h2>\n

                                                                        Setup:<\/strong> <\/span>Suppose this salesman calls on 3 clients every day.<\/p>\n

                                                                        Question:<\/span> <\/strong>How many different things can happen by the end of the day?<\/p>\n

                                                                        Solution:<\/span> <\/strong><\/p>\n

                                                                          \n
                                                                        • It is easy to be tempted to say the answer is [latex]3 \\times 2 = 6[\/latex].<\/li>\n
                                                                        • But remember there are now 3 stages to represent the 3 calls, and each call has 2 outcomes.<\/li>\n
                                                                        • The total possible outcomes [latex]= 2 \\times 2 \\times 2 = 8[\/latex].<\/li>\n
                                                                        • The tree diagram is like this<\/li>\n<\/ul>\n

                                                                          \"\"<\/p>\n

                                                                          \\[SS = \\{sss, ssn, sns, snn, nss, nsn ,nns, nnn\\}\\]<\/p>\n

                                                                          Example 14.4<\/h2>\n

                                                                          Setup: <\/strong><\/span>A Product Manager is asked to evaluate 2 new products. He is to give it a rating:<\/p>\n

                                                                            \n
                                                                          • P if he thinks the new product is Profitable in the first year<\/li>\n
                                                                          • N if he thinks it is Not profitable<\/li>\n
                                                                          • B if he thinks it will Breakeven.<\/li>\n<\/ul>\n

                                                                            Question:<\/strong> <\/span>In how many ways can he evaluate these 2 new products?<\/p>\n

                                                                            Solutions:<\/strong> <\/span><\/p>\n

                                                                              \n
                                                                            • Again, it is easy to be tempted to say the answer is 3 x 2 = 6.<\/li>\n
                                                                            • But remember there are 2 products, and each can be evaluated in 3 different ways.<\/li>\n
                                                                            • The correct answer is [latex]3\\times 3 = 9[\/latex].<\/li>\n
                                                                            • And the Sample Space is \\[SS = \\{PP, PN, PB, NP, NN, NB, BP, BN, BB\\}\\]<\/li>\n<\/ul>\n

                                                                              Example 14.5<\/h2>\n

                                                                              Setup<\/span>: <\/strong>BC license plates have the following setup:<\/p>\n

                                                                                \n
                                                                              • It has 6 characters,<\/li>\n
                                                                              • 3 letters,<\/li>\n
                                                                              • followed by a 3 digit number,<\/li>\n
                                                                              • \\[LLL \\, \u00a0 DDD\\]<\/span><\/li>\n<\/ul>\n

                                                                                Question:<\/strong><\/span> How many different regular licence plates for passenger vehicles can the BC government issue?<\/p>\n

                                                                                Solution: <\/span><\/strong>Assuming there are no restrictions,<\/p>\n

                                                                                  \n
                                                                                • There are 26 letters, and 10 (0 to 9) digits.<\/li>\n
                                                                                • So the total \\[= 26 \\times 26\\times 26 \\times 10 \\times 10\\times 10 = 17,576,000 \\text{ different plates.}\\]<\/li>\n<\/ul>\n

                                                                                  Example 14.6<\/h2>\n

                                                                                  Setup: <\/strong>How many different postal codes can there be in Canada?<\/span><\/p>\n

                                                                                  Question: <\/strong><\/span>What does a Canadian postal code look like? Do you get the exact same answer as in the example above?<\/p>\n

                                                                                  Solution: <\/span><\/strong><\/p>\n

                                                                                    \n
                                                                                  • Before we study the second and the third Counting Rules, we have to introduce another Mathematical Notation.<\/li>\n
                                                                                  • It is the idea of a FACTORIAL, which is represented by the exclamation mark, i.e. !.<\/li>\n
                                                                                  • We write it like this n!, where n is an integer, i.e., a whole number. By definition,<\/li>\n
                                                                                  • \\[n! = n\\cdot(n-1)\\cdot (n -2) \\cdots (2)\\cdot(1)\\]<\/li>\n<\/ul>\n

                                                                                    In other words, we start from the number [latex]n[\/latex]:<\/p>\n

                                                                                      \n
                                                                                    • multiply by it 1 less than [latex]n[\/latex],<\/li>\n
                                                                                    • multiply by 1. less again,<\/li>\n
                                                                                    • …until we come to the number 1.<\/li>\n<\/ul>\n

                                                                                      For instance, \\[4! = 4\\times 3\\times 2\\times 1 = 24\\]<\/p>\n

                                                                                      We can also make use of our calculator:<\/p>\n

                                                                                        \n
                                                                                      • We see that [x!] is on top of the multiplication sign, [latex]\\times[\/latex], key.<\/li>\n
                                                                                      • Remember anything on top of a key, we have to access it by pressing the 2ND key first.<\/li>\n<\/ul>\n

                                                                                        One more thing to remember, [latex]0! = 1[\/latex].<\/p>\n

                                                                                        RULE TWO – Permutations<\/h1>\n

                                                                                        This rule is so important it has a special name. It is called a PERMUTATION. A permutation is an ARRANGEMENT of objects into ORDER. We have emphasized the 2 key words, arrangement and order.<\/p>\n

                                                                                        Example 14.7<\/h2>\n

                                                                                        Setup<\/span>: <\/strong>There are 3 candidates in a Federal Election:<\/p>\n

                                                                                          \n
                                                                                        • a Liberal (LIB),<\/li>\n
                                                                                        • a Conservative (CON),<\/li>\n
                                                                                        • and an NDP (NDP).<\/li>\n<\/ul>\n

                                                                                          In this example, it should be clear that there is an ORDER:<\/p>\n

                                                                                            \n
                                                                                          • One person will get the most number of votes,<\/li>\n
                                                                                          • and they become MP.<\/li>\n
                                                                                          • A second person will get the second largest number of votes.<\/li>\n
                                                                                          • A third person will get the least number of votes.<\/li>\n
                                                                                          • There is an ORDER, and it is:<\/li>\n<\/ul>\n\n\n\n\n\n\n\n\n
                                                                                            LIB<\/td>\nCON<\/td>\nNDP<\/td>\n<\/tr>\n
                                                                                            LIB<\/td>\nNDP<\/td>\nCON<\/td>\n<\/tr>\n
                                                                                            CON<\/td>\nLIB<\/td>\nNDP<\/td>\n<\/tr>\n
                                                                                            CON<\/td>\nNDP<\/td>\nLIB<\/td>\n<\/tr>\n
                                                                                            NDP<\/td>\nLIB<\/td>\nCON<\/td>\n<\/tr>\n
                                                                                            NDP<\/td>\nCON<\/td>\nLIB<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

                                                                                            Solution:\u00a0<\/span><\/strong>As we can see from the above listing, there are 6, no more. Let us obtain this same answer, 6, from a mathematical formula. It is<\/p>\n

                                                                                            \\[{}_n P_r = \\frac{n!}{(n-r)!}\\]<\/p>\n

                                                                                            where<\/p>\n

                                                                                              \n
                                                                                            • [latex]r\\leq n[\/latex].<\/li>\n
                                                                                            • [latex]n[\/latex] is the total number of objects to be arranged. In this example, [latex]n = 3[\/latex].<\/li>\n
                                                                                            • [latex]P[\/latex] simply stands for Permutation. It has NO numeric value.<\/li>\n
                                                                                            • [latex]r[\/latex] is the number of objects to be arranged into order. In this example, [latex]r = 3[\/latex] also.<\/li>\n<\/ul>\n

                                                                                              According to the formula given above, we have<\/p>\n

                                                                                              \\[{}_n P_r = {}_3P_3 = \\frac{3!}{(3-3)!}=\\frac{3!}{0!}=\\frac{6}{1}=6\\]<\/p>\n

                                                                                              Example 14.8<\/h2>\n

                                                                                              Setup<\/span>: <\/strong><\/p>\n

                                                                                                \n
                                                                                              • There are 15 people in a contest (a beauty pageant, blueberry pie in a country fair, whatever)and<\/li>\n
                                                                                              • A winner, a first runner-up, and a second runner-up are to be declared.<\/li>\n
                                                                                              • Again, in this example, the words winner, first, second suggest ORDER.<\/li>\n
                                                                                              • It is, therefore, also a permutation, with [latex]n = 15[\/latex] and [latex]r =3[\/latex].<\/li>\n<\/ul>\n

                                                                                                \\[{}_n P_r = {}_{15}P_3 = \\frac{15!}{(15-3)!}=\\frac{15!}{12!}=\\frac{15\\times 14 \\times 13 \\times 12!}{12!}=15\\times 14 \\times 13 =2730\\]<\/p>\n

                                                                                                You may find it easier to do by your calculator:<\/p>\n

                                                                                                  \n
                                                                                                • You will find the nPr key on top of the MINUS sign.<\/li>\n
                                                                                                • First, enter n, which is 15,<\/li>\n
                                                                                                • Then, press 2ND nPr,<\/li>\n
                                                                                                • Then enter r, which is 3.<\/li>\n
                                                                                                • Now press the EQUAL sign.<\/li>\n
                                                                                                • You should get the same answer of 2,730.<\/li>\n<\/ul>\n

                                                                                                  RULE THREE – Combinations<\/h1>\n

                                                                                                  This rule also has a special name. It is called a COMBINATION. A combination is a SELECTION of objects WITHOUT REGARD TO ORDER. Again, we have emphasized the key phrases.<\/p>\n

                                                                                                  Example 14.9.1<\/h2>\n

                                                                                                  Setup<\/span>: <\/strong>Five people, call them A, B, C, D, and E for convenience, are running to become vice presidents of an organization. Two are to be chosen.<\/p>\n

                                                                                                  Question<\/span><\/strong>: In how many ways can the president choose 2 from the 5 to become his vice presidents?<\/p>\n

                                                                                                  Solution:<\/strong> <\/span><\/p>\n

                                                                                                  Let us list them first of all, and then we will give the mathematical formula. The president can choose<\/p>\n\n\n\n\n\n\n
                                                                                                  AB<\/td>\nAC<\/td>\nAD\u00a0\u00a0\u00a0\u00a0 AE<\/td>\n<\/tr>\n
                                                                                                  BC<\/td>\nBD<\/td>\nBE<\/td>\n<\/tr>\n
                                                                                                  CD<\/td>\nCE<\/td>\n<\/td>\n<\/tr>\n
                                                                                                  DE<\/td>\n<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n
                                                                                                    \n
                                                                                                  • We can see that there are 10.<\/li>\n
                                                                                                  • The general formula is: \\[{}_n C_{r}= \\binom{n}{r}= \\frac{n!}{r!(n-r)!}\\]<\/li>\n<\/ul>\n

                                                                                                    where<\/p>\n

                                                                                                      \n
                                                                                                    • [latex]r\\leq n[\/latex].<\/li>\n
                                                                                                    • [latex]n[\/latex] is the total number of objects to be arranged. In this example, [latex]n = 5[\/latex].<\/li>\n
                                                                                                    • [latex]C[\/latex] simply stands for Combination. It has NO numeric value.<\/li>\n
                                                                                                    • [latex]r[\/latex] is the number of objects to be arranged into order. In this example, [latex]r = 2[\/latex] also.<\/li>\n<\/ul>\n

                                                                                                      For our example then,<\/p>\n

                                                                                                      \\[{}_n C_{r}={}_5 C_{2} = \\binom{5}{2}= \\frac{5!}{2!(5-2)!}=\\frac{5!}{2!(3)!}=\\frac{120}{2\\times 6}=10\\]<\/p>\n

                                                                                                      Again, the calculator can do the same thing for us:<\/p>\n

                                                                                                        \n
                                                                                                      • See that nCr is located on top of the PLUS sign.<\/li>\n
                                                                                                      • Enter 5, 2ND nCr, enter 2, and the EQUAL sign.<\/li>\n
                                                                                                      • The answer is again 10.<\/li>\n<\/ul>\n

                                                                                                        In this example, it should be made clear that the 2 positions are exactly the SAME:<\/p>\n

                                                                                                          \n
                                                                                                        • The 2 people chosen will have the exact SAME title, Vice President (VP):<\/li>\n
                                                                                                        • In other word, AB is the same as BA, for both A and B will become vice presidents.<\/li>\n
                                                                                                        • AC is the same as CA, for both A and C will be vice presidents,<\/li>\n
                                                                                                        • And so on…<\/li>\n<\/ul>\n

                                                                                                          Example 14.9.2<\/h2>\n

                                                                                                          Setup:\u00a0<\/strong><\/span>Let us suppose the 2 positions are not the same:<\/p>\n

                                                                                                            \n
                                                                                                          • Suppose the first person to be chosen is to become VP Finance,<\/li>\n
                                                                                                          • and the second person chosen is to be VP Marketing.<\/li>\n
                                                                                                          • Then AB is not the same as BA.<\/li>\n
                                                                                                          • AB would mean that A is to be VP Finance, and B is to be VP Marketing. .<\/li>\n
                                                                                                          • And BA would mean B is to be VP Finance, and A is to be VP Marketing.<\/li>\n<\/ul>\n

                                                                                                            In other words, the ORDER is now important. And this becomes a problem of Permutation. We now have [latex]{}_5 P_{2}= 20 [\\latex]. We should expect 20 as our answer, because for every AB, there is a different BA. For every AC, there is a CA, and so on. In summary then, when we select 2 objects out of 5, there are 10 different combinations when the order of selection is NOT important, and there are 20 different permutations when the order of selection IS important. Now that we have considered all three counting rules, let us look at several more examples, so we can be sure which rule applies in the situations described below. <\/p>\n

                                                                                                            Example 14.10<\/h2>\n

                                                                                                            Setup<\/span>: <\/strong>A stock broker is asked to rate 5 different stocks. He is to give each of the 5 stocks ratings of A, B, C, or D. Question:<\/strong> <\/span>In how many ways can he rate these 5 stocks? Solution:<\/span> <\/strong>Is it Rule 1, or 2, or 3 that applies?\u00a0 If you have any doubts, go back to Example 3 under Rule 1: <\/p>\n

                                                                                                              \n
                                                                                                            • There, we have a Product Manager, here a stock broker.<\/li>\n
                                                                                                            • There, we have 2 new products, here 5 stocks.<\/li>\n
                                                                                                            • There, he can evaluate each of the new products in 3 ways, here in 4 ways.<\/li>\n
                                                                                                            • It is Rule 1 that applies.<\/li>\n<\/ul>\n

                                                                                                              Conclusion<\/strong><\/span>: The total number of ways the stock broker can rate these 5 stocks [latex]= 4 \\times 4 \\times 4\\times 4 \\times4 = 1,024[\/latex]<\/p>\n

                                                                                                              Example 14.11<\/h2>\n

                                                                                                              Setup<\/span>: <\/strong>An auditor has 12 Income Tax Returns in front of him. He has to select 3 of them at random to audit.<\/p>\n

                                                                                                              Question:<\/span> <\/strong>In how many ways can he select 3 from the 12?<\/p>\n

                                                                                                              Solution:<\/span> <\/strong>Here, he has to choose 3 from 12. The order is not important and, therefore, a combination: 12<\/sub>C3<\/sub> = <\/em>220.<\/p>\n

                                                                                                              Using the calculator:<\/p>\n

                                                                                                              \\[{}_{12} C_{3}=\\frac{12!}{3!}{9!}=\\frac{12\\cdot 11\\cdot 10\\cdot 9!}{9!\\cdot 3!}=\\frac{12\\cdot 11\\cdot 10}{6}=220\\]<\/p>\n

                                                                                                              Example 14.12<\/h2>\n

                                                                                                              Setup<\/span>: <\/strong>In Lotto 6\/49, as long as you have the 6 correct numbers, you hit the jackpot.<\/p>\n

                                                                                                              Question<\/strong><\/span>: How many possible tickets can be given out for each draw?<\/p>\n

                                                                                                              Solution:<\/strong> <\/span>The order is not important and, therefore, a combination:<\/p>\n

                                                                                                              \\[{}_{49} C_{6}=13,983,816\\]<\/p>\n

                                                                                                              Example 14.13<\/h2>\n

                                                                                                              Setup<\/span>: <\/strong>There are 10 people, 4 accountants and 6 Salespeople. Four of them, 2 accountants and 2 salespeople, are to be chosen to form a committee.<\/p>\n

                                                                                                              Question:<\/strong> <\/span>In how many ways can this committee be formed?<\/p>\n

                                                                                                              Solution:<\/strong> <\/span>Here we have to choose:<\/p>\n

                                                                                                                \n
                                                                                                              • 2 accountants from 4, and<\/li>\n
                                                                                                              • 2 salespeople from 6,<\/li>\n
                                                                                                              • Order does not appear to be important.<\/li>\n
                                                                                                              • So we have: \\[{}_4 C_2=6\\text{\u00a0 and\u00a0 } {}_6 C_{2}=15\\]<\/li>\n<\/ul>\n

                                                                                                                Now, what do you do to these 2 numbers, 6 and 15?<\/p>\n

                                                                                                                  \n
                                                                                                                • Do you add them?<\/li>\n
                                                                                                                • NO. According to Rule 1, you multiply.<\/li>\n
                                                                                                                • In the first stage, you choose 2 accountants from 4, and there are 6 ways to do so.<\/li>\n
                                                                                                                • In the second stage, you choose 2 salespeople from 6, and there are 15 ways to do so.<\/li>\n
                                                                                                                • All together, there are [latex]6 \\times15 = 90[\/latex] ways to have this committee formed.<\/li>\n<\/ul>\n","protected":false},"author":883,"menu_order":1,"template":"","meta":{"pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[],"contributor":[],"license":[],"class_list":["post-162","chapter","type-chapter","status-publish","hentry"],"part":208,"_links":{"self":[{"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/pressbooks\/v2\/chapters\/162","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/wp\/v2\/users\/883"}],"version-history":[{"count":25,"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/pressbooks\/v2\/chapters\/162\/revisions"}],"predecessor-version":[{"id":1457,"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/pressbooks\/v2\/chapters\/162\/revisions\/1457"}],"part":[{"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/pressbooks\/v2\/parts\/208"}],"metadata":[{"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/pressbooks\/v2\/chapters\/162\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/wp\/v2\/media?parent=162"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/pressbooks\/v2\/chapter-type?post=162"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/wp\/v2\/contributor?post=162"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/pressbooks.bccampus.ca\/1130sandbox\/wp-json\/wp\/v2\/license?post=162"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}