Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 1
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 9 Discrete Mathematics
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 9.1 Basic Combinatorics
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 4 Quick Review
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 5 Quick Review Solutions
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 6 What you’ll learn about Discrete Versus Continuous The Importance of Counting The Multiplication Principle of Counting Permutations Combinations Subsets of an n-Set … and why Counting large sets is easy if you know the correct formula.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 7 Continuous versus Discrete Continuous mathematics – field dealing with systems of contiguous, dimensionless points, each a measurable distance from some reference point In continuous systems, there are an infinite number of points in any interval. Discrete mathematics – field dealing with systems of discrete units that can be counted, e.g. the letters in the alphabet, peanuts in a jar, etc. In discrete systems, there are a finite number of objects in any set, such that the objects may be counted and the total number of the objects ascertained.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 8 Example Counting the Number of Ways a Procedure May Be Done How many different ways can four books be arranged on a book shelf?
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 9- 9 Multiplication Principle of Counting
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Using the Multiplication Principle If six girls and five boys are selected to the homecoming court, how many possible king-queen pairs are there?
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Permutations of an n-Set A permutation is a result of an experiment in which the order of the members of the set is important. If a set has n members, it is called an n-set There are n! possible permutations of an n-set.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Distinguishable Permutations Count the number of different 8-letter “words” that can be formed using the letters in the word COMPUTER.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Distinguishable Permutations
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Permutations of an n-set Containing Identical Multiples How many different arrangements of 12 M & Ms may be made, if there are three reds, two blues, five browns, and two yellows?
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Permutations Counting Formula
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Permutations of an n-set Taken r at a Time How many possible combinations of ASB officers are possible from a class of 325?
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Combination Counting Formula
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Counting Combinations How many 10 person committees can be formed from a group of 20 people?
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Formula for Counting Subsets of an n-Set
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Homework Homework Assignment #27 Review Section 9.1 Page 708, Exercises: 1 – 45 (EOO)
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley 9.2 The Binomial Theorem
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Quick Review
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Quick Review Solutions
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide What you’ll learn about Powers of Binomials Pascal’s Triangle The Binomial Theorem Factorial Identities … and why The Binomial Theorem is a marvelous study in combinatorial patterns.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Binomial Coefficient
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Using n C r to Expand a Binomial
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Pascal’s Triangle Pascal’s Triangle is a listing of the coefficients of the terms in the expansion of a binomial.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Using Pascal’s Triangle to Expand a Binomial
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide The Binomial Theorem
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Expanding a Binomial Points to note about Binomial Expansions: 1.The number of terms in the expansion is one more than the exponent. 2.The sum of the exponents of the variables in a term is always the exponent to which the binomial is raised, assuming both variables are first order in the initial expression. 3.The coefficient of the second term is the same as the exponent.
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Evaluating a Coefficient in a Binomial Expansion by hand
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Example Writing the Specified Term of a Binomial Expansion
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide Basic Factorial Identities