A taxi company is trying to find the quickest route during rush hour traffic from the train station to the football stadium. How many different routes must be considered if at each intersection the taxi must always move closer to the football stadium?
The Attempt at a Solution
My teacher told us that he didn't know how to solve this problem using permutations, and therefore solved it using pascal's triangle. This is what he did:
As you see, he got the answer of 119, which is correct. However, I was wondering, is there a way of doing this question using the permutations equation? If not, is there another way of approaching this problem?
Last edited by a moderator: