2026 AMC 10A Solutions

Scroll down to view professionally curated solutions from LIVE by Po-Shen Loh, print PDF solutions, view answer key, or take the full timed exam.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

1.

Helena’s vinyl record collection contains 3333 LP records and 4545 EP records. An LP record plays for three times as long as an EP record. How many more EP records must Helena buy so that the total playing time of her EP records equals the total playing time of her LP records?
4545
5454
6363
7878
8787
Concepts:ratio and proportionwhole number operations
Small hint:
3333 LP records play as long as 3×333 \times 33 EP records
Big hint:
Subtract the 4545 EP records Helena already has
Solution:
Each LP record plays as long as three EP records, so the 3333 LP records together play as long as 3×33=993 \times 33 = 99 EP records. Helena already has 4545 EP records, so she needs 99−45=5499 - 45 = 54 more.
Thus, the correct answer is B.

2.

A sign in a parking lot states that the total price includes a 27%27\% tax. To the nearest whole number, what percentage of the amount a customer pays is this tax?
21%21\%
22%22\%
27%27\%
37%37\%
73%73\%
Difficulty rating: 920
Small hint:
A $100\$100 price means $27\$27 tax and $127\$127 paid
Big hint:
27127\frac{27}{127} is close to 25125\frac{25}{125}
Solution:
Say the price before tax is $100.\$100. Then the tax is $27,\$27, and the customer pays $127\$127 in all. So the tax is 27127\frac{27}{127} of the amount paid.
This is close to 25125=15,\frac{25}{125} = \frac{1}{5}, so the tax is near 20%.20\%. Now 0.21×127=26.670.21 \times 127 = 26.67 and 0.22×127=27.94,0.22 \times 127 = 27.94, and 2727 is closer to 26.67.26.67. So to the nearest whole number the tax is 21%21\% of the amount paid.
Thus, the correct answer is A.

3.

Square ABCDABCD has side length 24.24. Let EE be the midpoint of BC‾,\overline{BC}, and let FF be the intersection of AE‾\overline{AE} and BD‾.\overline{BD}.
What is the area of △BEF?\triangle BEF?
3636
4040
4545
4848
5252
Difficulty rating: 1300
Small hint:
BE‾∥AD‾,\overline{BE} \parallel \overline{AD}, so triangles FBEFBE and FDAFDA are similar
Big hint:
BEBE is half of AD,AD, so △FBE\triangle FBE is half as tall as △FDA\triangle FDA
Solution:
Since BE‾∥AD‾,\overline{BE} \parallel \overline{AD}, triangles FBEFBE and FDAFDA are similar, and BEBE is half of AD.AD. So the height of △FBE\triangle FBE is half the height of △FDA.\triangle FDA. The two heights add up to the side 24,24, so FF is one third of the way up, at height 8.8.
Then △BEF\triangle BEF has area 12×12×8=48.\frac{1}{2} \times 12 \times 8 = 48.
Alternatively, AE‾\overline{AE} is a median of △ABC.\triangle ABC. The diagonal BD‾\overline{BD} passes through the center of the square, which is the midpoint of AC‾,\overline{AC}, so it contains the median from B.B. So FF is the centroid of △ABC.\triangle ABC. The three medians cut △ABC\triangle ABC into six triangles of equal area, and △BEF\triangle BEF is one of them. So its area is 16\frac{1}{6} of 12×24×24=288,\frac{1}{2} \times 24 \times 24 = 288, which is 48.48.
Thus, the correct answer is D.

4.

Half of the internal angles of a polygon measure 150∘150^\circ each, and the other half of its internal angles measure 190∘190^\circ each. How many sides does the polygon have?
3636
4040
6060
7272
180180
Concepts:angle summean
Difficulty rating: 1180
Small hint:
Exterior angles, each 180∘180^\circ minus the interior angle, sum to 360∘360^\circ even when some are negative
Big hint:
The interior angles average 170∘170^\circ
Solution:
The exterior angle at each corner is 180∘180^\circ minus the interior angle: 30∘30^\circ at the 150∘150^\circ angles and −10∘-10^\circ at the 190∘190^\circ angles, where the boundary turns back the other way. Going once around any polygon turns through 360∘360^\circ in all, so the exterior angles add up to 360∘.360^\circ.
The interior angles average 170∘,170^\circ, so the exterior angles average 10∘.10^\circ. With nn sides, 10n=360,10n = 360, so n=36.n = 36.
Thus, the correct answer is A.

5.

