TESTSHEET3 - Inclusion Exclusion Principle The Pigeon Hole...

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

View Full Document Right Arrow Icon
•Product rule: Suppose that a procedure can be broken down into a sequence of two tasks where there are n 1 ways to do the first task and n 2 ways of doing the second, then there are n 1 n 2 ways to do the procedure. •Sum rule: If a task can be done either in n 1 ways or n 2 way then there are n 1 +n 2 ways to do the task. How many ways are there of arranging… Permutations (order/ no repeat) How many ways are there of selecting at once Combination (No order/no repeat)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

Ask a homework question - tutors are online