Solved Exercises on Fundamental Counting Principle

Master the fundamental counting principle: multiplication rule, addition rule, tree diagrams, and applications through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Basic Multiplication Rule
Exercise 1
A restaurant offers 4 appetizers, 5 main courses, and 3 desserts. How many different three-course meals can be ordered?
Definition:

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.

Counting method:
  1. Identify independent choices (appetizer, main course, dessert)
  2. Count possibilities for each choice
  3. Multiply the number of options
Appetizers
4 ways
Main Courses
5 ways
Desserts
3 ways
Total
4×5×3=60
Step 1: Identify the independent choices

We have 3 independent decisions: choosing an appetizer, main course, and dessert

Step 2: Count possibilities for each choice

Appetizers: 4 options, Main courses: 5 options, Desserts: 3 options

Step 3: Apply the fundamental counting principle

Total outcomes = 4 × 5 × 3 = 60 different three-course meals

60 different three-course meals can be ordered
Final answer:

There are 60 different three-course meals that can be ordered.

Applied rules:

• Fundamental Counting Principle: Multiply independent choices

• Independence: Each choice does not affect others

• Sequential Events: Order matters in the sequence of choices

2 Password Combinations
Exercise 2
A password consists of 2 letters followed by 3 digits. Letters cannot repeat, but digits can. How many different passwords are possible?
Definition:

Permutation vs Combination: When order matters and items don't repeat, we use permutations. When repetition is allowed, we use powers.

Letters (no repeat)
26×25
Digits (with repeat)
10³
Total
26×25×10³
Result
650,000
Step 1: Analyze letter positions

First letter: 26 options (A-Z). Second letter: 25 options (since letters can't repeat)

Step 2: Analyze digit positions

Each digit: 10 options (0-9), and digits can repeat, so 10³ = 1000 total digit combinations

Step 3: Apply fundamental counting principle

Total passwords = 26 × 25 × 10 × 10 × 10 = 650,000

650,000 different passwords are possible
Final answer:

There are 650,000 different possible passwords.

Applied rules:

• 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

3 License Plate Arrangements
Exercise 3
A license plate has 3 letters followed by 4 digits. How many plates are possible if letters and digits cannot repeat?
Definition:

Permutation without repetition: When items are selected from a set without replacement, the number of available options decreases with each selection.

Letters (no repeat)
26×25×24
Digits (no repeat)
10×9×8×7
Total
15,600×5,040
Result
78,624,000
Step 1: Calculate letter arrangements

1st letter: 26 options, 2nd letter: 25 options, 3rd letter: 24 options

Total letter arrangements: 26 × 25 × 24 = 15,600

Step 2: Calculate digit arrangements

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

Step 3: Apply fundamental counting principle

Total license plates = 15,600 × 5,040 = 78,624,000

78,624,000 different license plates possible
Final answer:

There are 78,624,000 different possible license plates.

Applied rules:

• 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

Rules and methods, laws,...
\(n_1 \times n_2 \times n_3 \times \ldots \times n_k\)
Fundamental Counting Principle
Multiplication Rule
If events are independent, multiply possibilities
Used when making sequential choices
Addition Rule
If events are mutually exclusive, add possibilities
Used when choosing between alternatives
With Repetition
Same number of options each time
Like rolling dice multiple times
Without Repetition
Options decrease with each selection
Like drawing cards without replacement
Key definitions:

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.

Complete methodology:
  1. Identify the stages: Break down the problem into sequential steps
  2. Count possibilities: Determine how many options exist at each stage
  3. Determine independence: Check if choices affect future options
  4. Apply the principle: Multiply the number of options at each stage
  5. Verify: Check if your answer makes logical sense
Tip 1: Look for keywords like "AND", "then", "followed by" which indicate multiplication.
Tip 2: If items cannot repeat, reduce the number of options for each subsequent choice.
Tip 3: Draw tree diagrams for complex problems to visualize all possible outcomes.
Tip 4: Always verify your answer by checking if it's reasonable for the given context.
Common errors: Adding instead of multiplying, forgetting to account for restrictions, miscounting available options.
Key insight: The principle works for any number of stages, not just two.
Formulas to know by heart:

• 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

Solution: Exercises 4 to 5
4 Committee Selection
Exercise 4
A committee needs a president, vice-president, and secretary. There are 10 candidates available. In how many ways can these positions be filled if no person can hold more than one position?
Definition:

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)\).

President
10 ways
Vice-President
9 ways
Secretary
8 ways
Total
10×9×8=720
Step 1: Identify the constraint

No person can hold more than one position, so we're selecting without replacement.

Step 2: Calculate options for each position

President: 10 candidates available. Vice-President: 9 remaining candidates. Secretary: 8 remaining candidates.

Step 3: Apply fundamental counting principle

Total arrangements = 10 × 9 × 8 = 720 different ways to fill the positions.

720 different ways to fill the positions
Final answer:

There are 720 different ways to fill the three positions.

Applied rules:

• 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

5 Coin Toss Sequences
Exercise 5
A fair coin is tossed 5 times. How many different sequences of outcomes are possible? How many of these sequences contain exactly 3 heads?
Definition:

Binary outcomes: Situations with only two possible results (like heads/tails). For n independent binary trials, there are \(2^n\) total possible outcomes.

Total sequences
2⁵=32
Sequences with 3H
C(5,3)=10
Result
32 total, 10 with 3H
Step 1: Calculate total possible sequences

Each toss has 2 outcomes (H or T). For 5 tosses: 2 × 2 × 2 × 2 × 2 = 2⁵ = 32 total sequences.

Step 2: Calculate sequences with exactly 3 heads

We need to choose 3 positions out of 5 for the heads. This is a combination: C(5,3) = 5!/(3!(5-3)!) = 10.

Step 3: Verify the calculation

Alternatively, we could list: HHHTT, HHTHT, HHTTH, HTHHT, HTHTH, HTTHH, THHHT, THHTH, THTHH, TTHHH = 10 sequences.

32 total sequences, 10 with exactly 3 heads
Final answer:

There are 32 different possible sequences, and 10 of these contain exactly 3 heads.

Applied rules:

• 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

Comprehensive List of Laws, Methods, Rules, Definitions, Expressions
\(n_1 \times n_2 \times n_3 \times \ldots \times n_k\)
Fundamental Counting Principle
Key definitions:

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.

Complete methodology:
  1. Analyze the problem: Identify what is being counted and the constraints
  2. Identify stages: Break the process into sequential steps
  3. Count options: Determine how many choices exist at each stage
  4. Check independence: Verify if choices affect future options
  5. Apply the principle: Multiply options for independent events
  6. Consider restrictions: Account for any limitations or conditions
  7. Verify: Check if the answer is reasonable
Tip 1: Words like "and," "then," "followed by" usually indicate multiplication.
Tip 2: Words like "or," "either," "alternative" often indicate addition.
Tip 3: Draw tree diagrams for small problems to visualize the counting process.
Tip 4: When items cannot repeat, the number of available options decreases with each selection.
Tip 5: Always consider whether order matters in your counting problem.
Common errors: Forgetting to account for restrictions, adding instead of multiplying, miscounting due to repetition rules.
Exam preparation: Practice identifying independent vs dependent events, master permutation and combination differences.
Key insight: The fundamental counting principle extends to any number of stages, not just two.
Formulas to know by heart:

• 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).