离散数学杨争锋ch066.pptxVIP

2. An Alternative Form of Inclusion-Exclusion (1) Let Ai be the subset containing the elements that have property Pi. The number of elements with all properties Pi1, Pi2, …, Pik will be denoted by N(Pi1Pi2 …Pik). The number of elements with none of the properties P1, P2, …, Pn is denoted by N(P1’ P2’ … Pn’). The number of elements in the set is denoted by N. We have: N(P1’ P2’ … Pn’) = N - |A1∪A2∪…∪An| 牛牛文库文档分享 Then we have: N(P1’ P2’ … Pn’) = N - ∑1≤i≤n N(Pi) + ∑1≤ij≤n N(Pi,Pj) - ∑1≤ijk≤n N(Pi,Pj,Pk) +……..+ (-1)n N(P1,P2,…,Pn) Please note: N(P1’ P2’ … Pn’) = N - |A1∪A2∪….∪An| 牛牛文库文档分享 (2) Example 1 (page 506) How many solutions does x1+x2+x3=11 have, where x1, x2, and x3 are nonnegative integers with x1≤3, x2 ≤4, and x3 ≤6? Solution: 　为使用容斥原理,令性质P1代表x13，性质P2代表x24，性质P3代表X36． 　　　满足不等式x1≤3, x2 ≤4以及x3 ≤6的解的个数是： N(P1’P2’ P3’) = N - N(P1) - N(P2) - N(P2) + N(P1P2) + N(P1P3) + N(P2P3) - N(P1P2P3) 牛牛文库文档分享 N = 解的总数= C(3+11-1,11)=78, N (P1) = (具有x1≥4的解数) = C(3+7-1,7) = C(9,7) = 36, N (P2) = (具有x2≥5的解数)= C(3+6-1,6) = C(8,6) = 28, N (P3) = (具有x3≥7的解数) = C(3+4-1,4) = C(6,4) =15, N (P1P2) = (具有x1≥4且x2≥5的解数) = C(3+2-1,2)=C(4,2)=6, N (P1 P3) = (具有x1≥4且x3≥7的解数) = C(3+0-1,0) = C(2,0)=1, N (P2 P3) = (具有x2≥5且x3≥7的解数)=0, N (P1 P2 P3) = (具有x1≥4且x2≥5且x3≥7的解数)= 0 把这些等式代入关于N(P1’P2’ P3’)的公式,证明满足x1≤3, x2 ≤4, 以及 x3 ≤6的解的个数等于 N(P1’P2’ P3’) = 78-36-28-15+6+1+0-0 = 6 牛牛文库文档分享 3. The Sieve of Eratosthenes (伊拉脱森筛) (1) Question (page 507) The principle of inclusion-exclusion can be used to find the number of primes not exceeding a specified positive integer. (2) Example 0 (page 507) How to find the number of primes (素数) not exceeding 100? 牛牛文库文档分享 Solution: (1) Recall that a composite (合数) integer is divisible (整除) by a prime not exceeding its square root (平方根) (2) Composite integers not exceeding 100 must have a prime factor (因子) not exceeding 10