Let a1,a_1, a2,a_2, a3,a_3, …\ldots be a sequence with a1=94,a_1 = 94, a2=190,a_2 = 190, and ana_n equal to the arithmetic mean of the previous n−1n - 1 terms for n≥3.n \ge 3. What is the value of a10?a_{10}?
4747
9595
142142
284284
564564
Difficulty rating: 1130
Small hint:
a3a_3 is the mean of 9494 and 190190
Big hint:
Appending the current mean leaves the mean unchanged
Solution:
First, a3=94+1902=142.a_3 = \frac{94 + 190}{2} = 142. Now the first three terms have mean 142,142, because a3a_3 equals the mean of the two terms before it. So a4=142.a_4 = 142.
Each time we append a term equal to the current mean, the mean stays the same. Therefore every term from a3a_3 on equals 142,142, and a10=142.a_{10} = 142.
Thus, the correct answer is C.

6.

A triangle with sides 16,16, 30,30, and 3434 is inscribed in a circle, dividing the interior of the circle into four regions. Let A,A, B,B, and CC be the areas of the non-triangular regions, with CC being the greatest. What is the value of A+B?A + B?
2892π−240\dfrac{289}{2}\pi - 240
2892π−210\dfrac{289}{2}\pi - 210
289π−480289\pi - 480
289π−360289\pi - 360
289π−240289\pi - 240
Difficulty rating: 1390
Small hint:
Halve the sides: 8,8, 15,15, 1717
Big hint:
A right triangle’s hypotenuse is a diameter of its circle
Solution:
Halving the sides gives 8,8, 15,15, 17,17, a Pythagorean triple, so the triangle is right. Its hypotenuse 3434 is a diameter, and the radius is 17.17.
The diameter cuts the disk into two halves of area 2892π\frac{289}{2}\pi each. One half contains no part of the triangle, so it is the largest region C.C. The other half is the triangle together with regions AA and B,B, so A+B=2892π−12×16×30A + B = \frac{289}{2}\pi - \frac{1}{2} \times 16 \times 30 =2892π−240.= \frac{289}{2}\pi - 240.
Thus, the correct answer is A.

7.

How many ordered triples of positive integers (x,y,z)(x, y, z) satisfy both of the following equations? x+y+z=31x+3y+3z=41 \begin{aligned} x + y + z &= 31 \\ x + 3y + 3z &= 41 \end{aligned}
44
55
66
77
88
Difficulty rating: 1150
Small hint:
Subtract the first equation from the second
Big hint:
That fixes y+zy + z and x.x. Count the ways to split y+zy + z into two positive integers.
Solution:
Subtracting the first equation from the second gives 2y+2z=10,2y + 2z = 10, so y+z=5y + z = 5 and x=31−5=26.x = 31 - 5 = 26. The pair (y,z)(y, z) can be (1,4),(1, 4), (2,3),(2, 3), (3,2),(3, 2), or (4,1),(4, 1), so there are 44 triples.
Thus, the correct answer is A.

8.

A driver sees an electronic highway sign stating that the next exit is 77 miles away and it will take 55 minutes to reach it. Assume both numbers have been rounded to the nearest integer. Among the following options, what is the lowest speed limit (in miles per hour) that would possibly allow the driver to legally reach the exit within the given time frame?
6565
7070
7575
8080
8585
Difficulty rating: 1430
Small hint:
The distance is at least 6.56.5 miles, and the time is under 5.55.5 minutes
Big hint:
Use the shortest distance and the longest time, in miles per hour
Solution:
The exit is at least 6.56.5 miles away, and the trip takes less than 5.55.5 minutes, since 5.55.5 would round up to 6.6. So the speed must be more than 6.55.5/60=6.5×605.5=13×6011=78011≈70.9 \begin{gathered} \frac{6.5}{5.5/60} = \frac{6.5 \times 60}{5.5} \\ = \frac{13 \times 60}{11} = \frac{780}{11} \approx 70.9 \end{gathered} miles per hour, and the lowest choice that can work is 75.75. (At 7575 mph, 6.56.5 miles takes 5.25.2 minutes.)
Thus, the correct answer is C.

9.

