08combination_10_v2

08combination_10_v2 - CSIS1121 Discrete Mathematics...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
CSIS1121 iscrete Mathematics Discrete Mathematics ombinations Combinations Prof. Francis Chin, Dr SM Yiu October 7 / 8, 2010 (Chapter 5) 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CSIS1121 Discrete Maths ermutation (review) Permutation (review) Given a set S of n distinct objects, a permutation is an ordered arrangement of these objects . The number of permutations, P ( n , n ) = n ( n -1) … (2)(1) = n ! An r-permutation is an ordered arrangement of r objects in S . The number of r-permutations of an n -set S P ( n , r ) = n ( n -1) … ( n - r +1) = n ( n -1) … ( n - r +1) ( n-r )! / ( n-r )! = n ! / ( n-r )! To prove P ( n , r ) = P ( n , s ) P ( n - s , r - s ) by combinatorial arguments By the Product Rule, every r -permutation can be formed by an s - permutation (Task T 1 ) followed by an ( r - s )-permutation of the remaining ( n - s ) objects (Task T 2 ) x x x x . .. x x | x x x … x x x elements (r ) elements om (n ) elements 2 Task T 1 can be done in P ( n , s ) ways; task T 2 in P ( n - s , r - s ) ways. s elements (r-s) elements from (n-s) elements
Background image of page 2
CSIS1121 Discrete Maths eview eview - - ermutation (Rule of Sum) ermutation (Rule of Sum) Review Review r permutation (Rule of Sum) permutation (Rule of Sum) To prove P ( n , r ) = P ( n -1, r ) + r P ( n -1, r -1) Without w r-permutation permutation bcd acd bced baec dbec by combinatorial arguments Choose an arbitrary object w in S , ivide the ermutations into 2 sets abcd becd bacd bdea Divide the r -permutations into 2 sets, (Task T 1 ) Number of r -permutations not containing object w = P ( n -1, r ) (Task T 2 ) Number of r -permutations containing object w = r P ( n -1, r -1) (as w can be in r positions d w bcd of any ( r -1)-permutation of the set without object w ) y Sum Rule, bcd bc w d b w cd bcd w (r (r-1) 1)-permutation permutation 3 By Sum Rule, P ( n , r ) = P ( n -1, r ) + r P ( n -1, r -1) r copies
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CSIS1121 Discrete Maths o. of Permutations w/o = - , No. of Permutations w/o w P ( n 1, r ) Example : S = { w, x, y, z } The 3-permutations without w yz) (xzy) (yxz) (zxy) (yzx) (zyx) (xyz), (xzy), (yxz), (zxy), (yzx), (zyx) 3 -permutations without w = 3 -permutations of { x,y,z } No. of 3 -permutations not containing object w = P(3,3) = 6 No. of r -permutations not containing object w = P ( n -1, r ) So, to verify P ( n , r ) = P ( n -1, r ) + r P ( n -1, r -1) ) ( 1)( + )( ) ( 1) 4 = ( n -1)…( n - r +1)( n - r ) + r ( n -1)( n -2) …( n - r +1) = n ! / ( n - r )!
Background image of page 4
CSIS1121 Discrete Maths ermutations and Combinations Permutations and Combinations Let S = {A,B,C,D} 2-permutations from S = {AB, AC, AD, BA, BC, BD, CA, CB, CD, DA, DB, DC} umber of - ermutations om S = (4,2) = 4*3 = 12 Number of 2 permutations from S P(4,2) 43 12 2-combinations where the order of the elements is not important = {{A,B}, {A,C}, {A,D}, {B,C}, {B,D}, {C,D}} Number of 2-combinations from S = C(4,2) = 6 Let S = {A,B,C,D,E} 3-combinations = {{A,B,C}, {A,B,D}, {A,B,E}, {A,C,D}, ,C,E}, {A,D,E}, {B,C,D}, {B,C,E}, {B,D,E}, {C,D,E}} 5 {A,C,E}, {A,D,E}, {B,C,D}, {B,C,E}, {B,D,E}, {C,D,E}} Number of 3-combinations = C(5,3) = 10
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
CSIS1121 Discrete Maths - ombination ombination r combination C ( n , r ) = number of r -combinations (unordered selection) An r -permutation can be obtained by the Product Rule. r n from a set S of size n , sometimes denoted by ( ) (Task T 1 ) Form an r -combinations from S , (Task T 2 ) Permute the objects in an r -combinations.
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/10/2011 for the course ENGG 1007 taught by Professor Unknown during the Spring '11 term at HKU.

Page1 / 28

08combination_10_v2 - CSIS1121 Discrete Mathematics...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online