cents hendericfrmation ogi isto ¢ maxima Std dere Ber opesting many things, elading fescue sod destino en) eat ea that ‘Sot the aca at tht are arial. Ooo the 1 header ede the adr log Belden by LEN, which ie secifled bythe pte! 0 be 4 is Teng shat pect the bear eng nes of 32-5 ‘Hots it For exapl,FHLEN = 0110, heheader Uinta upot six .ni locks Aner ofthe 1 easer fis isthe le btlong total lengih tld (ocd y [TOTAL LENGTH, wich species he length ais of ‘becote datagram inling bt th beer Bella testa sen Toe length ofthe dit ree length ie dara min th length othe Dende 52°Te Pigeosal Pile 347 1) The arget poate value of TOTAL LENGTH (ch 6 bits Tong) denies the maximum foal leng in ces (locks of bis) of as Inert (dara, Wt hs ae? 1) The ugest possible ale of HLEN (wich 4b Tang determines the minum ft Rede in Sb. boca, What i is value? Wht iste Paki tl Bade leogh is oot? The mitimum (and most cosmos) header lenght Bost What he msi talaga Stes tthe data ea ofan trot agri? ow may eat ings of ces the at aa {arbetnsmited i se bade length 20 ete ‘Sn tal length a ong as pos? 5.2. The Pigeonhole Principle Introduction ‘Suppose that flock of20 pigeons fics nto et of 19 pizconholes to roost. Because thece are 20 pigeons but only 19 pigeonhole, a Teast ne of these 19 pigconboles must have atleast two i pigeors init To soe why ti re, nove thatieach pigeonhole had et most one pigeon iat [timost 19 pigeons, one pe hls, could be accommodated. This illustrates a generel principle ‘aed the pigeonhole principle which tats that iter ae more pigeons than pigeonhole, then there must beat east one pigeonhole with at least two pigeons init (see Figure 1). OF i ‘ous this pinipe spoies to ote objects besides pigeons and pigeonhole, i soa THEOREM1 THE PIGEONHOLE PRINCIPLE Iisa postive integer and k-+ | or more objec Ar placd nt k bones, then thereat lst one box cotsning two or more ofthe abject. ‘Proof: We will prove the pigeobole principle using a proof by contrapostion. Syppose that ‘one of the k boxes contains more tan ane object. Thea he tal umber of objets would be [tmnt This ise contradiction, because there are atleast k= | objects, 4 e & eo i & we ele { | @fael [ela] e |e | ala l = |e Be / FIGURE There Are More Pigeons Than Pigeonboles.COROLLARY 1 EXAMPLE EXAMPLE? EXAMPLES EXAMPLE 4 “The pigeonhole principe isa called th Ditehet drawer principle fier he nneteenth- ‘century German mathematician Dirichlet, who ofen used ti principle in his work. “The pigeonhole principe canbe used prove useful corollary about uncon. Afunetion fomasetwithk + | ormoreelementsto set with element isnctone-to-one, roof Suppose that for esch clement y inthe codomin of f we have a box that contin all clements «ofthe domain of f such tat f(s) — Because te domain contains k + 1or more ‘ements and the eodomin contains only lene, te pigeonhole principe tls ws that one ofthese necator mae clement of he domain. Tait mean at crt Be ‘Examples [-3 show how the pigeonhole principe is use. ‘Among ary soup of 367 ole, here must be at east 0 with the same bid, Desi there ae only 360 posible birthdays, Inany gro of 27 Engh word there mst be a es to tht eg withthe sae leis ‘cae there re 26 lees in the English sipabet ow many students must bo in clas to guaranto that atleast evo students receive the same score onthe ial exam, ithe exam is graded on a scale from Oto 100 points? Satin: hare 101 pose sors he al. he pigeobol ini sw the among any 102 studs there ust bea est 2 tudes with he same Sere “The pigeonhole principe isa useful to! in many proof, including proofs of suprising ress, ch as that given in Example ‘Show tat for every integer ther i multiple of » tha has only Os and in its decimal expansion Solution: Let be postive integer Consider them + integers UL, 1g. oy Ll (kere ‘he st ineger i this is sth intger with n+ [15 in is dacimal expansion). Note that there trem potible remainders when sn inegr i vided by m. Because there ae n+ 1 integers i ‘hs st, bythe pigooabole pnncple tere must bo two with the same remainder when divided by. The ere ofthese integers es th smal ne a mil of, wich has deci expansion consisting entirely of Os and Is. (, LEIEUNE DIRICHLET (805-1859) 6, Lene Dglet wns Bre ito a ene fly ing nee ‘Vastly of bet o 55 howe ina oucord Gre he Umer of lange Dit eo ‘Sve py rade even when tm Dena any ingore ber {Tedb teat jv Hepeved dp! Rema Lat Tino te eid a58 ‘THEOREM 2 EXAMPLES EXAMPLES EXAMPLE? 52 The Parone Plecle 348 The Generalized Pigeonhole Principle ‘The pigeonhole principle stats tha there must be atleast wo objets inthe same box when there are more objects an boxes. However, even mare can be sai hen the numberof obec ‘exezeds a multiple ofthe numberof boxe. Fe instance, among ary st of 21 decimal sits ‘here must be 3 that are the same. This follows because when 21 cbjects are distributed ino 10 boxes, one box must have more thas? objets. ‘THE GENERALIZED PIGEONHOLE PRINCIPLE If W objects are placed into & boxe, then thee at est one Box containing at least [4 abject, Proof: We willuse a proof by contradiction, Suppse tha none ofthe Boxes contains more than TN/2 — Lobjets. Then, the total numberof obec st ost -1) (Ee) ea where he inequality [1/4] < (Nt) +1 has heen uted. This sa contradiction because there dea otal of N objec 4 ‘A common type of problem asks forthe minimum number of objects such tata east ofthese objets must be in one of boxes when these oben ae ditbuted among the boxes, When we have ¥ objects, the gencralized pigeonhole principle tellus there must beat east - objects in one ofthe boxes a lng as [N/A = The smalls integer with Nk > r= 1, Damel, 8 = A(e~ 1) ht he ell inloger sting the mequaly TN/e] > »-Could {smaller vale of Suice? The answer ig no, Because iF we have He I) objerts we could Ptr — of them in each o he & boxes and no box would haves least objet, ‘When thinking about problons ofthis type tisusfalto consider how you can avoid having atleast abject in one ofthe bors as you ad successive objets, To avo adding arth object to any box, you eventually end up wih r~ {objet in each box There Is no Wy oa he ex object without ating an il objet n tt box. Examples 5-8 illustrate bow the generalized pigeonhole principe ie applied. Among 100 people there sre atleast (100/12) who were bom inthe same month, What isthe minimum numberof studens required in a discrete mathematics clas tobe sue shat at east si will receive the same grade there are ve posible grades, A,B,C Dyand F? Solution: The minimum number of students need to ensure tata lasts students recive the sue grad is the smallest integer N such tat [N/S] = 6. The smallest sac integer N= 5-5-+ 1 = 26. Ifyou have only 25 student itis posible For there tobe five who hive receivedeach grades tht no six stidenishaverecived the same grade, Ths, 26 the minima numberof students needed Yo ensure tat st leas sx students wil recive the same gra, 1) Howe many cards must be selected fom a standard deck of 52 cards to gurantee that t east thre cards of the sare suit are chosen 'b) How many must be sleced to guaantce that a leas thee hearts are selected?EXAMPLES EXAMPLES Solution ‘Suppose tere re four bores, on foreach sit, ad as cares ae selected they are placed in ‘he box reserved for cars of ta suit, Using the generalize pigeonhole principle, wee that W cards ae selected ther is at least one box containing at lest /] ear. Consequen, we Jenw that at east thre cards of one suit are selected iff /4] > 3. The smallest integer N sich ‘Bat [V/s] = 3iR N= 2-4 + | = 9, so nine card suc, Note that fist ards re selected, itispossibe to have two cards ofeach ut, so more than eight cards are nesded. Consequently, rine cards must be selected t gurantee that atleast thee cards of one sult are chosen. One ‘ood way fo think about this so ote thar after the eighth cris chosen, there i n0 way 10 void having a third ard of some suit 'b) We Go no use the generalize pigeonole principle to answer this quastion, because we Want to make sue that there are three hears, 20 ust oscar of oe sit. Note that i he worst cas, we an selectall he clubs, diamonds, and spades, 39 cards inal, before we select single heart The next tree cards wil be al eats, so we may need wo seiet 42 cards to get tree hears. ‘< ‘What isthe lest number of rea codes needed to gurane thatthe 25 milion phones in tte canbe assigned distin’ 10- 11 ipcluded there must be corresponding works Son W; with Ic j «10 not ncladed o Wy can acess server. (This follows besause there fe at least as many avalable saver S, a9 there are workstations W; with | = = 10 not ince) ‘Now suppose ther are fewer than 6 direct connections between workstations and servers. ‘Thea some server would be connecied tot most [39/10] = 5 workstations. (all servers were connected to at east sx workstations, there would beat least 6 10 = 6 det connections) ‘Thismeans thatthe mining nie servers are not enough tall the other 10 workstations f2EXAMPLE 10 EXAMPLE 11 THEOREM 3 52The Piguet Priipe 361 ‘simultaneously acces itferent servers. Consequently at leas 60 det connections ar needed, Tefllows that 60 the answer, < Some Elegant Applications of the Pigeonhole Principle In many ineesing applications of te pigeonhole principe the objects tobe placed in boxes must be chosen na clover vay. A few such applications wil be deseibed here Daring «month with 30 days, a baseball eam pays atleast one game day, but no mote than 4S games. Show hat there must bea pri of some numberof consecutive days ding which the team must play exactly Ld games Solon: Le , be the sumer of gems payed oor before the jth day ofthe month. Then 1,03.» .,ay 8 an increasing sequence of dint poste integer, ith | =) = 45. More (very + 1d. ae +14... ay + M4 isaloan increasing sequence of cto posive integer, wit 1S & then g divides 4 ‘A clever application of the pigonbolepriscple shows the existence ofan increasing ora decreasing subsequence of certain length in soquence of cstnetinlegers. Some definitions ‘ill bereviewed before this applications presented Suppose that, as... ay isasequence of real numbers, A subsequence ofthis sequence isasequeace ofthe form ajay... where Tish

2 Ife, = ay then, because J, = i, an increasing Sub- sequence of length +1 can be bail staring atc, by taking a, followed by an increasing ‘ubsoqunce of length begining at. Tiss a contradiction Silay iy > a, tean be Show that d; must be greater hard, which isa contradiction. ‘The final example shows hos the generalized pigeonhole principle canbe applied to an irapctat part of combinatorics called Ramsey theory, after the English mathematician FP Ramacy. In gonerl, Ramsey thoory deals withthe distribution of subst of elements of es [Assume that in 2 group of six poople, each par of individuals consists of two fends or two enemies, Show tat thee are ether thre moti friends or tires mal enemies inthe got, Salion: Let A be one ofthe six people. Ofte five other peopl inthe group, there ae either three or more who ae fiends of or tree or mere who are eaemics ofA. Tis follows fem "he geerlized pigeonhole principio, because when five objects ae dividad into two ses, one ofthe sets has a lest [5/2] = 3 elements. Inthe former case, suppose that B, C, and D are fends of 4 Ifany two ofthese theo individual are finda, then hese two and A fm a roap of thr mutual fiends, Otherwise, B,C, and D form set of three mutual enemies. The proot In the later case, when there are tre of more enemies of A, proceeds ina similar manner 4 “The Ramsey member Ron), where and ae postive integers reste than or equal to 2, denotes the minimiam numberof people as party seh that there ae either m mutual ends (of mutual enomies, assuming that every par of pole atthe party ae fends or enemies Example 13 shows that RG, 3) 6. We conlade that R(, 3) = because in a group of five people where every two people are frends or enemies, thee may not be tree mul rica or ‘vee mutsl enemies (se Exercise 28), FRANK PLUMPTON RAMSEY (1903-1930) Frank npn Ray nf epee of Magne (Cle Cambrian na eden Wicheer and Toit Caer er snag 97, ewe ‘Tul of Kips Clogs, Camb, shee be Spent treme’ of fs it Ramey tase import Srertetons timestep Nhat eno fal acy tery tase with hig corer cml Stuns pubated ne ppt “On a frobien of ural Lge any wo made cveibtons oe Isha theory of enc, He warmed an sts acre enh enon f maha. Hist rte ape of cp ie maton amen and Cambridge Unsere ela oe| 52'The MigsooeMinciple 353 11s posible to prove seme usefl properties about Ramsey numbers, bt forthe most partic s dificult tod thei eter values. Note that by symmetry i can be shown that Rm) = Rm) (ove Exercise 28), We also have RC, 2) 2 Torovery posite intern > 2 (see Enorie 27) Th exact valuss of only nine Ramsey numbers Rn 1) with =m = nate own, inching RC 4) 18 Only bounds are known fr many other Ramsey numbers, f= lading RCS. 5), which isknown wo susy 43 = RG, 5) = 49. The reader interested in learning tore ubout Ramsey numbers should consult (MiRoS} or (GFRoSp50), Exercises 1, Show tha nay Sto se seca meting gully Snes week on tarry ofthe wenk. thre mee two tat met ne sabe i tung tht no es tm eld on weckends 2. Show that there ae 30 sons in las then t ee. ‘wo hin ast ames tha begin with the sae lei 2. Adeawercontuinsa dozen own sacks nd cen ck socks ll enatched, A man ate socks ou at adorn Inthe dar 2) Hw sey Soks must he ke cu beste hat he hava eat ew seks fhe sane colar? by How sry Socks must be ecu be sre hat he {Slr witout lig tes, {3 wan tlle moet se sl tm af hving Mica tve ballot sane cla? 1) How many Rll must se sls te ie of having ‘Mleuths Be bal? Show tht among any group of fe (aot neces iy onscatne) negery thre ae wo ih the same oon wen died by 6 Leta br posineimepe Shot aong an soup of 111 (ootnecesaryconecne) begs reine 0 ‘wits eat he same remade when Tey ae died ba rconssetre igets thre is stacy one dive Show dati fi a fction fom 5 107, where Sant Te Ste nts with |] >I thn har ae lees sands in Ssh that ft) = fsa orn ther wont, fsa octone ‘Whats te minimum cunber of sues, ah of bom Comes om neo eS sas, ho abe ale in ‘erste gua tha he area ees 100 wh Cems ae sme sa? P10 Les hs = 12,385 beasetof fine dtc points ‘vith igor cores i the ty plate Stow ta the ‘point the ne josegstleatne pirates points ss itger copies w. Latin = 1,2,3.4,5.6,7.8 9, hence rne ‘Asn poi with epenerinaer spe spe, Sho "hate mga oft est one pl hse pe hs neg cordntes ow may ordre pairs fingers, ) ae need to ira tht to are tm ordered pats or) and (ey) auch tats; mod Ser med Sandy one Seemed? 8) Show ht Sv integers ae lest fam the st {pt pve ner, ere mas ea par Of these ingen witha eal 09, 1) Is the eonsason in put (a) eu if or integers ae Pelco ahr fe? ‘Sto ht if seen integers ae sels rom th fet TO postive seges: re st be a esto pis bes ties wt he sm by Ts he contin np (a ix epee ace Sele aber han seven ow mary bers mite slated fom the eet 1.2.3.4.5.6)toguate tit tls one par ofthoss How mary numbers mast be sleced fom she set {123,879,113 s}toguaanetat atest pat fens numbed upto A compu tres prot ina wareoure. Storage las {nthis watchouse ae speled by tr tle, cation ‘the ale, and sl Thee ae 50 ses, 8 rao lecatons incase, and shelves ioghout the ware ows, Whats the let narber of rout he op an haves hata east two prods must be stored ttesamc tn? Sopp th theese rine stents nase athe. imc cine at sal colege 5) Soo ht he ls ns he at est ie male st ‘et ora eat ve eae tae, 1) Shot te clas mt ve a es thes mile ts em ora Teast een faa stents, Supposettat every stdentin adie matics of 5 cadens is Feshnan sophomore, oni. 1) Show utter aeatensenne esr ales ne Sophomores ora este unr athe hs385 /Comne 1) Stow that there a ther tet tee feshme, a oust 19 sophomore oat et ve junio intel Find an icreasing subsequence of manna gt and 3 decreasing sibsequcoe of analog ne Se uence 22,57, 2.23, 10 15.21, 3, 17 has no increasing o deteasngsubsoquace of fe 22, Show that if here a 101 people of ieee ihe Standing ine, poe fed 1 peopl ine ‘edr ty ae nding inthe ine wh heii at ee er inreasing or doseasig. "23, Deserts an algoritnin peaocde for producing tbe lage inaig of etna aboueme om 24, Show that pomp of five peopl (where any to pe ‘lec ciber ech or ene) eearenoencesaly {re matin fendso res mel ene, 25, Show that ie 2 group of 10 people (hare any to eople ate ser fends or enemies) three th. {hor toe motel eds oe Tou muta! enamine there ae either tee muta eniee four mia finde 26, Use Exercise 25 show tat among ay group of 20 people here any two people ae eter fends ore ‘it hore et four mail and or oar ma 27 Show har i sa postive impr with «= 2, then he Ramsey amber RC, en 2% Show that ann arp nape with m = and 113 hen te Ramsry muses Uo) and Bn) ‘se egul 29. Sho tht thee are at assis poplin Calbia (op- lion 36min witht sme we il who mete ‘om on te sme Gay ofthe ear (bt ot necea iia the same jer Assume Bat everyone Ss hee 2, Show tat te ae 100,000,000 wage tes in the ‘Unita State carn lee ten 00,00 ols ten ‘hare ae two who eartd oly the same moar of ‘mone. othe my st yea. 1 Thee are 38 diferent ine periods ving whic lasor stp universty can be stbouled. If tote ste 677 Alieren cles, how many fleet rooms will be [3 Acer ctwedconstf i comput, Eachcom- er direst conocedto mst one ofthe cnt tr Show at re ar a nto computes ine eter tat a isi connected Wo the ue tunber Stour compu 38. Acomputernetwoconsss fsx compute Eacheom uit comucted oer e more of the ther mpi. Sho tht eee a te ops ‘he eewock a eddy coarse oe same an ‘er of ober computers [is impossible ate comput inked one of the thr an omer Takeda he cher {4 Fin he eas umber of cables equi oconeeteght “cunpues o our rites urate ta form ‘canhrecty sae our iferent printer st Your 236. Find the lent amber fcbls quite t cnet 100 empty 020 pts to garnet 20 comptes inert aces 20 ferent penser. (Hee, th Stmptogs about abe abd computes aretha se ain Lampe 9) Juty your saver #36 Prove that ta party whee there ae a east vo poops {horeare to people who know th seme umber ft people thr. 37, Anam wre the chrnpion fora pei of Shou, (ee. by as out, we mea a poviod sacing frm an ‘xt hue, su 6 #8, unl he ext our) The a ‘wreser hd at east one match aha bo mre than 125 oul matches. Stow Ghat thee prod of com seca Bours during which tan wrestr had exaly mes, 58 Lethe satonentin Execs 37 re if 24 oped ty a2 ya 92 om 38. Show that if faction om Sto T whee Sand T fhe ste an [S/F thn se se a let Imelement ofS mappedto tems aise oT Tha ‘how that there ae din elmer 8 sven tat) = fla) == J) des between 1000 sod 1099, inclusive. Show Bat ‘leet two hows fave adres tte concetne ese ‘41, Lets be a rations umber. Show ta fr some pos ‘ive iteper 3 not enceedg the aso vale a he ‘tence beeen and ie nearest itegs fst ‘tas Im 2 Let mon Be posite integers. Show tat if mien sicctm= tl objet ar placed ito t Sous th forsee = 1, Bon ft Mh Bo om tne at least, objec 143, A proof of Theorem 3 bse on the gener pigeon hate pip is oulaed in ths exeeae. The notation ‘Sed te same aha edn the poof inh ext a) Assume that fy for Ee 1,2, a? 1. Use the” enealie® pigoaboe principle show tint ‘ee ate nt tem Sen eke b) Show tat yyy, OE m1 2m ie Ae sume tat) < ay, and show thar is implies at fy > ta mbch a conan] ©) Use pts (a) and (10 show that i cere is a ineeasing beoyance of length ny then thee must be a Geersing ssequnce GF is length.5.3_Permutations and Combinations EXAMPLE1 ra Be EXAMPLE2 EXAMPLES Many counting problems can be solved by Snding the number of ways to arange a saciid umber of distinct elements of a set of a particular sizs, where the order ofthese clients ‘mates. Many ote counting problems canbe solved by finding the umber of ways to select ‘ particularnumber of clement froma set ofa particular size, where the order ofthe elements Seleced does noe mate. For example in how many ways ean We selec three stents fom & {group of five stents o tnd in line foe a peture? How many diferent committees of three Students ean be formed em a group of four students? In ths section we will develop methods fo anowers questions suchas hee. Permutations ‘We begin ty solving the fist question posed inthe inroducio to this section, aswell a elated questions. Inhow many ways can ve elect hee students from a group of ve students o standin ine for 1 petre? In how many ways ean we ange al five ofthve students in ine for picture? Solution: Fis, ote that he order in which we select the students mater, There are five ways to solect the fst studeatf stand atte tar ofthe line. Once tht stent hasbeen selected, there are four ways o solos he Second stent in th lin, Aer the stand second stents Inve ben selected, there are thre ways to select tho third student in the ln By the product tule there are S43 6D ways to ela trv dente fom a group of five students te stand inline fora pct, “Te arrange all five students in a ine fra picture, we select the fst stot in ve ways, ‘he second in four ways, the thir in thre ways, the uri in two ways, and the BRA in one ay Consent eter -4-3.2-1 = 126 wy toarange al re set nae fp pice. Example | illustrates how ordered anangemeats of dstne objects canbe counted. This lads to-some terminology. ‘A permutation of «set of distinct objects isan ordered scrangement of these objects, ‘We also ar intrested in ordered arrangements of some ofthe elements ofa st. An ordered arrangement of elements ofa setis called sn permutation. Lats = (12:3) The ordered aragemen3, 12s apemutaion ofS. The reed range, meat 3,2 a 2-permutation ofS. ‘The numberof r-permuttions ofa set with m elements it denoted by P(n.r). We can find Pin.7)sing the product rule, Let $= (e,5, }. The 2-permutations of $ ae the ordered arrangements a,c: a, ci a: ane, b. Consequently thereat six 2permtations of hs set with thre clement, To that there are alway sx 2-permutations ofa st with thre elements, ats that there are thre way o choose he fist element ofthe arangemant and to ways to choose the second element ‘ofthe arzngement because It ust be different from te et element. By the product rl, it follows that PQ, 2) = 3-2 4‘THEOREM 1 COROLLARY 1 EXAMPLE EXAMPLES Wenow use the prdctrul to fda formula for Pr} whenever w andr ae positive integers with er = 1 isa positive integer andr is an intogor with |<» = m then there ae Porn) =n = 1X2) nr 1) ‘-permutaion of st with distinct clement ‘Proof: We illus he product leo prove that this formula i correct. The first etement of the permutation ean be chosen in n ways because there ae clement inte st. Theo are — | ‘ways to choose the saond clemon! ofthe permutation, because thore aren — I elment le inthe sot afer using the element picked forthe rst position, Similny there aren 2 ways to choose the third element, andl s0 on, unl thee are exactly n ~~ I) nr | ways to choose the th element. Consequently by the produ rule, there are n= 1K = 2) =r #1) permutations ofthe set. 4 Dovethat P(r, 0) = I whenevern isa nonnegative itegerbecause there sexsi one ayo corder2eoclemenis. Thats tare exactly one ist wath no elements iat amely the empl. ‘We now sate «wef srollary of Theorem I fn and ae integers with 0 > Ged > C= 15 Stow at () = fcal ove inege ad al ine pentnih shen 168 Ue Cn stn ii mm ga i ‘fr postive eg, 1, Show da ip ade neg wi 1 en Gent 1 Sipps animes wih > 7.05 Bai Thatta expanse) Eas, he oa owet fhe sump he mon) 18, rove Pal ey sng te form) 2 Spy tear engi 1s cn. Pane ‘tehewnem ent COI) COVUME) {21h nnd a nego th 12k, hen tent 2) sings cit pHi Se theo sos sary osenmberot wate Sit eas mre cones ‘citer incenen of ie be] 1 ingen css pon tat the mal) Soot wen nsec 3. 22, re teeny (6) = (weer rand Excamoagane ites othe vase sr 2 wings etal get 3) ing sn pone bcd nm rtm 28, Shu tind ka pss gr tn (CP) -oenG Lr Us ths Mat ecm an nective deftion of ‘Seco coins 24, Shwe ps pe a age ch at Tete p stern ade () 25. Le 9b pose ince: Stow a (2) +) 16 Len and i ar. rota x boner and postive neers 2) sing combi arent Bing Pcl emi 28 Sw ti is postive neg ten 2) = 26) +9? 2) sing contingent yaa nan "2, Give a eombistaral pot that E-A() = 2! Ue Cot wo ways me of ase ¢ Sonic and toch lesan of be commits | “30. Gre conn pot at 3 tC) = a). {fam Cam nse nye mao ys Comite ih mens fsa group of be {choses ands compa ster pteaor uch tht de chipenon of he cme W's abot otserl 31. Show tata otenpy sett sane amber ose crime rune of emer an toc nevenimberafclonent “22, Prove th Bil Theor ng shel nde 22, Inti xe we wil count the amber of pat in : oe tween te Oi 0) a pt mhtht ech paths mae up ofa sero ps, where each ‘phar (No moves th lor dowd at sed) “Teo sch pth on (0,0) (5,3) a last Hee ao 1) Show iat cach uh of te ype desred can erp reseed bya bt ing contigo m Os end Te where epreseatsambve ene uit othe nd 1 Tepreseat sore one stop ) Cone rom put (a) dat eae ("7") pat of tiedesied ype ‘Use Eases 3 1 roe tht () = (whenever Es an imege wit 0 2h. (it Caer he mbt ‘tpals of te ype descr n sere a 6) {rf F) and fom (tole eA 38. Use Execs 33 rove Thorom 4, [lt Cout the umber of path with ops cf the pe denied in Ee cee 3. Every ech ph mut end toe ofthe pine nt ek Oted,- sm] $M: Use Execze 33 prove Pascal Met: int: Shor ‘datapath ofthe pe dsebedia Ene 3 fom (0.0 ‘a(t 1A, P)paertvoegh sere eek or (a~ 2) batt vough bah] 137. Prove the identity in Eerie 27 sing Exercise 33 (dt: Fs mts tat he mam of ats fom 0.0 to (ele) egue ("71"") Sond count he may Nev of pits by simmitg the aber af thee pate that suet by going ul upward for #0 eal [Give a combinatorial proof hat ifn is pot neg then gh G) = mln 2. in Show hat bat Sides ca te yet ale et of wt fn le ‘ets together th wo necessarily ie cleo ‘fom hssubset Farthemnrs express te ight and ie Senin | "38, Determine» formula involving bis cet fx the term of Sequence fl trea hse [sed (Hine Looking Pascal tangle willbe elp ‘Athongh infintly many sequences stat with pected Seto terms, each of the flowing ice the sat of 3 Sequence ofthe pe dein | 2) 13,6, 10, 15,21, 26,36, 45, 55.66, 1) 14 10,20,38, 684 (2, 16820, ©) 1.2.6, 20,70, 282,924, 5492, 1300, 8620, 5,6, 10,20, 35, 70,126, 31.15.35 3, 15, 88,495, So, 18568, 16280, 135e7, ices, 5.5_Generalized Permutations and Combinations Introduction Inmany counting problems, clments may be used repeatedly. For instance, ete or digit may be used more thn ance on license plate. Whon a dozen donuts ze selected each variety ca be choson repeatedly. This contrast wth the counting problems discussed ert inthe chapter ‘where we considered only permutations and combinations in which ech tem ould be sed at ‘most onc. Inti ection Wwe will Sow how 0 solve counting pcbems where elements may ‘be used more than onc. ‘Also, some counting problems invoveindistnguishabl laments. Forinstance, tocouatthe ‘umber of ways the lees ofthe word SUCCESS canbe rearranged the placement of ential ‘eters mast be considered. Thiscontass with he counting problems discussed earir where all clement were considered dsinguishabl, inhi sein we wil describe how trove counting problems in which some elements are incistnguishable “Moreover, inthis ection we wil explain how o soe another impertant class of counting problems, problems involving eounting the ways to place dsnguishate clement in boxes. An ‘xamole ofthis typeof problem isthe number of diferent ways poker hands can be dest to fur players.EXAMPLE1 ‘THEOREM1 EXAMPLE2 55 Gremize eats sl Combaaions 371 “Taken togeter, the methods described erie in his chapter and the methods invoduced inthis ston form a useful toolbox for solving «wide ange of counting problems. When the ‘itionel methods diseased in Chapter 7 are added this ssc, you willbe able to solve a Tange percentage of tho counting problems that arise ina wide range of aeas of su. Permuta ns with Repetition Counting permutstions when repetition of clement is allowed can easily be done using the product ue, as Example I shows. How many strings of length ean be formed frm he English alpha? Solution: By the product rl, because tore are 26 Ltrs, and because each eter can be used repeatedly, we se that there ae 20” rings of length. “ “The number of -permuttions of st wit n clement when repetition i allowed is given in Theorem | ‘The mumber of r-permutatons ofa set of n objects with repstition allowed i Proof: There are m ways to select an element of the set foreach of the r positions inthe ‘permutation when petition i alle, bocaure fr each choice alm jects are salable [Hence ty the prot fle thor are or permutations hen petition illowed 4 Combinations with Repetition Consider hese examples of combinations with repetition of element allowed, How many ways ate thor to select four piece of rit from a bowl containing apple, oranges, ‘nd pear ifthe order in which the pices ae solocod dos not mat, only the typeof rit and tot the individ piece mater, and there are at lest four pices of each typeof fruit inthe bow? Solution: To solve this problenn we list all the ways posible to elect the fut Thre are 15 ways 4 aples oranges 4 peas 5 apples, 1 orange apples, pear S oranges, 1 apple 3 oranges, I peat 3 peas, apple 3 pears, orange 2 apples, 2 oranges apples, 2 pears 2 oranges, 2 pears apples, Lorine, {pear 2oranges, apple, I pear 2 pears appl, | orange “Tre salution isthe numberof combinations wih repetition allowed from a thee-lement Apple, orange. pea 4 To solve more complex counting problems of this type, we neod a general method for counting ther combinations ofa -elrent xt. In Example 3 we wil sate scha methodCoating EXAMPLES FIGURE 1 Cash Box with Seven Types of Bil How many ways are there sees ve bills fom cash box containing $1 bil, $2 bills, $$ bills, $10 ils, $20 bills $50 bills and100 bile! Assume that the onde in which he bill re chosen doesnot mate, hat the bills of ack denomination ae indistinguishable, and that there te at est Bue leaf ach ype, ‘Soluion: Because the onder in which the bills are selected does not matter and seven dit ferent types of bils can be selected as many as five times, this problem volves counting ‘combinations with epeitan allowed fom a set with seven slement, Listing ll posites would be tedious, because there aces large numberof slatons. Instead we il lusts the use of technique for counting combinations with rpctiton allowed Seppose that a cash box as seven compartments one 1 hold each typeof il sillstrated in Figure I. These compartments are separated by six divides, a shown inthe pictire. The choice of five bills coresponds to placing five markers in the sompartments holding diferent {ypes of bills Figure 2 laste this corespondence fr te iferent waysto select veil where the sx dividers ar represented by basa th ive bills by sta “The number of ways to select five bill corresponds tothe numberof ways to artange six bars and five tare, Consoguenty, the numbar of ways to sce the fe ily te aes Ut ‘ways to select the positions of the five star from | posible postions. This correspones to ‘the numberof unordered selections ofS objet fom a set of I objet, which ean be done in CCC 5) ways. Consequemty there are |z | |S) || [ae] | [ewe | |a slelee| fa] | foo Bown!) | S |B) «| | [ae] fale FIGURE 2 Examples of Ways oSelet Five Bills,‘THEOREM 2 EXAMPLE EXAMPLES 5.8 Geen ruts nd Combining 373 vas to choose fe bil flom the cash box With seven types oil. < ‘Theorem 2 generalize this dscusion ‘Thereare Cin +r ~ lor) = Cn +r — lyn I)r-combinations fom aset with alements hen repesiton of elements is allowed. Proof: Sash r-ombination of a st with elements when repetition is allowed canbe rep- resented by ait of n~ I bars and rst. Them ~ I bars ae used to mark off diferent ells, wid the 1h cell containing a star for each time the th element ofthe set occurs inthe ‘combination, For instance, a Gcorbinatin of set wih fou elements represented with thee ‘ats and sx tars, Here representsthe combination containing exactly woof the firs element one ofthe second element, none ofthe thie element, and three of tho fourth element ofthese {AS we have seen, each ferent list containing n ~ I bas and r stars coresponds to an +-combinaton ofthe et with elements, whoa rpettio isallowed. Tae numberof such isis Con =I bar} bscaure each ist corresponds choice of he positions to plac ther stars fromthe I +r postions tit coatainr starsandn-~ I bare, The numberof sch ists is also qual C(n ~ 1 brn 1), because each Ist corresponds toa choice ofthe m1 positions toplace them — I bars a Examples 4-6 show ow Theorom 2 it aplid ‘Suppose that cookie shop has four diferent kinds of cookies. How many diferent ways can ‘Sit sokies be chosen? Assume that ony the type of cookie and not the ivi cookies of ‘he oder in which they are chosen, matters Solution: The numer of ways to choose sx cookies isthe number of combinations of a set ‘with four elements, From Theorem 2 his eqals C+ 6~ 1, 6)= CO, 6). Because 9-8-7 rr there are #4 diferent ways 1 chose the sx cookies < 60.9) =C0,.)= ‘Theorem 2 ean also be used iad the numberof solutions of certain linear equations where the variables are integers sobjest to constants, This illustrated by Example. How many solutions does the equation ntatyell Ive, wheres, 5, and sy are nonnegative iene? ‘Solon: To cout the number of solutions, we note that a solution corresponds to 2 way of “slcing IT items from meet with tree elements to that itera of type ono, x items OF ype34 $/Couting EXAMPLE6 two, and. tems of type three ar chosen. Hence the numberof olutionsis equal tothe number ‘of fi-combinations with repetition allowed from a st with thee elements. Fom Theotein 2 i follows that here are CGB+M~ 1,11) = 003,11) =C(13,2) = & Zan soltons The number of solutions ofthis equation canals be found when the variables ae subject to consraintsForinstnce wecan find he umber of solitons where the variables are ineger with 1 l.zy 2 2,and sy 2 3. A solutonto the equation sbjet to these constants corresponds {oa selection of 11 items with items of Spe one, rts of type 0, ad mms of type thre, where, in addition, there i at least one tem o ype one, twa ems OF Peto, ad vee items of type thre. So, choose one item of eype one, fo of Pe to, and toe of type the. ‘Tren selet five additional tems. By Theorem 2 this canbe dane in cors-L9aconaco.n=F8 vy The tec hina cptoatec egret Example 6 shows how counting the umber of combinations with repetition allowed ass in determining the vale of variable thas incremented each ime a certain typeof nested amp istavened ‘What is the value of afer the following pseudocode hasbeen execute? Solution: Note thatthe inital valuo of i and that ie added to Keath time the nested Toop Is traversed witha soquonce of integer i3.+. ly such hat I Sig Siny SoSH sm The numberof such sequences of integers is the numberof ways to choose m integers from {l.2....m), with repetion allowed, (To see thi, note that once such w sequence hes been selected i we onder the integers in the Sequsace in nondecreasing order, this uniguely defines ‘assignment of gs iq-t,--+-1) Conversely every such asignment corresponds to unique unordered st) Hence, ftom Theorem 2 fellows tha k= Cp +m — I,m) artis code hasbeen executed. 4 The formulae forthe numbees of ordered snd unordered selections ofr elements, chosen ‘with nd without petition allowed from ast with m elements, are shown in Tableuu 5. Generizn Remuttons nd Combinations 3 TABLET Combinations and Permutations w ] int without Repeion. E ee Some elements my be indstngushabl in counting problems. Whe hiss the case, care must >be faken to avoid counting tings mor than once. Consider Example 7. EXAMPLE How many different stings can be made by reordering the leters ofthe word commie) SUCCESS Solution: Because some ofthe eters of SUCCESS are tho same, the answers nor given by the umber of ermuttons of seven eters. This word contains tee Ss,two sone Uy andone E. ‘To determine te numberof diferent stings that can be made by reordering the eters fs note hatte tree Se can he plaond among the sven pouons nC. 3) ferent ways. leaving out poston fe, Thenthe two Cs.an be placed in (8,2) way, leaving Wo ffx postions. The O Ean be placed in C(, 1) way, leaving just one position fee. Hence & canbe placed in C1) ‘way. Consequey from the product ule, tbe numberof diferent strings tat canbe made is pores COCO. DCR. NCU.D = 5h SF ‘We can prove Theorem 3 using the same sort of easoning asin Example 7, THEOREM 3 The number of diferent permutations of objets, where there re n indstingishable objet of pe I,m nditnguishabl objects of fype 2, ..., and my ndisinguishable objets of ype kis Proof To determine the numberof permatons frst note thatthe my objets of ype one canbe placed among the x positons in C(r.m;) ways, leaving nm position ie. Then the objects : ‘ftype eve canbe paced in C(a — ys 2) wa, leaving mm — positions fee. ContinueEXAMPLES placing the objects oF type tes, ..., type FI, unt atthe last stage, ms objects oF type ‘an be placed in Cn my ~ 3 °°" m-t.me) ways Hence, by the prdct rule the tte ‘number of diferent permutations ie Comm yea = mys) C= my = — asm) nt fammt_G ate =aphaatin= a = or Distributing Objects into Boxes “Many counting problems canbe solve enumerating the vays objets canbe pacednto boxe (here the one these objects are placed into the boxes docs not matter). The ebjeci cn bs iter distingshabl, thats, diferent from each other, oc initingushabl, tht conse. “dencal.Distinguishable objects are sometimes sad tobe labeled, whereas insinguishale objets ae sid to be unlabeled. Similarly, boxes can be distinguishable that ifferen or indngushabl, thats, identical, Disnguishable boxes are often sad to be labeled, while inditinguishable boxes are sad to be unlabeled. When you solves counting problem usin, the model of distributing abject into bores, you ned to determine whether the objects att «stingushable and wheter the boxes ae distinguishable. Although the content ofthe Counting problem makes these two decisions cle, counting problems ae sometimes ambiguous ad # tay be neler which mode! applies. In sucha cae iis esto sate whatever sumptions you ‘ue making and explain why the particular model you choose conforms to your assumptions ‘We will se tat tore are closed formulae for counting te ways to cisibute ober ‘isngustabe or inaisingshabe, no astingushable bones. We ae not so lucky wc ne count the ways to distribute objec, distinguishable or indistingishae, into indistnguishable bones; there are no closed formato us in these cases DISTINGUISHABLE OBJECTS AND DISTINGUISHADLE BOXES _ Weis consider the ease when distinguishable objects ae placed into distinguishable boxes, Consider Example 8 ib ‘which the object are card andthe boxes are hands of players, How many waysare there o distribute hands of Scand to each of fourplayers from he standard dec of 52 cards? Solution: We wil use the product rule to solve this problem. To begin, note tat the fs player ‘canbe deal 5 cars in C62, 8) ways. The second player can be det cards C(47, 3) W398 because only 47 cuts are lel. The third player canbe dal cards i C(62.5) ways, Final, te fourth player ean be deal Scars inC(3?, 5) ways Hones, the ttl number of ways to de four players S cards each sr an ata (32, 9047, 9182, 9007.5) = A SE. 32 Hass < Remark: The solution to Example equals the numberof pexmiatons of 5 oboe, with $n Aistingnshabe objects ofeach of four different types, and 32 objects fa fith ype. ThisequaltyTHEOREM 4 EXAMPLES EXAMPLE 10 ‘can be seen by defiing a one-to-one correspondence between permutations of thi type and ise tributions of endothe players, To define this correspondence, st order the ar from 1052, "Thon cos dealt tothe fit player correspond to th cards inthe postions assigned to objects of the fst typein the permutation Simin, cards deal othe second, hit and fourth player, spectively, corespondta cardia the postions assigned to objects ofthe second third and fourth ‘ype, spectively. The card not dal toany player correspond to cards inthe psitions assigned {Dobe the ih ype. The reader should verify that this is 3 on-0-one correspondence Example 8 sa fypiea problem that volves dstbuting distinguishable objects ino dis tingsishable boxes. The distinguishable objects are che $2 card, and the fv distinguishable ‘boxes ae the hands ofthe fur players andthe et of he deck. Counting problems that involve Aistibuting distinguishable objet ino boxes ean be solved using Theorem “The nunber of ways to distribute m distinguishable objects into distinguishable boxes so thatm objects ae placed int box = 1,2, on equals ‘Theorem 4 canbe proved sing the product le. We eave the dels as Exereise 47, can also ‘beproved (se Excise 48) by sting up one-to-one correspondence between the permutations ‘outed by Theorem 3 and the was to dstnbue objects counted by Theorem 4 INDISTINGUISHABLE OBJECTS AND DISTINGUISHABLE BOXES Counting the utr of ways of placing indisinguishable objec ino distinguishable boxes turns out to bee same as counting he numberof n-combiatans (or set wil {cleats when Fete Ton re llowed. The reason beh hii that thee fs 4 oneto dy we say that {h.aus, sod) saparttlon ofthe postive integer ito j postive integers. We see that if (0) ‘sine numbee of partons of mito at mas € postive integers, then ee ace p(n) ways to ‘dstbutem indistingushable objet nok indstingulshale boxes. No simple chose formula ss EXAMPLE 11 ‘box ean conta a many a six books? ‘box The ways we can pck he books are $4), where ac, ee fr this nome Exercises Inow many dient ye can ive ema be seed itoqder rom 20th toe lemons when repetition ‘wet? 2. now many diferent way anv ements be selected order fom tet wits ve lets when rept 6 lowed! 2. How any stings of x eter ae there? 4. Every diya sdent randomly choses a sadich for Tunch rm plo wrapped sandwiches ther ar sx nds of stndviches bow many een ways te hee forthe det wo howe sandwiches for he seven ays ‘ofaneckifteonein white sandwiches ae chosen 5. Hl say ways ae ther ain he obs tire Employes if each slay enn Be gen mae ha ose Be 6 How many way re hee o sles ie unordered ee ‘ret lm ase with te element when pete lowed? 7. Mow mary ways ae feet eet tee unordered eb ‘trent from st with ie elem when epetion i 8 How mary éifient way ave there fo choos dozen ona rom th nro ata dont hop? 9A bge sop has onion bagel, opny sed bass ess ‘hacks sly bagels, pamper ge, same seed Saeki tel soda bagel How many way etic to chore 2) sites? 1) denen gs? 1) wo one bags? 1 dozen gee witht stone ofeach kind? 13 doen tagels witht en ies eng bagels and 20 Inoe han 0 sy bagels? 10. A cross shop has pin ross, cherry erin, ‘hocalitecromartssinoad rls apple eos, el bros evans How many ways are there 1 Choo 2) a dozen coisas?1) three doa cosas? ©) to dozen cols wih a eat two of esc kind? {wo dnen cosas wh a su tha wo brocel © to doze oissans wit est ve chocltecis Sand at ast te sland erat? dozen roast witht est oe aa css, fas geo chery coisas at let ts choc Ie rosa east one sma cost eas, ' sppe cost ado ne tha te boc I. How may way ar there chose eight cine om & ity tank onaaig 100 seat panes a 8 ee ‘ached 12, How many diferent combinations of pennies, ick, limes, quarts, anal dll an piggy bs conaa (ties 0 come 12 Abook publisher ha 300 cope ofa discrete mut ies bok How many ways re thet ste then books tn thew ivr washout thesis of te bok te inaisnguitae? 14. Hw many solaons thee whe equation eres. and ry ae nonnegative ines? 15 How many solaten artes athe suaion where 1.2.34, 5, onneptv ine ch ast 3) 52 Pheri 1.2.3.4,57 02x) = 107 055 S412 Samay 2 Oss 08, <8ade > 8 17. Hos many strings 10treary agit (0,192) ae ‘harcore exaly Woe, he sad five 20? 19 How many singsof20-decinal distr thee that on tant furs bce 2, one 0 5, Santee 9? 19, Suppose dha ae faily as 14 ilen, neing "wo ses of eta tplets he ses of eri ns ewe sda eden How many eye ate thee 10 seat tote cilen in aw of cas he Wen ‘al epee oc tins canst be disinguthed owt ons 20. How many seins tht the negli shee 35 ae aonsgaive neg? [i ‘rue av aueian sare schtha sy yy fell] Hoy ary ways are hereto dsb i indistinglsh shi bale nnedtingusbate bis? 22, How mary ways ae there oso 12 indstingih sbi balls ints dstngushate bins? 23, How many wayearethere to Gut 2 distinguishable tyes ino x singisable bots to tht mo ees Sec placedimesch box 24. How many says ache to bute 1S diagutbe lets into ve dstinguistale bess thatthe boss, ave on, vo, ce, ou, tl ve bjt thee spect 2. How may este integer tex than 00,00 have he sin of dc digis equal 197 26. How many postive integers esha 00,00 bare x ‘acy one gt equal and anes sum of digs equa 27. There ae 10 questions on a dsr materiel sam, How many way are there to ang sats the [oblen dheru ofthe oes 100and cach question [Sworh tes Spots? Show that thee are C47 — a) — gp = ge mgt 9) erent noted ection, tn objets of tent type hat meade a least Set of te ont gr abe at pe Sao. and ‘hp ot ype Sng mast begin wih I bi, mast aca thes adds onal I bits Go that atl of for I bits set a include tial of 120 bts and mt ve at et oO ‘Sts ftonng cach {M. How many diferent ings canbe mae the ters ‘MISSISSIPPI usage lates? $3 How many deren sings canbe mad fram the fers Sn ABRACADABRA, wig al te ten? 32, How many ferent sings canbe mae rom the Les in AARDVARK, sing I te lear al ce at te conecutne?| 233. How mary dif sigs can be mage fom he ts in ORONO, sing ome oral ofthe tes? ‘ML How many sings wit fe or mere carts cas be formed tom he eer in SEERESS? 35 How may segs wah sven or mor chutes an be Ferme or he eet EVERGREEN" 34, How many dere bi sigs can be formed sing sx {and eek Os 37, student hs tree anges, 89 papayas sod tro ki ‘eats Ihe sen cats one pace ofeach yd nly he ype a tte fo any fern oy antec tebe conse? 38. profesor pocks ber eallecton of 40 ines of 3 ‘mathemati joursl in four ones wth 10 ous Per», «. " 1) cachboxismumbered 2 hathy are dings? 1) the bono ar ens vo that hey cao he desi sea? oe ny ws ae thet ta ina pace fom he ‘niin 00.0 0h poe (3-3) by lag stp oe tin inthe paste eden, oe un nthe pose 9 Secon or one unt ine poste det? (Moving tnt agave 9, cr deston probit sha mo Ickrcking alowed.) How any ay ae there tte space fromthe ‘iin (000,040 te po (33:4) by aking tp ne ut inh pose poste y poatves, oposite How anyways re tht del ands fave cade 0 ‘ach fe pipers oma saad desk of 3 cade? ete the cat of tnd deck ae dato four Payers ow many erent wigs are het el dge hans fou pes? How macy ways ater deal ands ffi cards 0 ach of payers Bom a eck conning 48 det a bow many ways ean dozen books be plac on four 1) ifthe books re inistingusabe copies of We ame by ifma wo booksate the sme andthe poston of he baton testes maser re ms no TD'aakr placing cach book spray Set wa he Sequence 234 represent be sees Reeser Thebooksby ht 12 2 Pedy other piace yb, -- and} Ho any ways cabo be paced on ding 1) ifthe boos we indingusable copies of he ae by) ifma wo books atthe sing andthe ponon of he A sel nos 12 books in ar How many ways ate ‘seo chee ive Boks so hat no oan oaks ine eboser? (Hin Represent ebooks tha re chosen ty bara the boks ct honey tas. Cout he ae ber of sequences of ve at and seven sas 0 that mo ‘we bas aac] se the post rae o prove Tear $y ist placing bcs te bos. thn cig obec inthe bod Prove Theorem 4 by Sst stig up oseoone co ‘epondnce Hever jermtatines of bjs wh inditingishsbe objects of pe = 1.23. and Uhedrbatonrotn abject bossa bjs te pnced inbox = 2,3. k aed hen Sing ‘Teor 3 "Wn ts exccice we will prone Theorem 2 by set tng up 4 onedo-one corespodeoce between the Set ‘of prombaions wih repetition allwelof S (1.2.3.0 rn) and beset of sambinaton ofthe st Wa 1) range he elements isn combination, with ep ‘io allowed, of § io an inctesing Sequence Shs SS. Show tl the sequence formed ‘pyadding A Lio heb em ity icra Coola hat is sequences mae wp of sin tdenest oT 1) Show tha the procedure deste ia (8) dines ‘ omete-onecomeondese bawen the st of ombinntions, wi epetion allowed of Sand her omblasons of [bt Show he Comespondence an be evened by asocieg to the combination torscraeletT wit zy cn crear e 2 the eombition with ropetin allowed fom 5, formed by site k= oe the A sdement] ©) Conde tht tare ae Cle +r — 1.7) combi tuna with epettion allowed fan's os with 50, Hoy many waysurhrewdebue fvedistingsishable sljets imo thre sings boxes 1, How many waste tortoises distinguishabe siyets ii ou night ne ota sch of thetowes consist et one be? 52, How many ways ards top ve temporary employees How muny ways af tee 0 pu ix temporary em ployer int our sential ofies so that tere it Teast oe temporary enplyee in exch of these four sites? ‘4. How many ways are hereto disibue iveinsinguish. ‘hic objects in ie indtinguhable bees? ‘56. How many way are thereto satis ndings ble objects int for indstingusbbletbones oth each ‘the ones contin alent one objet? ‘6 How many ways ae thet packet ented DVDs ino ve ndingustabie bone that echo conta seas one DVD? 57, How aay ways are thee 10 pack nine ides! Bsmt ts isngusabe boxes a aca bok 8, How many ways arth todtibue febalsino seven ote exch Box ms have stmt oneal nti 1 both he tls boxes ae ele? 1) the als are abe but he one auld? ©) the als re lteed butte bas abel? 4 batt bal and nes ar ale?” 99, How many waysare thereto dsb fe als ito ce toue fetch Box ms ave enon bal ini 2) both the ballad bones ae abled? 1) the al abe bt the ones aula