Two similar but not congruent scalene triangles each have a side with length 99 and a side with length 12.12. What is the length of the longest side of the larger triangle?
1212
1414
1515
1616
1717
Difficulty rating: 1480
Small hint:
Scaling by k>1k \gt 1 lengthens every side, so the smaller triangle’s 99 must become the larger triangle’s 1212
Big hint:
The larger triangle’s 99 must come from the smaller triangle’s third side
Solution:
Let the smaller triangle have sides x,x, 9,9, and 12,12, and scale it by k>1.k \gt 1. The larger triangle has sides kx,kx, 9k,9k, and 12k,12k, two of which are 99 and 12.12. Since 9k>99k \gt 9 and 12k>12,12k \gt 12, the only possibility is kx=9kx = 9 and 9k=12.9k = 12.
So k=43,k = \frac{4}{3}, and the larger triangle has sides 9,9, 12,12, and 12×43=16.12 \times \frac{4}{3} = 16. It comes from the smaller triangle with sides 274,\frac{27}{4}, 9,9, and 12,12, which is a genuine triangle since 274+9>12.\frac{27}{4} + 9 \gt 12. The answer is 16.16.
Thus, the correct answer is D.

10.

For what odd positive integer nn is the mean of 1,1, 4,4, 9,9, 16,16, …,\ldots, n2n^2 exactly 32%32\% greater than its median?
1919
3939
4949
8989
169169
Difficulty rating: 1580
Small hint:
The mean is (n+1)(2n+1)6\frac{(n+1)(2n+1)}{6} and the median is (n+12)2\left(\frac{n+1}{2}\right)^2
Big hint:
Their ratio is 2(2n+1)3(n+1).\frac{2(2n+1)}{3(n+1)}. Set it to 3325.\frac{33}{25}.
Solution:
The mean of the nn squares is (n+1)(2n+1)6,\frac{(n+1)(2n+1)}{6}, and since nn is odd, the median is the middle square, (n+12)2.\left(\frac{n+1}{2}\right)^2. The factor n+1n + 1 cancels in their ratio: (n+1)(2n+1)6⋅4(n+1)2=2(2n+1)3(n+1). \begin{gathered} \frac{(n+1)(2n+1)}{6} \cdot \frac{4}{(n+1)^2} \\ = \frac{2(2n+1)}{3(n+1)}. \end{gathered}
Setting this equal to 3325\frac{33}{25} gives 50(2n+1)=99(n+1),50(2n + 1) = 99(n + 1), so n=49.n = 49.
Thus, the correct answer is C.

11.

Gary writes down six distinct positive integers: 2,2, 5,5, 24,24, 60,60, 240,240, and a three-digit number n.n. One of those six numbers is the least common multiple of all six of them. What is the sum of all possible values of n?n?
960960
16801680
21602160
22802280
24002400
Difficulty rating: 1460
Small hint:
2,2, 5,5, 24,24, and 6060 all divide 240240
Big hint:
The least common multiple of all six is 240,240, so n∣240,n \mid 240, or it is n,n, so 240∣n240 \mid n
Solution:
Each of 2,2, 5,5, 24,24, and 6060 divides 240,240, so the least common multiple of all six numbers is a multiple of both 240240 and n.n. It is at least 240,240, and 2,2, 5,5, 24,24, and 6060 are all smaller, so it must be 240240 or n.n.
If it is 240,240, then nn is a three-digit divisor of 240240 other than 240240 itself, so n=120.n = 120. If it is n,n, then nn is a three-digit multiple of 240240 other than 240,240, so nn is 480,480, 720,720, or 960.960. The sum is 120+480+720+960=2280.120 + 480 + 720 + 960 = 2280.
Thus, the correct answer is D.

12.

A drawer has 100100 red socks and 100100 blue socks. Pippi randomly removes one sock at a time, without replacement, until all the socks of one color have been removed. What is the probability that there are exactly 22 socks left in the drawer once that happens?
27196\dfrac{27}{196}
49198\dfrac{49}{198}
247990\dfrac{247}{990}
50199\dfrac{50}{199}
2599\dfrac{25}{99}
Difficulty rating: 1730
Small hint:
Imagine all 200200 socks drawn. The socks left are the final run of one color.
Big hint:
Exactly 22 are left when the last two match and the third-to-last does not
Solution:
Picture all 200200 socks coming out in a random order. Pippi stops when one color runs out, and the socks still in the drawer are the final run of one color at the end of the order. So exactly 22 are left when the last two socks match and the third-to-last does not.
Whatever the color of the last sock, the second-to-last matches it with probability 99199,\frac{99}{199}, and then the third-to-last has the other color with probability 100198.\frac{100}{198}. The answer is 99199×100198=50199.\frac{99}{199} \times \frac{100}{198} = \frac{50}{199}.
Thus, the correct answer is D.

13.

