1. Daniel Meissner Nick Lauber Kaitlyn Stangl Lauren Desordi

2. Binomial Theorem Permutation Combinations Independent Mutually Exclusive

3. (a+b) n = n C 0 a n b 0 + n C 1 a n-1 b 1 + n C 2 a n-2 b 2 +…. n C n A 0 b n

4. If event E 1 can occur m 1 different ways and event E 2 can occur m 2 different ways then the number of ways they can both occur is m 1 * m 2 Equation for total possible outcomes: m 1 * m 2 …. *m k

5. An arrangement of objects where order matters n! = Number of permutations of n objects nPr = Number of permutations of n objects taken r at a time

6. If a set of n objects has n1 of one kind, n2 of another kind etc… The number of distinguishable permutations

7. An arrangement where order does not matter nCr: Number of combinations of n objects taken r at a time

8. A happening for which the results is uncertain 1. Outcomes: Possible results 2. Sample Space: The set of all possible outcomes a) Event: A subset of the sample space

9. If an event E has n(E) equally likely outcomes and its sample space s has s(E) equally likely outcomes then the probability of event E is Compliments: The probability that event E will not happen P(E’) = 1 – P(E)

10. Events in the same sample space that have no common outcomes: P(A n B) = 0 If A and B are 2 events in the same sample space, then the probability of A or B is P(A u B) = P(A) + P(B) – P(A n B) If A & B are mutually exclusive, then just P(A u B) = P(A) + P(B) Two events are independent if the occurrence of one event has no effect on the occurrence of the other event