This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **m and the other gives n . ± n r ² = ± n n-r ² . ± 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 k-to-1 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 5-combination. How many hands are: • Four-of-a-Kind: include a set of cards of the same value. • Full-House: three cards of one value and two cards of another value. • Two-Pairs: two cards of one value, two of another value, and one of a third value. • Every-Suit: 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