Permutation: An arrangement of objects where order matters.
Combination: A selection of objects where order does not matter.
Factorial: n! = n × (n-1) × (n-2) × ... × 1, with 0! = 1.
Fundamental Counting Principle: If one event can occur in m ways and a second event can occur in n ways, then both events can occur in m × n ways.
Sample Space: The set of all possible outcomes of an experiment.
Event: A subset of the sample space.
- Does order matter? If yes, use permutations. If no, use combinations.
- Are objects being arranged? If yes, permutation formula.
- Are objects being selected? If yes, combination formula.
- Is it a probability problem? Count favorable outcomes and divide by total outcomes.
Order does not matter in committee formation. We're selecting 3 from 8 people.
This is a combination problem since order doesn't matter (committee members are not ranked).
\(C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}\)
Here: n = 8, r = 3
\(C(8,3) = \frac{8!}{3!(8-3)!} = \frac{8!}{3! \cdot 5!} = \frac{8 \times 7 \times 6 \times 5!}{3! \times 5!}\)
\(C(8,3) = \frac{8 \times 7 \times 6}{3!} = \frac{8 \times 7 \times 6}{3 \times 2 \times 1} = \frac{336}{6} = 56\)
56 different committees can be formed from 8 people.
Order matters since medals are ranked (gold, silver, bronze). We're arranging 3 positions from 10 runners.
This is a permutation problem since order matters (first place ≠ second place ≠ third place).
\(P(n,r) = \frac{n!}{(n-r)!}\)
Here: n = 10, r = 3
\(P(10,3) = \frac{10!}{(10-3)!} = \frac{10!}{7!} = \frac{10 \times 9 \times 8 \times 7!}{7!} = 10 \times 9 \times 8 = 720\)
Gold medal: 10 choices
Silver medal: 9 remaining choices
Bronze medal: 8 remaining choices
Total: 10 × 9 × 8 = 720
There are 720 different ways to award the gold, silver, and bronze medals.
We need to select 3 aces from 4 available aces AND 2 non-aces from 48 non-aces.
Select 3 aces from 4 aces: C(4,3)
Select 2 non-aces from 48 non-aces: C(48,2)
Use multiplication principle since both selections must happen.
\(C(4,3) = \frac{4!}{3!(4-3)!} = \frac{4!}{3! \cdot 1!} = \frac{4}{1} = 4\)
\(C(48,2) = \frac{48!}{2!(48-2)!} = \frac{48!}{2! \cdot 46!} = \frac{48 \times 47}{2 \times 1} = \frac{2256}{2} = 1128\)
Total number of 5-card hands with exactly 3 aces = C(4,3) × C(48,2) = 4 × 1128 = 4512
There are 4,512 different 5-card hands that contain exactly 3 aces.
Letters: 4 positions, no repetition, 26 letters available (order matters)
Digits: 3 positions, repetition allowed, 10 digits available (order matters)
First letter: 26 choices
Second letter: 25 remaining choices
Third letter: 24 remaining choices
Fourth letter: 23 remaining choices
Total for letters: 26 × 25 × 24 × 23 = 358,800
Alternatively: P(26,4) = 26!/(26-4)! = 26!/22! = 26 × 25 × 24 × 23 = 358,800
First digit: 10 choices
Second digit: 10 choices (repetition allowed)
Third digit: 10 choices (repetition allowed)
Total for digits: 10 × 10 × 10 = 1,000
Total number of passwords = (Ways to arrange letters) × (Ways to arrange digits)
Total = 358,800 × 1,000 = 358,800,000
There are 358,800,000 different possible passwords.
Positions are distinct (President ≠ Vice President ≠ Secretary), so order matters. This is a permutation problem.
This is a permutation since positions are distinct.
\(P(6,3) = \frac{6!}{(6-3)!} = \frac{6!}{3!} = \frac{6 \times 5 \times 4 \times 3!}{3!} = 6 \times 5 \times 4 = 120\)
Method 1: Count favorable outcomes
If Alice is President: P(5,2) = 5 × 4 = 20 ways
If Alice is Vice President: P(5,2) = 5 × 4 = 20 ways
If Alice is Secretary: P(5,2) = 5 × 4 = 20 ways
Total favorable outcomes = 20 + 20 + 20 = 60
\(P(\text{Alice elected}) = \frac{\text{Favorable outcomes}}{\text{Total outcomes}} = \frac{60}{120} = \frac{1}{2}\)
Probability Alice is NOT elected: She's not in any of the 3 positions
Ways to fill 3 positions from remaining 5 candidates: P(5,3) = 5 × 4 × 3 = 60
P(Alice not elected) = 60/120 = 1/2
P(Alice elected) = 1 - P(Alice not elected) = 1 - 1/2 = 1/2
There are 120 different ways to fill the 3 positions. The probability that Alice gets elected to one of the positions is 1/2 or 50%.
Permutations: Arrangements where order matters. Use when positioning, ranking, or sequencing is involved.
Combinations: Selections where order doesn't matter. Use when choosing groups or subsets.
Fundamental Counting Principle: If one event can occur in m ways and another in n ways, both can occur in m × n ways.
- Permutations: \(P(n,r) = \frac{n!}{(n-r)!}\)
- Combinations: \(C(n,r) = \binom{n}{r} = \frac{n!}{r!(n-r)!}\)
- Probability: \(P(E) = \frac{\text{Number of favorable outcomes}}{\text{Total number of outcomes}}\)
- Factorial: \(n! = n \times (n-1) \times (n-2) \times ... \times 1\), with \(0! = 1\)
- Complement Rule: \(P(A') = 1 - P(A)\)
Permutation vs Combination: Does order matter? Yes → Permutation, No → Combination
Repetition: Allowed → Different calculations, Not allowed → Use factorial-based formulas
Multiple Events: Use multiplication principle when both must occur