chapter4 permutations and combinations.pptVIP

Permutations and Combinations Permutations Definition: a permutation of a set of distinct objects is an ordered arrangement of these objects. Theorem1: the number of r-permutations of a set with n distinct element is P (n ,r)=n(n-1)(n-2)…(n-r+1) Example1:suppose that a salesman has to visit eight different cities . He must begin his trip in a specified city. But he can visit the other seven cities in any order he wishes. How many possible orders can the salesman use when visiting these cities? Solution: 7!=5040 Combinations Definition: an r-combination of elements of a set is an unordered selection of r elements from the set with n elements. Denoted by C(n,r). Theorem2: Corollary1: C(n,r)=C(n,n-r) Example2 : how many bit strings of length n contains r 1s? Solution: C(n,r) Example3: how many ways are there to select a committee to develop a discrete mathematics course at a school if the committee is to consist of three faculty members from the mathematics department and four from the computer science department, if there are nine faculty members of the mathematics department and 11 of the computer science department? Solution: C(9,3)C(11,4)=27720 Binomial Coefficients Theorem3: The Binomial Theorem Let x and y be variables, and n be a nonnegative integer. Then Corollary2: Corollary3 Corollary4 Pascal’s Identity and Triangle Theorem4: Pascal’s Identity Proof: Suppose that T contains n+1 elements. Let a belong to T, S be a subset of T with k elements. Then the number of S can be obtained by the cases: a is in S: a is not in S: Vandermond’s identity Theorem5: let m, n and r be nonnegative integers with r not exceeding either m or n. Then Corollary 4: if n is nonnegative integer, then Theorem6: let n and r be nonnegative integers with r not exceeding n. Then Generalized permutations and combinations Permutation with repetition Example1: how many strings of length n can be formed from the English alphabet. Solution: by the pr