Fundamental Counting Principle: If one event can occur in m ways AND a second event can occur in n ways, then the two events together can occur in m × n ways.
- Identify independent choices (appetizer, main course, dessert)
- Count possibilities for each choice
- Multiply the number of options
We have 3 independent decisions: choosing an appetizer, main course, and dessert
Appetizers: 4 options, Main courses: 5 options, Desserts: 3 options
Total outcomes = 4 × 5 × 3 = 60 different three-course meals
There are 60 different three-course meals that can be ordered.
• Fundamental Counting Principle: Multiply independent choices
• Independence: Each choice does not affect others
• Sequential Events: Order matters in the sequence of choices
Permutation vs Combination: When order matters and items don't repeat, we use permutations. When repetition is allowed, we use powers.
First letter: 26 options (A-Z). Second letter: 25 options (since letters can't repeat)
Each digit: 10 options (0-9), and digits can repeat, so 10³ = 1000 total digit combinations
Total passwords = 26 × 25 × 10 × 10 × 10 = 650,000
There are 650,000 different possible passwords.
• No repetition: Reduce available options for subsequent selections
• Repetition allowed: Same number of options for each selection
• Order matters: Position of each character is significant
Permutation without repetition: When items are selected from a set without replacement, the number of available options decreases with each selection.
1st letter: 26 options, 2nd letter: 25 options, 3rd letter: 24 options
Total letter arrangements: 26 × 25 × 24 = 15,600
1st digit: 10 options, 2nd digit: 9 options, 3rd digit: 8 options, 4th digit: 7 options
Total digit arrangements: 10 × 9 × 8 × 7 = 5,040
Total license plates = 15,600 × 5,040 = 78,624,000
There are 78,624,000 different possible license plates.
• Without replacement: Available options decrease with each selection
• Sequential reduction: First option: n, second: n-1, third: n-2, etc.
• Combined principle: Multiply independent sequences
Fundamental Counting Principle: If one event can occur in m ways AND a second event can occur in n ways, then the two events together can occur in m × n ways.
Independent Events: Events where the outcome of one does not affect the outcome of another.
Permutation: An arrangement where order matters.
- Identify the stages: Break down the problem into sequential steps
- Count possibilities: Determine how many options exist at each stage
- Determine independence: Check if choices affect future options
- Apply the principle: Multiply the number of options at each stage
- Verify: Check if your answer makes logical sense
• Fundamental Counting Principle: \(n_1 \times n_2 \times n_3 \times \ldots \times n_k\)
• With repetition: \(n^k\) (n options, k positions)
• Without repetition: \(n \times (n-1) \times (n-2) \times \ldots\) for k positions
• Addition rule: For mutually exclusive events, add the number of ways
Permutation: An arrangement of objects where order matters. When selecting r objects from n distinct objects without replacement, the number of permutations is \(P(n,r) = n \times (n-1) \times (n-2) \times \ldots \times (n-r+1)\).
No person can hold more than one position, so we're selecting without replacement.
President: 10 candidates available. Vice-President: 9 remaining candidates. Secretary: 8 remaining candidates.
Total arrangements = 10 × 9 × 8 = 720 different ways to fill the positions.
There are 720 different ways to fill the three positions.
• Without replacement: Available options decrease with each selection
• Order matters: The role of president is different from vice-president and secretary
• Sequential reduction: Each selection reduces available candidates
Binary outcomes: Situations with only two possible results (like heads/tails). For n independent binary trials, there are \(2^n\) total possible outcomes.
Each toss has 2 outcomes (H or T). For 5 tosses: 2 × 2 × 2 × 2 × 2 = 2⁵ = 32 total sequences.
We need to choose 3 positions out of 5 for the heads. This is a combination: C(5,3) = 5!/(3!(5-3)!) = 10.
Alternatively, we could list: HHHTT, HHTHT, HHTTH, HTHHT, HTHTH, HTTHH, THHHT, THHTH, THTHH, TTHHH = 10 sequences.
There are 32 different possible sequences, and 10 of these contain exactly 3 heads.
• Binary outcomes: Each trial has 2 possibilities, so n trials have 2ⁿ outcomes
• Combinations: When order doesn't matter, use C(n,r) = n!/(r!(n-r)!)
• Independent trials: Each coin toss is unaffected by previous tosses
Fundamental Counting Principle: If one event can occur in m ways AND a second event can occur in n ways, then the two events together can occur in m × n ways.
Independent Events: Events where the outcome of one does not affect the outcome of another.
Permutation: An arrangement of objects where order matters.
Combination: A selection of objects where order does not matter.
With Repetition: The same item can be selected multiple times.
Without Repetition: Each item can only be selected once.
- Analyze the problem: Identify what is being counted and the constraints
- Identify stages: Break the process into sequential steps
- Count options: Determine how many choices exist at each stage
- Check independence: Verify if choices affect future options
- Apply the principle: Multiply options for independent events
- Consider restrictions: Account for any limitations or conditions
- Verify: Check if the answer is reasonable
• Fundamental Counting Principle: \(n_1 \times n_2 \times n_3 \times \ldots \times n_k\)
• With repetition: \(n^k\) (n options, k positions)
• Without repetition: \(n \times (n-1) \times (n-2) \times \ldots\) for k positions
• Permutation: \(P(n,r) = n!/(n-r)!\)
• Combination: \(C(n,r) = n!/(r!(n-r)!)\)
• Addition rule: For mutually exclusive events, add the number of ways
Questions & Answers
Question: I'm confused about when to use the fundamental counting principle versus permutations or combinations. Can you explain the difference?
Answer: Great question! The fundamental counting principle is the foundation for both permutations and combinations:
- Fundamental Counting Principle: Used when you have multiple stages of choices and want to find the total number of outcomes
- Permutations: A specific application of FCP where you're arranging objects and order matters (e.g., selecting president, vice-president)
- Combinations: Used when order doesn't matter (e.g., selecting team members)
Example: Selecting 3 people from 10 for different roles (president, VP, treasurer) uses FCP: 10×9×8 = 720 (permutation).
But selecting 3 people from 10 for the same role uses combinations: C(10,3) = 120.
Question: How do I know if a problem involves "with replacement" or "without replacement"?
Answer: Look for key phrases and context clues:
- "Without replacement": "without putting back," "can't repeat," "unique," "no duplicates," "each item used only once"
- "With replacement": "putting back," "same item can be used again," "items are returned," "repetition allowed"
Context also helps: drawing cards from a deck (usually without replacement), rolling dice (with replacement), selecting officers (without replacement), creating passwords with repeated characters (with replacement).
Always read the problem carefully to identify these restrictions!
Question: I have trouble deciding whether to multiply or add when solving counting problems. Any tips?
Answer: Use this simple decision tree:
- Multiply (FCP): When you're making a sequence of choices ("AND" situations)
- Add (Addition Rule): When you have mutually exclusive options ("OR" situations)
Examples:
Multiply: "How many outfits with 3 shirts AND 4 pants?" Answer: 3×4=12
Add: "How many ways to travel: 3 by car OR 2 by bus?" Answer: 3+2=5
The key is asking: "Am I doing this AND then that?" (multiply) or "Am I choosing between these options?" (add).