Statistics

Probability Rules and Formulas

Notation

SymbolMeaning
SSSample space — the set of all possible outcomes
A,BA, BEvents — subsets of the sample space
P(A)P(A)Probability that event AA occurs
AA' or Aˉ\bar{A}Complement of AA — the event that AA does not occur
ABA \cap BIntersection — both AA and BB occur
ABA \cup BUnion — AA or BB (or both) occur
P(AB)P(A \mid B)Conditional probability — probability of AA given BB has occurred
n(A)n(A)Number of outcomes in event AA

Fundamental Rules

RuleFormulaWhen to Use
Probability of an eventP(A)=n(A)n(S)P(A) = \dfrac{n(A)}{n(S)}Equally likely outcomes
Probability bounds0P(A)10 \leq P(A) \leq 1Always true
Certain eventP(S)=1P(S) = 1Something must happen
Impossible eventP()=0P(\emptyset) = 0Cannot happen
Complement ruleP(A)=1P(A)P(A') = 1 - P(A)Easier to find what does NOT happen

Addition Rules (OR)

SituationFormulaExample
Mutually exclusive eventsP(A or B)=P(A)+P(B)P(A \text{ or } B) = P(A) + P(B)Rolling a 2 or a 5 on one die
General (overlapping events)P(A or B)=P(A)+P(B)P(A and B)P(A \text{ or } B) = P(A) + P(B) - P(A \text{ and } B)Drawing a red card or a face card

Events AA and BB are mutually exclusive if they cannot occur at the same time: P(A and B)=0P(A \text{ and } B) = 0.

Multiplication Rules (AND)

SituationFormulaExample
Independent eventsP(A and B)=P(A)P(B)P(A \text{ and } B) = P(A) \cdot P(B)Flipping heads twice in a row
Dependent eventsP(A and B)=P(A)P(BA)P(A \text{ and } B) = P(A) \cdot P(B \mid A)Drawing two aces without replacement

Events AA and BB are independent if the occurrence of one does not affect the other: P(BA)=P(B)P(B \mid A) = P(B).

Conditional Probability

FormulaUse
P(AB)=P(A and B)P(B)P(A \mid B) = \dfrac{P(A \text{ and } B)}{P(B)}Probability of AA given BB has occurred
P(BA)=P(A and B)P(A)P(B \mid A) = \dfrac{P(A \text{ and } B)}{P(A)}Probability of BB given AA has occurred

Testing for Independence

Two events are independent if and only if any one of these is true:

Test
P(AB)=P(A)P(A \mid B) = P(A)
P(BA)=P(B)P(B \mid A) = P(B)
P(A and B)=P(A)P(B)P(A \text{ and } B) = P(A) \cdot P(B)

Bayes’ Theorem

P(AB)=P(BA)P(A)P(B)P(A \mid B) = \frac{P(B \mid A) \cdot P(A)}{P(B)}

Expanded form (when BB can occur through AA or AA'):

P(AB)=P(BA)P(A)P(BA)P(A)+P(BA)P(A)P(A \mid B) = \frac{P(B \mid A) \cdot P(A)}{P(B \mid A) \cdot P(A) + P(B \mid A') \cdot P(A')}

Common application: A diagnostic test has sensitivity P(+disease)P(+ \mid \text{disease}) and specificity P(no disease)P(- \mid \text{no disease}). Bayes’ theorem finds P(disease+)P(\text{disease} \mid +).

Counting Techniques

MethodFormulaUse
Fundamental counting principlen1×n2××nkn_1 \times n_2 \times \cdots \times n_kTotal outcomes from kk sequential choices
Factorialn!=n(n1)(n2)(1)n! = n(n-1)(n-2) \cdots (1)Arrangements of nn distinct items
0!=10! = 1 by definition
PermutationsP(n,r)=n!(nr)!P(n, r) = \dfrac{n!}{(n-r)!}Ordered arrangements of rr from nn
CombinationsC(n,r)=(nr)=n!r!(nr)!C(n, r) = \dbinom{n}{r} = \dfrac{n!}{r!(n-r)!}Unordered selections of rr from nn

When to Use Permutations vs Combinations

Order MattersOrder Does Not Matter
Choosing rr from nnPermutation: P(n,r)P(n, r)Combination: C(n,r)C(n, r)
ExamplePicking 1st, 2nd, 3rd placeChoosing a committee of 3

”At Least One” Shortcut

P(at least one)=1P(none)P(\text{at least one}) = 1 - P(\text{none})

This is often much simpler than adding up every possible case individually.

Common Discrete Distributions

DistributionPMFMeanStd Dev
BinomialP(X=k)=(nk)pk(1p)nkP(X = k) = \dbinom{n}{k} p^k (1-p)^{n-k}μ=np\mu = npσ=np(1p)\sigma = \sqrt{np(1-p)}
GeometricP(X=k)=(1p)k1pP(X = k) = (1-p)^{k-1} pμ=1p\mu = \dfrac{1}{p}σ=1pp\sigma = \dfrac{\sqrt{1-p}}{p}
PoissonP(X=k)=eλλkk!P(X = k) = \dfrac{e^{-\lambda} \lambda^k}{k!}μ=λ\mu = \lambdaσ=λ\sigma = \sqrt{\lambda}

Return to Statistics for the full topic list.