Notation
| Symbol | Meaning |
|---|
| S | Sample space — the set of all possible outcomes |
| A,B | Events — subsets of the sample space |
| P(A) | Probability that event A occurs |
| A′ or Aˉ | Complement of A — the event that A does not occur |
| A∩B | Intersection — both A and B occur |
| A∪B | Union — A or B (or both) occur |
| P(A∣B) | Conditional probability — probability of A given B has occurred |
| n(A) | Number of outcomes in event A |
Fundamental Rules
| Rule | Formula | When to Use |
|---|
| Probability of an event | P(A)=n(S)n(A) | Equally likely outcomes |
| Probability bounds | 0≤P(A)≤1 | Always true |
| Certain event | P(S)=1 | Something must happen |
| Impossible event | P(∅)=0 | Cannot happen |
| Complement rule | P(A′)=1−P(A) | Easier to find what does NOT happen |
Addition Rules (OR)
| Situation | Formula | Example |
|---|
| Mutually exclusive events | P(A 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) | Drawing a red card or a face card |
Events A and B are mutually exclusive if they cannot occur at the same time: P(A and B)=0.
Multiplication Rules (AND)
| Situation | Formula | Example |
|---|
| Independent events | P(A and B)=P(A)⋅P(B) | Flipping heads twice in a row |
| Dependent events | P(A and B)=P(A)⋅P(B∣A) | Drawing two aces without replacement |
Events A and B are independent if the occurrence of one does not affect the other: P(B∣A)=P(B).
Conditional Probability
| Formula | Use |
|---|
| P(A∣B)=P(B)P(A and B) | Probability of A given B has occurred |
| P(B∣A)=P(A)P(A and B) | Probability of B given A has occurred |
Testing for Independence
Two events are independent if and only if any one of these is true:
| Test |
|---|
| P(A∣B)=P(A) |
| P(B∣A)=P(B) |
| P(A and B)=P(A)⋅P(B) |
Bayes’ Theorem
P(A∣B)=P(B)P(B∣A)⋅P(A)
Expanded form (when B can occur through A or A′):
P(A∣B)=P(B∣A)⋅P(A)+P(B∣A′)⋅P(A′)P(B∣A)⋅P(A)
Common application: A diagnostic test has sensitivity P(+∣disease) and specificity P(−∣no disease). Bayes’ theorem finds P(disease∣+).
Counting Techniques
| Method | Formula | Use |
|---|
| Fundamental counting principle | n1×n2×⋯×nk | Total outcomes from k sequential choices |
| Factorial | n!=n(n−1)(n−2)⋯(1) | Arrangements of n distinct items |
| 0!=1 by definition | |
| Permutations | P(n,r)=(n−r)!n! | Ordered arrangements of r from n |
| Combinations | C(n,r)=(rn)=r!(n−r)!n! | Unordered selections of r from n |
When to Use Permutations vs Combinations
| Order Matters | Order Does Not Matter |
|---|
| Choosing r from n | Permutation: P(n,r) | Combination: C(n,r) |
| Example | Picking 1st, 2nd, 3rd place | Choosing a committee of 3 |
”At Least One” Shortcut
P(at least one)=1−P(none)
This is often much simpler than adding up every possible case individually.
Common Discrete Distributions
| Distribution | PMF | Mean | Std Dev |
|---|
| Binomial | P(X=k)=(kn)pk(1−p)n−k | μ=np | σ=np(1−p) |
| Geometric | P(X=k)=(1−p)k−1p | μ=p1 | σ=p1−p |
| Poisson | P(X=k)=k!e−λλk | μ=λ | σ=λ |
Return to Statistics for the full topic list.