1986 AJHSME Problems/Problem 9
Revision as of 09:12, 19 January 2009 by 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...)
Problem
Using only the paths and the directions shown, how many different routes are there from 
to 
?
![[asy] draw((0,0)--(3,0),MidArrow); draw((3,0)--(6,0),MidArrow); draw(6*dir(60)--3*dir(60),MidArrow); draw(3*dir(60)--(0,0),MidArrow); draw(3*dir(60)--(3,0),MidArrow); draw(5.1961524227066318805823390245176*dir(30)--(6,0),MidArrow); draw(6*dir(60)--5.1961524227066318805823390245176*dir(30),MidArrow); draw(5.1961524227066318805823390245176*dir(30)--3*dir(60),MidArrow); draw(5.1961524227066318805823390245176*dir(30)--(3,0),MidArrow); label("M",6*dir(60),N); label("N",(6,0),SE); label("A",3*dir(60),NW); label("B",5.1961524227066318805823390245176*dir(30),NE); label("C",(3,0),S); label("D",(0,0),SW); [/asy]](http://latex.artofproblemsolving.com/d/7/b/d7b6d3b20583aeac57d4bae5e7e0367f8b123720.png)
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
