In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s.
|
|
- Darrell Francis
- 5 years ago
- Views:
Transcription
1 Section 10.6 Permutations and Combinations Permutations and Combinations In this section, we will learn to 1. Use the Multiplication Principle for Events. 2. Solve permutation problems. 3. Solve combination problems. 4. Use combination notation to write the Binomial Theorem. 5. Find the number of permutations of like things. 1. Use the Multiplication Principle for Events Lydia plans to go to dinner and attend a movie. If she has a choice of four restaurants and three movies, in how many ways can she spend her evening? There are four choices of restaurants and, for any one of these choices, there are three choices of movies, as shown in the tree diagram in Figure Lydia s choices Cheesecake Factory Outback Steakhouse P.F. Chang s Olive Garden Not For Sale FIGURE 10-3 True Grit Chronicles of Narnia: The Voyage of the Dawn Treader Black Swan True Grit Chronicles of Narnia: The Voyage of the Dawn Treader Black Swan True Grit Chronicles of Narnia: The Voyage of the Dawn Treader Black Swan True Grit Chronicles of Narnia: The Voyage of the Dawn Treader Black Swan
2 Not For Sale 10-2 Chapter 10 Sequences, Series, and Probability The diagram shows that Lydia has 12 ways to spend her evening. One possibility is to eat at the Cheesecake Factory and watch True Grit. Another is to eat at the Olive Garden and watch Black Swan. Multiplication Principle for Events example 1 Photos 12/Alamy Any situation that has several outcomes is called an event. Lydia s first event (choosing a restaurant) can occur in 4 ways. Her second event (choosing a movie) can occur in 3 ways. Thus, she has 4? 3, or 12, ways to spend her evening. This example illustrates the Multiplication Principle for Events. Let E 1 and E 2 be two events. If E 1 can be done in a 1 ways, and if after E 1 has occurred E 2 can be done in a 2 ways, then the event E 1 followed by E 2 can be done in a 1? a 2 ways. The Multiplication Principle can be extended to n events. Using the Multiplication Principle for Events If a traveler has 4 ways to go from New York to Chicago, 3 ways to go from Chicago to Denver, and 6 ways to go from Denver to San Francisco, in how many ways can she go from New York to San Francisco? We can let E 1 be the event going from New York to Chicago, E 2 the event going from Chicago to Denver, and E 3 the event going from Denver to San Francisco. Since there are 4 ways to accomplish E 1, 3 ways to accomplish E 2, and 6 ways to accomplish E 3, the number of routes available is 4? 3? self Check 1 If a man has 4 sweaters and 5 pairs of slacks, how many different outfits can he wear? Now Try Exercise Solve Permutation Problems Suppose we want to arrange 7 books in order on a shelf. We can fill the first space with any one of the 7 books, the second space with any of the remaining 6 books,
3 Section 10.6 Permutations and Combinations 10-3 the third space with any of the remaining 5 books, and so on, until there is only one space left to fill with the last book. According to the Multiplication Principle, the number of ordered arrangements of the books is 7? 6? 5? 4? 3? 2? 1 5 5,040 When finding the number of possible ordered arrangements of books on a shelf, we are finding the number of permutations. The number of permutations of 7 books, using all the books, is 5,040. The symbol P1n, r2 is read as the number of permutations of n things r at a time. Thus, P17, ,040. example 2 self Check 2 Finding the Number of Permutations Assume that there are 7 signal flags of 7 different colors to hang on a mast. How many different signals can be sent when 3 flags are used? We are asked to find P17, 32, the number of permutations (ordered arrangements) of 7 things using 3 of them. Any one of the 7 flags can hang in the top position on the mast. Any one of the 6 remaining flags can hang in the middle position, and any one of the remaining 5 flags can hang in the bottom position. By the Multiplication Principle, we have P17, ? 6? It is possible to send 210 different signals. How many signals can be sent if two of the 7 flags are missing? Now Try Exercise 37. Although it is correct to write P17, ? 6? 5, we will change the form of the answer to obtain a convenient formula. To derive this formula, we proceed as follows: P17, ? 6? 5 5 7? 6? 5? 4? 3? 2? 1 4? 3? 2? 1 5 7! 4! 5 7! ! Multiply numerator and denominator by 4? 3? 2? 1. The generalization of this idea gives the following formula. Formula for P1n, r2 The number of permutations of n things r at a time is given by P1n, r2 5 n! 1n 2 r2! example 3 Using the Permutation Formula Find: a. P18, 42 b. P1n, n2 c. P1n, 02 We will substitute into the formula for P1n, r2 and simplify. Not a. P18, For ! ! 5 8? 7 Sale? 6? 5? 4! 5 1,680 4!
4 Not For Sale 10-4 Chapter 10 Sequences, Series, and Probability b. P1n, n2 5 n! 1n 2 n2! 5 n! 0! 5 n! 1 5 n! c. P1n, 02 5 n! 1n 2 02! 5 n! n! 5 1 self Check 3 Find: a. P17, 52 b. P16, 02 Now Try Exercise 13. Parts (b) and (c) of Example 3 establish the following formulas. Formulas for P1n, n2 and P1n, 02 example 4 The number of permutations of n things n at a time and n things 0 at a time are given by the formulas P1n, n2 5 n! and P1n, Solving a Permutation Problem In how many ways can a baseball manager arrange a batting order of 9 players if there are 25 players on the team? Richard Paul Kane/Shutterstock.com To find the number of permutations of 25 things 9 at a time, we substitute 25 for n and 9 for r in the formula for finding P1n, r2. P1n, r2 5 n! 1n 2 r2! P125, ! ! 5 25! 16! 5 25? 24? 23? 22? 21? 20? 19? 18? 17? 16! 16! 5 741,354,768,000 The number of permutations is 741,354,768,000. self Check 4 In how many ways can the manager arrange a batting order if 2 players can t play? Now Try Exercise 41.
5 Section 10.6 Permutations and Combinations 10-5 Accent on Technology Permutations A graphing calculator can be used to find P1n, r2. For example, let s consider the permutation in Example 4 and determine P125, 92. The calculator operation that will be used is npr. to find P125, 92, first enter 25 in your calculator. Press MATH and move the cursor to PRB. Scroll down to 2:nPr and press ENTER. Enter 9 on your calculator and press ENTER. We see that P125, 92 is equal to 741,354,768,000. example 5 self Check 5 Solving a Permutation Problem FIGURE 10-4 In how many ways can 5 people stand in a line if 2 people refuse to stand next to each other? The total number of ways that 5 people can stand in line is P15, ! 5 5? 4? 3? 2? To find the number of ways that 5 people can stand in line if 2 people insist on standing together, we consider the two people as one person. Then there are 4 people to stand in line, and this can be done in P14, ! 5 24 ways. However, because either of the two who are paired could be first, there are two arrangements for the pair who insist on standing together. Thus, there are 2? 4!, or 48 ways that 5 people can stand in line if 2 people insist on standing together. The number of ways that 5 people can stand in line if 2 people refuse to stand together is 5! (the total number of ways to line up 5 people) minus 2? 4! 5 48 (the number of ways to line up the 5 people if 2 do stand together): There are 72 ways to line up the people. In how many ways can 5 people stand in a line if one person demands to be first? Now Try Exercise 39. example 6 Solving a Permutation Problem In how many ways can 5 people be seated at a round table? If we were to seat 5 people in a row, there would be 5! possible arrangements. However, at a round table, each person has a neighbor to the left and to the right. If each person moves one, two, three, four, or five places to the left, everyone has the same neighbors and the arrangement has not changed. Thus, we must divide 5! by 5 to get rid of these duplications. The number of ways that 5 people can be seated at a round table is 5! 5 5 5? 4! Not For 5 4! 5 4? 3? 2? Sale
6 Not For Sale 10-6 Chapter 10 Sequences, Series, and Probability self Check 6 In how many ways can 6 people be seated at a round table? Now Try Exercise 43. The results of Example 6 suggest the following fact. Circular Arrangements There are 1n 2 12! ways to arrange n things in a circle. Comment When discussing permutations, order counts. When discussing combinations, order doesn t count. 3. Solve Combination Problems Suppose that a class of 12 students selects a committee of 3 persons to plan a party. With committees, order is not important. A committee of John, Maria, and Raul is the same as a committee of Maria, Raul, and John. However, if we assume for the moment that order is important, we can find the number of permutations of 12 things 3 at a time. P112, ! 12? 11? 10? 9! 5 5 1, ! 9! However, since we do not care about order, this result of 1,320 ways is too large. Because there are 6 ways 13! 5 62 of ordering every committee of 3 students, the result of P112, ,320 is exactly 6 times too big. To get the correct number of committees, we must divide P112, 32 by 6: P112, , In cases of selection where order is not important, we are interested in combinations, not permutations. The symbols C1n, r2 and a n b both mean the number of r combinations of n things r at a time. If a committee of r people is chosen from a total of n people, the number of possible committees is C1n, r2, and there will be r! arrangements of each committee. If we consider the committee as an ordered grouping, the number of orderings is P1n, r2. Thus, we have (1) r!c1n, r2 5 P1n, r2 We can divide both sides of Equation 1 by r! to obtain the formula for finding C1n, r2. C1n, r2 5 a n P1n, r2 n! b 5 5 r r! r!1n 2 r2! Formula for C 1n, r2 The number of combinations of n things r at a time is given by C1n, r2 5 a n r b 5 n! r!1n 2 r2! In Exercises 77 and 78, you will be asked to prove the following formulas. Formulas for C 1n, n2 and C 1n, 02 If n is a whole number, then C1n, n2 5 1 and C1n,
7 Section 10.6 Permutations and Combinations 10-7 example 7 Solving a Combination Problem If Carla must read 4 books from a reading list of 10 books, how many choices does she have? Because the order in which the books are read is not important, we find the number of combinations of 10 things 4 at a time: C110, ! 10? 9? 8? 7? 6! 5 4! ! 4? 3? 2? 1? 6! self Check 7 Accent on Technology example 8 Carla has 210 choices. 5 10? 9? 8? 7 4? 3? How many choices would Carla have if she had to read 5 books? Now Try Exercise 49. Combinations A graphing calculator can be used to find C1n, r2. For example, let s consider the permutation in Example 7 and determine C110, 42. The calculator operation that will be used is ncr. to find C110, 42, first enter 10 in your calculator. Solving a Combination Problem Press MATH and move the cursor to PRB. Scroll down to 3:nCr and press ENTER. FIGURE 10-5 Enter 4 on your calculator and press ENTER. We see that C110, 42 is equal to 210. A class consists of 15 men and 8 women. In how many ways can a debate team be chosen with 3 men and 3 women? There are C115, 32 ways of choosing 3 men and C18, 32 ways of choosing 3 women. By the Multiplication Principle, there are C115, 32? C18, 32 ways of choosing members of the debate team: C115, 32? C18, ! 3! !? 8! 3! ! 15? 14? 13 6? 8? 7? ,480 Not There For are 25,480 ways to choose Sale the debate team.
8 Not For Sale 10-8 Chapter 10 Sequences, Series, and Probability self Check 8 In how many ways can the debate team be chosen if it is to have 4 men and 2 women? Now Try Exercise 59. Binomial Theorem Comment example 9 4. Use Combination Notation to Write the Binomial Theorem The formula C1n, r2 5 n! r!1n 2 r2! gives the coefficient of the 1r 1 12th term of the binomial expansion of 1a 1 b2 n. This implies that the coefficients of a binomial expansion can be used to solve problems involving combinations. The Binomial Theorem is restated below this time listing the 1r 1 12th term and using combination notation. If n is any positive integer, then 1a 1 b2 n 5 a n 0 ban 1 a n 1 ban21 b 1 a n 2 ban22 b 2 1 c 1 a n r ban2r b r 1 c 1 a n n bbn In the expansion of 1a 1 b2 n, the term containing b r is given by a n r ban2r b r Using Pascal s Triangle to Compute a Combination Use Pascal s Triangle to compute C17, 52. Consider the eighth row of Pascal s Triangle and the corresponding combinations: a 7 0 b a7 1 b a7 2 b a7 3 b a7 4 b a7 5 b a7 6 b a7 7 b C17, 52 5 a 7 5 b self Check 9 Use Pascal s Triangle to compute C16, 52. Now Try Exercise Find the Number of Permutations of Like Things A word is a distinguishable arrangement of letters. For example, six words can be formed with the letters a, b, and c if each letter is used exactly once. The six words are abc, acb, bac, bca, cab, and cba If there are n distinct letters and each letter is used once, the number of distinct words that can be formed is n! 5 P1n, n2. It is more complicated to compute the number of distinguishable words that can be formed with n letters when some of the letters are duplicates.
9 Section 10.6 Permutations and Combinations 10-9 example 10 Finding the Number of Permutations of Like Things Find the number of words that can be formed if each of the 6 letters of the word little is used once. For the moment, we assume that the letters of the word little are distinguishable: LitTle. The number of words that can be formed using each letter once is 6! 5 P16, 62. However, in reality we cannot tell the l s or the t s apart. Therefore, we must divide by a number to get rid of these duplications. Because there are 2! orderings of the two l s and 2! orderings of the two t s, we divide by 2!? 2!. The number of words that can be formed using each letter of the word little is self Check 10 Permutations of Like Things P16, 62 2!? 2! 5 6! 2!? 2! 5 6? 5? 4 2? 3? 2? ? 1? 2? 1 How many words can be formed if each letter of the word balloon is used once? Now Try Exercise 55. Example 10 illustrates the following general principle. The number of permutations of n things with a things alike, b things alike, and so on, is n! a!b! c Self Check Answers a. 2,520 b ,541,907, , ,260 Exercises 10.6 Getting Ready You should be able to complete these vocabulary and concept statements before you proceed to the practice exercises. 9. C1n, n C1n, If a word with n letters has a of one letter, b of another letter, and so on, the number of different words that can be formed is. Fill in the blanks. 12. Where the order of selection is not important, we 1. If E 1 and E 2 are two events and E 1 can be done in are interested in, not. 4 ways and E 2 can be done in 6 ways, then the event E 1 followed by E 2 can be done in ways. Practice 2. An arrangement of n objects is called a. Evaluate each expression. 13. P17, P18, P1n, r C17, C18, P1n, n P15, P15, P1n, There are ways to arrange n things in a 19. a 5 4 b 20. a8 4 b circle. 7. C1n, r a 5 0 b 22. a5 5 b 8. Using combination Not notation, C1n, r2 5 For. Sale 23. P15, 42? C15, P13, 22? C14, 32
10 Not For Sale Chapter 10 Sequences, Series, and Probability 25. a 5 3 b a4 3 b a3 3 b 26. a5 5 b a6 6 b a7 7 b a8 8 b 27. a 68 b 28. a b Applications 29. Choosing lunch A lunchroom has a machine with eight kinds of sandwiches, a machine with four kinds of soda, a machine with both white and chocolate milk, and a machine with three kinds of ice cream. How many different lunches can be chosen? (Consider a lunch to be one sandwich, one drink, and one ice cream.) 30. Manufacturing license plates How many six-digit license plates can be manufactured if no license plate number begins with 0? 31. Available phone numbers How many different sevendigit phone numbers can be used in one area code if no phone number begins with 0 or 1? dcb/shutterstock.com 32. Arranging letters In how many ways can the letters of the word number be arranged? 33. Arranging letters with restrictions In how many ways can the letters of the word number be arranged if the e and r must remain next to each other? 34. Arranging letters with restrictions In how many ways can the letters of the word number be arranged if the e and r cannot be side by side? 35. Arranging letters with repetitions How many ways can five Scrabble tiles bearing the letters, F, F, F, L, and U be arranged to spell the word fluff? 36. Arranging letters with repetitions How many ways can six Scrabble tiles bearing the letters B, E, E, E, F, and L be arranged to spell the word feeble? 37. Placing people in line In how many arrangements can 8 women be placed in a line? 38. Placing people in line In how many arrangements can 5 women and 5 men be placed in a line if the women and men alternate? 39. Placing people in line In how many arrangements can 5 women and 5 men be placed in a line if all the men line up first? 40. Placing people in line In how many arrangements can 5 women and 5 men be placed in a line if all the women line up first? 41. Combination locks How many permutations does a combination lock have if each combination has 3 numbers, no two numbers of the combination are the same, and the lock dial has 30 notches? 42. Combination locks How many permutations does a combination lock have if each combination has 3 numbers, no two numbers of the combination are the same, and the lock dial has 100 notches? 43. Seating at a table In how many ways can 8 people be seated at a round table? 44. Seating at a table In how many ways can 7 people be seated at a round table? 45. Seating at a table In how many ways can 6 people be seated at a round table if 2 of the people insist on sitting together? 46. Seating arrangements with conditions In how many ways can 6 people be seated at a round table if 2 of the people refuse to sit together? 47. Arrangements in a circle In how many ways can 7 children be arranged in a circle if Sally and John want to sit together and Martha and Peter want to sit together? 48. Arrangements in a circle In how many ways can 8 children be arranged in a circle if Laura, Scott, and Paula want to sit together? 49. Selecting candy bars In how many ways can 4 candy bars be selected from 10 different candy bars? Istockphoto.com/NoDerog 50. Selecting birthday cards In how many ways can 6 birthday cards be selected from 24 different cards? 51. Circuit wiring A wiring harness containing a red, a green, a white, and a black wire must be attached to a control panel. In how many different orders can the wires be attached? 52. Grading homework A professor grades homework by randomly checking 7 of the 20 problems assigned. In how many different ways can this be done? 53. Forming words with distinct letters How many words can be formed from the letters of the word plastic if each letter is to be used once? 54. Forming words with distinct letters How many words can be formed from the letters of the word computer if each letter is to be used once?
11 Section 10.6 Permutations and Combinations Forming words with repeated letters How many words can be formed from the letters of the word banana if each letter is to be used once? 56. Forming words with repeated letters How many words can be formed from the letters of the word laptop if each letter is to be used once? 57. Manufacturing license plates How many license plates can be made using two different letters followed by four different digits if the first digit cannot be 0 and the letter O is not used? 58. Planning class schedules If there are 7 class periods in a school day, and a typical student takes 5 classes, how many different time patterns are possible for the student? 59. Selecting golf balls From a bucket containing 6 red and 8 white golf balls, in how many ways can we draw 6 golf balls of which 3 are red and 3 are white? 60. Selecting a committee In how many ways can you select a committee of 3 Republicans and 3 Democrats from a group containing 18 Democrats and 11 Republicans? 61. Selecting a committee In how many ways can you select a committee of 4 Democrats and 3 Republicans from a group containing 12 Democrats and 10 Republicans? KamiGami/ Shutterstock.com 62. Drawing cards In how many ways can you select a group of 5 red cards and 2 black cards from a deck containing 10 red cards and 8 black cards? 63. Planning dinner In how many ways can a husband and wife choose 2 different dinners from a menu of 17 dinners? 64. Placing people in line In how many ways can 7 people stand in a row if 2 of the people refuse to stand together? 65. Geometry How many lines are determined by 8 points if no 3 points lie on a straight line? 66. Geometry How many lines are determined by 10 points if no 3 points lie on a straight line? 67. Coaching basketball How many different teams can a basketball coach start if the entire squad consists of 10 players? (Assume that a starting team has 5 players and each player can play all positions.) 68. Managing baseball How many different teams can a manager start if the entire squad consists of 25 players? (Assume that a starting team has 9 players and each player can play all positions.) 69. Selecting job applicants There are 30 qualified applicants for 5 openings in the sales department. In how many different ways can the group of 5 be selected? 70. Sales promotions If a customer purchases a new stereo system during the spring sale, he may choose any 6 CDs from 20 classical and 30 jazz selections. In how many ways can the customer choose 3 of each? 71. Guessing on matching questions Ten words are to be paired with the correct 10 out of 12 possible definitions. How many ways are there of guessing? 72. Guessing on true-false exams How many possible ways are there of guessing on a 10-question truefalse exam, if it is known that the instructor will have 5 true and 5 false responses? 73. Number of Wendy s hamburgers Wendy s Old Fashioned Hamburgers offers eight toppings for their single hamburger. How many different single hamburgers can be ordered? 74. Number of ice cream sundaes A restaurant offers ten toppings for their ice cream sundaes. How many different sundaes can be ordered? Practice Use Pascal s Triangle to compute each combination. 75. C18, C17, 42 Discovery and Writing 77. Prove that C1n, n Prove that C1n, Prove that a n r b 5 a n n 2 r b. 80. Show that the Binomial Theorem can be expressed in the form n 1a 1 b2 n 5 a a n k ban2k b k k Explain how to use Pascal s Triangle to find C18, Explain how to use Pascal s Triangle to find C110, 82. Review Find the value of x. 83. log x log p x log " x 86. log x Determine whether the statement is true or false. 87. log log log b b b 5 b Not For 90. Sale log 7 A log 7 B 5 log A 7 B
Permutations. and. Combinations
Permutations and Combinations Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another independent event has n possible outcomes, then there
More information6.4 Permutations and Combinations
Math 141: Business Mathematics I Fall 2015 6.4 Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects
More informationChapter 10A. a) How many labels for Product A are required? Solution: ABC ACB BCA BAC CAB CBA. There are 6 different possible labels.
Chapter 10A The Addition rule: If there are n ways of performing operation A and m ways of performing operation B, then there are n + m ways of performing A or B. Note: In this case or means to add. Eg.
More informationFundamental Counting Principle
Lesson 88 Probability with Combinatorics HL2 Math - Santowski Fundamental Counting Principle Fundamental Counting Principle can be used determine the number of possible outcomes when there are two or more
More informationMAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology
MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally
More informationPermutations and Combinations. Quantitative Aptitude & Business Statistics
Permutations and Combinations Statistics The Fundamental Principle of If there are Multiplication n 1 ways of doing one operation, n 2 ways of doing a second operation, n 3 ways of doing a third operation,
More informationTopics to be covered
Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle
More informationObjectives: Permutations. Fundamental Counting Principle. Fundamental Counting Principle. Fundamental Counting Principle
and Objectives:! apply fundamental counting principle! compute permutations! compute combinations HL2 Math - Santowski! distinguish permutations vs combinations can be used determine the number of possible
More informationElementary Combinatorics
184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are
More information* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
More information12.1 The Fundamental Counting Principle and Permutations
12.1 The Fundamental Counting Principle and Permutations The Fundamental Counting Principle Two Events: If one event can occur in ways and another event can occur in ways then the number of ways both events
More informationUnit on Permutations and Combinations (Counting Techniques)
Page 1 of 15 (Edit by Y.M. LIU) Page 2 of 15 (Edit by Y.M. LIU) Unit on Permutations and Combinations (Counting Techniques) e.g. How many different license plates can be made that consist of three digits
More informationAdvanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY
Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY 1. Jack and Jill do not like washing dishes. They decide to use a random method to select whose turn it is. They put some red and blue
More informationUnit 5 Radical Functions & Combinatorics
1 Unit 5 Radical Functions & Combinatorics General Outcome: Develop algebraic and graphical reasoning through the study of relations. Develop algebraic and numeric reasoning that involves combinatorics.
More informationSimple Counting Problems
Appendix F Counting Principles F1 Appendix F Counting Principles What You Should Learn 1 Count the number of ways an event can occur. 2 Determine the number of ways two or three events can occur using
More informationGeneralized Permutations and The Multinomial Theorem
Generalized Permutations and The Multinomial Theorem 1 / 19 Overview The Binomial Theorem Generalized Permutations The Multinomial Theorem Circular and Ring Permutations 2 / 19 Outline The Binomial Theorem
More informationMATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30
MATH 51 Fall 2009 Homework 1 Due: Wednesday, September 0 Problem 1. How many different letter arrangements can be made from the letters BOOKKEEPER. This is analogous to one of the problems presented in
More informationAlgebra II- Chapter 12- Test Review
Sections: Counting Principle Permutations Combinations Probability Name Choose the letter of the term that best matches each statement or phrase. 1. An illustration used to show the total number of A.
More information* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
More informationHonors Precalculus Chapter 9 Summary Basic Combinatorics
Honors Precalculus Chapter 9 Summary Basic Combinatorics A. Factorial: n! means 0! = Why? B. Counting principle: 1. How many different ways can a license plate be formed a) if 7 letters are used and each
More informationName: Spring P. Walston/A. Moore. Topic worksheet # assigned #completed Teacher s Signature Tree Diagrams FCP
Name: Spring 2016 P. Walston/A. Moore Topic worksheet # assigned #completed Teacher s Signature Tree Diagrams 1-0 13 FCP 1-1 16 Combinations/ Permutations Factorials 1-2 22 1-3 20 Intro to Probability
More informationFundamental. If one event can occur m ways and another event can occur n ways, then the number of ways both events can occur is:.
12.1 The Fundamental Counting Principle and Permutations Objectives 1. Use the fundamental counting principle to count the number of ways an event can happen. 2. Use the permutations to count the number
More informationWeek in Review #5 ( , 3.1)
Math 166 Week-in-Review - S. Nite 10/6/2012 Page 1 of 5 Week in Review #5 (2.3-2.4, 3.1) n( E) In general, the probability of an event is P ( E) =. n( S) Distinguishable Permutations Given a set of n objects
More informationMath 166: Topics in Contemporary Mathematics II
Math 166: Topics in Contemporary Mathematics II Xin Ma Texas A&M University September 30, 2017 Xin Ma (TAMU) Math 166 September 30, 2017 1 / 11 Last Time Factorials For any natural number n, we define
More informationCounting Methods and Probability
CHAPTER Counting Methods and Probability Many good basketball players can make 90% of their free throws. However, the likelihood of a player making several free throws in a row will be less than 90%. You
More informationCHAPTER 8 Additional Probability Topics
CHAPTER 8 Additional Probability Topics 8.1. Conditional Probability Conditional probability arises in probability experiments when the person performing the experiment is given some extra information
More informationIn how many ways can a team of three snow sculptors be chosen to represent Amir s school from the nine students who have volunteered?
4.6 Combinations GOAL Solve problems involving combinations. LEARN ABOUT the Math Each year during the Festival du Voyageur, held during February in Winnipeg, Manitoba, high schools compete in the Voyageur
More informationUnit 5 Radical Functions & Combinatorics
1 Graph of y Unit 5 Radical Functions & Combinatorics x: Characteristics: Ex) Use your knowledge of the graph of y x and transformations to sketch the graph of each of the following. a) y x 5 3 b) f (
More informationSTAT 430/510 Probability Lecture 1: Counting-1
STAT 430/510 Probability Lecture 1: Counting-1 Pengyuan (Penelope) Wang May 22, 2011 Introduction In the early days, probability was associated with games of chance, such as gambling. Probability is describing
More information19.2 Permutations and Probability
Name Class Date 19.2 Permutations and Probability Essential Question: When are permutations useful in calculating probability? Resource Locker Explore Finding the Number of Permutations A permutation is
More informationWEEK 7 REVIEW. Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.1)
WEEK 7 REVIEW Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.) Definition of Probability (7.2) WEEK 8-7.3, 7.4 and Test Review THE MULTIPLICATION
More informationGrade 7/8 Math Circles November 8 & 9, Combinatorial Counting
Faculty of Mathematics Waterloo, Ontario NL G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 8 & 9, 016 Combinatorial Counting Learning How to Count (In a New Way!)
More informationUnit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION
Name: Period: Date: NON-CALCULATOR SECTION Vocabulary: Define each word and give an example. 1. discrete mathematics 2. dependent outcomes 3. series Short Answer: 4. Describe when to use a combination.
More informationPERMUTATIONS AND COMBINATIONS
PERMUTATIONS AND COMBINATIONS 1. Fundamental Counting Principle Assignment: Workbook: pg. 375 378 #1-14 2. Permutations and Factorial Notation Assignment: Workbook pg. 382-384 #1-13, pg. 526 of text #22
More information11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b
11.3 Warmup 1. Expand: 2x y 4 2. Express the expansion of 2x y 4 using combinations. 3 3 3. Simplify: a 2b a 2b 4. How many terms are there in the expansion of 2x y 15? 5. What would the 10 th term in
More informationMath Week in Review #4
Math 166 Fall 2008 c Heather Ramsey and Joe Kahlig Page 1 Section 2.1 - Multiplication Principle and Permutations Math 166 - Week in Review #4 If you wish to accomplish a big goal that requires intermediate
More informationThe Fundamental Counting Principle & Permutations
The Fundamental Counting Principle & Permutations POD: You have 7 boxes and 10 balls. You put the balls into the boxes. How many boxes have more than one ball? Why do you use a fundamental counting principal?
More informationCS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6
CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3
More informationTree Diagrams and the Fundamental Counting Principle
Objective: In this lesson, you will use permutations and combinations to compute probabilities of compound events and to solve problems. Read this knowledge article and answer the following: Tree Diagrams
More information7.4 Permutations and Combinations
7.4 Permutations and Combinations The multiplication principle discussed in the preceding section can be used to develop two additional counting devices that are extremely useful in more complicated counting
More information6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices?
Pre-Calculus Section 4.1 Multiplication, Addition, and Complement 1. Evaluate each of the following: a. 5! b. 6! c. 7! d. 0! 2. Evaluate each of the following: a. 10! b. 20! 9! 18! 3. In how many different
More informationPermutations and Combinations
Permutations and Combinations In statistics, there are two ways to count or group items. For both permutations and combinations, there are certain requirements that must be met: there can be no repetitions
More informationFinite Mathematics MAT 141: Chapter 8 Notes
Finite Mathematics MAT 4: Chapter 8 Notes Counting Principles; More David J. Gisch The Multiplication Principle; Permutations Multiplication Principle Multiplication Principle You can think of the multiplication
More informationPermutations, Combinations and The Binomial Theorem. Unit 9 Chapter 11 in Text Approximately 7 classes
Permutations, Combinations and The Binomial Theorem Unit 9 Chapter 11 in Text Approximately 7 classes In this unit, you will be expected to: Solve problems that involve the fundamental counting principle.
More informationMath Fall 2011 Exam 2 Solutions - November 1, 2011
Math 365 - Fall 011 Exam Solutions - November 1, 011 NAME: STUDENT ID: This is a closed-book and closed-note examination. Calculators are not allowed. Please show all your work. Use only the paper provided.
More informationFundamentals of Probability
Fundamentals of Probability Introduction Probability is the likelihood that an event will occur under a set of given conditions. The probability of an event occurring has a value between 0 and 1. An impossible
More informationFundamental Counting Principle 2.1 Page 66 [And = *, Or = +]
Math 3201 Assignment 2 Unit 2 Counting Methods Name: Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Identify the choice that best completes the statement or answers the question. Show all
More informationCounting. Chapter 6. With Question/Answer Animations
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter
More informationProbability and Counting Techniques
Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each
More informationSection The Multiplication Principle and Permutations
Section 2.1 - The Multiplication Principle and Permutations Example 1: A yogurt shop has 4 flavors (chocolate, vanilla, strawberry, and blueberry) and three sizes (small, medium, and large). How many different
More informationPERMUTATIONS AND COMBINATIONS
8 PERMUTATIONS AND COMBINATIONS FUNDAMENTAL PRINCIPLE OF COUNTING Multiplication Principle : If an operation can be performed in 'm' different ways; following which a second operation can be performed
More informationWelcome! Worksheet Counting Principal, Permutations, Combinations. Updates: U4T is 12/12
Welcome! U4H1: Worksheet Counting Principal, Permutations, Combinations Updates: U4T is 12/12 Announcement: December 16 th is the last day I will accept late work. No new assignment list since this section
More informationFinite Math Section 6_4 Solutions and Hints
Finite Math Section 6_4 Solutions and Hints by Brent M. Dingle for the book: Finite Mathematics, 7 th Edition by S. T. Tan. DO NOT PRINT THIS OUT AND TURN IT IN!!!!!!!! This is designed to assist you in
More information4.1 Organized Counting McGraw-Hill Ryerson Mathematics of Data Management, pp
Name 4.1 Organized Counting McGraw-Hill yerson Mathematics of Data Management, pp. 225 231 1. Draw a tree diagram to illustrate the possible travel itineraries for Pietro if he can travel from home to
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
More 9.-9.3 Practice Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Answer the question. ) In how many ways can you answer the questions on
More informationLAMC Junior Circle February 3, Oleg Gleizer. Warm-up
LAMC Junior Circle February 3, 2013 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Compute the following. 2 3 ( 4) + 6 2 Problem 2 Can the value of a fraction increase, if we add one to the numerator
More informationDate Topic Notes Questions 4-8
These Combinatorics NOTES Belong to: Date Topic Notes Questions 1. Chapter Summary 2,3 2. Fundamental Counting Principle 4-8 3. Permutations 9-13 4. Permutations 14-17 5. Combinations 18-22 6. Combinations
More informationExercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}?
Exercises Exercises 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? 3. How many permutations of {a, b, c, d, e, f, g} end with
More informationCourse Learning Outcomes for Unit V
UNIT V STUDY GUIDE Counting Reading Assignment See information below. Key Terms 1. Combination 2. Fundamental counting principle 3. Listing 4. Permutation 5. Tree diagrams Course Learning Outcomes for
More informationMat 344F challenge set #2 Solutions
Mat 344F challenge set #2 Solutions. Put two balls into box, one ball into box 2 and three balls into box 3. The remaining 4 balls can now be distributed in any way among the three remaining boxes. This
More information10.2.notebook. February 24, A standard deck of 52 playing cards has 4 suits with 13 different cards in each suit.
Section 10.2 It is not always important to count all of the different orders that a group of objects can be arranged. A combination is a selection of r objects from a group of n objects where the order
More informationJUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson
JUST THE MATHS UNIT NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by A.J.Hobson 19.2.1 Introduction 19.2.2 Rules of permutations and combinations 19.2.3 Permutations of sets with some objects
More informationTImath.com. Statistics. Too Many Choices!
Too Many Choices! ID: 11762 Time required 40 minutes Activity Overview In this activity, students will investigate the fundamental counting principle, permutations, and combinations. They will find the
More informationW = {Carrie (U)nderwood, Kelly (C)larkson, Chris (D)aughtry, Fantasia (B)arrino, and Clay (A)iken}
UNIT V STUDY GUIDE Counting Course Learning Outcomes for Unit V Upon completion of this unit, students should be able to: 1. Apply mathematical principles used in real-world situations. 1.1 Draw tree diagrams
More informationSets, Venn Diagrams & Counting
MT 142 College Mathematics Sets, Venn Diagrams & Counting Module SC Terri Miller revised December 13, 2010 What is a set? Sets set is a collection of objects. The objects in the set are called elements
More informationFundamental Counting Principle 2.1 Page 66 [And = *, Or = +]
Math 3201 Assignment 1 of 1 Unit 2 Counting Methods Name: Fundamental Counting Principle 2.1 Page 66 [And = *, Or = +] Identify the choice that best completes the statement or answers the question. 1.
More informationIntroduction. Firstly however we must look at the Fundamental Principle of Counting (sometimes referred to as the multiplication rule) which states:
Worksheet 4.11 Counting Section 1 Introduction When looking at situations involving counting it is often not practical to count things individually. Instead techniques have been developed to help us count
More informationACTIVITY 6.7 Selecting and Rearranging Things
ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 757 OBJECTIVES ACTIVITY 6.7 Selecting and Rearranging Things 1. Determine the number of permutations. 2. Determine the number of combinations. 3. Recognize
More informationLEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together?
LEVEL I 1. Three numbers are chosen from 1,, 3..., n. In how many ways can the numbers be chosen such that either maximum of these numbers is s or minimum of these numbers is r (r < s)?. Six candidates
More informationSTATISTICAL COUNTING TECHNIQUES
STATISTICAL COUNTING TECHNIQUES I. Counting Principle The counting principle states that if there are n 1 ways of performing the first experiment, n 2 ways of performing the second experiment, n 3 ways
More informationCOUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility
More informationCase 1: If Denver is the first city visited, then the outcome looks like: ( D ).
2.37. (a) Think of each city as an object. Each one is distinct. Therefore, there are 6! = 720 different itineraries. (b) Envision the process of selecting an itinerary as a random experiment with sample
More informationStrings. A string is a list of symbols in a particular order.
Ihor Stasyuk Strings A string is a list of symbols in a particular order. Strings A string is a list of symbols in a particular order. Examples: 1 3 0 4 1-12 is a string of integers. X Q R A X P T is a
More informationCIS 2033 Lecture 6, Spring 2017
CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,
More information2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)
2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are
More information19.2 Permutations and Probability Combinations and Probability.
19.2 Permutations and Probability. 19.3 Combinations and Probability. Use permutations and combinations to compute probabilities of compound events and solve problems. When are permutations useful in calculating
More informationChapter 2. Permutations and Combinations
2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find
More informationUnit 2 Lesson 2 Permutations and Combinations
Unit 2 Lesson 2 Permutations and Combinations Permutations A permutation is an arrangement of objects in a definite order. The number of permutations of n distinct objects is n! Example: How many permutations
More informationCombinatorics problems
Combinatorics problems Sections 6.1-6.4 Math 245, Spring 2011 1 How to solve it There are four main strategies for solving counting problems that we will look at: Multiplication principle: A man s wardrobe
More informationStudy Guide For use with pages
3.1 GOAL For use with pages 119 124 Solve two-step equations. EXAMPLE 1 Using Subtraction and Division to Solve Solve 14 x 12 54. Check your solution. 14x 12 54 Write original equation. 14x 12 12 54 12
More informationSlide 1 Math 1520, Lecture 15
Slide 1 Math 1520, Lecture 15 Formulas and applications for the number of permutations and the number of combinations of sets of elements are considered today. These are two very powerful techniques for
More informationChapter 11, Sets and Counting from Applied Finite Mathematics by Rupinder Sekhon was developed by OpenStax College, licensed by Rice University, and
Chapter 11, Sets and Counting from Applied Finite Mathematics by Rupinder Sekhon was developed by OpenStax College, licensed by Rice University, and is available on the Connexions website. It is used under
More informationPermutations And Combinations Questions Answers
We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with permutations and combinations
More informationPermutations and Combinations. Combinatorics
~ Combinatorics Combinatorics is a branch of mathematics that studies collections of objects that satis@ specified criteria. In particular, it is concerned with "counting" the number of arrangements or
More information4.1 What is Probability?
4.1 What is Probability? between 0 and 1 to indicate the likelihood of an event. We use event is to occur. 1 use three major methods: 1) Intuition 3) Equally Likely Outcomes Intuition - prediction based
More information9.5 COUnTIng PRInCIPleS. Using the Addition Principle. learning ObjeCTIveS
800 CHAPTER 9 sequences, ProbAbility ANd counting theory learning ObjeCTIveS In this section, you will: Solve counting problems using the Addition Principle. Solve counting problems using the Multiplication
More informationCS1802 Week 3: Counting Next Week : QUIZ 1 (30 min)
CS1802 Discrete Structures Recitation Fall 2018 September 25-26, 2018 CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min) Permutations and Combinations i. Evaluate the following expressions. 1. P(10, 4)
More information10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.
Chapter 10 Lesson 10-1 Combinations BIG IDEA With a set of n elements, it is often useful to be able to compute the number of subsets of size r Vocabulary combination number of combinations of n things
More informationMath 3201 Notes Chapter 2: Counting Methods
Learning oals: See p. 63 text. Math 30 Notes Chapter : Counting Methods. Counting Principles ( classes) Outcomes:. Define the sample space. P. 66. Find the sample space by drawing a graphic organizer such
More informationChapter 11: Probability and Counting Techniques
Chapter 11: Probability and Counting Techniques Diana Pell Section 11.1: The Fundamental Counting Principle Exercise 1. How many different two-letter words (including nonsense words) can be formed when
More informationCS1800: Permutations & Combinations. Professor Kevin Gold
CS1800: Permutations & Combinations Professor Kevin Gold Permutations A permutation is a reordering of something. In the context of counting, we re interested in the number of ways to rearrange some items.
More informationCh. 12 Permutations, Combinations, Probability
Alg 3(11) 1 Counting the possibilities Permutations, Combinations, Probability 1. The international club is planning a trip to Australia and wants to visit Sydney, Melbourne, Brisbane and Alice Springs.
More informationPermutations and Combinations Section
A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Permutations and Combinations Section 13.3-13.4 Dr. John Ehrke Department of Mathematics Fall 2012 Permutations A permutation
More informationŸ 8.1 The Multiplication Principle; Permutations
Ÿ 8.1 The Multiplication Principle; Permutations The Multiplication Principle Example 1. Suppose the city council needs to hold a town hall meeting. The options for scheduling the meeting are either Monday,
More informationHOMEWORK ASSIGNMENT 5
HOMEWORK ASSIGNMENT 5 MATH 251, WILLIAMS COLLEGE, FALL 2006 Abstract. These are the instructor s solutions. 1. Big Brother The social security number of a person is a sequence of nine digits that are not
More informationWell, there are 6 possible pairs: AB, AC, AD, BC, BD, and CD. This is the binomial coefficient s job. The answer we want is abbreviated ( 4
2 More Counting 21 Unordered Sets In counting sequences, the ordering of the digits or letters mattered Another common situation is where the order does not matter, for example, if we want to choose a
More informationGrade 6 Math Circles Winter February 10/11 Counting
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Winter 2015 - February 10/11 Counting What is Counting? When you think of the word
More informationJessica Fauser EDUC 352 October 21, 2011 Unit Lesson Plan #3. Lesson: Permutations and Combinations Length: 45 minutes Age/Grade Intended: Algebra II
Jessica Fauser EDUC 352 October 21, 2011 Unit Lesson Plan #3 Lesson: Permutations and Combinations Length: 45 minutes Age/Grade Intended: Algebra II Academic Standard(s): A2.8.4 Use permutations, combinations,
More informationDiscrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting
Discrete Mathematics: Logic Discrete Mathematics: Lecture 15: Counting counting combinatorics: the study of the number of ways to put things together into various combinations basic counting principles
More informationThe Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n
Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product
More information