1 / 23

Permutations and Combinations

Permutations and Combinations. ictlab.tyict.vtc.edu.hk/~steveng/ITD1111/Lecture/07.%20CountPro2. ppt. 6.2.1 Arrangements. The number of ways of arranging n unlike objects in a line is n ! . Note: n ! = n (n-1) (n-2) ···3 x 2 x 1. Example.

kioko
Télécharger la présentation

Permutations and Combinations

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. Permutations andCombinations ictlab.tyict.vtc.edu.hk/~steveng/ITD1111/Lecture/07.%20CountPro2.ppt Permuntation & Combination

  2. 6.2.1 Arrangements • The number of ways of arranging n unlike objects in a line is n !. • Note: n ! = n (n-1) (n-2) ···3 x 2 x 1 Permuntation & Combination

  3. Example • It is known that the password on a computer system contain the three letters A, B and C followed by the six digits 1, 2, 3, 4, 5, 6. • Find the number of possible passwords. Permuntation & Combination

  4. Solution • There are 3! ways of arranging the letters A, B and C, and • 6! ways of arranging the digits 1, 2, 3, 4, 5, 6. • Therefore the total number of possible passwords is • 3! x 6! = 4320. • i.e. 4320 different passwords can be formed. Permuntation & Combination

  5. Like Objects • The number of ways of arranging in a line • n objects, • of which p are alike, is Permuntation & Combination

  6. The result can be extended as follows: • The number of ways of arranging in a line n objects of which p of one type are alike, • q of a second type are alike, • r of a third type are alike, and so on, is Permuntation & Combination

  7. Example • Find the number of ways that the letters of the word STATISTICS • can be arranged. Permuntation & Combination

  8. Solution • The word STATISTICS contains • 10 letters, in which • S occurs 3 times, • T occurs 3 times and • I occurs twice. Permuntation & Combination

  9. Therefore the number of ways is • That is, there are 50400 ways of arranging the letter in the word STATISTICS. Permuntation & Combination

  10. 6.2.2 Permutations • A permutation of a set of distinct objects is an orderedarrangement of these objects. • An ordered arrangement of r elements of a set is called an r-permutation. • The number of r-permutations of a set with n distinct elements, Permuntation & Combination

  11. i.e. the number of permutations of r objects taken from n unlike objects is: • Note: 0! is defined to 1, so Permuntation & Combination

  12. Example Find the number of ways of placing 3 of the letters A, B, C, D, E in 3 empty spaces. Permuntation & Combination

  13. Solution • The first space can be filled in • 5 ways. • The second space can be filled in • 4 ways. • The third space can be filled in • 3 ways. Permuntation & Combination

  14. Therefore there are 5 x 4 x 3 ways of arranging 3 letters taken from 5 letters. • This is the number of permutations of 3 objects taken from 5 and it is written as P(5, 3), • so P(5, 3)= 5 x 4 x 3 = 60. Permuntation & Combination

  15. On the other hand, 5 x 4 x 3 could be written as • Notice that the order in which the letters are arranged is important --- • ABC is a different permutation from ACB. Permuntation & Combination

  16. Example • How many different ways are there to select • one chairman and • one vice chairman • from a class of 20 students. Permuntation & Combination

  17. Solution • The answer is given by the number of 2-permutations of a set with 20 elements. • This is • P(20, 2) = 20 x 19 = 380 Permuntation & Combination

  18. 6.2.3 Combinations • An r-combination of elements of a set is an unordered selection of r elements from the set. • Thus, an r-combination is simply a subset of the set with r elements. Permuntation & Combination

  19. The number of r-combinations of a set with n elements, • where n is a positive integer and • r is an integer with 0 <= r <= n, • i.e. the number of combinations of r objects from n unlike objects is Permuntation & Combination

  20. Example • How many different ways are there to select two class representatives from a class of 20 students? Permuntation & Combination

  21. Solution • The answer is given by the number of 2-combinations of a set with 20 elements. • The number of such combinations is Permuntation & Combination

  22. HomeworkPage 884#2-32 even Page 892 #2-30 even Permuntation & Combination

  23. Page 884 24 720 5,040 1 15,120 6 42 13 311,875,200 n(n-1) 1 24 40,320 6,720 Page 892 84 84 1 252 6 20 64 2,598,960 38,608,020 Once = 36, Twice = 72 1200 635,013,559,600 Permuntation & Combination

More Related