Two bicycle clubs, with disjoint memberships, go on a tour together. On the morning of the tour, members greet each other with a handshake. Everyone shakes hands with everyone else exactly once. There were 119119 handshakes between members of the same club and 112112 handshakes between members of different clubs. How many more people came from the larger club than from the smaller club?
00
44
66
77
88
Difficulty rating: 1440
Small hint:
119+112=231119 + 112 = 231 handshakes, and nn people make n(n−1)2\frac{n(n-1)}{2}
Big hint:
Clubs of aa and bb people make abab handshakes between clubs. Compare (a+b)2(a + b)^2 and (a−b)2.(a - b)^2.
Solution:
Everyone shook hands once with everyone else, so if nn people came, n(n−1)2=119+112=231.\frac{n(n-1)}{2} = 119 + 112 = 231. Then n(n−1)=462=22×21,n(n - 1) = 462 = 22 \times 21, so n=22.n = 22.
If the clubs have aa and bb people, then a+b=22,a + b = 22, and the handshakes between the clubs number ab=112.ab = 112. So (a−b)2=(a+b)2−4ab(a - b)^2 = (a + b)^2 - 4ab =484−448=36,= 484 - 448 = 36, and the larger club has 66 more people.
Thus, the correct answer is C.

14.

Consider a triangle with positive area whose side lengths are functions of tt given by a=t2+1,a = t^2 + 1, b=5t+7,b = 5t + 7, and c=4t+4.c = 4t + 4. How many different integer values of tt are possible?
00
77
99
1010
infinitely many
Difficulty rating: 1590
Small hint:
Compute a+c−ba + c - b and b+c−a,b + c - a, and factor each
Big hint:
Both have the factor t+1,t + 1, which must be positive
Solution:
For c=4t+4c = 4t + 4 to be positive we need t>−1,t \gt -1, and then aa and bb are positive too.
The triangle inequalities factor neatly. First, a+b−c=t2+t+4a + b - c = t^2 + t + 4 is always positive. Next, a+c−b=t2−t−2a + c - b = t^2 - t - 2 =(t−2)(t+1)= (t - 2)(t + 1) and b+c−a=−t2+9t+10b + c - a = -t^2 + 9t + 10 =(10−t)(t+1).= (10 - t)(t + 1). Since t+1>0,t + 1 \gt 0, we need t>2t \gt 2 and t<10.t \lt 10.
So t=3,t = 3, 4,4, …,\ldots, 9,9, which is 77 values.
Thus, the correct answer is B.

15.

The tree diagram below has nodes labeled with rational numbers. The top node, at level 0,0, is 12.\frac{1}{2}. Each node ab\frac{a}{b} sprouts two nodes in the level below it, aa+b\frac{a}{a+b} and ba+b.\frac{b}{a+b}. For example, level 11 has nodes 11+2=13\frac{1}{1+2} = \frac{1}{3} and 21+2=23.\frac{2}{1+2} = \frac{2}{3}.
At what level does the node 2027\frac{20}{27} appear in the diagram?
55
88
1212
2626
The node 2027\dfrac{20}{27} does not appear in the diagram.
Difficulty rating: 1550
Small hint:
Going up a level, pq\frac{p}{q} becomes a fraction made of pp and q−pq - p
Big hint:
Starting from 2020 and 27,27, keep subtracting the smaller number from the larger until you reach 11 and 22
Solution:
Every node is a fraction less than 11 in lowest terms. If a node is pq,\frac{p}{q}, its parent is made of pp and q−p,q - p, in whichever order gives a fraction less than 1.1. So each step up replaces the pair of numbers by the smaller one and their difference, as in the Euclidean algorithm.
Starting from (20,27),(20, 27), the pairs are (7,20),(7, 20), (7,13),(7, 13), (6,7),(6, 7), (1,6),(1, 6), (1,5),(1, 5), (1,4),(1, 4), (1,3),(1, 3), and (1,2).(1, 2). That is 88 steps up to 12,\frac{1}{2}, so 2027\frac{20}{27} is at level 8.8.
Thus, the correct answer is B.

16.

