122 ¢ COMBINATORICS ‘Theory and Problems for Senior High Math COMBINATORICS Many problems in probability and statistics require careful analysis of complex events. Combinatorics" basic Toots are to develop systematic ways of counting. These systematic counting methods will allow the solving of complex counting problems that are used in all facets of life. FUNDAMENTAL COUNTING PRINCIPLE (The multiplication principle) + Ifwe can perform a first task in.x different ways + If we can perform a second task in y different ways + If we can perform a third task in z different ways, and so on. Then the first task followed by the second and so on can be performed in.x + yz... . different ways, Example 1: A man has 4 shirts and 5 paits of pants. How many different outfits can he wear? Solution: 4x = 20 different outfits Example 2: A particular automobile has 4 different models, 3 sizes of motors and 6 colour schemes. How many different ways could an automobile be ordered? Solution: 4x3 x 6=72 different ways Example 3: The first 4 questions on a quiz are true-false questions, while the next 6 questions are multiple choice with possible answers a, b, c,d and e. How many different possible answer sequences are there for these 10 questions? Solution: The first 4 questions on the quiz can be answered in 2x2 x2 2= 2* ways, and the next 6 questions can be answered in 5 x5 x 5x5 x5 5= 5® ways. So, the total number of different sequences are 2*x 5° = 250 000 ' NOTES/ WORK AREA QUESTIONS 1. Suppose Sam can travel from Calgary to Vancouver by car, train or bus, and from Vancouver to Victoria by boat or plane a) How many different modes of transportation can Sam use to travel from Calgary to Victoria? b) Make a list of different possible transportation modes for Sam. 2. There are 4 roads between cities A and B, and 3 roads between cities B and C. a) How many ways can a person travel from A to C by way of B? b) How many ways can a person make a round tr back to A by way of B? from A to C and ©) How many ways can a person make a round trip from A to C and back to A by way of B, without using any road twice? Copyright © by Crescent Beach Publishing — Allright: reserved. Cancopy © has ruled that this book is mot covered by their licensing agreement. No part of this publication may be reproduced without explicit permission ofthe publisher. langageSOTTVTTIIIIIIIIIIIII Theory and Problems for Senior High Math 3 10, ‘A math quiz consists of 5 multiple choice questions with 4 choices each. How many possible answer keys are there? A.coin is tossed. If it comes out heads a die is then tossed once, ifa tail appears, the coin is tossed one more time, How many outcomes are possible? List these possibilities Ifa student has a choice of 6 different computers, 4 different monitors and 5 different printers, how many ways can a person select a computer system? A breakfast consists of the following menu: Juice: apple, orange, grapefruit Toast: white, whole wheat Eggs: scrambled, over easy, poached Beverage: coffee, tea, milk Choose one item from each category. How many different breakfast combinations are possible? In a7 horse race, Bill thinks horses 1, 4, 6 will be the top 3 horses in the race, but not necessarily in that order. If Bill is correct, how many different outcomes are possible? ‘The maze below is constructed so a novice must pass through a series of one-way doors. How many different paths are possible? A license plate consists of 3 letters followed by 3 digits. Determine the total number of possible license plates if the following conditions apply’ a) there are no restrictions on letters or digits b) no letter or number can be repeated ©) alletter or digit can be used twice How many different 3-letter “words” are possible such that the letters of each word are in alphabetical order? (For example, the “word” ADF is in alphabetical order.) COMBINATORICS ¢ 123 NOTES/ WORK AREA Copyright © by Crecent Beach Publishing Al ighs reserved. Cancopy © has rll ha this book is wot cored by ‘her Heensing egreoment. No part of is publican may bereproduced without cpl permision ofthe publisher124 ¢ COMBINATORICS Theory and Problems for Senior High Math TREE DIAGRAMS A tree diagram is a very good way to visualize and count the number of outcomes of an event in a systematic way. Example: Don and Pat are in a fishing tournament. The first person to catch 2 fish in a row or 3 fish in total ‘wins the tournament. How many different outcomes are possible? Solution > i : r D > re oe ae ~—p aint | P| Count the ends of the Pp ne Pp branches ~ 10 different ~e cutcomes are posite Questions NOTES/ WORK AREA 11, List all possible outcomes for the gender of the children in a farnily that hhas 3 children, 12 Bruce plays a game in which he has an equal chance of winning or losing. He starts with $1.00, and plays by betting $1.00 each time. If he wins, he gains $1; if he loses, he loses $1. He plays until he has $0 or up to 4 bets. How many ways can the betting occur? 13, Ray and Ann play in a tennis tournament. The first person to win two games out of three wins the tournament. How many outcomes are possible? 14, Trisha goes to a restaurant to order either a sandwich or a hamburger. She can use mustard, ketchup or relish. Trisha never has ketchup on her sandwich, and never mixes ketchup and relish. How many different combinations are possible? 15. A town has only 3 TLV. stations A, B, C with starting time for different shows listed. If you decide to watch T.V. continuously from 7:00 p.m. to 10-00 p.m,, how many different combinations of complete shows are possible? Time A | 7:00 8:00 9:00 10:00 B | 7:00 | 7:30 | 8:00 9:00 10:00 c | 7:00 | 7:30 8:30 9:30 | 10:00 Copyright © by Crescent Beach Publishing ~ All rights reserved. Cancopy © has ruled that this book ts not covered by ‘their licensing agreement, No part ofthis publication may he reproduced without explicit permission ofthe publisher. | aanannnaaanararanearaaaneaaanTAAAAAAAAAAAAARAAKeeeeansSURO T OOF EHEC TEESHETTTTITII SPDDITFHFDTDDEBEDTEDEEGS ‘Theory and Problems for Senior High Math COMBINATORICS + 125 FACTORIAL NOTATION A pattern developed involving the product of consecutive positive integers from | to n is denoted by n! and read as “n factorial.” nn! = the number of ways 1 different items can be arranged. 5+4-3.2-1=120 (5 different items can be arranged 120 ways) (a 11=2) 1 1 by definition Note: When solving for n, n must be a counting number, so reject fractional, zero and negative solutions eg, n(n—2)(n+3)(Qn—1) =O m=2 , reject n= 0,-3,3 : (+n)! Example 1: Simplify. @* can Solution: Take the largest factorial value and reduce it to the lowest factorial value, then cancel. (m4 0! (n+ Din =D! (1 (1-0 =(n+In=n +n Example 2: How many different words can be made using all the letters in abode Solution: 5 leters, therefore, 5! = 120 different words QUESTIONS NOTES / WORK AREA 16. Without using a calculator, evaluate: 8! wor 4! a b) 71-51 ¢ a 5 y ) a 17. a) Write 20-49 18 17 in factorial notation. b) How many ways can 6 different books be arranged on a shelf? ©) How many different numbers can be made using all the digits 1,2,3,4,5,6and 7? 18. Simplify each of the following to an expression containing no factorial notation, a foie) py) Carden! (nl) (Qn+1)Ka—D! 9 MaDE(n=2)! a) MDE, =D =) mol g —aeGat aI (at !-2(n =D! 2 19. Solve: 3Ma=I! 95 wy 2D! 9 (n-3)! 24(2n -3)! Copyright © by Crescent Beach Publishing ~All righ reserved. Cancopy © has ruled that this book is wot covered by ‘heir licensing agreement. No part ofthis publication may be reproduced without explicit permission of the publisher.126 ¢ COMBINATORICS ‘Theory and Problems for Senior High Math PERMUTATION (RULE A) Note: Rule A is just the counting principle put into a formula. A permutation is the arrangement of r objects chosen from n objects such that ‘© the objects are all different © no object can be repeated ‘© order makes a difference (for example, ab and ba are different) (n=r)(n = P= [un n—-2)... nr 2 F= [nr 2).. MN Gn! Example 1: How many different 3 digit numbers can be made using the numbers 1, 2, 3, 4,5, 6,7? Ri Th Fs SAE Goya ay 276-5 20 ilferent numbers Permutation: Pn 7 Solution: P(7,3)= Example 2: How many ways can a president, vice president and treasurer be selected from a class of 25, students? 25! __ 25! _ 25-24-23-22! Solution: 45, = BE BPA TS TPT 8 25-24 23= 13 800 we olution: as = BE" Spi 7 3 800 ways, Example 3: How many ways can 4 books be arranged on a shelf if they are selected from 10 different books? 10! _ 101 10-9.8-7-61 at 10, 4)= RETO = 10-9 8-7 = 5 040 ways Solution: PO0.4)= T= gr a NOTES / WORK AREA QUESTIONS 20. How many different ways can 5 tickets be selected from 40 tickets? (Note: ABC, ACB, BAC ete. are considered different) 21. A 120-room hotel has reservations from 6 guests for 6 different rooms. In how many ways can the rooms be assigned? 22, How many ways can the batting order of a 9-member softball team be : listed? 23. How many different groups of four letters can be made from the letters A,B,C, D, E and F if the letters can only be used once? 24. How many ways can 3 boys and 3 girls sit in a row if: a) there are no restrictions on where they sit in the row? b) all the boys sit together, and all the girls sit together? ©) only the boys must sit together, the girls choosing the other seats? 25. A person must deliver packages to 6 different locations. If the order is randomly determined, how many routes are possible if the exact opposite route does not count as a different route? 26. How many ways can 5 people A, B,C, D and E sit in a row if A must be to the left of B but not necessarily next to each other? 27, How many ways can 5 people A,B, C, D and E sit in a row if A and B cannot sit next to each other? 28, How many ways can 5 couples sit in a row in a movie theatre if all couples must sit together? 29. How many ways can 5 people be seated around a round table so that the relative arrangements of the people in the group is different? Copyright © by Crescent Beach Publishing — Allright reserved. Cancopy © has ruled that this book Is not covered by ther licensing agreement. No par of tis publication may be reproduced without explicit permission ofthe publisher. SHSHSHHHAAHHAHDHAAADAHNHHAHAHNHHNHHHHAAADARARARAAAARARARARAHRARAA‘Theory and Problems for Senior High Math COMBINATORICS ¢ 127 PERMUTATION WITH REPETITION (RULE B) Note: Rule Bis just Rule A, but using all the objects available, and then taking into account not wanting 10 double possibilities when there are similar items. ‘The number of permutations of n objects in which mare alike, n, are alike, ete. is 5s Where ny 1p +My toesectm mt nln, ny Example; How many different 4-letter “words” can be formed using the letters, WEED? Solution: Since there are 4 letters, the total possible ways are 4! = 24 words, but the two “E"s are indistinguishable, so eliminate this duplication by dividing by 2! al 2 2 different words. ‘The 12 words are as follows: weed eewd — deew—ewde wede eedw dewe ewe wdee —ewed ~— dwee —edew = 12 words QUESTIONS NOTES / WORK AREA 30. How many different 10-letter “words” can be made using the letters from the word STATISTICS? 31. A football team plays a 10-game schedule. How many ways can the schedule end with $ wins, 3 losses and 2 ties? 432. Nine people apply for a job in which 2 people are selected to work in an office and 3 in the workyard. In how many different ways can the selection be made? 33. How many different codes can be made using the letters A, A,B, B, B,C, C, C, D, D if the code must contain all 10 letters? 34. How many ways can 5 apple trees, 4 pear trees, and 3 cherry trees be arranged along a fence line? In how many ways can 30 teachers be assigned to 6 schools, with each school receiving an equal number of teachers? 36. In how many ways can 12 jurors and 3 alternate jurors be selected from a group of 25 prospective jurors? 37. a) How many different arrangements are there using all the letters in the word ECONOMICS? b) How many of these arrangements begin with the letter C? ©) How many of these arrangements have the two C’s together? 38. Point B is 4 blocks east and 5 blocks north of point A. Point Cis 7 blocks north and 4 blocks east of point B. How many paths are there from point A to point C going north and east only? 39. How many ways can 6 people work at 3 different offices if people are in each office and 2 individuals refuse to work together? Copyright © by Crescent Beach Publishing - All rights reserved. Cancopy ® has raled that this book is not covered by their licensing agreement. No part ofthis publication may be reproduced without explicit permission of the publisher.128 ¢ COMBINATORICS, ‘Theory and Problems for Senior High Math COMBINATIONS A combination is the arrangement of r objects chosen from n objects such that ‘the m objects are all different ‘+ no object can be repeated ‘+ order does NOT make a difference ( ab and ba count as one object in a combination but two objects in a permutation) Remember, there are , P, = r! permutations of r distinct objects. But this different ordering of distinct objects are not to be counted separately. ‘Therefore, to get a formula for the number of ways in which objects can be selected from a set of n distinct objects without regard to the order, we divide , P. by r! nt Combination: C(x, 1) ran! Note: The only difference between a permutation and a combination is that order makes a difference in a permutation, and order does not make a difference in a combination, ( ) is a symbol used in many books to indicate a combination. Example 1: How many ways can 2 people be selected from a group of 6 people? “UG-Di Bal 2a ‘The order of the 2 people selected does not matter Example 2: How many five-card hands are possible in a regular card deck? was =~ 22! = 2598 960 different card hands 3162-3) Solution. Example 3: How many different possibilities are possible when playing Lotto 6/49? (must pick 6 numbers out of 49 numbers in any order) 49! Solution: C(49, 6) =" 6149-6)! 13.983 816 different possibilities. Example 4: From 6 students and 4 teachers, a committee of 2 students and 2 teachers must be chosen. In how many ways can this be done? 6\ (4) 6t 4! Sotut =_—ol_,_t__ woe Ceara Copyright © by Crescent Beach Publishing —All rights reserved. Cancopy © has ruled that this Book is not covered by their licensing agreement. No part ofthis publication may be reproduced without explicit permission of the publisher.SOSHSHPHSHTSHSSSHSPPPSSSSSTPSOSSTSVSSPISSGCTFHOOHPISFHVHFEVTITGSITGE ‘Theory and Problems for Senior High Math QUESTIONS 40. In how many ways can a group of 3 students be selected from 7 students? 41, How many ways can a committee of 3 people be chosen from 20 people in the Environment Club? 42. A sample of 5 people are selected from 3 smokers and 12 nonsmokers. In how many ways can the 5 people be selected? 43. You have a penny, nickel, dime, quarter, loonie, and toonie in your pocket, If you pull out 3 coins, how many different sums are possible? 44, Ten college students, including a married couple, are eligible to attend a national conference. Four students can attend, and the married couple will only go as a pair. How many different possibilities are possible? 45, Ten distinct points are marked on the circumference of a circle, 8) How many chords can be drawn using the points marked on the circumference? b) How many triangles can be drawn using the marked points as vertices? ©) How many quadrilaterals can be drawn using the marked points as vertices? 4) What isthe general formula for n distinct points and r vertices used”? 46. From a regular 52-card deck, how many 5-card hands have exactly 3 hearts and 2 clubs? 47. Twelve students, consisting of 5 men and 7 women, apply for a job. In how many ways can 4 jobs be awarded amongst the students if: a) there is no restriction on awarding the job? b) 2 men and 2 women must be hired? €) at least 2 jobs must go to women? 48. A box of 30 figshbulbs contain 5 defective bulbs. In how many ways can 6 bulbs be selected if: a) there is no restriction on what bulb is selected? b) only non-defective bulbs can be selected? ©). the selection must consist of 2 defective bulbs? 49. Calculate the number of different 5-card poker hands which contain the following: a) full house ~ 3 ofa kind plus a pair,e.g. 44499 b) four ofa kind. ©) straight ~5 cards in a row, e.g. 789 10/J (including 10, J, Q K, 1), but not all of the same suit 4) flush ~5 cards all of the same suit, e.g. 5S hearts, but not including 5 card straights flushes, ©) straight flush (including 10, J, Q, K, 1) ~5 cards in a row, all of the same suit Note: A S2-card deck consists of 4 “suits” of 13 cards called hearts, diamonds, clubs and spades, numbered I (Ace), 2, 34,5, 6.7, 8.9, 10, Jack, Queen, King. The I(Ace) can be low (e.g. 1, 2, 3) or high (eg: Q, K, 1) The hearts and diamonds are red, and the clubs and spades are black. COMBINATORICS ¢ 129 NOTES/ WORK AREA Copyright © by Crescent Beach Publishing — All rights reserved. Cancopy © has ruled that this book is mot covered by ‘their licensing agreement. No part of this publication may be reproduced without explict permission of the publisher.130_¢ COMBINATORICS ‘Theory and Problems for Senior High Math BINOMIAL THEOREM ‘The binomial theorem is a method for expanding an expression of the form (x+ y)", where n is a positive integer. Method 1 ( Pascal’s Triangle) ‘The coefficients of the expanded power of x+y can be arranged in a triangular form, called Pascal’s Triangle. Pascal's Triangle Sum of row (r+) 1 1 (x+y) =x+y 1. a2 (x+y? =x? +24 y? aad a4 (x+y 2x8 4302p 43a? +y? lotsa P=8 (x+y) axt +40’ y+ 6x7y? + 4ay? ty? 14641 2 =16 (x+y) = a5 +5x*y+10e'y? 410x2y? +5ay* + y? 15 101051 2=32 (x+y) = x5 + 6x5 y + 15x4y? +20x"y? + 15x? y* + Oxy! + y® 1615 2156 1 2°=64 Note: For each row of Pascal's Triangle # always start and end with a1 ‘+ sum of coefficients is 2” the numbers in the pattern are developed by adding the two numbers appearing directly above it ‘the number of terms is n+ I, one more than the power of the binomial Method 2 (Binomial Expansion) Cox" yt Cyr yt Ce ty tnt CRY" (+o) Example 1: Expand (x+y)* Solution: (x+y) sCox* yy Cyx' yl tg yt Cyr'y ty Carry xt t4xy+6x2y? + 4xy? 4 yt Example?: Expand (2x-4)* Solution: bx-4) = 2O*CHHCQ0'ED'+ COVED GREE + 4Cx(2x) 4)" Specific term of a binomial expansion For (x+y)! the k™ term = .C,,(x) 0. yt Example: Find the 4" term of (x-2y)" 4 term = igC3(x"™)-(-2y)° Copyright © by Crescent Beach Publishing All righs reserved. Cancopy © has ruled tha this book is not covered by ‘heir licensing agreement. No part of his publication may be reproduced without explicit permission of the publisher we eee ee neem ene m me mnanannanaanaaaaaanaaaaaeadSLSSHSSHSSSHSSSSHFSHSOSSHSHSHHISIFHSSTETCTCSSSSSSVossvvessseeeee eww se ‘Theory and Problems for Senior High Math QUESTIONS 50. Expand (x+y)° by a) Pascal’s Triangle b)_ binomial expansion si. Expand (x? ~2y)’ by a) Pascal's Triangle b) binomial expansion 52. Expand (- 1 } by y ) Pascal's Triangle ) binomial expansion 53. Determine the 6” term of (x-2y) 54, Determine the next to last term orf ! ) y 55. Determine the middle term of (3a + 267)? 56, which ermot (12-2) isa constant? x 59. whic em (25? — is aconstant 58. The stem of (x= ) is -15x7, Determine n, 59. The 7 term of (2x-1)" is 112x%, Determine n COMBINATORICS ¢ 131 NOTES/ WORK ARFA Copyright © by Crescont Beach Publishing — All rights reserved. Cancopy © has ruled that this book is not covered by their licensing agreement. No part ofthis publication may be reproduced without explicit permission ofthe publisher.132_¢ COMBINATORICS ‘Theory and Problems for Senior High Math SET, SUBSETS AND ELEMENTS A set is a well defined collection of objects. 4 = {a,b,c} the objects a, b, c are called elements of set A ‘* sets are designated by capital letters and elements by lower case letters © ¢ is the empty set (contains no elements) Ifevery clement in set B is also an element of set A, then B is a subset of 4 Subsets of A are {a,b,c}, {a,b}, {a,c}, {b,c}, {a}, {b}, fc}, & *Notice that the number of subsets of 4 is 2", where m is the number of elements of A. [a subset does not contain the set itself, itis called a proper subset. ‘The number of proper subsets of 4 is 2°— | Example |: Given set C= {a,e,i,0} a) List the subsets of C. b) How many proper subsets are there? Solution: a) subsets are {a,e,i,0}, {a,e,i}, {a,e,o}, {a,i,o}, {e.i,o}, {a.e}. fait. {ao}, {e,i} fool, fob la. tell b) umber of proper subsets is 2"— 2-1 = 15 (the set {a, ¢, i, 0} is not counted) Example 2: How many different sums of money can be made from a penny, nickel and dime? Solution: There are two choices for each coin, use the coin in your sum of money or don’t use the coin. So, the number of subsets, not including the empty set, is 2’ —1=7 different sums of money. Example 3: How many different sums of money can be made with 3 pennies, 2 dimes and 1 quarter? Solution: When a set has elements that are not distinct, then we use the same approach as example 2 above. Take 3 pennies for example; For this non-distinct element, each subset can contain 3, 2, Is or 0 pennies, which amounts to 4 choices. The 2 dimes have 3 choices and the quarters ‘would have 2 choices, So, 3 pennies, 2 dimes, | quarter, 4x 32-1 = 23 different sums. NOTES/ WORK AR! QUESTIONS 60. a) How many subsets are in the set D = {a,¢,i,0,u}? List the subsets, b) How many are proper subsets? 61. How many subsets are in the set E {a,b,b,c,c,c}? List the subsets. 62. A set has 2048 subsets. How many elements are in the set, assuming all elements of the set are unique? 63. How many different sums of money can be made from a penny, nickel, dime, quarter and a dollar? List the different sums of money. 64. How many different sums of money can be made with 3 pennies, 2 nickels, and 5 quarters? 65. a) Determine the total number of factors of 100. b) List the factors, 66. Determine the total number of factors of 1 000 000. Copyright © by Crescent Beach Publishing ~All rights reserved. Cancopy © has ruled tha this book i nat covered by ‘heir licensing agreement. No part ofthis publication may be reproduced without expliet permission ofthe publisher. an nn nn nn nnn nn nn nme sere cenecseeseccaaaanaaanaanaaee‘Theory and Problems for Senior High Math COMBINATORICS ¢ 133 PATHWAY PROBLEMS Most pathway problems can be done in two ways. n! 1) Using the counting principle — where my, +1, ty tant My in, 2) Pascal's Triangle Example: How many different ways going down and to the right can a person go from A to B? a) b) A A Solution: Two methods of solving the problem are presented below. Method 1 (counting principle) a) 4 squares across and 3 squared down = 7 squares total 1 Therefore, by the counting principle: == 35 ways b) 3 squares across and 2 squares down x 2 squares across and 2 squares down ‘Therefore, by the counting principle = 60 ways Method 2 (Pascal Triangle) a) ») pr undone ieeniuaient Lo Be ae io 1010 Lal steno. wt 38 10} 24 30 ways 4008 ae 10 308 Copyright © by Crescent Beach Publishing —dil rights reserved. Cancopy © has ruled that this book ts nat covered by their licensing agreement. No part of this publication may be reproduced without explicit permission ofthe publisher.134_¢ COMBINATORICS. ‘Theory and Problems for Senior High Math QUESTIONS 67. How many paths going down and to the right are there from point A to point B? a) bd) ee ‘ 8 8 °) d) A A ° 5 8 5 a A D 5 2) hy) A 4 8 8 Copyright © by Crescent Beach Publishing ~All rights reserved. Cancopy © has ruled that this book ts nat covered by ‘heir licensing agrezment. No part of this publication may be reproduced without explilt permission of the publisher. wt tt eet eee neem nnnnnananaaeaaee‘Theory and Problems for Senior High Math COMBINATORICS ¢ 135 6666 68. A checkerboard is an 8 x 8 game board with pieces only able to travel diagonally on the dark squares, If the checker is placed as shown, how many paths are there for the checker to reach the opposite side of the game board? a) b) @ ) The checker CANNOT jump over 4) The checker CAN jump over the X the X encountered. encountered. ] x x ‘Copyright © by Crescent Beach Publishing — All rights reserved. Cancopy © has ruled that this book is not covered by ‘ther licensing agreement. No part ofthis publication may be reproduced without explicit permission ofthe publisher.136_¢ COMBINATORICS ~ SOLUTIONS ‘Theory and Problems for Senior High Math SOLUTIONS 1. a) 3 ways from Calgary to Vancouver; 2 ways from Vancouver to Victoria, Therefore, 3 x 2 = 6 ways altogether b)_car-boat, car-plane, train-boat, train-plane, bus-boat, bus-plane 2. a) 4x 12 ways from A to C via B b) 4x3 x 3x 4 = 144 ways from A to C and back to A (via B both ways). ©) 4x3 2x3=7 wing elo one leat oute on eur ip 34x 4x 4x4 x 4 = 45 = 1024 ways 4. TT, TH, HI, H2 HB, H4, HS, H6 = 8 possibilities 5. 6 x 4 x 5 = 120 different ways 6 Juice~3 choices, Toast~2 choices, Eggs—3 choices, Beverage — 3 choices Therefore, 3 x 2 x 3 x 3 = 54 breakfast combinations are possible 7. Horses 1, 4, 6can come in 3-2-1 = 6 ways There are 4 non-winning horses. They can come 4-3-2- 1 = 24 ways ‘Therefore, 6 x 24 = 144 different ways in which the horse race can end. & 4x 3x 2= 24 ways 9. a) Each letter has 26 choices and each digit 10 choices. 26-26 -26- 10-10. 10 = 17 576 000 license plates b) The first letter has 26 choices and the second letter 25 choices, and the third letter has 24 choices. The first digit has 10 choices, the second digit has only 9 choices, and the third digit has just 8 choices. 26-25-24: 10-9-8= 11 232 000 license plates ©) There are 26 license plates with all leticrs the same, and 10 digits with all three numbers the same. You can only use a digit twice and a number twice, so you have to subtract the possibilities that use the letters and digits three times. (26 - 26-26 ~ 26) - (10 + 10- 10-10) = 17 374 500 license plates 10. There are 26 - 25 - 24 three-letter words in which all letters are different. Each of these three-letter words can be arranged in six ways. Example: ABC + ABC, ACB, BAC, BCA, CAB, CBA, Only 1 out of 6 is in alphabetic order Therefore, ne = 2600 three-letter words in alphabetical order Copyright © by Crescent Beach Publishing — All rights reserved. Cancopy © has ruled that this book is not covered by ‘their licensing agreement. No part of this publication may be reproduced without explicit permission ofthe publisher, | MMA AAemAMaAAAAAAAAAAAAOGOAOAHOHEHHAARARARARAAAARAARARARSSSSSTTSSVSRTTTTTETETIIIT50558s ‘Theory and Problems for Senior High Math COMBINATORICS - $ OLUTIONS ¢ 137 - < > BEB 11. Eight possible outcomes. 4 BBG oR BGG > GBB + GEG = ace AMAA } ¥ GGG 12. Bight possible outcomes. A /\ /\. /\ AAA 13. Six possible outcomes. . /\. /\ > \ A > Copyright © by Crescent Beach Publishing ~All rights reserved. Cancopy © has ruled that this book i mot covered by ‘heir licensing agreement. No part of this publication may be reproduced without explicit permission of the publisher.138_¢ COMBINATORICS ~ SOLUTIONS ‘Theory and Problems for Senior High Math 14, Ten outcomes counting plain sandwiches or hamburgers: S, SM, SR, SMR 1H, HK, HM, HR, HMK, HMR M s - MR R k MK u M Me 15, Fourteen different combinations of complete shows. 9A sa oo 18 on sp ae ; op oa tA > elle = 720 o— 1B = 130¢ ———— 0c 930c on 8a eae yee 7508 a oa 7306 ——— s330c 9:30 Copyright © by Crescent Beach Publishing ~ All rights reserved. Cancopy © has ruled that this book is not covered by ‘their licensing agreement. No part of this publication may be reproduced without explicit permission ofthe publisher. Ree eee‘Theory and Problems for Senior High Math COMBINATORICS ~ SOLUTIONS ¢ 139 16, 0) 81 -8:7-6-5-41 3.7.6. 51680 at ccat by T1=5!=7-6-5!-S5! =51(7-6-1)=5-4-3-2- 1-41 = 4920 10! 4! _10-9-814!_10-9_ B16! 865-4! 65 1 17.) 20-19-18. 17= 204 16! b) 6! = 6-5-4-3-2-1 =720 ways ¢) T1= 7-6-5-4.3-2-1 = 5.040 different 7 digit numbers (r= i)ler tween ned Peace MaGae oat py Qmctslnstt (2m — eens N)(n—ilt n(n) nt Govt! Qn W2n)n—I=I! An(Qn+l) Dean c) a» ¢ = + mle) mei) n=l (n=) i ° Gan cea (n-1)(u+2) #2 nn!=6 (1-2)! _n(n—1)(n—2)!-6(n=2)!_m(n—-6_n? -n-6_(n-3)(n42)_, 9 G32)! Gae-2 Ge3) San @esyate 19.) HO» eee D2 (n—i2) =n? ans =t2 1? —3n-10=0-9 (n= 5)(+2)=0-9 0-5-0 of n+2=0-90=5, reject ~2 ») coe to Pear Mone Ha1g-9 22D ig 5 292 39 +1210 Qn? ~3n—-9=0-> (20 +3)(n-3)= 0-9 2n +3=0 oF n-3=0-40=3, isjeet =? Copyright © by Crescent Beach Publishing ~All rights reserved. Cancopy © has ruled that this book is not covered by their licensing agreement. No part ofthis publication may be reproduced without explicit permission ofthe publisher.140_¢ COMBINATORICS ~ SOLUTIONS ‘Theory and Problems for Senior High Math ! ! 20. P(40, 5) = 42! - 40! _ 78 960 960 possible ticket selections (40-51-35! 21. iP Tm = 2.63 x 10" possible room assignments 22. 91 = 362 880 possible batting orders 6! (6-4)! 23. (Py = 360 possible groups of 4 letters 24, a) 6! = 720 possible seating arrangements b)_ We can sit the boys and girls in 2. ways: BBBGGG or GGGBBB. The boys can sit 3! ways and the girls 3! ways, Therefore, 3! x 3! x 2 ways = 72 ways. ©) We can sit the boys together in 4 ways: BBBGGG, GBBBGG, GGBBBG, GGGBBB. ‘The boys can sit 3! and the girls 3! Therefore, 3! x3! x 4 ways = 144 ways. 25. The delivery man can travel 6! ways. Since opposite routes, eg, ABCDEF and FEDCBA count as the 6! same route, there are, “= 360 different routes. 26, If there are no restrictions, then 5 people can be seated in 5! ways, A is tothe eft ofB for halfof these ways. Therefore, ©! = 60 ways with A to the left of B 2 27. If there are qo restrictions, then 5 people can be seated in 5! ways. If AB sat next to each other, consider them one person, so they could do this 4! ways. But they can also switch postions BA, which also has 4! ways. Therefore, they cannot sit together in 5!~2 x 41 = 72 ways. 28, Method | ‘The first couple has 10 choices of seats in which to sit. The second couple has & choices of seats in which to st ‘The third couple has 6 choices of seats in which to sit. ‘The fourth couple has 4 choices of seats in which to sit. The fifth couple has 2 choices of seats in which to sit Therefore, the couples can sit 10-8 -6-4-2 = 3 840 ways, Method 2: ‘The 5 couples can sit together in 5! ways, e.g., Aa Bb Ce Dd Ee. Each couple can switeh, e.g., 2A, DB; there are 2° ways of this happening. Therefore, the couples can sit 5!- 2° = 3 840 ways. 29. One person can sit at any position around the table. The other 4 can arrange themselves in 4! ways = 24 ways. Copyright © by Crescent Beach Publishing — All rights reserved. Cancopy © ha raled that this Book i wot covered by ‘her licensing agreement No part ofthis publication may be reproduced without explicit permission ofthe publisher° 2 ‘Theory and Problems for Senior High Math COMBINATORICS ~ SOLUTIONS ¢ 141 eo 1 : 30. a 5] 7 30400 tenletter “words” * 1 id . Be ty = 1260 ways s ' 7° 33, — 12! _ ~ 25 200 different ten-ltter codes = 2r 31312! =o as a EE = 27720 ways ways = 5 = 35. There are 30! ways of arranging 30 teachers. Each school has 5 teachers, who have 5! ways of a being arranged = 30! _ 0 = ar 72x 10" wae =” ad 36, —25!__ = 1 487285 800 ways 121310! sa) 2 = 90720 anges b)_ ICthe first letter is a “C,” then there are only 8 leters left, including two “Os.” Therefore, 1x = 20 160 arrangements ©) Consider the two “Cs” as one letter; there are 8 letters, including two “Os.” Therefore, $1 =20 160 38. 4 blocks + 5 blocks +7 blocks + 4 blocks = 20 blocks 4 blocks east + 4 blocks east = 8 blocks east 5 blocks north + 7 blocks north = 12 blocks north 20! Therefore, = 125970 different routes 8112! 39. IFeveryone gets along, there are >>>, = 90 ways But 2 people cannot work together in any of the 3 offices Therefore, 90~ 3 = 87 possible working situations. Copia © Ty Cresco Bach Pushing All vighs reserved. Cancopy © has rad hats book snot covered by See recat, Mo part of hs publication maybe reproced witout expt permission of te publisher.142_# COMBINATORICS ~ SOLUTIONS. ‘Theory and Problems for Senior High Math 40, Order is not important so this is a combination. ! 41, Order is not important. €(20, 3) G0 1140 ways, 42. Total people equals 3+ 12 = 15. Order is not important. 15) ist () siis-gy 3003 ays 43, Total number of coins is 6, Order is not important 6! oC) = xO = 20 different sums of mon 316-3)! ies 44, Ifthe couple does not attend there are 8 students left. 3! $0 C= = 70 06. Ea ays, If the couple is selected, then only 2 can come from the other 8 students. So ,C)= 28 ways. Total = 70 + 28 = 98 ways 45. a) Order is not important. A chord needs 2 points on the circumference. to! So C(10,2)=——.. = 45 chords. 21(10-2)! b) A triangle has 3 points. 10! So oC; =———~ = 120 triangle: 2 310-3): ao ) A quadrilateral has 4 points. 10) to! So (' =————_ = 210 quadrilatere (") aoa quadrilaterals. Ala") 4) General formula a, 46, A card deck consists of 13 hearts, 13 diamonds, 13 clubs, and 13 spades. 13) 1B So ||, | forthe 3 hearts and | || forthe 2 clubs By (13 Therefore, |] x[', ] = 22308 card hands. 47. a) If no restrictions, then 12 students try to get 4 jobs. 12! So C= 41(12-4)! = 495 ways. ‘Copyright © by Crescent Beach Publishing — All rights reserved. Cancopy © has ruled that this Book is not covered by their licensing agreement. No part of this publication may be reproduced without explicit permission ofthe publisher.» » ‘Theory and Problems for Senior High Math COMBINATORICS ~ SOLUTIONS ¢ 143 » » 47. b) 2 men out of Sis C(S, 2), 2 women out of 7 is C(7, 2) » So C(S,2) x (7,2) = 10 x 21 = 210 ways , ©) Atleast 2 women means: 2 women +2 men, or 3 women + | man, or 4 women and no men. » 75), (73). (7)5 » so (215) +(2e} (2g) = toa + ass + 35.1 = 420 ways > 2h) "(ah)" alo : 48, a) [f'no restrictions, then select 6 bulbs from 30 30! . Cs = = 593.775 ways 611306)! . (30-6) . b)_ IP there are 30 bulbs with 5 defective ones, then there are 25 non-defective bulbs. . : 25! C(25,6)=—" — = 177100 ways. . ( 61(25—6)! . > 7 ©) If'we must have 2 defective ones, then there are 4 non-defective bulbs selected. 5) (25 ! 25! > ag at essences! = 10% 12650 = 126500 ways. > 2} “(4) > 26-2) aes—ay 7 4 . 49. a) For 3 of a kind, out of 4 cards, you want 3. So (:) and there are 13 different numbers, ® J ® 4 ® Fora pair, out oF 4 cards, you want 2, So | >) and there are 12 different numbers let (one number ® is used up with the 3 ofa kind). ® ayia) (ayi2 ® Therefore. {>| | 4 1 | = 3.744 different fll house possibilies ina S-card hand 7 Seti an 7 ‘ afta > b) For 4 ofa kind, out of 4 cards, you want all 4, so ,C, and this can be done for 13 numbers, ‘The fifth card is | out of the 48 cards remaining : ‘ayayas ° Therefore, {4 | = 624 possiie our of «kind hands in a S-card hand ® ahiha) ® ° ©). There are 10 different straights from (1,2, 3, 4, 5) up to (10, J, Q, K, 1); each of the 5 cards ean be a club, diamond, heatt or spade. o a : Therefore, 10 () , but this includes card hands that have all 5 cards of the same suit (straight ® fushes) 50 subtract 10 different card hands times the 4 suits = 40 ® ay ° 10 (} = 40 = 10200 possible straights in a $-card hand. : 13 ® 4) A fush consists of 5 cards all of the same suit |!) and there are suits. We have to subtract ® ® the flushes that are in a row, which is 4 x 10 = 40. 13 : Therefore, 4 (3) ~ 40 = 5 100 possible flushes in a 5-card hand. 4 ©) A straight flush consists of 1,2,3,4,5, t0 10,J,Q,K, 1 of the same suit or 10 x 4 suits= 40 hands ® * . Copyright © by Crescent Beach Publishing — Al rights reserved. Cancopy @ has rated tha ths book isnot covered by ; ‘hei licensing agreement. No part ofthis publication may be reproduced without explicit permission ofthe publisher144 ¢ COMBINATORICS ~ SOLUTIONS ‘Theory and Problems for Senior High Math 50. Method 1 (Pascal's Triangle) (c+ yh ax #5x4y 4100°y? 4 10z4y? +Say4 4p ate 4) 5 1010 5 1 Method 2 (binor expansion) cop hr (en eee =x54Sxty+10x"y? $10x%y! +5ay4 + y® $1. Method 1 (Pascal’s Triangle) 14641 15 1010 5 1 Lé 15 20 156 1 (x? -2yf = if + ole?) (2p) +152 Cay) +20fe? Cay) + 15?) Cay) +6f?) Cay) (2 PC ar) x! -12x'y +60x8y? —160x%y? + 240x*y* —192x7y? + 6dy® Method 2 (binomial expansion) (east (Seer ofS)ey arr (Sherr carr «(Seed an + (‘JeFe an (Sleek anr «(Seeker x 12x! y 4 60x8y? ~160x*y? +240x4 y* -192x7y% +64y% Copyright © by Crescent Beach Publishing ~ All rights reserved. Cancopy © has ruled that this book is not covered by their licensing agreement. No part of this publication may be reproduced without explicit permission of te publisher. SameeeegeHOHOHOHOOOHHHHHHHHLEHHAAHRHAHHAARTHEHLLAL LENCLFULTS USE SUCCESS CCC CTU T EEUU Leesa S EEE EEE CrEEEEEEKeN” ‘Theory and Problems for Senior High Math, COMBINATORICS - SOLUTIONS ¢ 145 52. Method 1 (Pascal’s Triangle) 80x* 80x? 40x" a = 328 Ee xt 80x? 40x" = 3a Oe, 802? _ 40 y 53. term = Cyr -y" 6M term = 9Cy(2?*)(-2y)* 26(x* )(-32y*) = -4032x4y* S84, Remember | x? = y 1 & ) has 8 terms, so the next to last term is the 7” term. ic = shel) yt 7 term, ‘Copyright © by Crescent Beach Publishing — AI rights reserved. Cancopy © has ruled that this book is wot covered by their licensing agreement. No part of this publication may be reproduced without explicit permission of the publisher,146 # COMBINATORICS — SOLUTIONS ‘Theory and Problems for Senior High Math 55. Remember, (3a +2b7)* has 7 terms so the middle term is the 4" term. tem = C42" 4¥term = 4C,(a)* -(267)? = 20(3a)? -(267)? 20-27-8-a°b® = 4320a°b° Herm = ("lar get 56. K term ( "} We want a” .61 <1 ,ie., the exponent must be to a zero power. ayn (LY (aye yee oat Matera Hate 80 (e) (3) =(2F Gy =x -ise ‘Therefore, 14—2k + 1- k= 0 > 3k = 15 + & = S™ term. or tum = (,1 ras We want a’) 5! =1 , ie,, the exponent must be to a zero power. go Ge (L edt Ge P= ae eng po Therefore, 33-3 2k+2=0 >» Sk = 35 > k =7" term. 58, = [7 leet term (24) o Nd 1 n\ eaf_1) 7 Ifthe 4" termof|x-=| is —15x’ then pe] = —15x! 2 3 2 Equating exponents, n—3 = n= tern (2 59. term ( reat Irthe 7 term of (2x 1)" is 12x? then (Rleaeur =n? > (2lear* = 11282 Equating exponents, n- 6 2 n=8 Congrigh © by Cresent Beach Pblsng Al rights reserve. Cancopy © has rl hat hs Dok not covered by ‘her censing cgroment. No pare of ts publication maybe repraduced witout expel permission of the publi. a 88888828 e ee eseeeee2aseaee. as» . » . » & . . » » » ° » 2 SIFFPFFFFSSPHSPHSPPPFFSSTFFTFSETSVVVVsGsvsvssvse ‘Theory and Problems for Senior High Math COMBINATORICS ~ SOLUTIONS ¢ 147 60. a) You have two choices for each letter, use the letter or don’t use the letter, s02%2x2x2x 2= = 32 subsets ‘The 32 subsets are {a, 5, c,d, e}, {a,b c,d), (a, b,c, e}, {a,b d,e}, (a, c,d, e}, 1b, c,d, e}, {a,b,c}, (a, b, d), (a, b,c}, 1a, c,d},(a,c, e}, {a,d,e}, (b,c, d}, (b,c, e), {b,d,e},{e, d, e}, {a,b}, {a,c}, (a, d}, {a,e}, {b,c}, 1b, d}, tb, et, fe, d}, te, eb. td. eb, fa}, tb, fe}, bd, fel. b b) Proper subsets do not contain the set itself, so 2° ~1=31 proper subsets 61. For the a you have two choices, use the a in the subset or don't use the a in the subset. For the b you have three choices, use two b's, one b or no b's in the subset. For the c's you have four choices, use three ¢’s, two e's, one ¢ or no c's in the subset. Therefore, 2x 3 x 4 = 24 subsets. The 24 subseis are {a, b, b, ¢,¢,¢}, (a,b, b,c, c}, 1a, b,c, cc}, {b,b,6,6,c}, 1a, b, b,c}, (a,b, cch, fa c.e.c}, (B.b,c.0}, 1b, ccc}, 1a, B,b}, Lab. ch, tacch (bb ch (beck tece}, tab}, fac}, (b,b}, {bch ered, a}, (6), teh gd 63. Remember, you have two choices for each coin, use the coin in the total or don’t use the coin in the total. Therefore, | penny, | nickel, I dime, 1 quarter, and | dollar may be considered subsets, but we must subtract the empty set because no money is not considered a sum of money. So,2x2x2x2% 2-1 =2- 31 different sums. The 31 different sums of money are 1, 5, 6, 10, 11, 15, 16, 25, 26, 30, 31, 35, 36, 40, 41, 100, 101, 105, 106, 110, 111, 115, 116, 125, 126, 130, 131, 135, 136, 140, and 141 cents, 64. In your total you may use 0, 1, 2, or 3 pennies which makes four choices, you may use 0, 1, or 2 nickels which makes three choices and 0, 1, 2, 3. 4 or 5 quarters which makes six choices. A zero total of money is not considered a sum of money, so we must subtract the empty set. Therefore, 4x 3x 6-1 = 7I different sums of money. 6S. a) 100 = 2x2x5x 5 The number of factors equals the number of subsets of (2, 2, 5,5}. You have three choices for the 2°s, use both of them, use one of them or don’t use any of them. You have the same three choices for the 5's. Therefore, 3 x3 = 9 factors. (The empty set corresponds to the factor 1). b) Thenine factors are 1, 2, 5, 2x2, 2x5, 5x5, 2x2x5, 2x5x5, 2x2xSKS ‘Therefore, the factors are 1, 2,4, 5, 10, 20, 25, $0, 100 66. 1 000000 = 2°x s* You have between zero and six 2's which makes seven choices, and between zero and six 5’s which also makes seven choices. Therefore, the number of factors equals the number of subsets. So, 7x7=49 factors. (The empty set corresponds to the factor 1) Not asked for, but here are the 49 factors. 1,2,4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 64, 80, 100, 125, 160, 200, 250, 320, 400, 500, 625, 800, | 000, 1250, 1 600, 2.000, 2 500, 3 125, 4 000, 5 000, 6 250, 8 000, 10 000, 12 500, 15 625, 20 000, 25 000, 31 250, 40 000, 50 000, 62 500, 100 000, 125 000, 200 000, 250 000, 500 000, 1 000 000. Copyright © by Crescent Beach Publishing ~All rights reserved. Cancopy © has riled that this Book ix mot covered by their licensing agreement. No part of this publication may be reproduced without explicit permission ofthe publisher148 ¢ COMBINATORICS / SOLUTIONS ‘Theory and Problems for Math 12 co ar ee oy setters ») af_s|_ af slo : 7 alot al sl I, s_ iol is} mf |. iL3L4¢| tof is! 7 4 “ La tof_2of ssl sel |, ; soways 4102035 210 ways a a) Solution 2: 3 rows and 5 columns a Solution 2: 4 rows and 6 columns SL = s6.ways io! ii = 10 - pow 313! Gray 7 210 ways je Al ag AEE 4 3 iL 4 : ee eres Lal do o_o t 12] is|_24I 1 20] 30) 4 “0 ae 4 10] «L334 6ol__| oy 10} 29 __1 100 2ioways 10 200 ways : 2 60 120) 40 1000«~@B a7. Solution 2 ha = 210 ways °) : Db a eee tie \ Liat |, Lata} al «|, 3|_6| wo} ial dt lL ,, 1 0 7 25 ways i to}-24 a3, 7 tf un = : 82 ways 5 8 8) 1 hy 42 AL 1 4 4 4 4 p22 wt 1 at 16 1 2 4 2] 4 a 28 ways M4 ways 12 B 2 4 8 1 B ef ‘Copyright © by Crescent Beach Publishing ~ All rights reserved. Cancopy © has riled that this book isnot covered by ther licensing agreement, No part ofthis publication may be reproduced without explicit permission ofthe publisher, ano neem aeeSeOOSOSHSHHOHOHHsHORHAAARANAARAHRAARARAHE NANTTRV V RASS SESS SEESESHESHHHSHHFHHHHHSSSS SSS Se eBVvevevrVVVVS ‘Theory and Problems for Senior High Math __ COMBINATORICS ~ SOLUTIONS ¢ 149 68. a) ») ® al lel [al [« t 1 9 » 15 6 1 2 8 10 5 1 1 4 3 3 6 4 1 4 6 4 1 3 : 1 4 10 v0 5 1 2 1 i 20 is 5 i 1 4 4 5 20 03 ways 'e © a) 16 16 9 3 |= 44 ways 2 28 16 s |= 67 ways 6 0 6 3 7 u u 6 a 2 1 7 7 4 1 3 3 1 1 3 4 3 1 3 x a x 1 1 2 1 1 2 1 1 1 1 1 |e) ® pyri © By Crescnt Beak Pushing ~All igh reserved. Gncay © Fas rll at is ook sot covered 69 ihe Ieeangogrecnent No part of ha eaten mayb reproduced wiht exp persion ofthe pubSi AE RAGA