Hey, Gang - this one is from the official review 12th ed. There is an explanation in the book, but it's nothing but manual. I was wondering if anyone could come up with a faster solution. Here is the problem:
Pat is walking from Intersection X to intersection Y along the route that is confined to the square grid of four streets and three avenues shown on the map attached. How many routes from X to Y can Pat take that have a minimum possible length?
The OA is 10. In the explanation they just list the possible combinations of Upright and Right moves. There must be a mathematical solution to it.
On the attachment what i tried to accomplish was to create a 3 vertical lines that represent aveues and 4 horizontal lines that represent streets. Pat is located in the lower left corner and he has to get to the upper right. He has to walk up 3 blocks and right 2 blocks. I hope this clarifies the task. Also, for those who have OG 12th it's a math question 191.
Pat is walking from Intersection X to intersection Y along the route that is confined to the square grid of four streets and three avenues shown on the map attached. How many routes from X to Y can Pat take that have a minimum possible length?
The OA is 10. In the explanation they just list the possible combinations of Upright and Right moves. There must be a mathematical solution to it.
On the attachment what i tried to accomplish was to create a 3 vertical lines that represent aveues and 4 horizontal lines that represent streets. Pat is located in the lower left corner and he has to get to the upper right. He has to walk up 3 blocks and right 2 blocks. I hope this clarifies the task. Also, for those who have OG 12th it's a math question 191.
- Attachments
-
- Pat walking.docx
- (11.11 KiB) Downloaded 220 times
