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: m and the other gives n . ± n r ² = ± n nr ² . ± 2 n n ² = n X r =0 ± n r ² 2 . March 8 Permutations and combinations, Page 4 17.4 Division rule If f : A → B is a kto1 function, and A and B are ﬁnite sets, then  A  = k  B  . Another chess problem How many arrangements of the letters BOOK? March 8 Permutations and combinations, Page 5 17.5 Poker hands A hand is a 5combination. How many hands are: • FourofaKind: include a set of cards of the same value. • FullHouse: three cards of one value and two cards of another value. • TwoPairs: two cards of one value, two of another value, and one of a third value. • EverySuit: contains at least one card from every suit. March 8 Permutations and combinations, Page 6...
View
Full Document
 Winter '07
 YaoyunShi
 Combinatorics, Set Theory, Permutations, Combinatorial proof Combinatorial Proof

Click to edit the document details