1. Tree Diagrams
Why construct tree diagrams? A. Lists all possibilities of a sequence of events in a systematic way B. Helps eliminate omission of possible outcomes

2. Multiplication
Rules for Counting: used when we’re
interested in the total number of possible outcomes, but not in listing
each and every one.....
A. Rule 1  In a sequence of n events, in which the first event has k_{1} possibilities (choices), the second event has k_{2} possibilities, and so on, the total number of possibilities in the sequence is given by: Total = (k_{1} )(k_{2} )(k_{3}
)...(k_{n} )
The "kn" is "k subscript n" or "k sub n" B. Rule 2  If each event in a sequence of n events has k possibilities (choices), then the total number of possibilities in the sequence will be: Total = (k)(k)(k)...(k) = k^n (or just simply "k to the power of n") 
3. Permutations: Different combinations of any number of quantities, where order is important. REMEMBER THIS LAST PART  IT IS CRITICAL FOR YOUR TESTS!!! IF I GIVE YOU A QUESTION, AND THE QUESTION SAYS SOMETHING LIKE "they must be arranged in a certain pattern", or something like that, then IT IS A PERMUTATION! THIS IS A POINT WHERE ALMOST EVERYONE GETS CONFUSED! 
But before we go further...some
algebra review (but I thought this was STATISTICS?!?)!
Factorials:
(See Appendix A of the text for more info)
Mathematical definition: n! = (n)(n1)(n2)...(3)(2)(1) This is said as "n factorial" Example: 5! = (5)(4)(3)(2)(1) = 120 So......when said in English
"five
factorial equals 120"

OK, Now back to permutations.........
A. Rule 1  The number of permutations of n distinct objects when taken together is: n! 
But what if you’re not going to use all the objects?
B. Rule 2  The arrangement
of n objects in a specific order using r objects at a time is called “a
permutation of n objects taken r objects at a time” and is given by:
_{n}P_{r} = n!/(nr)!
>>>>>>>>>>>>The " _{n}P_{r }" is a symbol for permutation. 
But what if the objects are not all different?
C. Rule 3  The number
of permutations of n objects in which k_{1} are alike, k_{2}
are alike, and so on, is given by:
Total = (n!)/{(k_{1})(k_{2})(k_{3})...(k_{p})} 
3. Combinations  A selection
of distinct objects without regard to order; use when order or arrangement
is not important.
REMEMBER THIS LAST PART  IT IS CRITICAL FOR YOUR TESTS!!! IF I GIVE YOU A QUESTION, AND THE QUESTION SAYS SOMETHING LIKE "without regard to the specific arrangement", or something like that, then IT IS A COMBINATION! THIS IS DIFFERENT FROM THE PERMUTATION. It's another point where confusion takes place. Combination Rule  The number of combinations of r objects selected from n objects is given by: _{n}C_{r} = (n!)/{(nr)!(r!)}

Homework:
No reading assignment. Go to Lesson 5. The Schaum's outlines will help in this part if the course (Chapter 6 of Schaum's outlines  see my comment in the syllabus). 