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!/(nk)! No C(n+k1,k) Combination C(n,k)=n!/(nk)!k! P(E)=E/S if all outcomes are equally likely. P(EF) = E and F/F=P(E and F)/P(F)= (P(E) *P(FE))/P(F)...
View Full
Document
 Fall '08
 Myers

Click to edit the document details