Calculating Routes on a Grid: Using Combinations and Pascal's Triangle

3 replies · 5K views · last reply
SeththeBaller
Messages
13
Reaction score
0
1. The streets of a city are laid out in a rectangular gird, as shown below

Rectangular street grid 11 blocks wide and 6 blocks tall, with compass rose showing N, S, E, W; point A at bottom-left corner, point B at top-right corner, point C at an intersection near the top.


a) Use combinations to find the number of routes through the grid that lead from point A to point B by only traveling north or east. Show your calculations

b) How many of these routes pass through intersections C




2. Alright, so I've solved similar questions before. I get to P(66,6)/6! only to get some absurd answer. I understand that from point A to point B there is a distance of 66 blocks-11 east, 6 north. Somehow I believe that the exponential answer that comes from this is not what my professor expects.

I was wondering if I could have help with this please and thank you :D
 
Last edited:
How did you get 66 blocks? No matter how you travel, the most you could possibly get is 17 (11 east + 6 north). Multiplying gives you the area, not the distance.
 
Whoops, lmao, sorry long day, that makes so much sense, I know what to do from here lol