答案詳細解析請參考文末
![]()
![]()
![]()
![]()
![]()
![]()
Problem 4
Martians measure angles in clerts. There are?
?clerts in a full circle. How many clerts are there in a right angle?
![]()
The area of the rectangular region is
![[asy] draw((0,0)--(4,0)--(4,2.2)--(0,2.2)--cycle,linewidth(.5 mm)); label(".22 m",(4,1.1),E); label(".4 m",(2,0),S); [/asy]](https://latex.artofproblemsolving.com/8/c/c/8cc290473bf98b3c78b84fe4028b8f76279b0e54.png)
![]()
The smallest product one could obtain by multiplying two numbers in the set?
?is
![]()
The large cube shown is made up of?
?identical sized smaller cubes. For each face of the large cube, the opposite face is shaded the same way. The total number of smaller cubes that must have at least one face shaded is
![]()
![[asy] unitsize(36); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((3,0)--(5.2,1.4)--(5.2,4.4)--(3,3)); draw((0,3)--(2.2,4.4)--(5.2,4.4)); fill((0,0)--(0,1)--(1,1)--(1,0)--cycle,black); fill((0,2)--(0,3)--(1,3)--(1,2)--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((2,2)--(3,2)--(3,3)--(2,3)--cycle,black); draw((1,3)--(3.2,4.4)); draw((2,3)--(4.2,4.4)); draw((.733333333,3.4666666666)--(3.73333333333,3.466666666666)); draw((1.466666666,3.9333333333)--(4.466666666,3.9333333333)); fill((1.73333333,3.46666666666)--(2.7333333333,3.46666666666)--(3.46666666666,3.93333333333)--(2.46666666666,3.93333333333)--cycle,black); fill((3,1)--(3.733333333333,1.466666666666)--(3.73333333333,2.46666666666)--(3,2)--cycle,black); fill((3.73333333333,.466666666666)--(4.466666666666,.93333333333)--(4.46666666666,1.93333333333)--(3.733333333333,1.46666666666)--cycle,black); fill((3.73333333333,2.466666666666)--(4.466666666666,2.93333333333)--(4.46666666666,3.93333333333)--(3.733333333333,3.46666666666)--cycle,black); fill((4.466666666666,1.9333333333333)--(5.2,2.4)--(5.2,3.4)--(4.4666666666666,2.9333333333333)--cycle,black); [/asy]](https://latex.artofproblemsolving.com/3/2/d/32d182fcce5019c425fe5750bc4ed740d6bbc707.png)
If?
?and?
?are nonzero digits, then the number of digits (not necessarily different) in the sum of the three whole numbers is
![[begin{tabular}[t]{cccc} 9 & 8 & 7 & 6 \ & A & 3 & 2 \ & & B & 1 \ hline end{tabular}]](https://latex.artofproblemsolving.com/0/9/a/09af7496b4ffdb27348f275b8ab9b58041caf217.png)
![]()
When finding the sum?
, the least common denominator used is
![]()
![]()
![]()
The sum?
?is between
![]()
What fraction of the large?
?by?
?rectangular region is shaded?
![[asy] draw((0,0)--(18,0)--(18,12)--(0,12)--cycle); draw((0,6)--(18,6)); for(int a=6; a<12; ++a) { draw((1.5a,0)--(1.5a,6)); } fill((15,0)--(18,0)--(18,6)--(15,6)--cycle,black); label("0",(0,0),W); label("9",(9,0),S); label("18",(18,0),S); label("6",(0,6),W); label("12",(0,12),W); [/asy]](https://latex.artofproblemsolving.com/b/0/c/b0c6216f64369917ffe601761ed51640384663a4.png)
![]()
Which of the following fractions has the largest value?
![]()
A computer can do?
?additions per second. How many additions can it do in one hour?
![]()
The sale ad read: "Buy three tires at the regular price and get the fourth tire for three dollars;." Sam paid?
?for a set of four tires at the sale. What was the regular price of one tire?
![]()
Joyce made?
?of her first?
?shots in the first three games of this basketball game, so her seasonal shooting average was?
. In her next game, she took?
?shots and raised her seasonal shooting average to?
. How many of these?
?shots did she make?
![]()
Abby, Bret, Carl, and Dana are seated in a row of four seats numbered #1 to #4. Joe looks at them and says:
"Bret is next to Carl." "Abby is between Bret and Carl."
However each one of Joe's statements is false. Bret is actually sitting in seat #3. Who is sitting in seat #2?
![]()
Half the people in a room left. One third of those remaining started to dance. There were then?
?people who were not dancing. The original number of people in the room was
![]()
A calculator has a squaring key?
?which replaces the current number displayed with its square. For example, if the display is?
?and the?
?key is depressed, then the display becomes?
. If the display reads?
, how many times must you depress the?
?key to produce a displayed number greater than?
?
![]()
"If a whole number?
?is not prime, then the whole number?
?is not prime." A value of?
?which shows this statement to be false is
![]()
Suppose?
?means?
, the reciprocal of?
. For example,?
. How many of the following statements are true?
i)ii)
iii)
iv)
![]()
![]()
?is a rectangle,?
?is the center of the circle, and?
?is on the circle. If?
?and?
, then the area of the shaded region is between
![[asy] pair A,B,C,D; A=(0,4); B=(3,4); C=(3,0); D=origin; draw(circle(D,5)); fill((0,5)..(1.5,4.7697)..B--A--cycle,black); fill(B..(4,3)..(5,0)--C--cycle,black); draw((0,5)--D--(5,0)); label("A",A,NW); label("B",B,NE); label("C",C,S); label("D",D,SW); [/asy]](https://latex.artofproblemsolving.com/3/4/f/34f83e970acc786d0c8e91464cc6120d79fc07aa.png)
![]()
Assume the adjoining chart shows the?
?U.S. population, in millions, for each region by ethnic group. To the nearest percent, what percent of the U.S. Black population lived in the South?
![[begin{tabular}[t]{c|cccc} & NE & MW & South & West \ hline White & 42 & 52 & 57 & 35 \ Black & 5 & 5 & 15 & 2 \ Asian & 1 & 1 & 1 & 3 \ Other & 1 & 1 & 2 & 4 end{tabular}]](https://latex.artofproblemsolving.com/a/c/0/ac0df9f07dd9f79c3f3332c757b2ab909d547f32.png)
![]()
A multiple choice examination consists of?
?questions. The scoring is?
?for each correct answer,?
?for each incorrect answer, and?
?for each unanswered question. John's score on the examination is?
. What is the maximum number of questions he could have answered correctly?
![]()
Ten balls numbered?
?to?
?are in a jar. Jack reaches into the jar and randomly removes one of the balls. Then Jill reaches into the jar and randomly removes a different ball. The probability that the sum of the two numbers on the balls removed is even is
![]()
1.![]()
2.
Find that
Which gives us![]()
?Pair the least with the greatest, second least with the second greatest, etc, until you have five pairs, each adding up to?
?=?
?=?
?=?
?=?
?=?
. Since we have?
?pairs, we multiply?
?by?
?to get?
. But since we have to multiply by 2 (remember the 2 at the beginning of the parentheses!), we get?
, which is?
.
3.![]()
4.The right angle is?
?of the circle, hence it contains?
?clerts.
5.![]()
6.To get the smallest possible product, we want to multiply the smallest negative number by the largest positive number. These are?
?and?
, respectively, and their product is?
, which is?![]()
7.Clearly no cube has more than one face painted. Therefore, the number of cubes with at least one face painted is equal to the number of painted unit squares.
There are?
?painted unit squares on the half of the cube shown, so there are?
?cubes with at least one face painted.
![]()
8.The minimum possible value of this sum is when?
, which is![]()
The largest possible value of the sum is when?
, making the sum![]()
Since all the possible sums are between?
?and?
, they must have?
?digits.
![]()
9.We want the?least common multiple?of?
, which is?
, or choice?
.
10.
We can make use of the?distributive property?as?follows:
![]()
11.
Since?
?and?
,![]()
Clearly,![]()
Thus, the sum is between?
?and?
.
![]()
12.The shaded region makes up?
?of the quarter rectangle. The quarter rectangle is then?
?of the large rectangle, so the shaded region takes up?
?of the large rectangle.
![]()
13.Note that the first four choices are a little less than?
, but the last choice is just above?
. Thus, the largest fraction is clearly?![]()
14.There are?
?seconds per hour, so we have
15.
Let the regular price of one tire be?
. We have![]()
?Good Job!
16.After the fourth game, she took?
?shots,?
?of which she made, so she made?
?shots. Twelve of them were made in the first three games, so in the last game she made?
?shots.
![]()
17.We know that Carl does not sit next to Bret, so he must sit in seat #1. Since Abby is not between Bret and Carl, she must sit in seat #4. Finally, Dana has to take the last seat available, which is #2.
![]()
18.Let the original number of people in the room be?
. Half of them left, so?
?of them are left in the room.
After that, one third of this group is dancing, so?
?people are not dancing.
This is given to be?
, so![]()
![]()
19.
We just brute force this:
Clearly we need to press the button?
?times, so?![]()
20.To show this statement to be false, we need a non-prime value of?
?such that?
?is prime. Since?
?and?
?are prime, they won't prove anything relating to the truth of the statement.
Now we just check the statement for?
. If?
?or?
, then?
?is?
?or?
, which aren't prime. However,?
?makes?
, which is prime, so?
?proves the statement false.
![]()
21.
We can just test all of these statements:
The last two statements are true and the first two aren't, so?![]()
22.
The area of the shaded region is equal to the area of the quarter circle with the area of the rectangle taken away. The area of the rectangle is?
, so we just need the quarter circle.
Applying the?Pythagorean Theorem?to?
, we have
Since?
?is a rectangle,![]()
Clearly?
?is a?radius?of the circle, so the area of the whole circle is?
?and the area of the quarter circle is?
.
Finally, the shaded region is
so the answer is?![]()
23.There are?
?million Blacks living in the U.S. Out of these,?
?of them live in the South, so the percentage is?
.
![]()
24.
Let?
?be the number of questions correct,?
?be the number of questions wrong, and?
?be the number of questions left blank. We are given that![]()
Adding equation?
?to double equation?
, we get![]()
Since we want to maximize the value of?
, we try to find the largest multiple of?
?less than?
. This is?
, so let?
. Then we have![]()
Finally, we have?
. We want?
, so the answer is?
, or?
.
If John answered 16 questions correctly, then he answered at most 4 questions incorrectly, giving him at least?
?points. Therefore, John did not answer 16 questions correctly. If he answered 12 questions correctly and 6 questions incorrectly (leaving 2 questions unanswered), then he scored?
?points.?As?all other options are less than 12, we conclude that 12 is the most questions John could have answered correctly, and the answer is?
.
25.For the sum of the two numbers removed to be even, they must be of the same?parity. There are five even values and five?odd?values.
No matter what Jack chooses, the number of numbers with the same parity is four. There are nine numbers total, so the probability Jill chooses a number with the same parity?as?Jack's is?![]()
![]()
We find that it is only possible for the sum to be even if the numbers added are both even or odd. We will get an odd number when we add an even and an odd. We can use?complementary counting?to help solve the problem. There are a total of?
?possibilities since Jack can chose?
numbers and Jill can pick?
. There are?
?possibilities for the two numbers to be different since Jack can pick any of the?
?numbers and Jill has to pick from?
?numbers in the set with a different?parity?than the one that Jack picks. So the probability that the sum will be odd is?
. Subtracting this by one gets the answer?![]()
![]()


? 2025. All Rights Reserved. 滬ICP備2023009024號-1