1991 AJHSME Problems
Revision as of 16:18, 15 July 2009 by 5849206328x (talk | contribs)
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
Problem 2
Problem 3
Two hundred thousand times two hundred thousand equals
Problem 4
If , then
Problem 5
A "domino" is made up of two small squares: Which of the "checkerboards" illustrated below CANNOT be covered exactly and completely by a whole number of non-overlapping dominoes?
Problem 6
Which number in the array below is both the largest in its column and the smallest in its row? (Columns go up and down, rows go right and left.)
Problem 7
The value of is closest to
Problem 8
What is the largest quotient that can be formed using two numbers chosen from the set ?
Problem 9
How many whole numbers from through are divisible by either or or both?
Problem 10
The area in square units of the region enclosed by parallelogram is
Problem 11
Problem 12
Problem 13
Problem 14
Problem 15
Problem 16
Problem 17
Problem 18
Problem 19
Problem 20
Problem 21
Problem 22
Problem 23
Problem 24
Problem 25
See also
1991 AJHSME (Problems • Answer Key • Resources) | ||
Preceded by 1990 AJHSME |
Followed by 1992 AJHSME | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AJHSME/AMC 8 Problems and Solutions |