Browse · MATH
Printjmc
counting and probability intermediate
Problem
Each block on the grid shown in the Figure is 1 unit by 1 unit. Suppose we wish to walk from to via a 7 unit path, but we have to stay on the grid -- no cutting across blocks. How many different paths can we take?
Solution
We know that we must take a 7 unit path. If we look at the grid a little more carefully, we can see that our path must consist of 4 steps to the right and 3 steps up, and we can take those steps in any order. So in order to specify a path, we must choose 3 of our 7 steps to be `up' (and the other 4 steps will thus be `right'). Hence the number of paths is
Final answer
35