Difference between revisions of "1986 AJHSME Problems"
5849206328x (talk | contribs) (→Problem 7) |
5849206328x (talk | contribs) (→Problem 9) |
||
Line 68: | Line 68: | ||
== Problem 9 == | == Problem 9 == | ||
+ | |||
+ | 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); | ||
+ | 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> | ||
+ | |||
+ | <math>\text{(A)}\ 2 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 5 \qquad \text{(E)}\ 6</math> | ||
[[1986 AJHSME Problems/Problem 9|Solution]] | [[1986 AJHSME Problems/Problem 9|Solution]] |
Revision as of 20:03, 15 January 2009
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
- 26 See also
Problem 1
In July 1861, inches of rain fell in Cherrapunji, India. What was the average rainfall in inches per hour during that month?
Problem 2
Which of the following numbers has the largest reciprocal?
Problem 3
The smallest sum one could get by adding three different numbers from the set is
Problem 4
The product is closest to
Problem 5
A contest began at noon one day and ended minutes later. At what time did the contest end?
Problem 6
Problem 7
How many whole numbers are between and ?
Problem 8
Problem 9
Using only the paths and the directions shown, how many different routes are there from to ?