答案詳細解析請參考文末
A basketball player made?
?baskets during a game. Each basket was worth either?
?or?
?points. How many different numbers could represent the total points scored by the player?
![]()
A?
?block of calendar dates is shown. The order of the numbers in the second row is to be reversed. Then the order of the numbers in the fourth row is to be reversed. Finally, the numbers on each diagonal are to be added. What will be the positive difference between the two diagonal sums?
![$begin{tabular}[t]{|c|c|c|c|} multicolumn{4}{c}{}hline 1&2&3&4hline 8&9&10&11hline 15&16&17&18hline 22&23&24&25hline end{tabular}$](https://latex.artofproblemsolving.com/b/9/b/b9b73fd2d51a903cdaf987fca13b101dde70d13c.png)
![]()
A semipro baseball league has teams with?
?players each. League rules state that a player must be paid at least?
?dollars, and that the total of all players' salaries for each team cannot exceed?
?dollars. What is the maximum possible salary, in dollars, for a single player?
![]()
On circle?
, points?
?and?
?are on the same side of diameter?
,?
, and?
. What is the ratio of the area of the smaller sector?
?to the area of the circle?
![[asy] unitsize(6mm); defaultpen(linewidth(0.7)+fontsize(8pt)); pair C = 3*dir (30); pair D = 3*dir (135); pair A = 3*dir (0); pair B = 3*dir(180); pair O = (0,0); draw (Circle ((0, 0), 3)); label ("(C)", C, NE); label ("(D)", D, NW); label ("(B)", B, W); label ("(A)", A, E); label ("(O)", O, S); label ("(45^circ)", (-0.3,0.1), WNW); label ("(30^circ)", (0.5,0.1), ENE); draw (A--B); draw (O--D); draw (O--C); [/asy]](https://latex.artofproblemsolving.com/6/e/f/6ef568ce45b5abd28fca3d7565af0a5d7af4c6f2.png)
![]()
A class collects?
?dollars to buy flowers for a classmate who is in the hospital. Roses cost?
?dollars each, and carnations cost?
?dollars each. No other flowers are to be used. How many different bouquets could be purchased for exactly?
?dollars?
![]()
Postman Pete has a pedometer to count his steps. The pedometer records up to?
?steps, then flips over to?
?on the next step. Pete plans to determine his mileage for a year. On January?
?Pete sets the pedometer to?
. During the year, the pedometer flips from?
?to?
?forty-four times. On December?
?the pedometer reads?
. Pete takes?
?steps per mile. Which of the following is closest to the number of miles Pete walked during the year?
![]()
For real numbers?
?and?
, define?
$
. What is?
$
?
![]()
Points?
?and?
?lie on?
. The length of?
?is?
?times the length of?
, and the length of?
?is?
?times the length of?
. The length of?
?is what fraction of the length of?
?
![]()
Points?
?and?
?are on a circle of radius?
?and?
. Point?
?is the midpoint of the minor arc?
. What is the length of the line segment?
?
![]()
Bricklayer Brenda would take?
?hours to build a chimney alone, and bricklayer Brandon would take?
?hours to build it alone. When they work together they talk a lot, and their combined output is decreased by?
?bricks per hour. Working together, they build the chimney in?
?hours. How many bricks are in the chimney?
![]()
A cone-shaped mountain has its base on the ocean floor and has a height of 8000 feet. The top?
?of the volume of the mountain is above water. What is the depth of the ocean at the base of the mountain in feet?
![]()
For each positive integer?
, the mean of the first?
?terms of a sequence is?
. What is the?
th term of the sequence?
![]()
Vertex?
?of equilateral triangle?
?is in the interior of unit square?
. Let?
?be the region consisting of all points inside?
?and outside?
?whose distance from?
?is between?
?and?
. What is the area of?
?
![]()
A circle has a radius of?
?and a circumference of?
. What is?
?
![]()
On each side of a unit square, an equilateral triangle of side length 1 is constructed. On each new side of each equilateral triangle, another equilateral triangle of side length 1 is constructed. The interiors of the square and the 12 triangles have no points in common. Let?
?be the region formed by the union of the square and all the triangles, and?
?be the smallest convex polygon that contains?
. What is the area of the region that is inside?
?but outside?
?
![]()
A rectangular floor measures?
?by?
?feet, where?
?and?
?are positive integers with?
. An artist paints a rectangle on the floor with the sides of the rectangle parallel to the sides of the floor. The unpainted part of the floor forms a border of width?
?foot around the painted rectangle and occupies half of the area of the entire floor. How many possibilities are there for the ordered pair?
?
![]()
Let?
,?
?and?
?be three distinct points on the graph of?
?such that line?
?is parallel to the?
-axis and?
?is a right triangle with area?
. What is the sum of the digits of the?
-coordinate of?
?
![]()
A pyramid has a square base?
?and vertex?
. The area of square?
?is?
, and the areas of?
?and?
?are?
?and?
, respectively. What is the volume of the pyramid?
![]()
A function?
?is defined by?
?for all complex numbers?
, where?
?and?
?are complex numbers and?
. Suppose that?
?and?
?are both real. What is the smallest possible value of?
?
![]()
Michael walks at the rate of?
?feet per second on a long straight path. Trash pails are located every?
?feet along the path. A garbage truck travels at?
?feet per second in the same direction?as?Michael and stops for?
?seconds at each pail.?As?Michael passes a pail, he notices the truck ahead of him just leaving the next pail. How many times will Michael and the truck meet?
![]()
Two circles of radius 1 are to be constructed?as?follows. The center of circle?
?is chosen uniformly and at random from the line segment joining?
?and?
. The center of circle?
?is chosen uniformly and at random, and independently of the first choice, from the line segment joining?
?to?
. What is the probability that circles?
?and?
?intersect?
![]()
A parking lot has 16 spaces in a row. Twelve cars arrive, each of which requires one parking space, and their drivers chose spaces at random from among the available spaces. Auntie Em then arrives in her SUV, which requires 2 adjacent spaces. What is the probability that she is able to park?
![]()
The sum of the base-
?logarithms of the divisors of?
?is?
. What is?
?
![]()
Let?
. Distinct points?
?lie on the?
-axis, and distinct points?
?lie on the graph of?
. For every positive integer?
,?
?is an equilateral triangle. What is the least?
?for which the length?
?
![]()
Let?
?be a trapezoid with?
,?
,?
,?
, and?
. Bisectors of?
?and?
?meet at?
, and bisectors of?
?and?
?meet at?
. What is the area of hexagon?
?
![]()
Let?
?be the angle that subtends the arc?
. By the law of cosines,?
?implies?
.
The?half-angle formula?says that?
. The law of cosines tells us?
, which is answer choice?
.
![]() |
|
Figure 1 |
Define?
?as?the midpoint of line segment?
, and?
?the center of the circle. Then?
,?
, and?
?are collinear, and since?
?is the midpoint of?
,?
?and so?
. Since?
,?
, and so?
.
Letting?
?be the nth partial sum of the sequence:
![]()
![]()
The only possible sequence with this result is the sequence of odd integers.
![]()
![]()
Letting the sum of the sequence equal?
?yields the following two equations:
?and
.
Therefore:
?and?![]()
Hence, by substitution,?![]()
![[asy] pair A,B,C,D,E; A=(0,1); B=(1,1); C=(1,0); D=(0,0); E=(1/2,1-sqrt(3)/2); draw(A--B--C--D--cycle); label("A",A,NW); dot(A); label("B",B,NE); dot(B); label("C",C,SE); dot(C); label("D",D,SW); dot(D); draw(A--E--B--cycle); label("E",E,S); dot(E); draw((1/3,0)--(1/3,1)); draw((2/3,0)--(2/3,1)); fill((1/3,0)--(1/3,1-sqrt(3)/3)--E--(2/3,1-sqrt(3)/3)--(2/3,0)--cycle,Black);[/asy]](https://latex.artofproblemsolving.com/c/1/3/c138ff4f242efb62680b69d5db830a4762be1b42.png)
.The base of the rectangle is?
![[asy] real a = 1/2, b = sqrt(3)/2; draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((0,0)--(a,-b)--(1,0)--(1+b,a)--(1,1)--(a,1+b)--(0,1)--(-b,a)--(0,0)); draw((0,0)--(-1+a,-b)--(1+a,-b)--(1,0)--(1+b,-1+a)--(1+b,1+a)--(1,1)--(1+a,1+b)--(-1+a,1+b)--(0,1)--(-b,1+a)--(-b,-1+a)--(0,0)); filldraw((1+a,-b)--(1,0)--(1+b,-1+a)--cycle,gray(0.9)); filldraw((1+b,1+a)--(1,1)--(1+a,1+b)--cycle,gray(0.9)); filldraw((-1+a,1+b)--(0,1)--(-b,1+a)--cycle,gray(0.9)); filldraw((-b,-1+a)--(0,0)--(-1+a,-b)--cycle,gray(0.9)); [/asy]](https://latex.artofproblemsolving.com/8/c/7/8c7af6121e2831aa5bf8db7a271830fc340d0c5d.png)
We need only concern ourselves with the imaginary portions of?
?and?
?(both of which must be 0). These are:
![]()
Let?
?and?
?then we know?
?and?
?Therefore
which reaches its minimum?
?when?
?by the Trivial Inequality. Thus, the answer is?![]()
?![]()
Since?
?and?
?are both real we get,![]()
![]()
Solving, we get?
,?
?can be anything, to minimize the value we set?
, so then the answer is?
. Thus, the answer is?![]()
![[asy] import graph; size(400,300,IgnoreAspect); real[] xt = new real[21]; real[] yt = new real[21]; for (int i=0; i<11; ++i) xt[2*i]=50*i; for (int i=0; i<10; ++i) xt[2*i+1]=50*i+20; for (int i=0; i<11; ++i) yt[2*i]=200*(i+1); for (int i=0; i<10; ++i) yt[2*i+1]=200*(i+2); real[] xm={0,500}; real[] ym={0,2500}; draw(graph(xt,yt),red); draw(graph(xm,ym),blue); xaxis("$mathrm{time}$",Bottom,LeftTicks); yaxis("$mathrm{position}$",Left,LeftTicks); [/asy]](https://latex.artofproblemsolving.com/b/9/4/b9418ee09131439f5566d386095e5665437c05ce.png)
Circles centered at?
?and?
?will overlap if?
?and?
?are closer to each other than if the circles were tangent. The circles are tangent when the distance between their centers is equal to the sum of their radii. Thus, the distance from?
?to?
?will be?
. Since?
?and?
?are separated by?
vertically, they must be separated by?
?horizontally. Thus, if?
, the circles intersect.
Now, plot the two random variables?
?and?
?on the coordinate plane. Each variable ranges from?
?to?
. The circles intersect if the variables are within?
?of each other. Thus, the area in which the circles don't intersect is equal to the total area of two small triangles on opposite corners, each of area?
. We conclude the probability the circles intersect is:![[1-frac{(2-sqrt{3})^2}{4}=boxed{textbf{(E)}frac{4sqrt{3}-3}{4}}.]](https://latex.artofproblemsolving.com/0/1/a/01a32a94e3b5c0a95d824b2e9102c14b1b7e1c05.png)
Two circles intersect if the distance between their centers is less than the sum of their radii. In this problem,?
?and?
?intersect iff![]()
In other words, the two chosen?
-coordinates must differ by no more than?
. To find this probability, we divide the problem into cases:
1)?
?is on the interval?
. The probability that?
?falls within the desired range for a given?
?is?
?(on the left)?
?(on the right) all over?
?(the range of possible values). The total probability for this range is the sum of all these probabilities of?
?(over the range of?
) divided by the total range of?
?(which is?
). Thus, the total probability for this interval is![[frac{1}{2}left(int_{0}^{2-sqrt{3}} frac{x+sqrt{3}}{2},dxright) =frac{1}{2}left(x^2/4+frac{xsqrt{3}}{2} Big |_{0}^{2-sqrt{3}}right)]](https://latex.artofproblemsolving.com/c/0/f/c0f848643cb581923471f5070b217c6b44756624.png)
2)?
?is on the interval?
. In this case, any value of?
?will do, so the probability for the interval is simply?
.
3)?
?is on the interval?
. This is identical, by symmetry, to case 1.
The total probability is therefore?![]()
We first calculate the probability that the circles at are their maximum possible distance while still intersecting. Since the difference in heights is 1, and the two radii add up to 2 (at their point of tangency), we can see that the maximum possible distance for the two centers is?
. If we look at possible placements for the lower point, we see that at placement?
?there is exactly?
?of space wherein we can put the top point. Similarly, at point?
?we can put the top point anywhere, resulting in?
?of space. If one looks at a diagram (which I can't put here), we can see that the space available for the top point increases linearly from?
?to?
. From then on to?
?it stops at?
?(this is symmetric for the other half of placements). If one draws a plot of the space available (which I again can't show here) with x determined by the x-value of the bottom point and y determined by space available for the top point, we notice two things: first, since for each (theoretically infinitesimally) small x-slice there is a line segment determining how much space there is available, if we sum up all of the line segments and divide by the total space (technically speaking by enumerating all the valid combinations and dividing by all of the general combinations), we will end up with a plot that looks like a rectangle with two small triangles cut out of it. Two, that since this is symmetric, we can just focus on the first half?as?the ratio of valid to total is the same. We see that the rectangle has a height of?
?and a width of?
, thus its area is 2. The triangle's height is?
, and its width is the same thus its area is?
?=>?
. Now we simply subtract to obtain?
?is the valid area, thus?
?is our solution.
Every factor of?
?will be of the form?
. Using the logarithmic property?
, it suffices to count the total number of 2's and 5's running through all possible?
. For every factor?
, there will be another?
, so it suffices to count the total number of 2's occurring in all factors (because of this symmetry, the number of 5's will be equal). And since?
, the final sum will be the total number of 2's occurring in all factors of?
.
There are?
?choices for the exponent of 5 in each factor, and for each of those choices, there are?
?factors (each corresponding to a different exponent of 2), yielding?
?total 2's. The total number of 2's is therefore?
. Plugging in our answer choices into this formula yields 11 (answer choice?
)?as?the correct answer.
We are given
The property?
?now gives
The product of the divisors is (from elementary number theory)?
?where?
?is the number of divisors. Note that?
, so?
. Substituting these values with?
?in our equation above, we get?
, from whence we immediately obtain?
?as?the correct answer.
For every divisor?
?of?
,?
, we have?
. There are?
?divisors of?
?that are?
. After casework on the parity of?
, we find that the answer is given by?
.
The sum is![]()
![]()
![]()
Trying for answer choices we get?![]()
Let?
. We need to rewrite the recursion into something manageable. The two strange conditions,?
's lie on the graph of?
and?
?is an equilateral triangle, can be compacted?as?follows:
which uses?
, where?
?is the height of the equilateral triangle and therefore?
?times its base.
The relation above holds for?
?and for?
?
, so![[left(a_kfrac{sqrt{3}}{2}right)^2-left(a_{k-1}frac{sqrt{3}}{2}right)^2=]](https://latex.artofproblemsolving.com/a/e/e/aee559eb17dd729174f088536fdf6f4423e141d1.png)
Or,
This implies that each segment of a successive triangle is?
?more than the last triangle. To find?
, we merely have to plug in?
?into the aforementioned recursion and we have?
. Knowing that?
?is?
, we can deduce that?
.Thus,?
, so?
. We want to find?
?so that?
.?
?is our answer.
Consider two adjacent equilateral triangles obeying the problem statement. For each, drop an altitude to the?
?axis and denote the resulting heights?
?and?
. From 30-60-90 rules, the difference between the base of these altitudes is![]()
But the square root curve means that this distance is also expressible?as?
?(the?
?coordinates are the squares of the heights). Setting these expressions equal and dividing throughout by?
?leaves?
. So the difference in height of successive triangles is?
, meaning their bases are?
?wider and wider each time. From here, one can proceed?as?in Solution 1 to arrive at?
.

Since?
,?
, and they share?
, triangles?
?and?
?are congruent.
By the same reasoning, we also have that triangles?
?and?
?are congruent.
Hence, we have?
.
If we let the height of the trapezoid be?
, we have?
.
Thusly, if we find the height of the trapezoid and multiply it by 12, we will be done.
Let the projections of?
?and?
?to?
?be?
?and?
, respectively.
We have?
,?
, and?
.
Therefore,?
. Solving this, we easily get that?
.
Multiplying this by 12, we find that the area of hexagon?
?is?
, which corresponds to answer choice?
.
![[asy] unitsize(0.6cm); import olympiad; pair A,B,C,D,P,Q,M,N,W,X,Y,Z; A=(11/2,5sqrt(3)/2); B=(33/2,5sqrt(3)/2); C=(19,0); D=(0,0); P=incenter(A,D,(99999,5sqrt(3)/4)); Q=incenter(B,C,(-99999,5sqrt(3)/4)); W=P+(0,5sqrt(3)/4); X=P-(0,5sqrt(3)/4); Y=Q+(0,5sqrt(3)/4); Z=Q-(0,5sqrt(3)/4); M=reflect(A,P)*W; N=reflect(B,Q)*Y; draw(A--B--C--D--cycle); draw(A--P--D); draw(B--Q--C); label("$A$",A,dir(135)); label("$B$",B,dir(45)); label("$C$",C,dir(315)); label("$D$",D,dir(225)); dot("$P$",P,dir(0)); dot("$Q$",Q,dir(180)); draw(W--X); draw(Y--Z); draw(M--P); draw(N--Q); label("$11$",midpoint(A--B),dir(90)); label("$5$",midpoint(B--C),dir(45)); label("$19$",midpoint(C--D),dir(270)); label("$7$",midpoint(D--A),dir(135)); label("$x$",midpoint(P--W),dir(0)); label("$x$",midpoint(P--X),dir(0)); label("$x$",midpoint(P--M),dir(225)); label("$x$",midpoint(Q--Y),dir(180)); label("$x$",midpoint(Q--Z),dir(180)); label("$x$",midpoint(Q--N),dir(315)); draw(rightanglemark(P,W,B,12.5)); draw(rightanglemark(P,X,C,12.5)); draw(rightanglemark(P,M,D,12.5)); draw(rightanglemark(Q,Y,A,12.5)); draw(rightanglemark(Q,Z,D,12.5)); draw(rightanglemark(Q,N,C,12.5)); [/asy]](https://latex.artofproblemsolving.com/4/3/9/439a142ee816512f6ac356f1871ce0028a1f7458.png)
Since point?
?is the intersection of the angle bisectors of?
?and?
,?
?is equidistant from?
,?
, and?
. Likewise, point?
?is equidistant from?
,?
, and?
. Because both points?
?and?
?are equidistant from?
?and?
?and the distance between?
?and?
is constant, the common distances from each of the points to the mentioned segments is equal for?
?and?
. Call this distance?
.
The distance between a point and a line is the length of the segment perpendicular to the line with one endpoint on the line and the other on the point. This means the altitude from?
?to?
?is?
, so the area of?
?is equal to?
. Similarly, the area of?
?is?
. The altitude of the trapezoid is?
, because it is the sum of the distances from either?
?or?
?to?
?and?
. This means the area of trapezoid?
?is?
. Now, the area of hexagon?
?is the area of trapezoid?
, minus the areas of triangles?
?and?
. This is?
. Now it remains to find?
.
![[asy] unitsize(0.6cm); import olympiad; pair A,B,C,D,R,S; A=(11/2,5sqrt(3)/2); B=(33/2,5sqrt(3)/2); C=(19,0); D=(0,0); R=(11/2,0); S=(33/2,0); draw(A--B--C--D--cycle); draw(A--R); draw(B--S); label("$A$",A,dir(135)); label("$B$",B,dir(45)); label("$C$",C,dir(315)); label("$D$",D,dir(225)); label("$R$",R,dir(270)); label("$S$",S,dir(270)); label("$11$",midpoint(A--B),dir(90)); label("$5$",midpoint(B--C),dir(45)); label("$11$",midpoint(R--S),dir(270)); label("$7$",midpoint(D--A),dir(135)); label("$r$",midpoint(R--D),dir(270)); label("$s$",midpoint(C--S),dir(270)); label("$19$",midpoint(C--D),5*dir(270)); label("$2x$",midpoint(A--R),dir(0)); label("$2x$",midpoint(B--S),dir(180)); draw(rightanglemark(A,R,D,15)); draw(rightanglemark(B,S,C,15)); [/asy]](https://latex.artofproblemsolving.com/6/c/3/6c3c2652f53a9d028a4ec39b476006ebabeb49ce.png)
We let?
?and?
?be the feet of the altitudes of?
?and?
, respectively, to?
. We define?
?and?
. We know that?
, so?
?and?
. By the Pythagorean Theorem on?
?and?
, we get?
?and?
, respectively. Subtracting the second equation from the first gives us?
. The left hand side of this equation is a difference of squares and factors to?
. We know that?
, so?
. Now we can solve for?
?by adding the two equations we just got to see that?
, or?
.
We now solve for?
. We know that?
, so?
?and?
. We multiply both sides of this equation by?
?to get?
. However, the area of hexagon?
?is?
, so the answer is?
, or answer choice?
.
![[asy] import olympiad; unitsize(0.5cm); pair A, B, C, D; A = 5*(Cos(120), Sin(120)); B = A + (-11, 0); C = origin + (-19, 0); D = origin; label("$A$", A, dir(30)); label("$B$", B, dir(150)); label("$C$", C, dir(150)); label("$D$", D, dir(30)); pair E, F, G, H; E = bisectorpoint(B, A, D); F = bisectorpoint(A, B, C); G = bisectorpoint(B, C, D); H = bisectorpoint(C, D, A); pair P, Q; P = extension(A, E, D, H); Q = extension(B, F, C, G); dot("$P$", P, dir(20)); dot("$Q$", Q, dir(150)); pair W, X, Y, Z; W = extension(A, P, D, C); X = extension(B, Q, C, D); Y = extension(C, Q, A, B); Z = extension(D, P, A, B); label("$W$", W, dir(100)); label("$X$", X, dir(60)); label("$Y$", Y, dir(50)); label("$Z$", Z, dir(140)); draw(A--W--X--B--Y--C--D--Z--B--C--Y--A--D); [/asy]](https://latex.artofproblemsolving.com/6/d/2/6d2fcc526d540edebf20603740558027aea9a556.png)
Let?
?respectively. Since?
?we have?
?similarly we get?
?Thus,?
?is both an angle bisector and altitude of?
?so?
?Using the same logic on?
?gives?
?is a rhombus; similarly,?
?is a rhombus. Then,?
?where?
?is the height of trapezoid?
Finding?
?is the same?as?finding the altitude to the side of length?
?in a?
?triangle, and using Heron's, the area of such a triangle is?
?Multiply to get our answer if?![]()
Like above solutions, find out the height of?
?is?
?Let?
?be the intersection of the line through?
?and parallel to?
?and?
?the intersection of the line through?
?and parallel to?
?Angle chasing shows that?
?is the midpoint of?
?and?
?midpoint of?
?Then from midline theorem,?
?are collinear, and likewise for?
?Thus, the line through?
?is in fact the midline of?![]()
Let?
?Then, angle chasing shows that?
?not only bisects?
?but is also perpendicular to it. This makes it a perpendicular bisector. The same is true for?
?and?
?Thus,?
?and?
?This means?
?We can now find?
?as?the midline of?
?Thus,?![]()
Now, the answer is simply finding the area of?
?plus area of?
?This is?![]()
學術活動報名掃碼了解!免費領取歷年真題!

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