You Must Construct Additional Pylons

If I want to move from point A to point B, and I cannot traverse each edge more than once, how many paths could I possibly take?

5 7 9 11

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Notice that the exact shape of the path is irrelevant to the problem. We only need certain important points, precisely, the intersections. Let us relabel the diagram.

  1. We could go straight from A A to B B : To do this, we can walk along A P Q B APQB , A P X Q B APXQB , or A P Y Q B APYQB . That's three of them.
  2. We could go from A A to B B , loop back to A A and use the remaining edge to traverse back to B B . Two choose the first edge, there are 3 3 ways, and then to choose the back-edge, only the remaining 2 2 edges, and just 1 1 remaining edge to use to travel back to B. So, there are 2 × 3 = 6 2 \times 3 = 6 possible such walks. A P X Q P Y Q B APXQPYQB , A P X Q Y P Q B APXQYPQB , A P Q X P Y Q B APQXPYQB , A P Q Y P X Q B APQYPXQB , A P Y Q X P Q B APYQXPQB , A P Y Q P X Q B APYQPXQB

In total, there are 9 9 walks from A A to B B

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...