An urn contains 66 red balls, 44 black balls, and 44 white balls. Suppose 77 balls are drawn at random without replacement and a score is computed as follows:
• 11 point is given for each red ball up to a maximum of 33 points.
• 11 point is given for each black ball up to a maximum of 22 points.
• 11 point is given for each white ball up to a maximum of 22 points.
For example, drawing 11 red ball, 44 black balls, and 22 white balls would earn a score of 1+2+2=5.1 + 2 + 2 = 5. What is the probability of getting the lowest possible score?
1858\dfrac{1}{858}
53432\dfrac{5}{3432}
1312\dfrac{1}{312}
2429\dfrac{2}{429}
5264\dfrac{5}{264}
Difficulty rating: 1760
Small hint:
The score is 77 minus the balls beyond their color’s cap. Waste as many balls as possible.
Big hint:
At most 33 balls can be wasted: 66 reds and 11 other, or 44 of one other color and 33 of the last
Solution:
Call a ball wasted if it is beyond its color’s cap. Then the score is 77 minus the number of wasted balls, so we want to waste as many as possible.
Wasting 44 is impossible. With 66 reds, 33 reds are wasted and the 11 other ball is not. With 55 reds, 22 reds are wasted and the 22 other balls waste nothing. With 44 reds, 11 red is wasted and the 33 other balls waste at most 1.1. With at most 33 reds, only black and white can be wasted, and wasting 22 of each would take 88 balls. So at most 33 are wasted, and the lowest score is 4.4.
Exactly 33 are wasted with 66 reds and 11 of the 88 other balls (88 ways), with 44 black and 33 white (44 ways), or with 33 black and 44 white (44 ways). That is 1616 of the (147)=3432\binom{14}{7} = 3432 equally likely draws, for a probability of 163432=2429.\frac{16}{3432} = \frac{2}{429}.
Thus, the correct answer is D.

17.

For each edge of a regular hexagon with side length 1,1, a square is constructed inside the hexagon with that edge as one of its sides. The region interior to all six squares is the interior of a smaller hexagon, shown shaded in the figure below.
The area of the smaller hexagon can be expressed in the form abc−d,\dfrac{a\sqrt{b}}{c} - d, where a,a, b,b, c,c, and dd are positive integers, aa and cc are relatively prime, and bb is not divisible by the square of any prime. What is a+b+c+d?a + b + c + d?
1616
1717
1818
1919
2020
Difficulty rating: 1790
Small hint:
The center is 32\frac{\sqrt{3}}{2} from each edge, and each square reaches 11 inward
Big hint:
The small hexagon is regular with the same center, and its sides are 1−321 - \frac{\sqrt{3}}{2} from it
Solution:
Let OO be the center. Each edge is 32\frac{\sqrt{3}}{2} from O,O, and the square on that edge reaches 11 inward, so its inner side lies just past O,O, at distance h=1−32h = 1 - \frac{\sqrt{3}}{2} on the far side. Together with the square on the opposite edge, it cuts out a strip of width 2h2h centered on O.O.
The three strips meet in a regular hexagon with the same center and orientation as the big one, whose sides are hh from O.O. (Its corners are only about 0.150.15 from O,O, so the squares’ other sides, 12\frac{1}{2} from O,O, do not cut it.) It is the big hexagon scaled by 2h3=2−33.\frac{2h}{\sqrt{3}} = \frac{2 - \sqrt{3}}{\sqrt{3}}.
The big hexagon has area 332,\frac{3\sqrt{3}}{2}, so the small one has area 332×(2−3)23=32(7−43)=732−6. \begin{gathered} \frac{3\sqrt{3}}{2} \times \frac{(2 - \sqrt{3})^2}{3} \\ = \frac{\sqrt{3}}{2}\left(7 - 4\sqrt{3}\right) \\ = \frac{7\sqrt{3}}{2} - 6. \end{gathered} So a+b+c+da + b + c + d =7+3+2+6=18.= 7 + 3 + 2 + 6 = 18.
Thus, the correct answer is C.

18.

The strictly decreasing sequence of 1111 positive integers (a0,a1,a2,…,a10)(a_0, a_1, a_2, \ldots, a_{10}) is defined by the recursive rule ak=12ak−1+2a_k = \frac{1}{2}a_{k-1} + 2 for k≥1.k \ge 1. Let NN be the minimum possible value of a0.a_0. What is the sum of the digits of N?N?
77
99
1010
1111
1414
Difficulty rating: 1640
Small hint:
Subtract 44: ak−4=12(ak−1−4)a_k - 4 = \frac{1}{2}(a_{k-1} - 4)
Big hint:
So a10−4=a0−4210a_{10} - 4 = \frac{a_0 - 4}{2^{10}} must be an integer
Solution:
Subtracting 44 from both sides of the rule gives ak−4=12(ak−1−4).a_k - 4 = \frac{1}{2}(a_{k-1} - 4). So the distance from 44 halves at every step, and ak−4=a0−42k.a_k - 4 = \frac{a_0 - 4}{2^k}.
All 1111 terms are integers exactly when 210=10242^{10} = 1024 divides a0−4.a_0 - 4. The sequence is strictly decreasing exactly when a0−4>0,a_0 - 4 \gt 0, and then every term is above 4,4, so positive. The smallest choice is a0−4=1024,a_0 - 4 = 1024, so N=1028,N = 1028, and its digit sum is 1+0+2+8=11.1 + 0 + 2 + 8 = 11.
Thus, the correct answer is D.

