Lecture Week 7

Discrete Mathematics and Its Applications with MathZone

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

View Full Document Right Arrow Icon
Permutations r-permutation (AKA “ordered r-selection”) An ordered arrangement of r elements of a set of n distinct elements. permutation of a set of n element = n-permutation on this set Example: S={J,K,Q}: (K,Q,J) is a permutation of S; (J,K) is a 2-permutation of S Note: Set is unordered , but permutation is ordered !, e.g. (K,Q)≠(Q,K) The number of r-permutations of n objects is: P(n,r) =n(n-1)(n-2). ..(n-r+1) =n! / (n-r)! 0<=r<=n And the number of permutations of n objects is P(n,n) = n! (Proof:1 st object can be chosen in n ways, 2 nd in (n-1) ways, and so on (k th in n-k+1 ways) until the r th object is chosen in n-r+1 ways. Now, use the product rule to get the formula given for P(n,r).) Reminder: n! = n(n-1)(n-2). ..1. “n factorial.” (n+1)! = (n+1)n! 0! = 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
Permutation Examples Q: A mailman needs to bring 8 packages to 8 cities. How many ways are there to visit the cities? A: Pick first city among 8, second city among 7, etc. Each route is a permutation of 8-element set: Answer = P(8)=8! Q: How many permutations of the letters “abcdefgh” contain “abc” as a block. A: Rename “abc” to B. Question becomes: Count permutations of blocks Bdefgh: A: It’s the # permutations in a 6-element set, i.e. P(6) = 6! Q: How many ways to pick three prizes (gold,silver,bronze) among 100 contestants? A: It’s the number of 3-permutations in a 100-element set: P(100,3) = 100! / (100-3)! = 100! / 97! = 100*99*98
Background image of page 2
Combinations r-combination (AKA “ un ordered r-selection”) An unordered selection of r elements, i.e. a subset of size r of a set of n elements. Example: S={A,J,Q,K}. {A,J,K}={K,A,J}={J,K,A} are all 3-combinations of set S. The total number of r-combinations of a set of size n is denoted C(n,r), and given by: C(n,r) = n! / (r! (n-r)!) , for 0<=r<=n Two facts to observe: 1. C(n,r) = C(n,n-r) Why does this make sense? 2. C(n,r) = P(n,r) / r! Why? Each of the C(n,r) subsets of r objects can be ordered in r! ways, meaning that C(n,r) * r! = P(n,r)
Background image of page 3

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

View Full DocumentRight Arrow Icon
Computing Combinations Computing C(n,r) as n! / [(n-r)!r!] is grossly inefficient and, as a practical matter, can lead to incorrect results (even using computers!). Choose to compute
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/30/2008 for the course ICS 6D taught by Professor Jarecki during the Fall '07 term at UC Irvine.

Page1 / 19

Lecture Week 7 - r-permutation (AKA "ordered r-selection")...

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

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