Scribd Logo
Upload

Welcome to Scribd!

  • 74 views

    Section 9.6 Counting Principles: Name

    Uploaded by

    sarasmile2009
    In this lesson you learned how to solve counting problems using the Fundamental counting Principle, permutations, and combinations.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Section 9.6 Counting Principles: Name

    Uploaded by

    sarasmile2009
    74 views2 pages
    In this lesson you learned how to solve counting problems using the Fundamental counting Principle, permutations, and combinations.

    Original Title

    9-6

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    In this lesson you learned how to solve counting problems using the Fundamental counting Principle, permutations, and combinations.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    74 views2 pages

    Section 9.6 Counting Principles: Name

    Uploaded by

    sarasmile2009
    In this lesson you learned how to solve counting problems using the Fundamental counting Principle, permutations, and combinations.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Section 9.

    6 • Counting Principles 165


    Name______________________________________________
    Section 9.6 Counting Principles

    Objective: In this lesson you learned how to solve counting problems


    using the Fundamental Counting Principle, permutations,
    and combinations.

    Important Vocabulary Define each term or concept.

    Fundamental Counting Principle Let E1 and E2 be two events. The first event E1
    can occur in m1 different ways. After E1 has occurred, E2 can occur in m2 different
    ways. The number of ways that the two events can occur is m1 ⋅ m2.
    Permutation An ordering of n different elements such that one element is first, one is
    second, one is third, and so on.
    Distinguishable permutations Suppose a set of n objects has n1 of one kind of
    object, n2 of a second kind, n3 of a third kind, and so on, with n = n1 + n2 + n3 + . . . +
    nk. Then the number of distinguishable permutations of the n objects is
    n!/(n1!⋅n2!⋅n3!⋅ ⋅ ⋅ ⋅ nk!).
    Combination A subset of a set of n elements in which the order is not important.

    I. Simple Counting Problems (Page 691) What you should learn


    How to solve simple
    If two balls are randomly drawn from a bag of six balls, counting problems
    numbered from 1 to 6, such that it is possible to choose two 3’s,
    the random selection occurs with replacement . If
    two balls are drawn from the bag at the same time, the random
    selection occurs without replacement , which
    eliminates the possibility of choosing two 3’s.

    II. The Fundamental Counting Principle (Page 692) What you should learn
    How to use the
    The Fundamental Counting Principle can be extended to three or Fundamental Counting
    more events. For instance, if E1 can occur in m1 ways, E2 in m2 Principle to solve
    counting problems
    ways, and E3 in m3 ways, the number of ways that three events
    E1, E2, and E3 can occur is m1 ⋅ m2 ⋅ m3 .

    Example 1: A diner offers breakfast combination plates which


    can be made from a choice of one of 4 different
    types of breakfast meats, one of 8 different styles
    of eggs, and one of 5 different types of breakfast
    breads. How many different breakfast combination
    plates are possible?
    160 different combinations

    Larson/Hostetler Precalculus/Precalculus with Limits Notetaking Guide IAE


    Copyright © Houghton Mifflin Company. All rights reserved.
    166 Chapter 9 • Sequences, Series, and Probability

    III. Permutations (Pages 693−695) What you should learn


    How to use permutations
    The number of different ways that n elements can be ordered is to solve counting
    n! . problems

    The number of ways of ordering a subset of a collection of


    elements, called a permutation of n elements taken r at a time, is
    given as nPr = n!/(n − r)! .

    Example 2: In how many ways can a chairperson, a vice


    chairperson, and a recording secretary be chosen
    from a committee of 14 people?

    2184 ways

    Example 3: In how many distinguishable ways can the letters


    COMMITTEE be written?

    45,360 ways

    IV. Combinations (Pages 696−697) What you should learn


    How to use combinations
    The number of combinations of n elements taken r at a time is to solve counting
    n!/((n − r)! r!) problems
    nCr = .

    For a combination, the order in which the elements are listed


    is not important.

    Example 4: In how many ways can a research team of 3


    students be chosen from a class of 14 students?

    364 ways

    Homework Assignment

    Page(s)

    Exercises

    Larson/Hostetler Precalculus/Precalculus with Limits Notetaking Guide IAE


    Copyright © Houghton Mifflin Company. All rights reserved.

    You might also like