19.

Three 2×2×22 \times 2 \times 2 cubes sit on a table so that two of the cubes share a face, and a face of the third cube is centered along a shared edge of the other two cubes, as shown.
A hemispherical cover is placed over the cubes so that its circumference rests on the table and the cubes are under the cover. What is the least possible value of the radius of the cover?
33
3576\dfrac{\sqrt{357}}{6}
6818\dfrac{\sqrt{681}}{8}
1784\dfrac{\sqrt{178}}{4}
232\sqrt{3}
Difficulty rating: 1890
Small hint:
A point at height 22 is covered when its horizontal distance from the center is at most R2−4\sqrt{R^2 - 4}
Big hint:
From above, the cubes form a 4×24 \times 2 rectangle with a 2×22 \times 2 square centered on a long side. Find the smallest circle around it.
Solution:
The center of the cover lies on the table. A point at height 22 whose horizontal distance from the center is dd is under the cover exactly when d2+4≤R2.d^2 + 4 \le R^2. The top corners of the cubes are the hardest points to cover, so we need the smallest circle on the table that contains the cubes’ shadow. If its radius is r,r, then R2=r2+4.R^2 = r^2 + 4.
Put the two side-by-side cubes over −2≤x≤2,-2 \le x \le 2, 0≤y≤20 \le y \le 2 and the third cube over −1≤x≤1,-1 \le x \le 1, −2≤y≤0.-2 \le y \le 0. The circle must reach the corners (±2,2)(\pm 2, 2) and (±1,−2).(\pm 1, -2). By symmetry, try the center (0,k)(0, k) with all four corners at the same distance: 4+(2−k)2=1+(k+2)2, 4 + (2 - k)^2 = 1 + (k + 2)^2, which gives k=38k = \frac{3}{8} and r2=4+(138)2=42564.r^2 = 4 + \left(\frac{13}{8}\right)^2 = \frac{425}{64}. The corners (±2,0)(\pm 2, 0) are inside this circle. The center lies inside the trapezoid with those four corners, so no smaller circle holds them all.
Then R2=42564+4=68164,R^2 = \frac{425}{64} + 4 = \frac{681}{64}, and R=6818.R = \frac{\sqrt{681}}{8}.
Thus, the correct answer is C.

20.

Boxes with dimensions 77×78×8577 \times 78 \times 85 or 2×3×850852 \times 3 \times 85085 have volume 510,510.510{,}510. How many different boxes with integer side lengths at least 2,2, including these two, have volume 510,510?510{,}510? Boxes are considered different if they have different dimensions.
6363
9090
301301
377377
966966
Difficulty rating: 1840
Small hint:
510,510510{,}510 =2×3×5×7×11×13×17.= 2 \times 3 \times 5 \times 7 \times 11 \times 13 \times 17. Split these primes into three nonempty groups.
Big hint:
Count ordered splits: 373^7 ways, minus those that leave a side equal to 11
Solution:
Since 510,510510{,}510 =2×3×5×7×11×13×17,= 2 \times 3 \times 5 \times 7 \times 11 \times 13 \times 17, choosing the three side lengths in order means sending each of the seven primes to one of the sides. Every side must be at least 2,2, so every side must get at least one prime.
There are 37=21873^7 = 2187 ways to send the primes. Leaving a particular side empty happens in 27=1282^7 = 128 ways, and leaving two particular sides empty happens in 11 way. So the ordered triples number 2187−3×128+3=1806.2187 - 3 \times 128 + 3 = 1806.
The three sides use different primes, so they are three different numbers, and each box is counted 3!=63! = 6 times. There are 18066=301\frac{1806}{6} = 301 boxes.
Thus, the correct answer is C.

21.

