This section introduces powerful methods for counting possible outcomes in experiments, especially when listing them is not practical. Understanding these techniques is essential for calculating probabilities.
If an operation consists of a sequence of k steps, and:
nโ ways,nโ ways,k can be done in nโ ways,Then the total number of ways the operation can be done is:
nโ ร nโ ร ... ร nโ
4 ร 3 ร 3 = 36
Permutations count the number of ways to arrange items in order. For n different items, the number of permutations is:
n! = n ร (n - 1) ร (n - 2) ร ... ร 1
P(n, r) = n! / (n - r)!
P(8, 4) = 8 ร 7 ร 6 ร 5 = 1680
Combinations count groups where order does not matter. The number of combinations is:
C(n, r) = n! / (r!(n - r)!)
C(8, 5) = 56
Key idea: Permutations care about order; Combinations do not.
| Concept | Order? | Formula | Example (n=3: A,B,C; r=2) | 
|---|---|---|---|
| Permutation | Order matters | P(n, r) = n! / (n - r)! | AB, BA, AC, CA, BC, CB โ 6 | 
| Combination | Order does not matter | C(n, r) = n! / (r!(n - r)!) | {A,B}, {A,C}, {B,C} โ 3 | 
Rule of thumb: If swapping positions creates a new outcome, use permutations. If swapping positions gives the same outcome, use combinations.
Try it: Compare permutations vs. combinations for the same n and r.
What if we want a sample with specific criteria?
Step 1: Choose 2 from 3 defectives:
C(3, 2) = 3! / (2! ยท 1!) 
        = (3 ร 2 ร 1) / [(2 ร 1)(1)]
        = 6 / 2
        = 3
Step 2: Choose 4 from 47 non-defectives:
C(47, 4) = 47! / (4! ยท 43!) 
         = (47 ร 46 ร 45 ร 44) / (4 ร 3 ร 2 ร 1)
         = 4,280,760 / 24
         = 178,365
Total samples (multiply independent choices):
= C(3,2) ร C(47,4)
= 3 ร 178,365
= 535,095