CEMC Cayley, 2002

Combinatorics Difficulty 2.0 Junior Find the answer Canada

In the grid shown, it is only possible to travel along an edge in the direction indicated by the arrow. The number of different paths from $A$ to $F$ is

(A) $9$ (B) $5$ (C) $3$ (D) $6$ (E) $4$

Figure for this problem

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.