This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Inclusion Exclusion Principle The Pigeon Hole Principle If N objects are placed into k boxes, then there is at least one box containing at least the ceiling of N/k objects. Repeated characters Order Yes No Yes Multiplication Principle Permutation P(n,k)=n!/(n-k)! No C(n+k-1,k) Combination C(n,k)=n!/(n-k)!k! P(E)=|E|/|S| if all outcomes are equally likely. P(E|F) = |E and F|/|F|=P(E and F)/P(F)= (P(E) *P(F|E))/P(F)...
View Full Document
- Fall '08