Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
FORMULA SHEET: FINAL EDITION SPRING 2008
 

Summary: FORMULA SHEET: FINAL EDITION
MATH 5651
SPRING 2008
INSTRUCTOR: PROF. GREG W. ANDERSON
Basic rules
0 Pr(A) 1.
Pr(S) = 1 (S: sample space).
Pr() = 0 (: empty set).
Pr(A1 An) = Pr(A1) + + Pr(An) for disjoint events A1, . . . , An.
Pr(Ac
) = 1 - Pr(A) (Ac
: complement of A).
A B Pr(A) Pr(B).
Pr(A) = Pr(AB) + Pr(ABc
).
Pr(A B) = Pr(A) + Pr(B) - Pr(AB).
Pr(A B C) = Pr(A) + Pr(B) + Pr(C)
- Pr(AB) - Pr(BC) - Pr(AC) + Pr(ABC).
Combinatorial definitions and formulas
Pn,k = the number of permutations of n things taken k at a time

  

Source: Anderson, Greg W. - School of Mathematics, University of Minnesota

 

Collections: Mathematics