Gerry is playing the Triples Game. Her task is to partition the 3×33 \times 3 grid of squares shown at the top into three sections, each containing three adjoining squares. (Three squares are adjoining if each shares an edge with at least one of the other two.) One point will be awarded for each section containing more X’s than O’s. Shown below it is a sample partition that will earn one point in total. A partition that earns two or more points will win the game. What fraction of the possible partitions of this particular grid will result in a win for Gerry?
310\dfrac{3}{10}
13\dfrac{1}{3}
25\dfrac{2}{5}
49\dfrac{4}{9}
12\dfrac{1}{2}
Difficulty rating: 1770
Small hint:
Only 44 squares hold X’s. A win needs two sections with 22 X’s each, so the third section is all O’s.
Big hint:
Only the bottom row and one L-shape consist of three O’s. Check the partitions that contain each.
Solution:
Each section is a straight line of three squares or an L-shape. An L-shape fits in a 2×22 \times 2 block, so it covers at most one corner of the grid, and a middle row or column covers none. The three sections cover all four corners, so one of them is a full row or column along the edge.
That leaves a 2×32 \times 3 rectangle, which splits in 33 ways: into two straight pieces, or into two L-shapes in 22 ways. Four edges give 4×3=12,4 \times 3 = 12, but the three-rows and three-columns partitions are each counted twice, so there are 1010 partitions.
The grid has only 44 X’s, and a section earns a point only with at least 22 of them. So a winning partition has two sections with 22 X’s each and a third section of three O’s. Only two sections consist of three O’s: the bottom row, and the L made of the middle-right, bottom-center, and bottom-right squares.
With the bottom row, the top two rows split as two rows (XOX and XXO) or as two L-shapes (XOX and XXO again), both wins, or as XXX and OXO, which earns only 11 point. With the L, the other six squares split only as the top row plus an L (XOX and XXO) or as the left column plus an L (XXO and OXX), both wins.
So 44 of the 1010 partitions win, a fraction of 25.\frac{2}{5}.
Thus, the correct answer is C.

22.

An engineer is designing a closely packed field of 77 wind turbines for electricity production. Each turbine, whose center is marked by a labeled dot in the figure, occupies one of 77 congruent elliptical regions. Turbines in the same row have centers that are 44 units apart, and turbines in the same column have centers that are 99 units apart, as shown in the figure below.
The major axis of each ellipse is mp,m\sqrt{p}, where mm and pp are positive integers and pp is not divisible by the square of any prime. What is m+p?m + p?
66
88
99
1010
1212
Difficulty rating: 1950
Small hint:
Each ellipse is 44 wide. Squeeze vertically to make them circles of radius 2.2.
Big hint:
OO and AA are 22 apart across and 4.54.5 apart vertically, and their ellipses touch
Solution:
Turbines in the same row touch halfway between their centers, so each ellipse has horizontal semi-axis 2.2. Call the vertical semi-axis s.s.
Squeeze the whole picture vertically by the factor 2s.\frac{2}{s}. Every ellipse becomes a circle of radius 2,2, and ellipses that touched still touch. The centers OO and AA were 22 apart across and 4.54.5 apart up and down, so now they are 22 across and 9s\frac{9}{s} up and down. Touching circles of radius 22 have centers 44 apart, so 4+81s2=16, 4 + \frac{81}{s^2} = 16, which gives s2=274s^2 = \frac{27}{4} and s=332.s = \frac{3\sqrt{3}}{2}.
Since s>2,s \gt 2, the major axis is vertical, with length 2s=33.2s = 3\sqrt{3}. So m+p=3+3=6.m + p = 3 + 3 = 6.
Thus, the correct answer is A.

23.

In a list of one or more consecutive integers, there are pp multiples of 22 and qq multiples of 3.3. How many ordered pairs (p,q)(p, q) are possible for this list if pp and qq are between 00 and 100,100, inclusive?
232232
233233
234234
235235
236236
Difficulty rating: 2080
Small hint:
In nn consecutive integers, pp is n2\frac{n}{2} rounded up or down, and qq is n3\frac{n}{3} rounded up or down
Big hint:
Then 2p2p and 3q3q are both close to n.n. How far apart can they be?
Solution:
Take a list of nn consecutive integers. The number of multiples of 22 in it is n2\frac{n}{2} rounded up or down, so ∣n−2p∣≤1.|n - 2p| \le 1. The number of multiples of 33 is n3\frac{n}{3} rounded up or down, so ∣n−3q∣≤2.|n - 3q| \le 2. Every combination of roundings occurs. Which way pp rounds depends only on whether the first number is even or odd, and which way qq rounds depends only on its remainder when divided by 3.3. Any six consecutive starting points cover every combination of the two.
So (p,q)(p, q) is possible exactly when some positive nn satisfies both ∣n−2p∣≤1|n - 2p| \le 1 and ∣n−3q∣≤2.|n - 3q| \le 2. Such an nn exists exactly when 2p2p and 3q3q are at most 1+2=31 + 2 = 3 apart, that is, when ∣2p−3q∣≤3.|2p - 3q| \le 3. (In that case the smaller of 2p+12p + 1 and 3q+23q + 2 works as n,n, and it is positive.)
Now count by p.p. The condition says qq is within 11 of 2p3.\frac{2p}{3}. If 33 divides p,p, that allows 33 values of q,q, and otherwise 2.2. Among p=0,p = 0, 1,1, …,\ldots, 100,100, there are 3434 multiples of 33 and 6767 others. Dropping q=−1q = -1 at p=0p = 0 gives 34×3+67×2−1=235.34 \times 3 + 67 \times 2 - 1 = 235. (Every qq found is at most 67,67, so q≤100q \le 100 holds.)
Thus, the correct answer is D.

