1 / 15

Chapter 10

Chapter 10. Counting Methods. Chapter 10: Counting Methods. 10.1 Counting by Systematic Listing 10.2 Using the Fundamental Counting Principle 10.3 Using Permutations and Combinations 10.4 Using Pascal’s Triangle 10.5 Counting Problems Involving “Not” and “Or”. Section 10-3.

jamesvrivera
Download Presentation

Chapter 10

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 10 Counting Methods

  2. Chapter 10: Counting Methods • 10.1 Counting by Systematic Listing • 10.2 Using the Fundamental Counting Principle • 10.3 Using Permutations and Combinations • 10.4 Using Pascal’s Triangle • 10.5 Counting Problems Involving “Not” and “Or”

  3. Section 10-3 • Using Permutations and Combinations

  4. Using Permutations and Combinations • Solve counting problems involving permutations and the fundamental counting principle. • Solve counting problems involving combinations and the fundamental counting principle. • Solve counting problems that require whether to use permutations or combinations.

  5. Permutations In the context of counting problems, arrangements are often called permutations; the number of permutations of n things taken r at a time is denoted nPr. Applying the fundamental counting principle to arrangements of this type gives nPr= n(n – 1)(n – 2)…[n – (r – 1)].

  6. Factorial Formula for Permutations The number of permutations, or arrangements, of n distinct things taken r at a time, where rn, can be calculated as

  7. Example: Using the Factorial Formula for Permutations Evaluate each permutation. a) 5P3 b) 6P6 Solution

  8. Example: IDs How many ways can you select two letters followed by three digits for an ID if repeats are not allowed? Solution There are two parts: 1. Determine the set of two letters. 2. Determine the set of three digits. Part 1 Part 2

  9. Example: Building Numbers From a Set of Digits How many four-digit numbers can be written using the numbers from the set {1, 3, 5, 7, 9} if repetitions are not allowed? Solution Repetitions are not allowed and order is important, so we use permutations:

  10. Combinations In the context of counting problems, subsets, where order of elements makes no difference, are often called combinations; the number of combinations of n things taken r at a time is denoted nCr.

  11. Factorial Formula for Combinations The number of combinations, or subsets, of n distinct things taken r at a time, where rn, can be calculated as Note:

  12. Example: Using the Factorial Formula for Combinations Evaluate each combination. a) 5C3 b) 6C6 Solution

  13. Example: Finding the Number of Subsets Find the number of different subsets of size 3 in the set {m, a, t, h, r, o, c, k, s}. Solution A subset of size 3 must have 3 distinct elements, so repetitions are not allowed. Order is not important.

  14. Example: Finding the Number of Subsets A common form of poker involves hands (sets) of five cards each, dealt from a deck consisting of 52 different cards. How many different 5-card hands are possible? Solution Repetitions are not allowed and order is not important.

  15. Guidelines on Which Method to Use

More Related