Permutations and Combinations Lesson #7: Pathway Problems Warm-Up Consider the fotlowing problem: “Find the number of pathways from A to B if paths must always move closer to B” Ay ot \ fi u \ B This problem can be solved in several ways. 1a) Solve this problem by tracing the number of paths on the grid, 1b) Explain how this problem can be regarded as an example of permutations with repetitions. Detesmine the number of pahweys using ths aproah em ND Meal SMa lenges» Rete 6 wmyesed of 3Blaks ruph and 2d dn Summe $5. Hee nalts ab pecmaladins oP m5 lellerverd BRard AD SL _ 5 ) Explain how this problem can be regarded as an example of combinations. Use the 3a ‘combination formula or Pascal's Triangle to determine the number of pathways 13 ste. Sheleh J A city centre has a rectangular road system with S steets running north to south and 6 avenues running west to east. " a) Drawa grid to represent thissituation. ql rc] 8 =! 35 Wys=4 5 'b) Seam is driving a car and is situated at the extreme northwest comer of the city centre. In how many ways can he drive t the extreme southeast corner if at each tum he moves loser to his destination (assume all streets and avenues allow two-way trafic). al = fab wai mae Copyright © by Absolute Value Publications. This book is NOT covered by the Cancopy agreement418 Permutations and Combinations Lesson #7: Pathway Problems Find the number of pathways from A to B if paths must always move closer to B. aaAgt 1 4l by ATS ‘aE ~ 235 (| NAL ait re ail iLL ss = UD pabhoays 35xb> ad galnaays Gusta | A taxi company is tying to find the quickest route during rush hour traffic from the tain ©” | station to the footbal stam. How many different routes must be considered if st each intersection the taxi must always move clover tothe football stadium? “wt a) Trin Station by tbat station Lab af utp 4 a7 |e sly ey spol fo sly |e |» & |, |, sbabaeadl tytn Lest s le |, v is 4 od ets le J, Football Stadium all Sadi U4 afferent ays 262. difleent ways Ch. | How many different paths can a pinball e take asi falls from top o bottom? 1 KAN a". favrast gal (L203 A? “ KA YALA TAS SA WPA WAS AY CARA AS ‘Complete Assignment Questions #1 - #7 Copyright © by Absolute Value Publications. This book is NOT covered by the Cancopy agreement.Permutations and Combinations Lesson #7: Pathway Problems 419 Assignment Find the number of pathways from A to B if paths must always move closer to B. a) b) ©) Fi 2, 4 4d) © B B A hy Lake’ 4A B Copyright © by Absolute Value Publications. This book is NOT covered by the Cancopy agreement.420 Permutations snd Combinations Lesson #7: Pathway Problems 2, The bakery is four blocks south and three blocks west of the supermarket, The bakery driver, bored with travelling the same route, decides to use a different route for each delivery Assuming that he always travels closer to the supermarket, how many deliveries are possible before he has to repeat a route? 3. A town has 10 streets running from north fo south and 8 avenues running from west to east ‘Aman wishes to drive from the extreme south-west intersection to the extreme north-east intersection, moving either north or east along one of the streets or avenues. Find the number of routes he can take. State any assumptions that you have made, 4. Given the following pinball machines determine the number of pathways to reach each of the exits a) a ») a a a AA AA AAA AAR A AAR AAR AAAAA AALR AB C DE F ALs aa The number of pathways from X to Yif paths must always move closer to ¥ is x oe 4 7 Baral * 2a c Dd. Copyright © by Absolute Value Publications. This book is NOT covered by the Cancopy agreement.Permutations and Combinations Lesson #7 Pathway Problems 421 r BRR. te numero iteren pts ta pina cantake wills ram op to ot is e a AA AA AA AA AA a 7. Counsellor McAdam has to drive from city hall (at the comer of I Ave. and 1 St.) to the hospital (at the comer of 6" Ave.and 6" St). ‘Third Avenue is one way heading east and, Fourth Avenue is one way heading West. Ifhe must always be uavelling closer to tie hospital, the number of different routes he can take is it pda gh sh gh S&S & & & SS an Ave Se} i ae =|] th ave sth ave ave Answer Key Tea) 126 bo ©) 106 a Wo © 0 1 90 2) 260 hy 495 D9 re) 35.3, 11 40. Assumptions: 1) He always travels closer to his destination 2)None of the routes are one-svay from north to south or cast 0 west doa) Exits 1 ERitBe S| Exit: 10 ExitDs 10 EE: 5 EXit b) ExiA: 200 XUB: 1S Ext 6 5B 6 7 106 Copyright © by Absolute Value Publeations. This book ts NOT covered by the Cancopy agreement422 Peemtations and Combinations Lesson #7: Pathway Problems Copyright © by Absolute Value Publications. This book is NOT covered by the Cancopy agreement.