# Notes - The number of arrangements of r distinct objects...

This preview shows page 1. Sign up to view the full content.

Chapter 1 Fundamental Principles of Counting 1.1 Rules of Sum and Product 1. If the possible outcomes of a procedure can be divided into two disjoint categories and if the 1st category has m 1 outcomes and the 2nd has m 2 outcomes then the total number of outcomes is m 1 + m 2 2. The rule of Product. If a procedure can be broken into two stages and if there are m 1 outcomes for the 1st stage and for each outcome of the 1st stage there are m 2 outcomes from the second stage then a total number of outcomes is m 1 m 2 Permutations: n ! ( n - r )!
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online