olymmath

AMC 8 1986 Problem 9

  • Paper

Using only the paths and the directions shown, how many different routes are there from M\text{M} to N\text{N}?

(A) 2(B) 3(C) 4(D) 5(E) 6\text{(A)}\ 2 \text{(B)}\ 3 \text{(C)}\ 4 \text{(D)}\ 5 \text{(E)}\ 6

Dataset text NuminaMath-1.5. Quoted with source.

Show the answer

6

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator amc8/1986/p9 · Tag 53AYAMC4KP · Edit this page on GitHub · Keys: j next, k previous