This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: If AB = , then P ( A B ) = P ( A ) + P ( B ) . (c) For any events A and B , P ( A B ) = P ( A ) + P ( B )P ( AB ) . (d) If A B , then P ( A ) P ( B ) . (e) For any event A , 0 P ( A ) 1. (f) P ( A ) = 1P ( A ) (g) Principle of InclusionExclusion Theorem (Principle of InclusionExclusion) Given events E 1 , . . . , E n , P ( n i = 1 E i ) = n i = 1 P ( E i ) i 1 < i 2 P ( E i 1 E i 2 ) + + (1 ) r + 1 i 1 < i 2 < ir P ( E i 1 E i 2 E ir ) + + (1 ) n + 1 P ( E 1 E n ) Arthur Berg 2.4 Counting Rules Useful in Probability 4/ 4...
View
Full
Document
This note was uploaded on 10/04/2011 for the course STA 4321 taught by Professor Staff during the Fall '08 term at University of Florida.
 Fall '08
 Staff
 Counting, Probability

Click to edit the document details