1991年AJHSME真题
- 这是一个包含25个问题的单项选择题测试。每个问题后面都有标记为A、B、C、D和E的答案。其中只有一个是正确的。每个正确答案得1分。错误的答案不会扣分。
- 除普通纸、书写工具、尺子和橡皮外,不允许使用任何辅助工具。特别是,不允许使用方格纸、指南针、量角器、计算器、电脑、智能手表和智能手机。
- 您将有40分钟的工作时间来完成测试。
1991年AJHSME真题+答案在线试做!
以下是整理好的中英双语真题试卷,还有全英版真题供您选择!
1991年AJHSME 真题:
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?
![[asy] unitsize(12); fill((0,0)--(1,0)--(1,1)--(0,1)--cycle,black); fill((1,1)--(1,2)--(2,2)--(2,1)--cycle,black); fill((2,0)--(3,0)--(3,1)--(2,1)--cycle,black); fill((3,1)--(4,1)--(4,2)--(3,2)--cycle,black); fill((0,2)--(1,2)--(1,3)--(0,3)--cycle,black); fill((2,2)--(2,3)--(3,3)--(3,2)--cycle,black); draw((0,0)--(0,3)--(4,3)--(4,0)--cycle); draw((6,0)--(11,0)--(11,3)--(6,3)--cycle); fill((6,0)--(7,0)--(7,1)--(6,1)--cycle,black); fill((8,0)--(9,0)--(9,1)--(8,1)--cycle,black); fill((10,0)--(11,0)--(11,1)--(10,1)--cycle,black); fill((7,1)--(7,2)--(8,2)--(8,1)--cycle,black); fill((9,1)--(9,2)--(10,2)--(10,1)--cycle,black); fill((6,2)--(6,3)--(7,3)--(7,2)--cycle,black); fill((8,2)--(8,3)--(9,3)--(9,2)--cycle,black); fill((10,2)--(10,3)--(11,3)--(11,2)--cycle,black); draw((13,-1)--(13,3)--(17,3)--(17,-1)--cycle); fill((13,3)--(14,3)--(14,2)--(13,2)--cycle,black); fill((15,3)--(16,3)--(16,2)--(15,2)--cycle,black); fill((14,2)--(15,2)--(15,1)--(14,1)--cycle,black); fill((16,2)--(17,2)--(17,1)--(16,1)--cycle,black); fill((13,1)--(14,1)--(14,0)--(13,0)--cycle,black); fill((15,1)--(16,1)--(16,0)--(15,0)--cycle,black); fill((14,0)--(15,0)--(15,-1)--(14,-1)--cycle,black); fill((16,0)--(17,0)--(17,-1)--(16,-1)--cycle,black); draw((19,3)--(24,3)--(24,-1)--(19,-1)--cycle,black); fill((19,3)--(20,3)--(20,2)--(19,2)--cycle,black); fill((21,3)--(22,3)--(22,2)--(21,2)--cycle,black); fill((23,3)--(24,3)--(24,2)--(23,2)--cycle,black); fill((20,2)--(21,2)--(21,1)--(20,1)--cycle,black); fill((22,2)--(23,2)--(23,1)--(22,1)--cycle,black); fill((19,1)--(20,1)--(20,0)--(19,0)--cycle,black); fill((21,1)--(22,1)--(22,0)--(21,0)--cycle,black); fill((23,1)--(24,1)--(24,0)--(23,0)--cycle,black); fill((20,0)--(21,0)--(21,-1)--(20,-1)--cycle,black); fill((22,0)--(23,0)--(23,-1)--(22,-1)--cycle,black); draw((26,3)--(29,3)--(29,-3)--(26,-3)--cycle); fill((26,3)--(27,3)--(27,2)--(26,2)--cycle,black); fill((28,3)--(29,3)--(29,2)--(28,2)--cycle,black); fill((27,2)--(28,2)--(28,1)--(27,1)--cycle,black); fill((26,1)--(27,1)--(27,0)--(26,0)--cycle,black); fill((28,1)--(29,1)--(29,0)--(28,0)--cycle,black); fill((27,0)--(28,0)--(28,-1)--(27,-1)--cycle,black); fill((26,-1)--(27,-1)--(27,-2)--(26,-2)--cycle,black); fill((28,-1)--(29,-1)--(29,-2)--(28,-2)--cycle,black); fill((27,-2)--(28,-2)--(28,-3)--(27,-3)--cycle,black); [/asy]](https://latex.artofproblemsolving.com/0/5/4/0549d7186304b7b16f055941bb248dff3bcbcd70.png)
![]()
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.)![\[\begin{tabular}[t]{ccccc} 10 & 6 & 4 & 3 & 2 \\ 11 & 7 & 14 & 10 & 8 \\ 8 & 3 & 4 & 5 & 9 \\ 13 & 4 & 15 & 12 & 1 \\ 8 & 2 & 5 & 9 & 3 \end{tabular}\]](https://latex.artofproblemsolving.com/a/2/f/a2f94b73e928c49ee0bf3205e524e03cf1f6cfb4.png)
![]()
以下是我们为您整理的全英版pdf真题,扫码即可免费领取完整版:


扫码即可免费下载以上完整版真题+答案解析,
还可以免费下载近20年AMC8真题+答案解析⇓
