This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 231ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiICS141: Discrete Mathematics for Computer Science IDepartment of Information and Computer SciencesUniversity of HawaiiStephen Y. Itoga232ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiLecture 23Chapter 5. Counting5.3 Permutations and Combinations233ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiSome material in these slides were taken/adapted from the slides made by Prof. Michael P. Frank and Prof. Jonathan L. Gross which are provided through the publisher of “Discrete Mathematics and Its Applications” written by Kenneth H. Rosen.Some slides were done by Prof. Baek234ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiPermutationsA permutationof a set Sof elements is an orderedsequence that contains each element in Sexactly once.E.g. {A, B, C} → six permutations: ABC, ACB, BAC, BCA, CAB, CBAAn orderedarrangement of rdistinct elements of Sis called an rpermutationof S.The number of rpermutations of a set with n=S elements is.,nrrnnrnnnnrnP≤≤=+=)!(!)1()2)(1(),(…235ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiPermutation ExamplesExample: Let S = {1, 2, 3}.The arrangement 3, 1, 2 is a permutation of S (3! = 6 ways)The arrangement 3, 2 is a 2permutation of S (3·2=3!/1! = 6 ways)Example: A terrorist has planted an armed nuclear bomb in your city, and it is your job to disable it by cutting wires to the trigger device. There are 10 wiresto the device. If you cut exactly the right three wires, in exactly the right...
View
Full Document
 Fall '08
 IDK
 Combinatorics, University of Hawaii

Click to edit the document details