真題解析
A scout troop buys?
?candy bars at a price of five for?
?dollars. They sell all the candy bars at the price of two for?
?dollar. What was their profit, in dollars?
![]()
A positive number?
?has the property that?
?of?
?is?
. What is?
?
![]()
Brianna is using part of the money she earned on her weekend job to buy several equally-priced CDs. She used one ?fth of her money to buy one third of the CDs. What fraction of her money will she have left after she buys all the CDs?
![]()
At the beginning of the school year, Lisa's goal was to earn an A on at least?
?of her?
?quizzes for the year. She earned an A on?
?of the first?
?quizzes. If she is to achieve her goal, on at most how many of the remaining quizzes can she earn a grade lower than an A?
![]()
An?
-foot by?
-foot floor is tiled with square tiles of size?
?foot by?
?foot. Each tile has a pattern consisting of four white quarter circles of radius?
?foot centered at each corner of the tile. The remaining portion of the tile is shaded. How many square feet of the floor are shaded?
![[asy] unitsize(2cm); defaultpen(linewidth(.8pt)); fill(unitsquare,gray); filldraw(Arc((0,0),.5,0,90)--(0,0)--cycle,white,black); filldraw(Arc((1,0),.5,90,180)--(1,0)--cycle,white,black); filldraw(Arc((1,1),.5,180,270)--(1,1)--cycle,white,black); filldraw(Arc((0,1),.5,270,360)--(0,1)--cycle,white,black); [/asy]](https://latex.artofproblemsolving.com/c/b/e/cbe2bb4966beb1c1cbc889938c8e120b7d80639b.png)
![]()
In?
, we have?
?and?
. Suppose that?
?is a point on line?
?such that?
?lies between?
?and?
?and?
. What is?
?
![]()
What is the area enclosed by the graph of?
?
![]()
For how many values of?
?is it true that the line?
?passes through the vertex of the parabola?
??
![]()
On a certain math exam,?
?of the students got?
?points,?
?got?
?points,?
?got?
?points,?
?got?
?points, and the rest got?
points. What is the difference between the mean and the median score on this exam?
![]()
The first term of a sequence is?
. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the?
?term of the sequence?
![]()
An envelope contains eight bills:?
?ones,?
?fives,?
?tens, and?
?twenties. Two bills are drawn at random without replacement. What is the probability that their sum is $
?or more?
![]()
The?quadratic equation?
?has roots twice those of?
, and none of?
?and?
?is zero. What is the value of?
?
![]()
Suppose that?
,?
,?
, ... ,?
. What is?
?
![]()
A circle having center?
, with?
,is tangent to the lines?
,?
?and?
. What is the radius of this circle?
![]()
The sum of four two-digit numbers is?
. None of the eight digits is?
?and no two of them are the same. Which of the following is?not?included among the eight digits?
![]()
Eight spheres of radius 1, one per octant, are each tangent to the coordinate planes. What is the radius of the smallest sphere, centered at the origin, that contains these eight spheres?
![]()
How many distinct four-tuples?
?of rational numbers are there with
?
![]()
Let?
?and?
?be points in the plane. Define?
?as?the region in the first quadrant consisting of those points?
?such that?
?is an acute triangle. What is the closest integer to the area of the region?
?
![]()
Let?
?and?
?be two-digit integers such that?
?is obtained by reversing the digits of?
. The integers?
?and?
?satisfy?
?for some positive integer?
. What is?
?
![]()
Let?
?and?
?be distinct elements in the set
![]()
What is the minimum possible value of
![]()
![]()
A positive integer?
?has?
?divisors and?
?has?
?divisors. What is the greatest integer?
?such that?
?divides?
?
![]()
A sequence of complex numbers?
?is defined by the rule
![]()
where?
?is the?complex conjugate?of?
?and?
. Suppose that?
?and?
. How many possible values are there for?
?
![]()
Let?
?be the set of ordered triples?
?of real numbers for which
There are real numbers?
?and?
?such that for all ordered triples?
?in?
?we have?
?What is the value of?![]()
![]()
All three vertices of an equilateral triangle are on the parabola?
, and one of its sides has a slope of?
. The?
-coordinates of the three vertices have a sum of?
, where?
?and?
?are relatively prime positive integers. What is the value of?
?
![]()
Six ants simultaneously stand on the six?vertices?of a regular?octahedron, with each ant at a different vertex. Simultaneously and independently, each ant moves from its vertex to one of the four adjacent vertices, each with equal?probability. What is the probability that no two ants arrive at the same vertex?
![]()

Since?
?means?
, the statement "
" can be rewritten?as?"
":![]()
Let?
Brianna's money. We have?
. Thus, the money left over is?
, so the answer is?
. This was just a simple manipulation of the equation. No solving was needed!
Lisa's goal was to get an A on?
?quizzes. She already has A's on?
?quizzes, so she needs to get A's on?
?more. There are?
?quizzes left, so she can afford to get less than an A on?
?of them. Here, only the A's matter... No complicated stuff!
There are 80 tiles. Each tile has?
?shaded. Thus:
4 quarters of a circle is a circle so that may save you 0.5 seconds???
In?
, we have?
?and?
. Suppose that?
?is a point on line?
?such that?
?lies between?
?and?
?and?
. What is?
?![]()
Draw height?
?(Perpendicular line from point C to line AD). We have that?
. From the?Pythagorean Theorem,?
. Since?
,?
, and?
, so?
.
If we get rid of the absolute values, we are left with the following 4 equations (using the logic that if?
, then?
?is either?
?or?
):

We can then put these equations in slope-intercept form in order to graph them.

Now you can graph the lines to find the shape of the graph:
![[asy] Label f; f.p=fontsize(6); xaxis(-8,8,Ticks(f, 4.0)); yaxis(-6,6,Ticks(f, 3.0)); fill((0,-3)--(4,0)--(0,3)--(-4,0)--cycle,grey); draw((-4,-6)--(8,3), Arrows(4)); draw((4,-6)--(-8,3), Arrows(4)); draw((-4,6)--(8,-3), Arrows(4)); draw((4,6)--(-8,-3), Arrows(4));[/asy]](https://latex.artofproblemsolving.com/a/1/9/a19def037694543a1771b3897d68d519dd066fcf.png)
We can easily see that it is a rhombus with diagonals of?
?and?
. The area is?
, or?![]()
You can also assign?
?and?
?to be?
. Then you can easily see that the diagonals are?
?and?
. Multiply and divide by?
?to get D.
We see that the vertex of the quadratic function?
?is?
. The y-intercept of the line?
?is?
. We want to find the values (if any) such that?
. Solving for?
, the only values that satisfy this are?
?and?
, so the answer is?![]()
To begin, we see that the remaining?
?of the students got?
?points. Assume that there are?
?students; we see that?
?students got?
?points,?
?students got?
?points,?
?students got?
?points,?
?students got?
?points, and?
?students got?
?points. The median is?
, since the?
?and?
?terms are both?
. The mean is?
. The difference between the mean and median, therefore, is?
.
Performing this operation several times yields the results of?
?for the second term,?
?for the third term, and?
?for the fourth term. The sum of the cubes of the digits of?
?equal?
, a complete cycle. The cycle is... excluding the first term, the?
,?
, and?
?terms will equal?
,?
, and?
, following the fourth term. Any term number that is equivalent to?
?will produce a result of?
. It just so happens that?
, which leads us to the answer of?
.
The only way to get a total of $
?or more is if you pick a twenty and another bill, or if you pick both tens. There are a total of?
?ways to choose?
?bills out of?
. There are?
?ways to choose a twenty and some other non-twenty bill. There is?
?way to choose both twenties, and also?
?way to choose both tens. Adding these up, we find that there are a total of?
?ways to attain a sum of?
?or greater, so there is a total probability of?
.
Another way to do this problem is to use complementary counting, i.e. how many ways that the sum is less than 20. Now, you do not have to consider the 2 twenties, so you have 6 bills left.?
?ways. However, you counted the case when you have 2 tens, so you need to subtract 1, and you get 14. Finding the ways to get 20 or higher, you subtract 14 from 28 and get 14. So the answer is?
.
Let?
?have roots?
?and?
. Then
![]()
so?
?and?
. Also,?
?has roots?
?and?
, so
![]()
and?
?and?
. Thus?
.
Indeed, consider the quadratics?
.
If the roots of?
?are 2a and 2b and the roots of?
?are a and b, then using Vieta's equations,![]()
![]()
![]()
Therefore, substituting the second equation into the first equation gives
and substituting the fourth equation into the third equation gives
We see that we can re-write?
,?
,?
, ... ,?
?as?
?by using substitution. By using the properties of exponents, we know that?
.
Therefore, the answer is?![]()
Changing?
?to logarithmic form, we get?
. We can rewrite this?as?
. Applying this to the rest, we get?![]()
Let?
?be the radius of the circle. Draw the two radii that meet the points of tangency to the lines?
. We can see that a square is formed by the origin, two tangency points, and the center of the circle. The side lengths of this square are?
?and the diagonal is?
. The diagonal of a square is?
?times the side length. Therefore,?
.
![[asy] real Xmin,Xmax,Ymin,Ymax; real R = 6+6*sqrt(2); Xmin = -16; Xmax = 16; Ymin = -4; Ymax = 40; xaxis(Xmin,Xmax,Arrows); yaxis(Ymin,Ymax,Arrows); label("$x$",(Xmax+0.25,0),S); label("$y$",(0,Ymax+0.25),E); draw((Xmin,-Xmin)--(-Ymin,Ymin)); draw((Xmax,Xmax)--(Ymin,Ymin)); draw((Xmin,6)--(Xmax,6)); dot((0,0)); dot((R/sqrt(2),R/sqrt(2))); dot((-R/sqrt(2),R/sqrt(2))); dot((0,R*sqrt(2))); draw((0,0)--(R/sqrt(2),R/sqrt(2))--(0,R*sqrt(2))--(-R/sqrt(2),R/sqrt(2))--(0,0)); draw(Circle((0,6+R),R)); label("$R$",(0,6+R/2),(0,0)); label("$R$",(-R/(2*sqrt(2)),3*R/(2*sqrt(2))),0.5*NW); label("$R$",(R/(2*sqrt(2)),3*R/(2*sqrt(2))),0.5*NE); label("$R$",(-R/(2*sqrt(2)),R/(2*sqrt(2))),0.5*SW); label("$R$",(R/(2*sqrt(2)),R/(2*sqrt(2))),0.5*SE); label("$6$",(0,3),(0,0)); [/asy]](https://latex.artofproblemsolving.com/9/2/1/9214d60dfddf137d3b4e216cf2abcdd4d76c8e90.png)
?can be written?as?the sum of four two-digit numbers, let's say?
,?
,?
, and?
. Then?
. The last digit of?
?is?
, and?
?won't affect the units digits, so?
?must end with?
. The smallest value?
?can have is?
, and the greatest value is?
. Therefore,?
?must equal?
?or?
.
Case 1:?![]()
The only distinct positive integers that can add up to?
?is?
. So,?
,
,
, and?
?must include four of the five numbers?
. We have?
, or?
. We can add all of?
, and try subtracting one number to get to?
, but to no avail. Therefore,?
?cannot add up to?
.
Case 2:?![]()
Checking all the values for?
,
,
,and?
?each individually may be time-consuming, instead of only having?
?solution like Case 1. We can try a different approach by looking at?
?first. If?
,?
, or?
. That means?
. We know?
, so the missing digit is?![]()
Alternatively, we know that a number is congruent to the sum of its digits mod 9, so?
, where?
?is some digit. Clearly,?
.
The eight spheres are formed by shifting spheres of radius?
?and center?
?
?in the?
?directions. Hence, the centers of the spheres are?
. For a sphere centered at the origin to contain all eight spheres, its radius must be greater than or equal to the longest distance from the origin to one of these spheres. This length is the sum of the distance from?
?to the origin and the radius of the spheres, or?
. To verify this is the longest length, we can see from the triangle inequality that the length from the origin to any other point on the spheres is strictly smaller. Thus, the answer is?
.
Using the laws of?logarithms, the given equation becomes![]()
![]()
As?
?must all be rational, and there are no powers of?
?or?
?in?
,?
. Then?
.Only the four-tuple?
?satisfies the equation, so the answer is?
.
For angle?
?and?
?to be acute,?
?must be between the two lines that are perpendicular to?
?and contain points?
?and?
. For angle?
?to be acute, first draw a?
?triangle with?
?as?the hypotenuse. Note?
?cannot be inside this triangle's circumscribed circle or else?
. Hence, the area of?
?is the area of the large triangle minus the area of the small triangle minus the area of the circle, which is?
, which is approximately?
. The answer is?
.
let?
, then?
?where?
?and?
?are nonzero digits.By difference of squares,![]()
![]()
For this product to be a square, the factor of?
?must be repeated in either?
?or?
, and given the constraints it has to be?
. The factor of?
?is already a square and can be ignored. Now?
?must be another square, and since?
?cannot be?
?or greater then?
?must equal?
?or?
. If?
?then?
,?
,?
, which is not a digit. Hence the only possible value for?
?is?
. Now we have?
,?
,?
, then?
,?
,?
,?
, and?![]()
The sum of the set is?
, so if we could have the sum in each set of parenthesis be?
?then the minimum value would be?
. Considering the set of four terms containing?
, this sum could only be even if it had two or four odd terms. If it had all four odd terms then it would be?
, and with two odd terms then its minimum value is?
, so we cannot achieve two sums of?
. The closest we could have to?
?and?
?is?
?and?
, which can be achieved through?
?and?
. So the minimum possible value is?
.
We may let?
, where?
?is not divisible by 7. Using the fact that the number of divisors function?
?is multiplicative, we have?
. Also,?
. These numbers are in the ratio 3:4, so?
.
Since?
, let?
, where?
?is an?argument?of?
. We will prove by induction that?
, where?
.
Base Case: trivial
Inductive Step: Suppose the formula is correct for?
, then
Since
the formula is proven
, where?
?is an integer. Therefore,![]()
The value of?
?only matters?modulo?
. Since?
, k can take values from 0 to?
, so the answer is?![]()
Let?
.![]()
Repeating through this recursive process, we can quickly see that
Thus,?
. The solutions for?
?are?
?where?
. Note that?
?for all?
, so the answer is?
. (Author: Patrick Yin)
Note that for any complex number?
, we have?
. Therefore, the magnitude of?
?is always?
, meaning that all of the numbers in the sequence?
?are of magnitude?
.
Another property of complex numbers is that?
. For the numbers in our sequence, this means?
, so?
. Rewriting our recursive condition with these facts, we now have
Solving for?
?here, we obtain
It is seen that there are two values of?
?which correspond to one value of?
. That means that there are two possible values of?
, four possible values of?
, and so on. Therefore, there are?
?possible values of?
, giving the answer?as?
.
Let?
?and?
. Then,?
?implies?
,so?
. Therefore,?
. Since?
, we find that?
. Thus,?
?
?![]()
First, remember that?
?factors to?
. By the givens,?
?and?
. These can be used to find?
:![]()
![]()
![]()
![]()
Therefore,![]()
![]()
![]()
![]()
![]()
It follows that?
?and?
, thus?![]()
We can rearrange?
?into?
?and?
?into?![]()
We can then put?
?to the third power or?
. Basic polynomial multiplication shows us that?
?Thus,?
?or?
. We know that?
?so we have?
.
Now we need to find out what?
?is equal to in terms of?
. We will find?
?by squaring?
. It is basic polynomial multiplication to figure out that?
. We also given that
?and?
. Thus?
?or?
. Rearranging the terms of this equation we obtain that?
?or?
. Now plugging this equation into our original equation?
, we obtain the equation?
Simple rearranging of this equation yields the result that?
. Combining like terms we obtain the equation?
.
Now we know the coefficients of?
?and?
?which are?
?and?
?respectively. Adding the two coefficients we obtain an answer of?
?
?
?(Author: David Camacho)
![[asy] import graph; real f(real x) {return x^2;} unitsize(1 cm); pair A, B, C; real a, b, c; a = (-5*sqrt(3) + 11)/11; b = (5*sqrt(3) + 11)/11; c = -19/11; A = (a,f(a)); B = (b,f(b)); C = (c,f(c)); draw(graph(f,-2,2)); draw((-2,0)--(2,0),Arrows); draw((0,-0.5)--(0,4),Arrows); draw(A--B--C--cycle); label("$x$", (2,0), NE); label("$y$", (0,4), NE); dot("$A(a,a^2)$", A, S); dot("$B(b,b^2)$", B, E); dot("$C(c,c^2)$", C, W); [/asy]](https://latex.artofproblemsolving.com/1/6/1/16184f744e08f706cf208e04e55092dcd13671ad.png)
We approach this problem by counting the number of ways ants can do their desired migration, and then multiple this number by the probability that each case occurs.
Let the octahedron be?
, with points?
?coplanar. Then the ant from?
?and the ant from?
?must move to plane?
. Suppose, without loss of generality, that the ant from?
?moved to point?
. Then, we must consider three cases.
Case 1: Ant from point?
?moved to point?![]()
On the plane, points?
?and?
?are taken. The ant that moves to?
?can come from either?
?or?
. The ant that moves to?
?can come from either?
?or?
. Once these two ants are fixed, the other two ants must migrate to the "poles" of the octahedron, points?
?and?
. Thus, there are two degrees of freedom in deciding which ant moves to?
, two degrees of freedom in deciding which ant moves to?
, and two degrees of freedom in deciding which ant moves to?
. Hence, there are?
?ways the ants can move to different points.
Case 2: Ant from point?
?moved to point?![]()
On the plane, points?
?and?
?are taken. The ant that moves to?
?must be from?
?or?
, but the ant that moves to?
?must also be from?
?or?
. The other two ants, originating from points?
?and?
, must move to the poles. Therefore, there are two degrees of freedom in deciding which ant moves to?
?and two degrees of freedom in choosing which ant moves to?
. Hence, there are?
?ways the ants can move to different points.
Case 3: Ant from point?
?moved to point?![]()
By symmetry to Case 1, there are?
?ways the ants can move to different points.
Given a point?
, there is a total of?
?ways the ants can move to different points. We oriented the square so that point?
?was defined as the point to which the ant from point?
?moved. Since the ant from point?
?can actually move to four different points, there is a total of?
?ways the ants can move to different points.
Each ant acts independently, having four different points to choose from. Hence, each ant has probability?
?of moving to the desired location. Since there are six ants, the probability of each case occuring is?
. Thus, the desired answer is?
.
Let?
?be the number of?cycles?of length?
?the can be walked among the vertices of an octahedron. For example,?
?would represent the number of ways in which an ant could navigate?
?vertices and then return back to the original spot. Since an ant cannot stay still,?
. We also easily see that?
.
Now consider any four vertices of the octahedron. All four vertices will be connected by edges except for one pair. Let’s think of this?as?a?squarewith one diagonal (from top left to bottom right).
![[asy] size(30); defaultpen(0.6); pair A = (0,0), B=(5,0), C=(5,5), D=(0,5); draw(A--B--C--D--cycle); draw(B--D); [/asy]](https://latex.artofproblemsolving.com/6/6/6/666e49bcbf25ed91b3eda62dae34cc3680159376.png)
For?
, consider an ant at the top of the octahedron. It has four choices. Afterwards, it can either travel directly to the bottom, and then it has?
ways back up, or it can travel along the sides and then go to the bottom, of which simple counting gives us?
?ways back up. Hence, this totals?
.
Now, the number of possible ways is given by the sum of all possible cycles,![]()
where the?coefficients?represent the number of ways we can configure these cycles. To find?
, fix any face, there are?
?adjacent faces to select from to complete the cycle. From the four remaining faces there are only?
?ways to create cycles, hence?
.
To find?
, each cycle of?
?faces is distinguished by their common edge, and there are?
?edges, so?
.
To find?
, each three-cycle is distinguished by the vertex, and there are?
?edges. However, since the two three-cycles are indistinguishable,?
.
Clearly?
. Finally,
![]()
Each bug has?
?possibilities to choose from, so the probability is?
.
以上解析方式僅供參考
學術活動報名掃碼了解!免費領取歷年真題!

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