Permutation and Combination | |

Finding numbers of shortest paths in a network of roads with restrictions. Please check the attachment. I really need to know how to solve it |

Re: Permutation and Combination | |

Hi Anupam Just observe that Peter can go along rightwards or upwards as he is to travel minimum possible distance. So just calculate the number of ways to reach any particular vertex as shown in the figure below and you will get the answer. Also note that every vertex is connected with direct roads from exactly four other vertices {one upward, one downward, one leftward and one rightward}. Because Peter is to travel only in two particular directions so it becomes easier to calculate the number of ways to reach every vertex. More questions on this concept and many other concepts too have been discussed at my article. Check this - Kamal Lohia's Math Corner. |