Chapter 15 Combinations, Ordered Partitions COMBINATIONS Suppose we have a collection of n objects. A combination of these n objects taken rat a time is any selection of r of the objects where order doesn't count. In other words, an r-combination of a set of n objects is any subset of r elements. Example 1.1; ‘The combinations of the leters a,6,¢,d taken 3 et a time are (abel, (2,04), (a6. d}, {8,6,d) or simply abe, abd, acd, bed Observe that the following combinations are equal; abe, acb, bac, bea, cab and cba ‘That fs, each denotes the same set (0, b,c) ‘The number of combinations of n objects taken r at a time is denoted by C(n,7). The symbols ,C,, C,,, and C* also appear in various texts. Before we give the general formula for C(n,7), we consider a special case. wany combinations are there of the four objects, a,b, e and dy taken 3 at How a tim Each combination consisting of 8 objects determines 3!= 6 permutations of the objecte in the combination: Example 1 ‘Combinations Permutations be _| obo, web, bao, be abd | bd, adb, bad, ba, dab, dba aed | ocd, ade, ead, ea, dac, dea bed ‘Thus the number of combinations multiplied by St equals the number of permus — cuss = ray aus) = PD hence C(4, 8) = 4 a8 noted in Example 1.1, A and 3! = But P(4, 3) Since any combination of n objects taken r at a time determines r! permutations of the objects in the combination, we can conclude that Pin,r) = 1! O(n, 7) 432 ‘Thus we obtain ‘Theorem 15.1 cnn = BY? = tt = Fma7 161162 . COMBINATIONS, ORDERED PARTITIONS (CHAP. 15 /, Recall that the binomial eoeffeent () was defined to be | /n\ cm) = (7) We shall use C(n,r) and a) interchangeably. Example 13: How many committegs of $ can be formed from fasentially, « combination of the & people taken 8 at can = (3) = sari ob ed Bach committee ie, Tao Example 14: A farmer buys 3 cows, 2 pigy and 4 hens from «man who has 6 cows, § pigs and S hens. How many choices does the farmer have? The tamer ean han 2 co ($) war he i (8) wae ad the hens in (#) ways, Hence altogether he can choote the animals in 4) (GK) = PARTITIONS AND CROSS-PARTITIONS Recall (Page 60) that a partition of a set X is a subdivision of X into subsets which are disjoint and whose union is X, i.e. such that each a €X belongs to one and only one of the subsets. In other words, the collection (4,,4,,...,4,,) of subseta of X ia a partic tion of X iff (i) X= AVA --UAw; (fi) forany Ay Ay, either A= A) or AAs = 9 ‘The subsets of a partition are called cells = 20-10-70 = 14,000 ways Example 21: Consider the following classes of subsets of X= (1,2, ..,8,9) © (2,8,5), (28), (4,8,99) 6) 12,9,8), 2 4,6,8), (6,7,90] (68) [0,8 5}, (2, 4,8,8), (7,9)] ‘Then (f) isnot a partition of X, since TEX but 7 does not belong to any callin (t) Also (i) is not a partition of X since 5€X and 6 belongs to both (1, 3,8) and 15,78). On the other band, (it) is m partition of X since each element of X Delonge to exactly one Suppose {4,,A,,...,4,) and (B,,B,,...,B,) are both partitions of the same set X. ‘Then the class of intersections (4, " B,} form a new partition of X called the eross-partition. Brample 22: Lat (A,B,C,D) be the partition of the undergraduate students at a university into freshmen, sophomores, juniors and seniors, reepectively; and let {MF} be the partition of the students into males and females, respectively, ‘The’ eroae Partition consists of the following: AM: male freshmen ADF: female freshmen BOM: male sophomores BF: female sophomores COM: male juniors CF: female juniors DOM: male seniors DF: female seniorsCHAP.) | COMBINATIONS, ORDERED PARTITIONS 163, ORDERED PARTITIONS Suppose an urn A contains seven balls numbered 1 through 7. We compute the number of ways we can draw, first, 2 balls from the urn, then 8 balls from the urn, and lastly 2 balls from the urn, In other words, we want to compute the number of ordered partitions (Au, 4s, Ad) of the set of 7 balls into cells A, containing 2 balls, 4, containing 8 balls and A, cont 2 balls. We call these ordered partitions since we distinguish between ((1,2}, (8,45), (6,7}) and ((6,7), (8, 4,5), (1,2)) each of which determines the same partition of A. Now we begin with 7 balls in the urn, so there are (2 ) ways of draving the first 2 balls, i.e. of determining the frst cell A,; following this, there are 5 balls left in the urn and 80 . of determining the second cell 4,; finally, there are 2 balls left in the urn and so there are () ways of determining the last eell A,. Hence there are \ / there are (3) ways of drawing the 8 balls, TysV2) _ 16 543 21 _ oy a\s\2) ~ Terese ~ : different ordered partitions of A into cells A, containing 2 balls, A, containing 8 balls, and A, containing 2 balls. We state the above result in its general form as a theorem. Theorem 15.2: Let A contain n elements and let 7,,n,,....m, be positive integers with ntn,tso +n, =n, Then there exist nYfn—m)\/n=mom) | (/mamoma snr ae ee) me difterent ordered partitions of A of the form (A,.A,,...,A,) where A, contains m, elements, A, contains n, elements, ..., and A, contains n, elements. ‘Now observe that (rVey2) ot \2A3A2/ ~ 2tei 312i 2tor “ grat2t since each numerator after the first is cancelled by the second term in the denominator of the previous factor. Similarly, Gras) Tm Mal (mM = Ma)!” al (n= Mi = Me— Ms)!” |? ‘The above computation together with the preceding theorem gives us our next theorem,ipa 164 COMBINATIONS, ORDERED PARTITIONS (CHAP. 15 ‘Theorem 15.3: Let A contain n elements and let mtmtso tm, =n. Then there exist sty be positive integers with ail mal male different ordered partitions of A of the form (As, As, ..., As) where As con- tains 1 elements, Az contains nz elements, .. ., and A- contains m, elements. ‘Example $1: In how many ways can 9 toys be divided between 4 children if the youngest child fs t receive 3 toys and etch of the others 2 toys? We wish to find the number of ordered partitions of the 9 toys into 4 cells containing 3,22 and 2 toys respectively. By Theorem 16.3, there are oe wet = 3520 such ordored partitions. Solved Problems COMBINATIONS 15.1. In how many ways can a committee consisting of 8 men and 2 women be chosen from T men and 5 wormen? 1) f 3/ 5 women n() warn Hone be mite cn be ehnn in (3)($) ‘ways, and the 2 women can be chosen from the T8684 a0 wap The ncn be hewn fom te ( 152. A’bag contains 6 white balls and 5 black balls. Find the number of ways 4 balls can ‘be drawn from the bag if (i) they can be of any color, (ii) 2 must be white and 2 black, (iii) they must all be of the same color. () The d balls (of any color) can be chen from the 11 balls in the urn in ('f) = 3 380 ways, a) The wie al can shown n ($a and te 2 Mak ta cant hon n (8) war sous eae ({)(5) = $f Ff = twa tee wie aa i ta m of drawing 4 black 16 +5 = 20 ways of drawing 4 balla of the same color. «iy There ae (2) = 18 mae af ravine wit tty and (8) = 8 wae The there 153. A delegation of 4 students is selected each year from a college to attend the National Student Association annual meeting. (i) In how many ways can the delegation be chosen if there are 12 eligible students? (ii) In how many ways if two of the eligible students will not attend the meeting together? (iii) In how many ways if two of the eligible students are married and will only attend the meeting tozether? 12) a) = 1211109 (The Asn ante cen tom he 18 eet in ( = een, Let A and B denote the students who will not attend the meeting together.CHAP.) * COMBINATIONS, ORDERED PARTITIONS 165 BA, Mats TE A nor nd th dltn cn cen in (18) = 182282 tio Ebr A or Bk ot th t,he he ttn an Bee I 2:([2) = 2 MEE2 = aioe ‘Than, altogete,the dlatin can betwen in 2109 240 = at war Method 2. If A and B are both included, then the other 2 members of the delegation can be chosen in 19) = evan Thor there ao 948 = (6 wae the etn cob ce A and B are not both included (U1 and D tah mln dD et th he tn seems (3) = nove Tem coat 2 ten aren Hen (i (28) = ern Aosthes,tedetin con Ye nen 2 0+ 6 = 25 war There are 12 points 4,B,... in a given plane, no three on the same line. (i) How many lines are determined by the points? (ii) How many of these lines pass through the point A? (iii) How many triangles are determined by the points? (iv) How many of these triangles contain the point A as a vertex? ye) _ eet 6) mai see pues me es (2) aE ot : (ll) To determine a line through A, one other point must be chosen; hence there are 11 lines through A. (di) Since three points determine «tris ie) Mathod 1. To determine a triangle with vertex A, two other points must be shove hence here 12) 2 TE ae cag with A a Method 2 . There are (12) = 1:10 = 16 ngewe A of the triangles do have A as a vertex 153, A student is to answer 8 out of 10 questions on an exam. (1) How many choices has he? (ii) How many if he must answer the first 3 questions? (iii) How many if he must answer at least 4 of the first 5 questions? o)=(R)- TF () The # questions can be ssected tn ( 5 ways, (ibe aes ttt 8 coating ht nee te eer ns ton tn © (ey ae aN re ct at i eon Sr ak sim (5) =o vur One rhe srr ofthe Be usin hen te an tha tem 40 (3) = (5) = Bway, a be an hom the thr 4 gone trom the tnt 6 in ($) = ({) = S warns tence he can chooue the 8 quentions in 5-5 26-wayn. Thos he hie’ total of 35 choees 1 exci n (2) = = amr166 : COMBINATIONS, ORDERED PARTITIONS [CHAP. 15 15.6. How many diagonals has an octagon? ‘An octagon as 8 id ‘Thus there are () = 2 and 8 vertices. Any two vertices determine either side or # diagor = 28 sides plus diagonala. But there are 8 sides; hence there are = 20 diagonals. 15.2. How many diagonals has a regular polygon with m sides? ‘The regular polygon with w slides he 1 vertices. Any two vertices determine either a oe > sides plus diagonals. But there seo goa Tose tae ace (2) fre n sides; hence there are nin= 1) _ iagonals 15,8. Which regular polygon has the same number of diagonals as sides? tr te pretng potion 27 atupaaia Thee ‘The regular polygon with w sides ha wwe seek the polygon of m sides for which wa 3n Since m must be a positive integer, the only answer is 5. In other words, the pentagon is the ‘only regular polygon with the same number of diagonals as siden : =m or mtn = On or wn = 0 or nin—B = 0 159. A man is dealt a poker hand (5 cards) from an ordinary playing deck. In how many ways can he be dealt (i) a spade flush (5 spade fan ace high spade flush (5 spades with the ace), (iif) a flush (5 of the same suit), (iv) an ace high full house (8 aces with another pair), (v) a full house (8 of one kind and 2 of another), (vi) 8 aces (without the fourth ace or another pair), (vii) 8 of a kind (without another air), (viii) two pair? (The 6 spades cam be dt tam the 19 apadee ip ($2) = MeHBsttestse 1287 ways, (i) TE he receives the spade ace, then he can be dealt the other 4 spades from the remaining parecer 12 wate in (!2) = HEE Ge apn (5) Thre re te, oh och cant dn (i 8) wee fash canbe dea in 4-(!2) = sat war (iv) The 8 ace can be deat from the 4 nes in ($) = (£) = dwayn ‘The pair can be selected in 8 war ate ad oh pc edit (4) apn Th tae Bh al hhouse can be dealt in wie($) = 288 ways, () Open a ewe 1s mgs and a iden eat ($) wr ner (4) ws kind can be selected in 12 ways and 2 of this kind can be dealt in ‘Thos a full hhouse ean be dealt in ()a2-(8) = (Jeu (5) = 144 ware (Observe, by (ii), that a flush is more common than a full house.)CHAP. 15) . COMBINATIONS, ORDERED PARTITIONS 167 (vi) The 8 aces can be aclected from 4 aces in ($) ways. The 2 other cards can be selected from on nemo (3) the remain 12 dst (2) waa ada neh nd ca be da war ‘Thos a poker hand of 3 aces can be dealt in (2): (Bete = ane wan (i) One kind can be wed 1 wae and 3 af hs Kind an tm dn (2) warn Tha tens ean be ded from th rnng 1 nem ('2) wap and ard ah in cn te any Tara oer nd of 3 Kn eal 912 ways (to nd rn pul cab ace rom nds (22) wap ad nd * cases (4) sage as ae ai a ag 6 A i eae Ti fr ha tt pire di (28). ($)-(Q)eatea = sane rae 15.10, Consider 4 vowels (including a) and 8 consonants (including b). (i) How many 5 letter “words” containing 2 different vowels and 8 different con- sonants can be formed from the letters? (ii) How many of them contain 6? (iii) How many of them begin with b? (iv) How many of them begin with a? (vy) How many of them begin with a and contain 6? and the 3 consonanta ean be (Teed ewe ca be ed fom te von in (4) teat the Bema (8) way Petraes 8 te can be ering fhe ef aro in 9m (4) ./8) (o)*\a, "Thus we can form |) +81 = 656-120 = 40,20 words ii) The 2 vowels can sil be selected in (3) ways. However, snce 8 is one of the consonants, the ster sna ean be lec thermal 1 cosas (1) wap Again ech Bicer ante arene wos wort 6! way The we ca frm (: (3) = seatsimy = 1610 wore oii ways, The 4 letters can be arranged, following 5, in 4! ways. Thus we can form ()-()-« (2) "(2 \2/ +21+24 = 3026 words beginning with &168 . COMBINATIONS, ORDERED PARTITIONS (CHAP. 15 : te) Teter oul ean be hn 8 wap and he 8 onan eae in (§) war : Se {diy oe cate i mare. Hie esten 42(8)-G = (v) The other vowel can be chosen in 3 ways, and the 2 other consonants can be chosen in (5) wn te # het en be ace Ewing 49a Thee wc fm 1.11 How many committees of 5 with a given chairman can be selected from 12 persons? ‘The chairman ean be chosen in 12 ways and, following this, the other 4 on the committer can se conn fom the 1h remaining in (2) warn, Tha tere ae 22¢(11) = 12-490 = sen Zale } 15,12, Find the number of subsets of a set X’ containing n elements. Method 1. ‘The number of subsets of X with rn elements i given by (*). Mence, altogether, there are (3) + (3) + @) + + G2) + @) : ‘subsets of X. The above sum (see Problem 18.30, Page 151) is equal to 2, Le. therw are 2 subsets of X. Method 2 ‘There are two possibilities for each clement of X: either it belongs to the subset or it doesn't; hence there are times Qed ways to form a subset of X, ie. there are 2° different subsets of X. In how many ways can a teacher choose one or more students from six eligible students? Method 1. By the preceding problem, there are 2 = 64 subsets of the set consisting of the six students. 1e empty aet must be deleted since one or more students are chosen. Accordingly, there 84-1 = 63 ways to choose the students, Method 2. Either 1,2,3,4,5 or 6 students are chosen. Hence the number of cholees is (+ (2) +0) +0) + +0) 6+ +t + E+ 15.14. In how many ways can three or more persons be selected from 12 persons? ‘There are 24-1 = 4096-1 4095 ways of choosing one or more of the twelve persons. Now there are ; (12)2(12) = 1208 = 70 warn of mln oe ote of the tte end Hae thr are ~ 08 are feng tn moreCHAP. 15) . COMBINATIONS, ORDERED PARTITIONS 169 PARTITIONS AND CROSS-PARTITIONS 1515. Which of the following are partitions of X = (a,b,e,d,e,f,9)? () [la b,e}, (a), tf. 9) (ii) [la b.e), (odie), (f.9)) (ii) [(a, bee}, (de), (f-9)] (i) Thin is not a partition of X since €X, but « does not belons to any cell (6s) This fe not a partition of X since ©€ X and belongs to both (a,b,c) and (ede) (il) This fea partition of X. Each element of 2 belong to exactly one cell IBUG Let of = (Ay Ay..A,} and B — (B,B,,...,B,) be partitions of the same set X. Show! that the cross-partition ('= (4,5, 4,€0f,B,€B) is also a partition of X. Lat x€X. Then x belongs to some Ay, and to some By, since of and @ are partitions of X. ‘Thus zEA\OB,, and s0 belongs to a member of the eronpartition. and 4,,8,. Then £€ Ay and Ay, whence AYR, = AB, On the other hand, suppose 2€ A,B, AG=Ay, since of ia a partition of X. ‘Similarly, ,~B),. According and 90 Cis s partition of X. Let X = (1,2,3,4,5,6,7,8). Find the cross-partition of each pair of partitions of X;~ () ((1,2,8,4), (6,6,7,8)] and ((1,2,8), (8,4,5,6,7)] Gi) [(1,2,8,4}, (6,6,7,8)} and ((1,2), (84,5), (6,7,8)] "To obtain the crosspastition, intersect each set of one partition with each set of the other. © 0,2,3,4000,2,8) = (2; £5,6,7,8) 0 (1,2,8) = (8) 42,2,8,4) 0 (34,5,6,7) = (8,4; 5,6,7,8)068,4, ‘Thus the cross-partition is [(1,2), (8,4), (8), (5,6, 7)] GH) G,2,8,4) 00,2) = 2s 15,6,7,8) 9 (1,2) = 0 (2,2,8,4).0 (84,8) = 4845 (5,6,7,8) 9 (8,445) = (5) 0,2,8,4) 9 (6,7,8) =O; 15,5,7,8) 9 (6.7.8) = (67,8) ‘Thus the erose-partition ia (01,2), 41 (8, (6.7,8),2] or my, (1,2), (8,4), (8) Remark: We do not distinguish partitions which difer by the empty set 15.18, Let X denote the domain of a proposition P(p, 4,7) of three variables: X = (TTT, TIF, TFT, TFF, FTT, FTF, FFT, FFF) (i) Partition X according to the number of T's appearing in each element. (ii) For the proposition P = (pq), partition X into T(P) and (T(P))*. (Recall that T(P) is the truth set of P.) (iii) For,the proposition Q = ~p~ (gar), partition X into T(Q) and (T(Q)y*. (iv) Find the cross-partition of the partitions of X in (ti) and (ii). (3) Combine the elements of X with the same number of Ys to form the cell: (PF), (TRF, FTF, FFT), (TTF, TFT, FIT), (TTT?)x70 COMBINATIONS, ORDERED PARTITIONS [ORAP. 15 ). Construct the truth tables of P= (p-*g)er and Q = ~p= (an P Q wren (i) ana [oF nd Q fs true Sn Cases 1,2,2,4 and 5, Thus Note that P is true in Cases (lines) 1,5 and 7, qe) = (IPT, FTT, FFT) and TQ) = (TTT, TTF, TPT, TFF, PTT} land so the required partitions are [(T9T, FIT, FPT), (TTP, TPT, TPF, FTF, FFF)] and (TT, TTR, TPT, TFF, PTT), (PTF, FPT, FFF}] (iv) The eross-partition is obtained by intersecting each set of one partition with each set of the other: 2 (PTT, PTT, FFT) 9 (TTT, TTF, TPT, TRF, PTT) = (TPT, FIT) (TPT, PTT, FFT} 0 (FTF, FFT, FFF) = (FFT) (rrr, TPT, TFF, FTF, FFF) 9 (TTT, TTF, TPT, TRF, PTT) = (TTF, TFT, TPF) (PTF, TPT, TF, PTF, FFF) 9 (FTF, FFT, PEF} = (FTF, FFF) "Thus the eross-partition is {CTT PTT), (FFT), (TTF, TPT, TFF), (PTF, FFF] ORDERED AND UNORDERED PARTITIONS Tie-In how many wars ean 7 toys be divided among & children if the youngest gets T tayn and each of the others gets 27 re nn te nur of dred partion of 7 bjt ina cle containing 3,2 and# object sepuaivy, By Tianen 164, ere a0 gydigy = 218 eck rites 1520. There are 12 students in a class. In how many ways can the 12 students take 8 different tests if 4 students are to take each test? Method 1. at nu i ether of se i stdents fo ts eotaning 4 eaten ech By Theorem 163, there are pity = 84050 ach partion. Mahe hes ae (12) wae hu & st et At flo i te ae . (8) way ten sno tbe he cand nthe eng et at ed a Tho segs, hr are (2) (5) = apo = S450 wa fr h nde ae aCHAP. 15} : COMBINATIONS, ORDERED PARTITIONS im 1521. In how many ways can 12 students be partitioned into 8 teams, A,, A, and Ay, so that each team contains 4 students? Method 1. Observe that each partition (A;,Ay As) of the students can be arranged in 3! = 6 ways san ott peton. ice the prcting on) here woe qi = BAS) cheered aie beer aae ee ee sot 2 . Tot A det on he adn, Then thr ac (3!) ap oe 8 her tet be cxtac ue a as A Nowe ee + enw ttn thse nt A hen tee sm ({) vee ct 8 sf eg sds oo mat tam BT Sepang 4 sae conte the ed tam, Ts aloes, tne are (2) -(3) BST oe nee wpe wd 1522. In how many ways can 6 students be partitioned into (i) 2 teams containing 8 students each, (ii) 3 teams containing 2 students each? () Method 3. ‘There are gfgy = 20 ordered partitions into 2 cells containing 8 students each. Since each unordered partition determine 2 ordered partitions, there are 20/2 = 10 unordered partitions, Method 2. Tat 4a nth nets hn hs re (8) 16 waa hn oer ts totem none no Tie tte st tee a ne ee there are 10 ways to partition the students, (i) Method 1. ot ‘There are grgfpy = 90 ordered partitions into 8 cells containing 2 students each. Since ‘each unordered partition determines 8! = 6 ordered partitions, there are 00/6 = 18 unordered partitions Method 2. Let A denote one of the students, Then there are § ways to chooas the other student to be on the same team as A. Let B denote a student who isn't on the same team as A; then there are $ ways to choose another student to be on the same team as B. The remaining 2 students eonatitute the other team. ‘Thus, eliogether, there are 5+3 = 15 ways to partition the students, 15.23. In how many ways can a class X with 10 students be partitioned into 4 teams A, A, B,,B, where A, and A, contain 2 students each and B, and B, contain 3 students each? Method 1 . There are gyargy = 26300 ordered patitons of X into 4 cll containing 2,2,8 and 3 students, reapectively. However, each unordered. partition (4y.Ay.By By} of X determines 21-21 = 4 ordered partitions of X, Thus, altogether, there are 25,200 ‘unordered partitions, ‘Method 2, There are (10) ways to choose 4 students who will be on the teams Ay and Ay, and there are ‘ ‘3 ways In which each 4 students can be partitioned into 2 teams of 2 students each. On the other hhand, there are 10 ways (sve preceding problem) to partition the remaining 6 students into 2 teams ‘ cringe ch Ton, seer, thr ar (10) 840 = Hr 8e19 = 0 gn vat ee )va : COMBINATIONS, ORDERED PARTITIONS [OHAP. 15 1524. In how many ways can 9 students be partitioned into three teams containing 4, 8 and 2 students, respectively? Since all the cells contain different numbers of students, the number of unordered partitions 260, ants the number of ordered partitions which, by Theorem 158, 8 gar 1525. i) In how many ways can a set X containing 10 elements be partitioned into two cells? (ii) In how many ways can 10 students be partitioned into two teams? () Method 1. ch subset A of X determines an ordered partition (A,A®) of X (where A° is the com- plement of A), and so there are 210 = 1024 such ordered partitions. However, each unordered partition (A,B) determines two ordered partitions, (A,B) and (B,A), and s0 there are 1026/2 = 512 unordered partitions, Method 2 Let 2 denote one of the elements in X. Now X~(z} contains 9 elements, and so there are 28 = 512 ways of chooting © subset of X—{2) to be in the aame cell as z. In other words, there are S12 such partitions. (Observe that (X,Q) is one of these partitions) ii) Here we assume that each team must contain at least one student, hence we do not allow the partition for which one team contains 10 students, and the other tem none, Accordingly, there are 612-1 = 511 possible partitions. Supplementary Problems ‘COMBINATIONS 15.26. A class contains 9 boys and 8 girls, (j) In how many waye can the teacher choose a committee of 4? (i) How many of them will contain at least one giel? (if) How many of them will contain exactly ie ail? 1527, A woman has 11 close friends. () In how many ways can she invite 6 of them to dinner? (ii) In hhow many ways if two of the friends are married and will not attend separately? (i) Tn how iy waya if two of them are not on speaking terms and will not attend together? 1528 A woman has 11 close friends of whom 6 are also women. (i) In how many ways can she invite Sor more of them to a party? (ll) In how many ways can she invite 3 oF more of them if she wants the same number of men as women (including herself)? 1528, ‘There are 10 points A,#,... in a plane, no three on the same line. (i) How many lines are Getarmined by the points?” (i) How many of these lines do not pass through A or B? ii) How many triangles are determined by the points? (Iv) How many of these triangles contain the point A? () How many of these triangles contain the side ABT 1530, A student ia to answer 10 out of 12 questions on an exam. (i) How many choices has het (ji) How many if he most answer the first two questions? (ill) How many if he most answer the frst or fecond question but not beth? (iv) How many if he must answer exactly 3 of the first 5 questions? (3) How many if he most answer at least 3 of the first 5 questions? 1531, How many diagonels has a (i) hexagon, (i) deeagon?CHAP. 15 . COMBINATIONS, ORDERED PARTITIONS 173 1532. Which regular polygon has (i) twice as many diagonals as sides, (ji) three times as many ingonals ae aides? 1838, (3) How many triangles are determined by the vertices of en octagon? i) How many if the sides of the octagon are not to be aides of any triangle? 16M. How many triangles are determined by the vertices of « regular polygon with m sides if the sides of the polygon are not to be aldes of any triangle? 1538. A man i dealt » poker hand (6 cards) from an ordinary playing deck. In how many ways can hi be dealt (i) « straight Aus, (i) four of a kind, lll) a straight, (iv) & pair of cen, (v) two of a ind (a pair)? 1838. ‘The English alphabet has 26 letters of which 6 are vowels (© How many § letter words containing 3 different consonants and 2 different vowels can be formed’ (ii) How many of them contain the letter 82 (li) How many of them contain the letters ® and ef (iv) How many of them begin with 6 and contain the letter o? (©) How many of them begin with & und end with ot (vi) How many of them contain the letters ¢ and 6 (vil) How many of them begin with a and contain (vit) How many of them begin with ® and contain a? (ix) How many of them begin with a and end with 61 (2) How many of them contain the letters a, and ef PARTITIONS AND CROSS-PARTITIONS ASST. Which of the following are partitions of X gt © [lee.0, (), to] (iv) (Case, 48, (0h ye, (0)] i) [Cou Ce, (0,09) ( [loed, (o,u 0} (at) (C04), Co), (0)} (7H) 10, (0), fe,0), 8, G0}] 15M, Find the croos-partition of each pair of partitions of (0) (02,8), (4,5,6)) and (1,85), (2.489). (ii) [{1,2,8), 4,5,6)] and ((2,2), (8, 4,5), (6)} (2,2, 8,4 1539. Let X denote the domain of « proposition P(p,qsr) of three variables: X = (TT, TTF, TPT, TPF, PTT, PTF, FFT, FFF) (i) Partition X according to the number of F's appearing in each element. (ii) For the proposition P = (pv 9)Ar, partition X into TIP) and (TWP), (iti) Partition X into T(q) and T(~2). (iv) Find the erose-partition of the partitions in (ii) and (ii) 1840, For any proposition P= P(p,¢,...), show that [T(P), T(~P)] forms a partition of the domain of P. tition (Ay, Ap, .../A,) be a refinement of the partition (By, Bp -.., subset of some B,. Describe the croas-partition, } that is, each 1542. Show that a cross-partition is a refinement (see preceding problem) of each of the original partitions. ORDERED AND UNORDERED PARTITIONS 1848. In how many ways can 9 toya be divided evenly among 3 children? 15.4, In how many ways can 9 students be evenly divided into three teams?m4 1845. 1848, wat. 16. 1549, 1550. 15s. 1552 1528. 152. 1528, 1630. 1532, 1.8, COMBINATIONS, ORDERED PARTITIONS (CHAP. 15 In how many ways can 10 students be divided into three teams, one containing 4 students and the others 3? ‘There are 12 balls in an urn, In how many ways can 3 balls be drawn from the urn, four times In how many ways can a club with 12 members be partitioned into three committees containing 5.4 and 8 members respectively? In how many ways can n students be partitioned into two teams containing at least one student? In how many ways can 14 men be partitioned into 6 committees where 2 of the committees contain Simen and the others 27 In how many ways can a ast X with § elements be partitioned into (i) three ordered cells, (i) three (unordered) cella? In how many ways cans set X with 4 elements be partitioned into (i) three ordered cells, (i) three (unordered) cells? In bridge, 18 cards are dealt to each of four players who are called North, South, East and West ‘The distribution of the cards is called a bridge hand. (f) How many bridge hands are there? (ii) Tn how many of them will ene player be dealt all four acea? (Ii) In how many of them wi ‘each player be dealt an ace? (iv) Tn how many of them will North be dealt 8 spades and South tthe other 5 spades? (v) In how many of them will North and South have, together, all four aces? (Remark. Leave answers in factorial notation.) Answers to Supplementary Problems 0 (3) = 0 (2)=(2) =m on 2) =a w (3) = «00, co ()+(8) = 20, can 2-($) = w a1 ()-() = to oe (B)+() (() + GE) + QE) + OO) 0 (19) = 48 wv (8) = a8, wn (2) = 198, ow (2) (is) = (#) = G)G) = © m(i)=()=% QE) +@Q) +O) =m 10 0 ({)-#= 9. (8-1 =a ‘Hint. By Problem 16:7, the regular polygon with w sides has (x! —$n)/2 diagonals, (i) (8 —Bny/2 = Be or m= 7, (h) (n= mye wi) =m m ()-(f)-r2H 225 38, 8CHAP.15) COMBINATIONS, ORDERED PARTITIONS 15 BY = a[358) a, sae (5) =0(*74) <8 = feo WS, 6) 4-184, (38-48 = 64 (A 1-00 = 1008, ata te ameter of sel frorhes) cy ($)(32) +49 = asso, was ($)(12) 642 = 108240 aha ala was 0) (B)(p) +58 = s96000 ) sae(8)-st = 10 in a. (28) a1 = ae 09 (PCE) 81 = amo — yy 4-()ea1 = onz00 we) aeiaest = aieo tay s9-(p)+st = mato oy 4-(%) 41 = an2t0 com 19+(§) +41 = 4860 (vit 1a20 ASST. (ye, oo, (yo, () yo yu a 0 (81 (8, HO 6 (0.2, 8, (40,00) Mao) [orT), (rR, TPT, PPT), (TPE, PTE, FFT), (FFP) (i) (TTT, TFT, PPT), (TTR, TPE, FTF, FFT, FFF)) Gu) (CTT, TTF, PTT, FTF), (TPT, TF, FFT, FFF)] 6m) (CTT, PTT), (TPT), (TTF, PTF), (TFP, FFT, FFF)] WAL Udy.) 4. the refinement partition. WAL A\NB\CA, and A\NB\CB, or wa, shh = 1680 ssa. sept = 0 oe (8)(8) = 20 Tot 1 tq or (10/8) = a. Gigi a = 20 or (10)(5) = n100 wt 1548, gpg gy = 860.600 121 wat, ttt = 2120 Wak, B11 1550. () 9 =27 (ach clement can be placed in any of the three cella.) (Gi) The number of clements in the three cells can be distributed as follows: (2) {(8), {0}, (OH, @) (C2), (2), £0}, (ed (44D, 42), CD] ‘Thus the number of partitions ie 1+3+1 = 5, 1. (ii) The number of elemente in the three cells can be distributed as follows: (a) [(4), 1551. (I) 6 0), (03), (8) (C9), (1), COV}, Ce) [E2), (2), (0)}, Cd) [(2), (1), {1)]. Thus the number of partitions fe 'Tedeaye =u, ast be Bt w) (38) 390 1582, mat) arpftern 0 «le aaraaterm ™ (8) area 81 4a . 4st 5 481 @ @orsnanig +? worms + ?Ssarmistis = *TTrerierieT