24.

How many polynomials f(x)f(x) of degree 33 satisfying f(3+5)=f(3−5) f\left(3 + \sqrt{5}\right) = f\left(3 - \sqrt{5}\right) are there that have leading coefficient equal to 11 and all of whose coefficients are integers between −10-10 and 10,10, inclusive?
2121
4242
6363
8484
105105
Difficulty rating: 1840
Small hint:
Put x=3+t,x = 3 + t, so that the two inputs are t=±5t = \pm\sqrt{5}
Big hint:
Replacing tt by −t-t changes only the odd powers of tt
Solution:
Write f(x)=x3+ax2+bx+c.f(x) = x^3 + ax^2 + bx + c. The inputs 3±53 \pm \sqrt{5} are symmetric about 3,3, so put x=3+t.x = 3 + t. Expanding (3+t)3,(3 + t)^3, a(3+t)2,a(3 + t)^2, and b(3+t),b(3 + t), the coefficient of t3t^3 is 11 and the coefficient of tt is 27+6a+b.27 + 6a + b.
Replacing tt by −t-t flips the signs of the odd powers of tt and leaves the even powers alone, so f(3+t)−f(3−t)=2t3+2(27+6a+b)t. \begin{gathered} f(3 + t) - f(3 - t) \\ = 2t^3 + 2(27 + 6a + b)t. \end{gathered} At t=5t = \sqrt{5} this is 25 (5+27+6a+b),2\sqrt{5}\,(5 + 27 + 6a + b), which must be 0.0. So b=−32−6a.b = -32 - 6a.
For −10≤b≤10-10 \le b \le 10 we need −7≤a≤−4,-7 \le a \le -4, giving b=10,b = 10, 4,4, −2,-2, and −8,-8, all in range. The constant cc can be any of the 2121 integers from −10-10 to 10.10. So there are 4×21=844 \times 21 = 84 polynomials.
Thus, the correct answer is D.

25.

Chris the squirrel has 2020 rooms in his cavern for storing food. The first room contains 11 nut, the second room contains 22 nuts, the third room contains 33 nuts, and so on, with the 2020th room containing 2020 nuts. Starting from today, Chris will collect 1818 additional nuts each day and store them one per room in 1818 distinct rooms in his cavern. His goal is to have all the rooms contain the same number of nuts once he is finished. What is the minimum number of days required to accomplish this goal?
7575
9595
105105
190190
195195
Difficulty rating: 2030
Small hint:
Room 11 gains at most one nut a day, so it ends with at most d+1d + 1
Big hint:
After dd days the 210+18d210 + 18d nuts must be 2020 times the final count per room
Solution:
Suppose that after dd days every room holds NN nuts. The rooms start with 1+2+⋯+20=2101 + 2 + \cdots + 20 = 210 nuts, so 210+18d=20N.210 + 18d = 20N. Room 11 gets at most one nut a day, so N≤d+1.N \le d + 1. Then 210+18d=20N≤20d+20, 210 + 18d = 20N \le 20d + 20, so d≥95.d \ge 95.
With d=95d = 95 we get N=210+171020=96.N = \frac{210 + 1710}{20} = 96. Each day Chris skips exactly two rooms, and room ii needs 96−i96 - i nuts, so it must be skipped 95−(96−i)=i−195 - (96 - i) = i - 1 times. These skips add up to 0+1+⋯+190 + 1 + \cdots + 19 =190=2×95,= 190 = 2 \times 95, as they should.
To schedule them, list the 190190 skips in order: room 22 once, then room 33 twice, and so on up to room 2020 nineteen times. On day kk skip the rooms in positions kk and k+95k + 95 of the list. No room appears 9595 times, so these are always two different rooms. So 9595 days is the minimum.
Thus, the correct answer is B.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.Terms of UsePrivacy PolicyCOPPA Privacy Policy