Cycle Paths

The diagram shows the one-way cycle paths in a park. 

Work out the total number of possible routes to go from 

A to C

from A to D

from A to E




Comments

  1. From A to C, directly, there are no ways, but you can go through B and then to C.
    There are three ways to get from A to B and two ways to get from B to C. If we then multiply these values, we get 6, which is the answer.

    From A to D directly, there is one way. We will have to add this at the end. Next, we can do the same as what we did for the last problem. There are three ways to get from A to B, two routes from B to C, and four routes from C to D. If we multiply these together, we get 24 ways. If we add on the one direct way, there are 25 ways.

    Finally, to get from A to E, there is one direct way, then two ways from A to D to E, and then six ways from A to B to C to E. This is a total of 9 tracks. Now we need to add the ways from A to B to C to D to E. there are 24 ways from the last problem, and if we multiply this by the number of ways from D to E, we get 48. Now we add the nine from before to get 57.

    ReplyDelete

Post a Comment

Popular posts from this blog

A box of biscuits

The Secret of the Locked Chest

Word Problem