Learn on PengiSaxon Algebra 2Chapter 4: Lessons 31-40, Investigation 4

Lesson 33: Applying Counting Principles

In this Grade 10 Saxon Algebra 2 lesson, students learn how to apply the Addition Counting Principle and the Fundamental Counting Principle to count outcomes in experiments involving mutually exclusive, independent, and dependent events. Students practice using tree diagrams to map sample spaces and work through real-world problems such as calculating sandwich combinations and three-letter password possibilities. The lesson builds core vocabulary in counting theory, including sample space, compound events, and trials.

Section 1

πŸ“˜ Applying Counting Principles

New Concept

If there are n1n_1 ways to choose the first item, n2n_2 ways to choose the second item, and so on, then there are n1β‹…n2⋅…⋅nkn_1 \cdot n_2 \cdot \ldots \cdot n_k ways to choose all kk items.

What’s next

Next, you'll apply this principle to calculate possibilities for passwords, sports lineups, and other combinations.

Section 2

Addition Counting Principle

Suppose a trial can result in any of n1n_1 outcomes from one category, any of n2n_2 outcomes from another category, and so on. If there are kk different categories of outcomes, then the total number of outcomes that can result is n1+n2+…+nkn_1 + n_2 + \ldots + n_k.

Examples

  • Draw a king or a queen from a standard deck: 4 kings + 4 queens = 8 possible outcomes.
  • From numbers 1-20, choose a perfect square or a multiple of 7: \{1, 4, 9, 16\} or \{7, 14\}. This gives 4+2=64 + 2 = 6 total outcomes.

Section 3

Fundamental Counting Principle

Suppose kk items are to be chosen. If there are n1n_1 ways to choose the first item, n2n_2 ways to choose the second item, and so on, then there are n1β‹…n2⋅…⋅nkn_1 \cdot n_2 \cdot \ldots \cdot n_k ways to choose all kk items.

Examples

  • Create a 2-character password using letters (A-Z) where letters can be repeated: 26β‹…26=67626 \cdot 26 = 676 possible passwords.
  • An ice cream shop has 10 flavors and 4 types of toppings. The number of single-scoop, single-topping options is 10β‹…4=4010 \cdot 4 = 40.
  • A student has 5 shirts and 3 pairs of pants. The number of different outfits is 5β‹…3=155 \cdot 3 = 15.

Section 4

Independent and Dependent Events

Two events are independent if the probability of one event is not affected by whether or not the other event occurs. Two events are dependent if the probability of one event is affected by whether or not the other event occurs.

Examples

  • Independent: Flipping a coin and then rolling a die. The coin's outcome (HH or TT) has no effect on the die's outcome (1-6).
  • Dependent: Drawing a card from a deck, not replacing it, and then drawing another. The first card drawn changes the remaining deck.
  • Independent: Picking a marble from a bag, putting it back, then picking another. The odds reset for the second pick.

Book overview

Jump across lessons in the current chapter without opening the full course modal.

Continue this chapter

Chapter 4: Lessons 31-40, Investigation 4

  1. Lesson 1

    Lesson 31: Multiplying and Dividing Rational Expressions

  2. Lesson 2

    Lesson 32: Solving Linear Systems with Matrix Inverses (Exploration: Exploring Matrix Inverses)

  3. Lesson 3Current

    Lesson 33: Applying Counting Principles

  4. Lesson 4

    Lesson 34: Graphing Linear Equations II

  5. Lesson 5

    Lesson 35: Solving Quadratic Equations I

  6. Lesson 6

    Lesson 36: Using Parallel and Perpendicular Lines

  7. Lesson 7

    Lesson 37: Adding and Subtracting Rational Expressions

  8. Lesson 8

    Lesson 38: Dividing Polynomials Using Long Division

  9. Lesson 9

    Lesson 39: Graphing Linear Inequalities in Two Variables

  10. Lesson 10

    Lesson 40: Simplifying Radical Expressions

  11. Lesson 11

    Investigation 4: Understanding Cryptography

Lesson overview

Expand to review the lesson summary and core properties.

Expand

Section 1

πŸ“˜ Applying Counting Principles

New Concept

If there are n1n_1 ways to choose the first item, n2n_2 ways to choose the second item, and so on, then there are n1β‹…n2⋅…⋅nkn_1 \cdot n_2 \cdot \ldots \cdot n_k ways to choose all kk items.

What’s next

Next, you'll apply this principle to calculate possibilities for passwords, sports lineups, and other combinations.

Section 2

Addition Counting Principle

Suppose a trial can result in any of n1n_1 outcomes from one category, any of n2n_2 outcomes from another category, and so on. If there are kk different categories of outcomes, then the total number of outcomes that can result is n1+n2+…+nkn_1 + n_2 + \ldots + n_k.

Examples

  • Draw a king or a queen from a standard deck: 4 kings + 4 queens = 8 possible outcomes.
  • From numbers 1-20, choose a perfect square or a multiple of 7: \{1, 4, 9, 16\} or \{7, 14\}. This gives 4+2=64 + 2 = 6 total outcomes.

Section 3

Fundamental Counting Principle

Suppose kk items are to be chosen. If there are n1n_1 ways to choose the first item, n2n_2 ways to choose the second item, and so on, then there are n1β‹…n2⋅…⋅nkn_1 \cdot n_2 \cdot \ldots \cdot n_k ways to choose all kk items.

Examples

  • Create a 2-character password using letters (A-Z) where letters can be repeated: 26β‹…26=67626 \cdot 26 = 676 possible passwords.
  • An ice cream shop has 10 flavors and 4 types of toppings. The number of single-scoop, single-topping options is 10β‹…4=4010 \cdot 4 = 40.
  • A student has 5 shirts and 3 pairs of pants. The number of different outfits is 5β‹…3=155 \cdot 3 = 15.

Section 4

Independent and Dependent Events

Two events are independent if the probability of one event is not affected by whether or not the other event occurs. Two events are dependent if the probability of one event is affected by whether or not the other event occurs.

Examples

  • Independent: Flipping a coin and then rolling a die. The coin's outcome (HH or TT) has no effect on the die's outcome (1-6).
  • Dependent: Drawing a card from a deck, not replacing it, and then drawing another. The first card drawn changes the remaining deck.
  • Independent: Picking a marble from a bag, putting it back, then picking another. The odds reset for the second pick.

Book overview

Jump across lessons in the current chapter without opening the full course modal.

Continue this chapter

Chapter 4: Lessons 31-40, Investigation 4

  1. Lesson 1

    Lesson 31: Multiplying and Dividing Rational Expressions

  2. Lesson 2

    Lesson 32: Solving Linear Systems with Matrix Inverses (Exploration: Exploring Matrix Inverses)

  3. Lesson 3Current

    Lesson 33: Applying Counting Principles

  4. Lesson 4

    Lesson 34: Graphing Linear Equations II

  5. Lesson 5

    Lesson 35: Solving Quadratic Equations I

  6. Lesson 6

    Lesson 36: Using Parallel and Perpendicular Lines

  7. Lesson 7

    Lesson 37: Adding and Subtracting Rational Expressions

  8. Lesson 8

    Lesson 38: Dividing Polynomials Using Long Division

  9. Lesson 9

    Lesson 39: Graphing Linear Inequalities in Two Variables

  10. Lesson 10

    Lesson 40: Simplifying Radical Expressions

  11. Lesson 11

    Investigation 4: Understanding Cryptography