1 / 13

Chapter 6 The principle of inclusion and exclusion

Chapter 6 The principle of inclusion and exclusion. 6.1 排容原則 (the principle of inclusion and exclusion) 6.2 亂序 (derangements) 6.3 城堡多項式 (the rook polynomial). 6.1 排容原則. Determine the number of positive integers n , 1  n  30, that are divisible by 2, 3, or 5. Ans: 15+10+6-5-3-2+1=22.

mark-nicholson
Download Presentation

Chapter 6 The principle of inclusion and 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. Chapter 6 The principle of inclusion and exclusion • 6.1 排容原則 (the principle of inclusionand exclusion) • 6.2 亂序(derangements) • 6.3 城堡多項式 (the rook polynomial)

  2. 6.1 排容原則 Determine the number of positive integers n , 1n 30, that are divisible by 2, 3, or 5. Ans: 15+10+6-5-3-2+1=22

  3. 6.1 排容原則 例1. (a) Find the number of integers between 1 and 250 that are not divisible by any of the integers 2, 3, 5, and 7. (b) the number of integers that not divisible by 2 nor by 7 but are divisible by 5

  4. 6.1 排容原則 例2. Find the number of r-digit quaternary sequences in which each of the three digits 1, 2, and 3 appears at least once.

  5. 6.2 亂序(derangements) A permutation of these integers is said to be a derangement of the integers if no integer appears in its natural position.

  6. 6.2 亂序(derangements)

  7. 6.2 亂序(derangements) 例1. Let n books be distributed to n children. The books are returned and distributed to the children again later on. In how many ways can the books be distributed so that no child will get the same book twice? 例2. In how many ways can the integers 1, 2, 3, 4, 5, 6, 7, 8, and 9 be permuted such that no odd integer will be in its natural position?

  8. 6.2 亂序(derangements) 例3. Find the number of permutations of the letters a, b, c, d, e, and f in which neither the pattern ace nor the pattern fd appears. 6!-4!-5!+3! 例4. In how many ways can the letters x, x, x, x, y, y, y, z, and z be arranged so that all the letters of the same kind are not in a single block?

  9. 6.3 城堡多項式 (the rook polynomial) The problem of nontaking rooks: a rook is a chessboard piece which “captures” on both rows and column Given a chessboard, let rk denote the number of ways of placing k nontaking rooks on the board. r0 = 1 r1 = 4 r2 = 3 R(x) = 1 +4x+3x2

  10. 6.3 城堡多項式 (the rook polynomial) Expansion formula:

  11. 6.3 城堡多項式 (the rook polynomial)

  12. 6.3 城堡多項式 (the rook polynomial)

  13. 6.3 城堡多項式 (the rook polynomial) Given a chessboard C, find the rook polynomial of C.

More Related