PART 2 FURTHER TOPICS IN ENUMERATIONCHAPTER 8 ‘THE PRINCIPLE OF INCLUSION AND EXCLUSION Section 8.1 Let ¢ € S and let n be the number of conditions (from among ¢,¢2,¢s,¢4) satisfied by #: (n= 0): Here « is counted once in N(@;252,) and once in N (22,2364). ( If z satisfies c; (and not cz,¢5,¢4), then x is counted once in N(@€3%4) and once in N(créx63%). If satisfies ¢;, for i # 1, then is not counted in any of the three terms in the equation. (n= 2,3,4): If 2 satisfies at least two of the four conditions, then z is not counted in any of the three terms in the equation. ‘The preceding observations show that the two sides of the given equation count the same elements from $, and this provides a combinatorial proof for the formula N(@@%4) = N(crBxtats) + N(Gi@rtst.)- Proof (By the Principle of Mathematical Induction): If t = 1, then we have W = N(@) = the number of elements in S that do not satisfy condition cy = N — N(cy). This is the basis step for the proof. Now assume the result true for k conditions, where k (> 1) is fixed but arbitrary, and for any finite set $. That is, N(@2at... 2) = N — [N(cx) + Nex) + N(cs) +--+ + N(ce)] + [IN (crea) +N (eres) +++ +N (cree) +N (crea) +: + +N (cace) ++ +N (ecg) +> + +N (c4-102)]— [N(creaes) +--+ N(ch-2ce-iee)} +++ + (- TAN (cxcace--- cx) ‘Now consider the case for ¢ = k +1 conditions. From the induction hypothesis we have N (GG. Zecets) = N(cu41) ~ [N (creas) + N(caceer) + N(cackes) + °° + N(ceeees)] IN (ereacnys) + N(crcaciga) + +++ + N(crcecegs) + N(cacscess) + +++ + N(creecess) here N(eacxcugs) + +++ + N(ce-acncugs)] ~ [N(ereaeascees) +07 + N(ch-a¢h-164¢e41)] + +++ + (~1)EN (creacs »-. cxceys)- Subtracting this last equation from the one given in the induction hypothesis we find that N(GjGats---Bitiin) = N(Gskaea.. Ge) — NGtres..-Fecues) = N ~[N(cx) + N(ea) +++ + N(ca)] + [M(ciea) + N(cres) + +++ + N(cica) + N(caes) tore (cacy) +++ N (cae) +----+N(ce-104)} ~[N(ereres) +++ N(cn-2ee-ace)] 007+ (SDN (ereaes « C4) N (eee) +EN (ereear +N (exenar) + --+N (exeets )I— EN (creaciss) + N(Cxeacigs) + +++ + N(Ch-aCeeeea)] + 20+ (1) N (erences. + CeCe41) = 209N~[N(e1) +N (62) +--+ Nee) + (Cua) + LN (crea) + +++ + N (crea) + N(ercen) tot N(ck-sces1) + N(cecigs)] — [N(excaca) + +++ + N(cr-2ch-ace) + +++ +N (ce-sencegs bo + (=I) IN(crea¢s ... cxCn41)» So the Principle of Inclusion and Exclusion is true for any given finite set $ and any number # (> 1) of conditions ~ by the Principle of Mathematical Induction. N= 100 N(ex) = 35; N(ca) = 30; N (cs) = 30; N(cs) = 41 N(erea) = 11; N(cxes) = 13; N (exes) = 10; N(eaca) = 14; N(caca) = 10. 35 N(creaca) = 6; N(cresca) = 6; N(cxesea) = 6 (a) N@:tres%4) = N(Giexee) — N (Greet) N(@xeits) = N — [N(ex) + N(ca) + N(ca)] +IN (ere2) + N(crca) + N(c2ca)] — N(crcece) = 100 — [35 + 30 + 41] + [9 +13 + 14]~6 = 100 ~ 106 + 36 - 6 = 24 N(€i2:2304) = 12 (as shown in Example 8.3) So N(&zocs%q) = 24-12 = 12 Alternately, NG: N ~[N(c1) + N(c2) + N(ca)] + [N (crea) +N (cre4) + N(c2es)] — N(cre2ea), so N(@éaca@s) = N(cs) — [N(c1es) +N (crea) + N(csca)} + [N(cre2es) + N(eresca) + N(exeaca)] —N(eye2¢a¢4) = 30 — (11 + 10 + 10] + [54646] -4= 30-314 17-4= 12. (b) (Gea) = N ~ [N (cr) + M(ea)] + M(erea)s 90 N(reresza) = N(Caes) ~ (M(ereaes) + N(caesca)} + N(ereacace) = 10 — [5 + 6] +4 = 3. cx: Staff member brings hot dogs ca: Staff member brings fried chicken es: Stadt member brings salads cq Staff member brings desserts N=65 N(c) = 21; N(c2) = 35; N(¢s) = 28; N(c4) = 32 N(exe2) = 13; N(e1e3) = 10; N(exes) = 9; N(ex¢3) = 12; N(caca) = 17; (cata) = 14 N(crexes) = 4; N(crexea) = 6; N(crcsca) = 5; N(cacsce) = 7 N(eyeyeaea) = 2. (8) N(Ge2st4) = 65 — [21+ 35-+ 28-432] + (134 10494124174 14] (446454742 = 65~116+75—22+2=4. (b) N(Gaeaé4) = N~[N (co) +M(cs) +N (ca)}+(N (eres) +N (cxce) + N(e904)}— N(c2eae4), 80 (1) —[N (crea) +N (crea) +N (exe4)] +1N (ereaes) +N (ereacs) +N (cree )]— 1 ~ [13 + 10+ 9] + [446+ 5] -2= 21-324+15-2=2. '4) = N(ex) — [N(crea) + N(caea) + N(caea)] + [N(excacs) + N(excaca) + N(caegca)} ~ N(crcacacs) = 35 — (13 +124 17] + [44647] -2= 95 -42417-2=8 210N(ca)—[N (eres) +N (cats) +N (cses)) +N (creates) +N (creaca) +N (creaca)]~ — [10 + 12 + 14] + [445 +7]—-2 = 28-36 +16 -2=6. N(c4)—[N (crea) +N (cars) +. (caca)] + [NV (crcace) +N (cresca) +N (eresca)] — —B+17 +14] + [6+54+7]-2= 32-404 18-2=8. So the answer is 2+8+6+8= 24. (a) ci: number n is divisible by 2 cz: number n is divisible by 3 es: number n is divisible by 5 N(cy) = [2000/2] = 1000, N(cs) = {2000/3] = 666, N(cs) = [2000/5] = 400, N(ere2) = |2000/(2)(3)| = 333, N(caes) = |2000/(3)(5)} = 133, N(cics} = |2000/(2)(5)] = 200, N(e,e2ca) = {2000/(2)(3)(5)| = 66. N(&é2¢3) = 2000 — (1000 + 666 + 400) + (383 + 200 + 133) ~ 66 = 534 (b) Let c1,02,¢5 be as in part (a). Let cq denote the number n is divisible by 7. Then N(ca) = 285, N(crca) = 142, N(caea) = 95, N(eaca) = 57, N(crcaea) = 47, N(cxcace) = 28, N(cacaca) = 19, N(creresce) = 9. N(&e,85¢4) = 2000 ~ (1000 + 666 + 400 + 285) + (933 + 200 + 133 + 142 +95 + 57) — (66+ 47 + 28 + 19) + 9 = 458 (c) 584-458 = 76. ayaa tant ty = 19. (@) O 6; ¢2: #227; es: 2925; i 426. war )= (8 N(ey), Nea): ex tea tes baa 7 Nae) ayt+atratm= cr) =) N(ea): a1 +224 23+24=6: (*47) = (3) Nea): 21+ a24+25+24=8: (37) = (3) N(eyes) = 1 N(cies) : 21+ 22t20424=2: (7%) = (2) 21b. a. 10. N(cres) : y+ 22+ 03+ 24 = Cr)=@ N(cxes) = (f), N(eaca) = 1, N(caea) = N(Geaeaes) = (i) ~ (2(7) + (@) + ()1-+ 201+ () + Gh ‘Let c, denote the condition where an arrangement of these 11 letters contains two occur- rences of the consecutive pair IN. Define similar conditions ¢2,¢3,¢4,¢s, and cs, for the consecutive pairs NI, 10, O1, NO, and ON, respectively. Then N = Sy=111/(28) Nex) = 91/(28), S; N(cxe2) = N(exes) N(Csco) = 0, N(cxea) S3 = Sy = Ss = Se=0. G)ernenty N(cye0) = N(caca) = N(exes) = N(caes) = N(cses) = N (cae) = 71/21, and S, = (6)(71/2!}; and Consequently, the number of arrangements under the given restrictions is N(& So— Si + Sr = [111/29 - (Slo! 4, 460, 400. ) !)*] + (6)[7!/2!] = 4,989,600 — 544,320 + 15, 120 ‘The number of integer solutions for 21+ #2 +25 +24 = 19, -5 <2, $10, 19 (or 25210). N(ci) is the number of integer solutions for yy +29 +25-+...+27 = 21, 05m, 0S % for 2 4 (or y; > 3) and yj > 0 for 1 4. Then i<4 let ¢; denote messed = (2) 0) +00: Let cy denote that the arrangement contains the pattern spin. Likewise, let ¢2,¢3,¢4 denote this for the patterns game, path, and net, respectively. N(&\2,éa¢4) = 26!~[3(23!)+ 24] — (201 +21!) Let a,b,c,d,e, f denote the six villages. For 1 19 (2 20), i = 1,2,3,4. Then Moe CNS wrsice Maes) = (12) = (8),1si 6. Then the number of integer solutions for titi tus tutus = 15, where 0 < yi $5 for 1 n= 2. (a) (6000) = 4(2* - 3. 5*) = 6000(1 — oe — (1/3))@ — (1/5) = 1600. (b) 6000 ~ 1600 —1 (for 6000) = 43 Proof: 4(n™) = (n™) [] (1 - . Bui for every prime p it follows from Lemma 4.3 that if, pine pin” then pin. Therefore, @") Ta om on™ fn TTA — 2 = 1 6{n). OP $(17) = 4(32) = 4(48) = 16. For ¢(n) to be a power of 2 we must have one of the following: (1) n= 2, for k > 1; 21529, (2) n=pip2-++ ps, where t > 1 and each prime p; has the form 2 +1, for 1 1, t > 1, and each prime p; has the form 24 + 1, for lsist. If 4 divides 4(n) then one of the following must hold: (1) nis divisible by 8 (2) nis divisible by two (or more ) distinet odd primes; (3) n is divisible by an odd prime p (such as 5, 13, and 17) where 4 divides p~ 1; and (4) nis divisible by 4 (and not 8) and at least one odd prime. For 1 < i < 5 let condition o; denote the situation where the seating arrangement has family i seated all together. Then the anawer to this problem is N(22,2,2405)- Here Sp is the number of ways one can arrange 15 distinct objects around a circular table. This is (15 — 1)! = 14! N(cx) = 6(13 — 1)! = 6(12)), for there are (13 — 1)! = 12! ways to arrange 13 distinct objects [family 1 (considered as one object) and the other 12 people] and 6 ways to seat the three members of family 1 so that they are side by side. Consequently, 5; = (°)6(12!). Similar reasoning leads us to N(cie2) = 6710!) Sy = (ero) N(creaes) = 6(8!) Ss = (5) 6%8!) N(ciexescs) = 66!) Sa = (‘)o4(6!) N(creaeacacs) = 64!) Sy = (°) 64). ‘Therefore, N( Wf) = So ~ S; + Sy ~ Sy + Se - Ss = Fh.o(-1)'(*)6(14 - 2)! = 87,178, 291, 200 ~ 14, 370, 048, 000 + 1, 306, 368, 000 ~ 87, 091, 200 + 4, 665, 600 — 186, 624 = 74,031, 998, 976. Section 8.2 Eq = 168; By = 205; By = 40; Ey = 10; Ey= 0; By =1. LB = 04 =. & (a) Let denote the condition that the two A’s are together in an arrangement of ARRANGEMENT. Conditions ¢2,c3,¢, are defined similarly for the two B's, N’s, and Ris, respectively. N = (111)/{(2!)"] = 2494800 For 1 9 (or n; > 10). 7437-1) _ (43 Han= ( 37 ye) N(c1) is the number of nonnegative integer solutions for 2 + 22 + é teeta = 27 — here 21 +10 =n, and 2; = nj for 2 5 (or y; > 6) and y; > 0 for all 1 m and 2; is not in the selection. NeQ): Med=(7)isism = (7) 4 N(G:éxest4) 22512, 13. 14, 15. N(eie)) = (A) 1 Si 1, Then ¢(n) = nIT we (1 ~ (/a)) $ n(1 ~ (1/q)). Consequently, n-1 = d(n) < n—(n/g) or 1 > n/g=m>1—a contradiction! (a) Sy = {1,5,7, 11, 13,17} Sq = {2,4,8, 10, 14, 16} Ss = {3,15} Se = {6,12} {9} Sis = {18} 22616. it. 18. (a) Let k € Z+,1 < k < m. Then ged(i,m) = d < m, for some d € Dy. If k € Si,, Say then dy = god(k,m) = dz. So the collection Sj,d € Dy, provides a partition of {1,2,3,4,...,m—1,m). (b) Recall that ged(n,m) = d if and only if ged(n/d,m/d) = 1, so |S4| = {nl0 1 and m is odd, Then 2n = 2m and 6(2n) = (2) ~ Db(m) = 2466) = 2024) 6(m) = 224 — Dem) = 2[4(2'm)] = 2d(n). (b) When n is odd we find that g(2n) = (2n)(1 ~ H)[T(2 ~ 5), where the product is taken Pin over all (odd) primes dividing n. (If n = 1 then Ho-3) is 1.) But @na-pla-% = pin pin af] -4) = a(n). mm Proof: Let a = pipy? «+p? and b= ppp}? ---pl*, where pr,p2,-.. Pr ate distinet primes, and sng May 4 May Paysage EN Then c = ged(a,b) = ppneme) pina. pinion) So d(ab)é(c) = - A bre ppm ..prma —2a-2)--a-2) TT printing _ and raingrns se) #0 dlagW}e [nee - 3] | Z pa 3] f Tee| : For 1 0: (The same type of argument applies if 0 3) =1-@)-(B) = 38 = 0.326531. one aoe 23 elgg = GADLED ++ © Poy. 3 d)=re.(# GP +-J=anG yy YOA+ + 23329, 30. 31. 32. 33. (a) (Leetate a? + o\Ote +2274 82+... _ Pr(¥ 25 and ¥ > 3) (@) Pr¥ 2 SY 23) = “Sosy Ay Gy. (0) Prk 2 OY 24) = (9G = (6) Var (Y) = 4/p*, where g = 1~p Consequently, oy = 28/9 = 1.763834. (s) The differences are 3~1,6—3,8—6,15~8, and 15—15 ~ that is 2,3,2,7, and 0, where2+3424+7+0=14. (>) (35,815) (ce) {lta,lta+bi+etbtel+a+b+c4+d} = Pr(¥ 2 5)/Px(¥ 23) = audy = 4, "4. So Var (¥) = (4/8 = (4)/$) = QB) = Be Using the ideas developed in Example 9.17, we consider one such subset: 1<1<3< 6 < 10 < 15 < 30 < 42 < 50. This subset determines the differences 0,2,3,4,5,15,12,8, which sum to 49. A second such subset is 1 <5 7< 9 < 15 < 21 < 32 < 43 < 50 < 50, which provides the differences 6,2,6,6,11,11,7, 0, which also sum to 49. ‘These observations suggest @ one-to-one correspondence between the subsets and the in- teger solutions of c + cz +c3+...+ce = 49 where c,cg 20 and o > 2 for 2 5. (b) Qa etat— 24-2 pet 284...) = ghp = (1+2)%, the generating function for the sequence (73), (37), (3), (;2),.-. Hence the convolution of the given nai of seauenoe it o Cryo Where (=r) Cis) =Ccnne nen. [Tie dhe alternating sequence 1, 2,3, -4,5, -6,7,... Section 9.3 7; G1; 542; BAL+L; 443; 44-241; 4414144; 34941; $4242; 3424141; BELA HHL; 2424241; 221414; 2TH, 141141 tL (2) f(@) = 1/G ~ 2101/0 ~ 2*)101/0 ~ 2) 9] ++ = TE E/G ~ 27) (b) oz) = (+24) +241 +28) Te,0-+24) () A(z)=( +2) 4+2°)\1 +25). (1+ 21) ‘The number of partitions of 6 into 1’s, 2's, and 3's is 7. @ G/a-*)0/0 -A)N/G -#yB/0 ~ #7) (b) A/G ~ AYE /0 — BA — NEEL 2) (a) and (b) (L+a?4+at+a5+...)L+atta%t.. + e+e 4 = Mi ea (a) fe) stata? t+... +251 eettaett.. ta) Te, teh te% +... 42%) = 12, [0 - 28 - 24) (b) THE + af to 4. + of) = UR (= e)/(2 = 2h] Let f(x) be the generating funcion for the number of partitions of n where no summand appears more than twice, Let g(z) be the generating function for the number of partitions of n where no summand is divisible by 3. deepsea Gerteyits? $21 +22 + 2° + ct + 28) Let f(z) be the generating function for the number of partitions of n where no summand is divisible by 4; g(x) is the generating function for the number of partitions of n where no even summand is repeated (odd summands may be repeated). f@= te te te rear 23510. abe was (1+2")- ps eH ae gen : Bais ‘This result follows from the one-to-one correspondence between the Ferrers graphs with summands (rows) not exceeding m and the transpose graphs (also Ferrers graphs) that have m summands (rows). Consider the Ferrers graph for a partition of 2n into n summands (rows). Remove the first column of dots and the result is a Ferrers graph for a partition of n. This correspondence is one-to-one, from which the result follows. Section 9.4 (e) = (b) (es (d) = (e) ae*= (f) we (a) f(z) = 3c = 30%) 49', so f(x) is the exponential generating function for the sequence 3,3?,3°, (b) f(x) = 6c — ee Gat _ gy, 2 ao f(x) is the exponential generating function for the sequence 3,24,138,...,6(6") ~3(2"),. (e) 1,4,3,1,1,1,1,... (a) 1,9,14, -10,2,25,28,... () f(e)=lertatt et function for the sequence 0!,1!,2!, (f) f(z) = 3[1 + 22+ (2x)? + (22) +...]+Dizo f, 80 f(z) is the exponential generating, function for the sequence 4,7,25,145,...,(3n!)2" +1,... Fla) + [3 —as](2*/3!) (2) + [-1~ ao}(2"/a!) = e — (1262%)/31 (2) + [2 ~ Qar}(2"/1!) + [4 ~ 2aa}(x?/2) Seat & ), so f(x) is the exponential generating (©) 92) = (A) gla) = 2f x) + 3e° 4 [2 — 2a — 3](x4/L!) + [4 — 2aq ~ 3](2?/21) + [8 — 2a ~ 3]{z"/3!) fa) (24 (22/2) + 2/8) += (CF ~ Uh = eo (e+ (Jer - Ger + ()). The coefficient of 21/121 in (e* ~1)* is 41 — (4)3" + (Jo? - (4). (b) How many onto functions are — A= {1,2,3,...,12} to B= {red, white, blue, black}? (fle) = (Lb a + (2/2) + FL + 8/2 + (2A +P = lle + AP = 23610. (1/4)(e*)(e™ + 2 +e) = (1/4)(e** + 2c +1). Here the coefficient of x1?/(12!) is (1/4)[4*? + 2(2")] and this counts the number of signals where the number of blue flags is even and the number of black flags is even. oa) = (L+2+(2?/2!)+...)(4 (29/31) +...)? = e[(e* ~e7*)/2}? = (1/4)(e#* —2e* 41). ‘The coefficient of z!?/(12!) in g(x) is (1/4)[4"? — 2(2!2)], and this counts the signals where the numbers of blue and black flags are both odd. Consequently, the number of signals where the total number of blue and black flags is even is (1/4)[4"? + 2(2")] + (4/4)[4? — 2(2'*)] = (1/2)(4"9). We find that = ie l¢a¢egege- (ONF+ADS+ANE+WNEH, 0 1/(1 ~ 2) is the exponential generating function for the sequence 0!, 1!,2!,3!,.... wil (a) i) (1+ 2)%(1 +24 (27/21)? (i) (+ 2) +2 + (27/21) (0 + 2 + (27/21) + (29/31) + (24/41)? Gi) GQ +2P(Q +24 (27/2) (b) (1+2)-(1+24(2?/2!))-(1 +24 (2?/2!) +(29/3!)+(2*/4!))-((2?/2!) + (29/3!) + (24/41). + The answer is the coefficient of @ in (24+ 4...498)4 A(z) = f(z)g(2) = co + cre + (2/2!) + ca(29/3!) + ..., where en(a" fn!) = Thaolaia'/it)(by-i2"*/(n —i)!) = (Etao(aiby (Cin = a)" = [DtLele!/Cil(n — i)!asdy—s(2"/n!) = [Thao ("aid ~c](2"/n!) - (a) (2/2){3 + 1)/(3) (b) (2/4)[3" + 3]/(3%) (©) (/2)|3# - 1/63") (€) (/2)8" = 1)/8") (©) G/2)[8" + 1/0") (a) f(x) = (x + (2/3!) + (08/51) +.) (at (0/21) + (27/3 +...) (eet = (1/2\(e* — 1)(e2*) = (1/2)(e? — 1)(e* — e*) = (1/2)(e* — c%* ~ ce” + e*). ‘The answer is the coefficient of 2*/(20!) in f(e) which is (1/2)[4% - 3° — 27° 44], (b) gla) = (+ 2 + (29/3!) + (et/4l) +.) = (e ~ (27/2))" = el — (JeH(xt/2) + eed ~ (Set(z?/2)° + (27/2)'. The coefficient of 27°/(20!) in g(z) is 4° ~ {)(4/2)(3")¢20)(29)+ (3) (4/4)(2#*)(20)(29)(18)(17)~ ($) (2/8)(1"4)(20)(19)(18)(47)(16)(15) {o) R(a) = (1 +2 + (2°/3!) + (24/4) +...) = (eF ~ (24/2))* = &* - (Je*(a5/6) + 237