1 / 4

7.6 Applications of Inclusion-Exclusion

7.6 Applications of Inclusion-Exclusion. An Alternative Form of Inclusion-Exclusion Example 1: How many solutions does x 1 + x 2 +x 3 =11 have ,where x 1 , x 2 , x 3 are nonnegative integers with x 1  3, x 2  4, and x 3  6 ?. The Number of Onto Functions.

sancha
Download Presentation

7.6 Applications of Inclusion-Exclusion

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. 7.6 Applications of Inclusion-Exclusion An Alternative Form of Inclusion-Exclusion • Example 1: How many solutions does x1+ x2 +x3 =11 have ,where x1, x2, x3 are nonnegative integers with x1 3, x2  4, and x3  6 ?

  2. The Number of Onto Functions • Example 2: How many onto functions are there from a set with six elements to a set with three elements? • Theorem 1: Let m and n be positive integers with m  n . Then ,there are nm – C(n, 1)(n-1)m +C(n, 2)(n-2)m –. . . +(-1)n-1 C(n, n-1)*1m onto functions from a set with m elements to a set with n elements. • Example 3: How many ways are there to assign five different jobs to four different employees if every employee is assigned at least one job?

  3. Derangements • Example 4: The Hatcheck Problem A new employee checks the hats of n people at a restaurant, forgetting to put claim check numbers on the hats. • When customers return for their hats, the checker gives them back hats chosen at random from the remaining hats. • What is the probability that no one receives the correct hat? • A derangement is a permutation of objects that leaves no object in its original position. • Example 5: The permutation 21453 is a derangement of 12345 because no number is left in its original position. However, 21543 is not a derangement of 12345, because this permutation leaves 4 fixed.

  4. Derangements • Theorem 2: The number of derangements of a set with n elements is • Dn =n! [ 1- 1/1! + 1/2! - . . . + (-1)n1/n! ]

More Related