Difference between revisions of "1986 AJHSME Problems/Problem 9"
5849206328x (talk | contribs) (New page: ==Problem== Using only the paths and the directions shown, how many different routes are there from <math>\text{M}</math> to <math>\text{N}</math>? <asy> draw((0,0)--(3,0),MidArrow); dra...) |
(No difference)
|
Revision as of 09:12, 19 January 2009
Problem
Using only the paths and the directions shown, how many different routes are there from to ?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.