Addition Principle: If events A and B are mutually exclusive, the total number of outcomes is n(A) + n(B). For independent events, use the multiplication principle.
- Identify if events are independent (can occur simultaneously) or mutually exclusive (cannot occur simultaneously)
- For independent events: use multiplication principle
- For mutually exclusive events: use addition principle
- Multiply the number of choices in each category
We have 3 independent categories: appetizers, main courses, desserts
Appetizers: 5 choices, Main courses: 8 choices, Desserts: 4 choices
Since these events are independent (we can choose one from each category), we multiply the number of choices: 5 × 8 × 4
5 × 8 × 4 = 40 × 4 = 160
There are 160 different possible meal combinations.
• Multiplication Principle: For independent events, multiply the number of outcomes
• Independent Events: Choosing an appetizer doesn't affect main course choices
• Sequential Decisions: Each choice is made independently of others
Multiplication Principle: If one event can occur in m ways and another independent event can occur in n ways, then both events can occur in m × n ways.
License plate format: LLL-DDD (3 letters followed by 3 digits)
Letters: 26 possible choices for each position (A-Z)
Digits: 10 possible choices for each position (0-9)
First letter: 26 ways
Second letter: 26 ways
Third letter: 26 ways
First digit: 10 ways
Second digit: 10 ways
Third digit: 10 ways
Total = 26 × 26 × 26 × 10 × 10 × 10 = 26³ × 10³ = 17,576,000
There are 17,576,000 different possible license plates.
• Multiplication Principle: Independent choices multiply
• Repetition Allowed: Each position has full range of choices
• Position Independence: Choice for one position doesn't affect others
Permutation: An arrangement of objects in a specific order. The number of permutations of n objects taken r at a time is P(n,r) = n!/(n-r)! When arranging all n objects, it's n!
We need to arrange 5 distinct people in 5 distinct seats (order matters)
First seat: 5 people can sit here
Second seat: 4 remaining people can sit here
Third seat: 3 remaining people can sit here
Fourth seat: 2 remaining people can sit here
Fifth seat: 1 remaining person can sit here
Total arrangements = 5 × 4 × 3 × 2 × 1 = 5! = 120
This follows the general formula for permutations of n objects: n!
There are 120 different ways to seat 5 people in 5 chairs.
• Permutation Formula: n! for arranging n distinct objects
• Order Matters: Seating position is important
• Distinct Objects: Each person is unique
Counting: Determining the number of possible outcomes in a sample space
Fundamental Theorem: The foundation of combinatorics: addition and multiplication principles
Permutation: An arrangement where order matters
Combination: A selection where order doesn't matter
- Identify the problem type: Addition vs multiplication, permutation vs combination
- Determine if order matters: Use permutation if yes, combination if no
- Check for repetition: Adjust calculations accordingly
- Apply the appropriate formula: Calculate the result
• Addition Principle: n(A ∪ B) = n(A) + n(B) for disjoint sets
• Multiplication Principle: n(A × B) = n(A) × n(B) for independent events
• Permutation: P(n,r) = n!/(n-r)!
• Combination: C(n,r) = n!/[r!(n-r)!]
1. Are events independent ("AND") or mutually exclusive ("OR")?
2. Does order matter in the outcome?
3. Are repetitions allowed?
For mutually exclusive events
"OR" situations
n(A ∪ B) = n(A) + n(B)
For independent events
"AND" situations
n(A × B) = n(A) × n(B)
Combination: A selection of objects where order does not matter. C(n,r) = n!/[r!(n-r)!]
We're selecting 3 people from 8, and the order doesn't matter (committee member A, B, C is the same as B, A, C)
C(n,r) = n!/[r!(n-r)!]
C(8,3) = 8!/[3!(8-3)!] = 8!/(3! × 5!)
C(8,3) = (8 × 7 × 6 × 5!)/(3! × 5!)
= (8 × 7 × 6)/(3 × 2 × 1)
= 336/6
= 56
Using the calculator: C(8,3) = 56 ✓
There are 56 different possible committees.
• Combination Formula: Order doesn't matter, so use C(n,r)
• Factorial Simplification: Cancel common terms in numerator and denominator
• Context Verification: Committee formation doesn't depend on order of selection
Complex Counting: Problems requiring multiple applications of counting principles with constraints.
Structure: LL-DDD
First letter: 26 choices
Second letter: 26 choices (repetition allowed)
First digit: 10 choices
Second digit: 10 choices
Third digit: 10 choices
Total = 26 × 26 × 10 × 10 × 10 = 26² × 10³ = 676,000
First letter: 26 choices
Second letter: 25 choices (one letter already used)
First digit: 10 choices
Second digit: 9 choices (one digit already used)
Third digit: 8 choices (two digits already used)
Total = 26 × 25 × 10 × 9 × 8 = 468,000
(a) With repetition: 676,000 passwords possible
(b) Without repetition: 468,000 passwords possible
• Repetition Effects: When repetition is not allowed, available choices decrease
• Multiplication Principle: Apply to each independent position
• Constraint Handling: Adjust calculations based on given conditions
Fundamental Counting Principle: If one event can occur in m ways and a second event can occur in n ways, then the two events can occur in m × n ways.
Addition Principle: If two events A and B are mutually exclusive, then A or B can occur in n(A) + n(B) ways.
Multiplication Principle: If two events A and B are independent, then A and B can occur in n(A) × n(B) ways.
- Understand the problem: Identify what is being counted and any constraints
- Determine if order matters: Use permutations if order matters, combinations if not
- Check for repetition: Adjust calculations based on whether items can be repeated
- Apply the appropriate principle: Addition for OR situations, multiplication for AND situations
• Fundamental Principle: For independent events: m × n
• Permutation: P(n,r) = n!/(n-r)!
• Combination: C(n,r) = n!/[r!(n-r)!]
• Relationship: P(n,r) = C(n,r) × r!
• Special case: C(n,r) = C(n, n-r)
Analysis: Counting principles are fundamental to probability theory, statistics, and combinatorial mathematics.
- Addition: Used for mutually exclusive events (P(A or B) = P(A) + P(B))
- Multiplication: Used for independent events (P(A and B) = P(A) × P(B))
- Permutations: Used when order matters in arrangements
- Combinations: Used when order doesn't matter in selections