Unformatted text preview: The number of arrangements of r distinct objects from n distinct objects. Combinations: ( n r ) . The number of r-combinations of n objects. 1.2 examples 1. number of selection of a 5 member team from 10 playes, including the best and ex-cluding the worst? So we want the best one, so we only have to choose 4. We dont want the worst player, so we only have 8 guys to choose 4 from. 70 guys 2. Proof of Choose function Theorem 1. ( x + y ) n = n s k =0 p n k P x k y n-k 1...
View Full Document
This note was uploaded on 01/23/2012 for the course MATH 3012 taught by Professor Costello during the Fall '08 term at Georgia Tech.
- Fall '08