1 / 23

PERMUTATIONS

COUNTING TECHNIQUES. PERMUTATIONS. AND. COMBINATIONS. Computer Science, Statistics and Probability all involve counting techniques which are a branch of mathematics called combinatorics (ways to combine things). We'll be introducing this topic in this section.

tanyam
Download Presentation

PERMUTATIONS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. COUNTING TECHNIQUES PERMUTATIONS AND COMBINATIONS

  2. Computer Science, Statistics and Probability all involve counting techniques which are a branch of mathematics called combinatorics (ways to combine things). We'll be introducing this topic in this section. For dinner you have the following choices: ENTREES MAINS chicken soup salad prawns hamburger DESSERTS How many different combinations of meals could you make? We'll build a tree diagram to show all of the choices.  icecream

  3. We ended up with 12 possibilities ice cream  chicken ice cream prawns  hamburger soup ice cream  ice cream salad  chicken ice cream prawns  hamburger ice cream  Notice the number of choices at each branch 2choices 3choices 2choices soup, chicken, ice cream soup, chicken,  2 x 3 x 2 = 12 soup, prawns, ice cream soup, prawns,  soup, hamburger, ice cream soup, hamburger,  salad, chicken, ice cream salad, chicken,  salad, prawns, ice cream salad, prawns,  Now to get all possible choices we follow each path. salad, hamburger, ice cream salad, hamburger, 

  4. Multiplication Principle of Counting If a task consists of a sequence of choices in which there are p selections for the first choice, q selections for the second choice, r selections for the third choice, and so on, then the task of making these selections can be done in different ways. px qx r If we have 6 different shirts, 4 different pants, 5 different pairs of socks and 3 different pairs of shoes, how many different outfits could we wear? 6 x 4 x 5 x 3 = 360 Much quicker than making a list!

  5. Choosing a path……how many ways from A to C through B? A to B = 4 ways B to C = 2 ways 4x2 = 8 ways

  6. You try! 5 X 4 X 3 = 60 ways

  7. A little tougher…..

  8. A permutation is an ordered arrangement of r objects chosen from n objects. For combinations order does not matter but for permutations it does. There are three types of permutations.The first is distinctwithrepetition. This means there are n distinct objects but in choosing r of them you can repeat an object. this means different Let's look at a 3 combination lock with numbers 0 through 9 There are 10 choices for the first number There are 10 choices for the second number and you can repeat the first number There are 10 choices for the third number and you can repeat By the multiplication principle there are 10 x 10 x 10 = 1000 choices

  9. This can be generalized as: Permutations: Distinct Objects with Repetition The number of ordered arrangements of r objects chosen from n objects, in which the n objects are distinct and repetition is allowed, is nr What if the lock had four choices for numbers instead of three? 104 = 10 000 choices

  10. 1st 2nd 3rd 4th The second type of permutation is distinct, without repetition. Let's say four people have a race. Let's look at the possibilities of how they could place. Once a person has been listed in a place, you can't use that person again (no repetition). Based on the multiplication principle: 4 x 3 x 2x 1 = 24 choices First place would be choosing someone from among 4 people. Now there are only 3 to choose from for second place. Now there are only 2 to choose from for third place. Only one possibility for fourth place.

  11. nPr , means the number of ordered arrangements of r objects chosen from n distinct objects and repetition is not allowed. In the last example: If you have 10 people racing and only 1st, 2nd and 3rd place how many possible outcomes are there? 0! = 1

  12. A combination is an arrangement of r objects chosen from n objects regardless of order. nCr, means the number combinations of r objects chosen from n distinct objects and repetition is not allowed. Order doesn't matter here so the combination 1, 2, 3 is not different than 3, 2, 1 because they both contain the same numbers. Note: Dividing out by the common “r” combinations. Hence, you will have fewer combinations than permutations!

  13. You need 2 people on your committee and you have 5 to choose from. You can see that this is without repetition because you can only choose a person once, and order doesn’t matter. You need 2 committee members but it doesn't matter who is chosen first. How many combinations are there?

  14. The third type of permutation is involving n objects that are not distinct. How many different combinations of letters in specific order (but not necessarily English words) can be formed using ALL the letters in the word REARRANGE? representative example Not Examinable.. Just for Fun  E R N R A A G E R The "words" we form will have 9 letters so we need 9 spots to place the letters. Notice some of the letters repeat. We need to use R 3 times, A 2 times, E 2 times and N and G once. 9C3 6C2  4C2  2C1 1C1 84 156 2 1 = 15 120 possible "words" First we choose positions for the R's. There are 9 positions and we'll choose 3, order doesn't matter That leaves 6 positions for 2 A's. That leaves 2 positions for the N. That leaves 1 position for the G. That leaves 4 positions for 2 E's.

  15. Permutations Involving n Objects That Are Not Distinct This can be generalized into the following:

  16. A Challenging Example. Have a go.  Permutation: Order Matters How many even numbers greater than 4000 can be formed using some or all of the digits 1, 2, 3, 4, 5, 6 if each digit must feature no more than once in a number? We could have even numbers with 4, 5 or 6 digits This Gives 4 possibilities to work with: PART A: 4, 5 or 6 EVEN digits beginning with a 4 OR 6 PART B: 4, 5 or 6 EVEN digits beginning with a 5 PART C: 5 or 6 EVEN digits beginning with a 2 PART D: 5 or 6 EVEN digits beginning with a 1 or 3

  17. A Challenging Example. Have a go.  Permutation: Order Matters How many even numbers greater than 4000 can be formed using some or all of the digits 1, 2, 3, 4, 5, 6 if each digit must feature no more than once in a number? PART A: 4, 5 or 6 EVEN digits beginning with a 4 OR 6 2 4 3 2 + 2 4 3 2 2 + 2 4 3 2 1 2 This gives a total of 240

  18. A Challenging Example. Have a go.  Permutation: Order Matters How many even numbers greater than 4000 can be formed using some or all of the digits 1, 2, 3, 4, 5, 6 if each digit must feature no more than once in a number? PART B: 4, 5 or 6 EVEN digits beginning with a 5 1 4 3 3 + 1 4 3 2 3 + 1 4 3 2 1 3 This gives a total of 180

  19. A Challenging Example. Have a go.  Permutation: Order Matters How many even numbers greater than 4000 can be formed using some or all of the digits 1, 2, 3, 4, 5, 6 if each digit must feature no more than once in a number? PART C: 5 or 6 EVEN digits beginning with a 2 1 4 3 2 2 + 1 4 3 2 1 2 This gives a total of 96

  20. A Challenging Example. Have a go.  Permutation: Order Matters How many even numbers greater than 4000 can be formed using some or all of the digits 1, 2, 3, 4, 5, 6 if each digit must feature no more than once in a number? PART D: 5 or 6 EVEN digits beginning with a 1 or 3 2 4 3 2 3 + 2 4 3 2 1 3 This gives a total of 288

  21. A Challenging Example. Have a go.  Permutation: Order Matters How many even numbers greater than 4000 can be formed using some or all of the digits 1, 2, 3, 4, 5, 6 if each digit must feature no more than once in a number? We could have even numbers with 4, 5 or 6 digits This Gives 4 possibilities to work with: PART A: 4, 5 or 6 EVEN digits beginning with a 4 OR 6 = 240 PART B: 4, 5 or 6 EVEN digits beginning with a 5 = 180 PART C: 5 or 6 EVEN digits beginning with a 2 = 96 PART D: 5 or 6 EVEN digits beginning with a 1 or 3 =288 Number of possible even numbers greater than 4000 = 804

  22. Acknowledgement I wish to thank Shawna Haider from Salt Lake Community College, Utah USA for her hard work in creating this PowerPoint. www.slcc.edu Shawna has kindly given permission for this resource to be downloaded from www.mathxtc.com and for it to be modified to suit the Western Australian Mathematics Curriculum. Stephen Corcoran Head of Mathematics St Stephen’s School – Carramar www.ststephens.wa.edu.au

More Related