2025 AIME I 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.

Find the sum of all integer bases b>9b \gt 9 for which 17b17_b is a divisor of 97b.97_b.

Concepts:number basedivisibilitybounding to limit cases
Difficulty rating: 1890
Small Hint:

Write the two numbers in base b:b: they are b+7b + 7 and 9b+79b + 7

Big Hint:

Since 9(b+7)(9b+7)=56,9(b + 7) - (9b + 7) = 56, the condition is that b+7b + 7 divides 5656

Solution:

In base bb the two numbers are 17b=b+717_b = b + 7 and 97b=9b+7.97_b = 9b + 7. We need 9b+79b + 7 to be divisible by b+7,b + 7, and since b+7b + 7 certainly divides 9(b+7)=9b+63,9(b + 7) = 9b + 63, this is equivalent to (9b+63)(9b+7)=56 \begin{gathered} (9b + 63) - (9b + 7) \\ = 56 \end{gathered} being divisible by b+7.b + 7.

For b>9b \gt 9 we have b+7>16,b + 7 \gt 16, so b+7b + 7 must be 2828 or 56,56, giving b=21b = 21 or b=49.b = 49. The sum is 21+49=70.21 + 49 = 70.

2.

On ABC\triangle ABC points A,A, D,D, E,E, and BB lie in that order on side AB\overline{AB} with AD=4,AD = 4, DE=16,DE = 16, and EB=8.EB = 8. Points A,A, F,F, G,G, and CC lie in that order on side AC\overline{AC} with AF=13,AF = 13, FG=52,FG = 52, and GC=26.GC = 26. Let MM be the reflection of DD through F,F, and let NN be the reflection of GG through E.E. Quadrilateral DEGFDEGF has area 288.288. Find the area of heptagon AFNBCEM.AFNBCEM.

Difficulty rating: 2340
Small Hint:

Since AB=28AB = 28 and AC=91,AC = 91, the points DD and FF sit 17\frac{1}{7} of the way from A,A, while EE and GG sit 57\frac{5}{7} of the way, so [DEGF][DEGF] is a fixed fraction of [ABC][ABC]

Big Hint:

Write M=2FDM = 2F - D and N=2EGN = 2E - G as vectors from A,A, then apply the shoelace formula to the heptagon; almost everything cancels

Solution:

Here AB=4+16+8=28AB = 4 + 16 + 8 = 28 and AC=13+52+26=91,AC = 13 + 52 + 26 = 91, so DD and FF lie 17\frac{1}{7} of the way from AA along their sides while EE and GG lie 57\frac{5}{7} of the way. Triangles sharing angle AA have areas proportional to the products of the adjacent sides, so [ADF]=149[ABC][ADF] = \frac{1}{49}[ABC] and [AEG]=2549[ABC].[AEG] = \frac{25}{49}[ABC]. Therefore [DEGF]=[AEG][ADF]=2449[ABC]=288, \begin{aligned} [DEGF] &= [AEG] - [ADF] \\ &= \frac{24}{49}[ABC] = 288, \end{aligned} which gives [ABC]=588.[ABC] = 588.

Now set b=AB\mathbf{b} = \overrightarrow{AB} and c=AC,\mathbf{c} = \overrightarrow{AC}, so that D=17b,D = \frac{1}{7}\mathbf{b}, E=57b,E = \frac{5}{7}\mathbf{b}, F=17c,F = \frac{1}{7}\mathbf{c}, G=57c,G = \frac{5}{7}\mathbf{c}, and the reflections are M=2FD=17(2cb)M = 2F - D = \frac{1}{7}(2\mathbf{c} - \mathbf{b}) and N=2EG=17(10b5c).N = 2E - G = \frac{1}{7}(10\mathbf{b} - 5\mathbf{c}). The shoelace formula for AFNBCEMAFNBCEM sums cross products of consecutive vertices: the two terms at AA vanish, and F×N=1049b×c,N×B=57b×c,B×C=b×c,C×E=57b×c,E×M=1049b×c. \begin{aligned} F \times N &= -\tfrac{10}{49}\,\mathbf{b} \times \mathbf{c}, \\ N \times B &= \tfrac{5}{7}\,\mathbf{b} \times \mathbf{c}, \\ B \times C &= \mathbf{b} \times \mathbf{c}, \\ C \times E &= -\tfrac{5}{7}\,\mathbf{b} \times \mathbf{c}, \\ E \times M &= \tfrac{10}{49}\,\mathbf{b} \times \mathbf{c}. \end{aligned}

Everything cancels except the single term b×c,\mathbf{b} \times \mathbf{c}, so the heptagon’s area is 12b×c=[ABC]=588.\frac{1}{2}\left|\mathbf{b} \times \mathbf{c}\right| = [ABC] = 588.

3.

The 99 members of a baseball team went to an ice-cream parlor after their game. Each player had a single scoop cone of chocolate, vanilla, or strawberry ice cream. At least one player chose each flavor, and the number of players who chose chocolate was greater than the number of players who chose vanilla, which was greater than the number of players who chose strawberry. Let NN be the number of different assignments of flavors to players that meet these conditions. Find the remainder when NN is divided by 1000.1000.

Difficulty rating: 2180
Small Hint:

First find every triple of flavor counts: strictly decreasing positive integers summing to 99

Big Hint:

For counts (c,v,s),(c, v, s), the number of ways to assign flavors to the nine distinct players is 9!c!v!s!\frac{9!}{c!\,v!\,s!}

Solution:

Let c>v>s1c \gt v \gt s \ge 1 be the numbers of players choosing chocolate, vanilla, and strawberry, with c+v+s=9.c + v + s = 9. Checking small values of ss shows the only possibilities are (6,2,1),(6, 2, 1), (5,3,1),(5, 3, 1), and (4,3,2).(4, 3, 2).

Since the players are distinct, each triple of counts contributes a multinomial coefficient: 9!6!2!1!=252,9!5!3!1!=504,9!4!3!2!=1260. \begin{aligned} \frac{9!}{6!\,2!\,1!} &= 252, \\ \frac{9!}{5!\,3!\,1!} &= 504, \\ \frac{9!}{4!\,3!\,2!} &= 1260. \end{aligned} Thus N=252+504+1260=2016,N = 252 + 504 + 1260 = 2016, and the remainder modulo 10001000 is 16.16.

4.

Find the number of ordered pairs (x,y),(x, y), where both xx and yy are integers between 100-100 and 100,100, inclusive, such that 12x2xy6y2=0.12x^2 - xy - 6y^2 = 0.

Difficulty rating: 2110
Small Hint:

The left side factors as (3x+2y)(4x3y)(3x + 2y)(4x - 3y)

Big Hint:

One line gives (x,y)=(3t,4t)(x, y) = (3t, 4t) with t25;|t| \le 25; the other gives (2t,3t)(2t, -3t) with t33.|t| \le 33. Don’t count the origin twice.

Solution:

The equation factors as 12x2xy6y2=(3x+2y)(4x3y)=0, \begin{gathered} 12x^2 - xy - 6y^2 \\ = (3x + 2y)(4x - 3y) \\ = 0, \end{gathered} so every solution has 4x=3y4x = 3y or 3x=2y.3x = -2y.

Integer solutions of 4x=3y4x = 3y are (x,y)=(3t,4t);(x, y) = (3t, 4t); the constraint 4t100|4t| \le 100 gives 25t25,-25 \le t \le 25, or 5151 pairs. Integer solutions of 3x=2y3x = -2y are (x,y)=(2t,3t);(x, y) = (2t, -3t); the constraint 3t100|3t| \le 100 gives 33t33,-33 \le t \le 33, or 6767 pairs. The families overlap only at (0,0),(0, 0), so the count is 51+671=117.51 + 67 - 1 = 117.

5.

There are 8!=403208! = 40320 eight-digit positive integers that use each of the digits 1,1, 2,2, 3,3, 4,4, 5,5, 6,6, 7,7, 88 exactly once. Let NN be the number of these integers that are divisible by 22.22. Find the difference between NN and 2025.2025.

Difficulty rating: 2510
Small Hint:

For divisibility by 11,11, the four digits in odd positions and the four in even positions must have equal sums

Big Hint:

Each side sums to 18,18, and there are 88 such splits. Then count arrangements with an even units digit, sorted by how many even digits share the units digit’s side.

Solution:

The digits sum to 36.36. Divisibility by 1111 requires the alternating sum of digits to be a multiple of 11,11, so if the four digits in odd positions sum to a,a, then a(36a)=2a36a - (36 - a) = 2a - 36 must be a multiple of 11.11. Since 10a26,10 \le a \le 26, the only possibility is a=18:a = 18: each block of four positions carries digit sum 18.18. The four-element subsets of {1,,8}\{1, \ldots, 8\} with sum 1818 are {1,2,7,8}, {1,3,6,8}, {1,4,5,8}, {1,4,6,7}, {2,3,5,8}, {2,3,6,7}, {2,4,5,7}, {3,4,5,6}, \begin{gathered} \{1,2,7,8\},\ \{1,3,6,8\},\ \\ \{1,4,5,8\},\ \{1,4,6,7\},\ \\ \{2,3,5,8\},\ \{2,3,6,7\},\ \\ \{2,4,5,7\},\ \{3,4,5,6\}, \end{gathered} eight in all, and they come in complementary pairs.

Choose which of the 88 subsets occupies the even positions (which include the units place); the complement fills the odd positions. If that subset contains kk of the even digits, then the units digit can be chosen in kk ways, the rest of the even positions in 3!3! ways, and the odd positions in 4!4! ways, for 144k144k numbers. Complementary subsets have kk-values summing to 4,4, so over all 88 choices k=16.\sum k = 16. Hence N=14416=2304,N = 144 \cdot 16 = 2304, and N2025=279.N - 2025 = 279.

6.

An isosceles trapezoid has an inscribed circle tangent to each of its four sides. The radius of the circle is 3,3, and the area of the trapezoid is 72.72. Let the parallel sides of the trapezoid have lengths rr and s,s, with rs.r \ne s. Find r2+s2.r^2 + s^2.

Difficulty rating: 2230
Small Hint:

The height is twice the inradius, so the area formula gives r+s=24r + s = 24

Big Hint:

In a tangential quadrilateral the two pairs of opposite sides have equal sums, so each leg is 12;12; use the Pythagorean theorem to get (rs)2(r - s)^2

Solution:

The circle is tangent to both parallel sides, so the height of the trapezoid is 23=6.2 \cdot 3 = 6. From the area, r+s26=72,\frac{r + s}{2} \cdot 6 = 72, so r+s=24.r + s = 24. By the Pitot theorem the legs together also sum to 24,24, and since the trapezoid is isosceles each leg is 12.12.

Dropping a perpendicular from an endpoint of the shorter base, the leg is the hypotenuse of a right triangle with legs 66 and rs2:\frac{|r - s|}{2}: 144=36+(rs2)2,144 = 36 + \left(\frac{r - s}{2}\right)^2, so (rs)2=432.(r - s)^2 = 432. Therefore r2+s2=(r+s)2+(rs)22r^2 + s^2 = \frac{(r+s)^2 + (r-s)^2}{2} =576+4322=504.= \frac{576 + 432}{2} = 504.

7.

The twelve letters A,A, B,B, C,C, D,D, E,E, F,F, G,G, H,H, I,I, J,J, K,K, and LL are randomly grouped into six pairs of letters. The two letters in each pair are placed next to each other in alphabetical order to form six two-letter words, and then those six words are listed alphabetically. For example, a possible result is AB,AB, CJ,CJ, DG,DG, EK,EK, FL,FL, HI.HI. The probability that the last word listed contains GG is mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Difficulty rating: 2710
Small Hint:

The last word’s first letter is the largest among the six smaller letters of the pairs

Big Hint:

Either GG pairs with a later letter and no two of HH through LL pair together, or the last word is FGFG with HH through LL all paired into AA through EE

Solution:

There are 1197531=1039511 \cdot 9 \cdot 7 \cdot 5 \cdot 3 \cdot 1 = 10395 ways to pair the letters. Each word begins with the smaller letter of its pair, so the last word alphabetically is the pair whose smaller letter is largest.

Case 1:1: GG is the smaller letter of the last word. Then GG pairs with one of H,H, I,I, J,J, K,K, or LL (55 ways), and no two of the remaining four late letters may pair together (such a pair would start with a letter after GG). Those four letters must take distinct partners from {A,,F},\{A, \ldots, F\}, in 6543=3606 \cdot 5 \cdot 4 \cdot 3 = 360 ways, and the two leftover early letters pair with each other. That gives 5360=18005 \cdot 360 = 1800 pairings. Case 2:2: GG is the larger letter, paired with some xx before G.G. Then none of H,,LH, \ldots, L may pair together, so all five take partners among the other five early letters; the six smaller letters are then exactly AA through F,F, and the largest is F.F. For the last word to contain G,G, its smaller letter must therefore be F,F, so the last word is FG,FG, and H,,LH, \ldots, L match with A,,EA, \ldots, E in 5!=1205! = 120 ways.

The probability is 1800+12010395=192010395=128693,\frac{1800 + 120}{10395} = \frac{1920}{10395} = \frac{128}{693}, so m+n=128+693=821.m + n = 128 + 693 = 821.

8.

Let kk be a real number such that the system 25+20iz=5|25 + 20i - z| = 5 z4k=z3ik|z - 4 - k| = |z - 3i - k| has exactly one complex solution z.z. The sum of all possible values of kk can be written as mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n. Here i=1.i = \sqrt{-1}.

Difficulty rating: 2560
Small Hint:

The first equation is a circle centered at 25+20i25 + 20i with radius 5;5; the second is the perpendicular bisector of the points 4+k4 + k and 3i+k3i + k

Big Hint:

Exactly one solution means the bisector is tangent to the circle: set the distance from (25,20)(25, 20) to the line equal to 55

Solution:

The first equation says zz lies on the circle of radius 55 centered at (25,20).(25, 20). The second says zz is equidistant from P1=(k+4,0)P_1 = (k + 4, 0) and P2=(k,3),P_2 = (k, 3), i.e. it lies on the perpendicular bisector of P1P2.\overline{P_1 P_2}. The system has exactly one solution precisely when this line is tangent to the circle.

The midpoint is (k+2,32)\left(k + 2, \frac{3}{2}\right) and P1P2\overline{P_1 P_2} has slope 34,-\frac{3}{4}, so the bisector has slope 43:\frac{4}{3}: in standard form 8x6y(8k+7)=0.8x - 6y - (8k + 7) = 0. Tangency requires 8256208k782+62=738k10=5, \begin{gathered} \frac{|8 \cdot 25 - 6 \cdot 20 - 8k - 7|}{\sqrt{8^2 + 6^2}} \\ = \frac{|73 - 8k|}{10} \\ = 5, \end{gathered} so 8k=73±50,8k = 73 \pm 50, giving k=1238k = \frac{123}{8} or k=238.k = \frac{23}{8}.

The sum is 1468=734,\frac{146}{8} = \frac{73}{4}, so m+n=73+4=77.m + n = 73 + 4 = 77.

9.

The parabola with equation y=x24y = x^2 - 4 is rotated 6060^\circ counterclockwise around the origin. The unique point in the fourth quadrant where the original parabola and its image intersect has yy-coordinate abc,\frac{a - \sqrt{b}}{c}, where a,a, b,b, and cc are positive integers, and aa and cc are relatively prime. Find a+b+c.a + b + c.

Difficulty rating: 2920
Small Hint:

PP lies on both curves exactly when PP and its rotation by 60-60^\circ both lie on the original parabola, at equal distance from the origin

Big Hint:

Try making the rotated image the mirror point (x,y):(-x, y): that forces y=3x,y = -\sqrt{3}\,x, which you can substitute into the parabola

Solution:

A point PP lies on the image parabola exactly when its rotation by 60,-60^\circ, namely Q=(x+3y2, 3x+y2),Q = \left(\frac{x + \sqrt{3}y}{2},\ \frac{-\sqrt{3}x + y}{2}\right), lies on the original parabola. So we need PP and QQ both on y=x24.y = x^2 - 4. The parabola is symmetric in xx,x \mapsto -x, so we look for P=(x,y)P = (x, y) whose rotated image is the mirror point Q=(x,y).Q = (-x, y).

Matching yy-coordinates gives 32x+y2=y,-\frac{\sqrt{3}}{2}x + \frac{y}{2} = y, i.e. y=3x,y = -\sqrt{3}\,x, and then the xx-coordinate works automatically: x2+32(3x)=x.\frac{x}{2} + \frac{\sqrt{3}}{2}(-\sqrt{3}x) = -x. Substituting y=3xy = -\sqrt{3}\,x into y=x24y = x^2 - 4 gives x2+3x4=0,x^2 + \sqrt{3}\,x - 4 = 0, whose positive root is x=3+192.x = \frac{-\sqrt{3} + \sqrt{19}}{2}. Then y=3x=3572<0,y = -\sqrt{3}\,x = \frac{3 - \sqrt{57}}{2} \lt 0, so this point is in the fourth quadrant, on both curves.

The problem guarantees the fourth-quadrant intersection is unique, so its yy-coordinate is 3572,\frac{3 - \sqrt{57}}{2}, giving a+b+c=3+57+2=62.a + b + c = 3 + 57 + 2 = 62.

10.

The 2727 cells of a 3×93 \times 9 grid are filled in using the numbers 11 through 99 so that each row contains 99 different numbers, and each of the three 3×33 \times 3 blocks heavily outlined in the example below contains 99 different numbers, as in the first three rows of a Sudoku puzzle.

The number of different ways to fill such a grid can be written as paqbrcsd,p^a \cdot q^b \cdot r^c \cdot s^d, where p,p, q,q, r,r, and ss are distinct prime numbers and a,a, b,b, c,c, dd are positive integers. Find pa+qb+rc+sd.p \cdot a + q \cdot b + r \cdot c + s \cdot d.

Difficulty rating: 2990
Small Hint:

Fill the left block in 9!9! ways, then decide which digits from each of its rows go into each row of the middle block

Big Hint:

The middle block’s row contents can be chosen in 5656 ways, the right block is then determined, and every row of both blocks can be ordered in 3!3! ways

Solution:

Fill the left block arbitrarily: 9!9! ways. Let R1,R_1, R2,R_2, and R3R_3 be the sets of three digits in its rows. In the middle block, row ii must avoid RiR_i (those digits already appear in row ii), and the block’s three rows must partition {1,,9}.\{1, \ldots, 9\}. Say its top row takes jj digits from R2R_2 and 3j3 - j from R3.R_3. Balancing the three rows then forces the middle row to take 3j3 - j digits from R1R_1 together with all jj remaining digits of R3,R_3, and the bottom row is determined. The number of content choices is j=03(3j)(33j)2=1+27+27+1=56. \begin{gathered} \sum_{j=0}^{3} \binom{3}{j}\binom{3}{3-j}^2 \\ = 1 + 27 + 27 + 1 \\ = 56. \end{gathered}

The right block’s row contents are then forced (row ii takes whatever is missing from row ii), and each of the six rows of the middle and right blocks can be ordered internally in 3!3! ways. The total is 9!5666=(273457)(237)(2636)=2163105172. \begin{gathered} 9! \cdot 56 \cdot 6^6 \\ = (2^7 \cdot 3^4 \cdot 5 \cdot 7)(2^3 \cdot 7)(2^6 \cdot 3^6) \\ = 2^{16} \cdot 3^{10} \cdot 5^1 \cdot 7^2. \end{gathered}

Therefore pa+qb+rc+sdp \cdot a + q \cdot b + r \cdot c + s \cdot d =216+310+51= 2 \cdot 16 + 3 \cdot 10 + 5 \cdot 1 +72=81.+ 7 \cdot 2 = 81.

11.

A piecewise linear function is defined by f(x)={xif 1x<12xif 1x<3f(x) = \begin{cases} x & \text{if } -1 \le x \lt 1 \\ 2 - x & \text{if } 1 \le x \lt 3 \end{cases} and f(x+4)=f(x)f(x + 4) = f(x) for all real numbers x.x. The graph of f(x)f(x) has the sawtooth pattern depicted below.

The parabola x=34y2x = 34y^2 intersects the graph of f(x)f(x) at finitely many points. The sum of the yy-coordinates of all these intersection points can be expressed in the form a+bcd,\frac{a + b\sqrt{c}}{d}, where a,a, b,b, c,c, and dd are positive integers such that a,a, b,b, dd have greatest common divisor equal to 1,1, and cc is not divisible by the square of any prime. Find a+b+c+d.a + b + c + d.

Difficulty rating: 2990
Small Hint:

On the parabola x=34y2,x = 34y^2, intersections are the solutions of y=f(34y2)y = f(34y^2) with 1y1,-1 \le y \le 1, so 0x340 \le x \le 34

Big Hint:

Each linear piece turns y=f(34y2)y = f(34y^2) into a quadratic; add the roots with Vieta’s formulas, but check which roots actually land in the piece’s interval

Solution:

Since ff only takes values in [1,1],[-1, 1], any intersection has 1y1-1 \le y \le 1 and hence x=34y2[0,34].x = 34y^2 \in [0, 34]. On the rising pieces, x[4k1,4k+1)x \in [4k - 1, 4k + 1) with f(x)=x4k,f(x) = x - 4k, so y=f(34y2)y = f(34y^2) becomes 34y2y4k=0;34y^2 - y - 4k = 0; on the falling pieces, x[4k+1,4k+3)x \in [4k + 1, 4k + 3) with f(x)=4k+2x,f(x) = 4k + 2 - x, giving 34y2+y(4k+2)=0.34y^2 + y - (4k + 2) = 0. In each case a root is valid exactly when it lies in [1,1)[-1, 1) (rising) or (1,1](-1, 1] (falling), since then x=34y2x = 34y^2 automatically falls in the correct interval.

For the rising pieces the roots are 1±1+544k68,\frac{1 \pm \sqrt{1 + 544k}}{68}, and both are valid exactly when 1+544k67,\sqrt{1 + 544k} \le 67, i.e. for k=0,1,,8:k = 0, 1, \ldots, 8: nine quadratics, each contributing root sum 134\frac{1}{34} by Vieta. For the falling pieces the roots are 1±544k+27368.\frac{-1 \pm \sqrt{544k + 273}}{68}. The root with the minus sign requires 544k+273<67,\sqrt{544k + 273} \lt 67, which holds for k=0,,7;k = 0, \ldots, 7; those eight quadratics each contribute 134.-\frac{1}{34}. For k=8k = 8 only the positive root 1+462568=1+518568\frac{-1 + \sqrt{4625}}{68} = \frac{-1 + 5\sqrt{185}}{68} is valid.

The total is 934834+1+518568=1+518568, \begin{aligned} &\frac{9}{34} - \frac{8}{34} + \frac{-1 + 5\sqrt{185}}{68} \\ &\quad = \frac{1 + 5\sqrt{185}}{68}, \end{aligned} and 185=537185 = 5 \cdot 37 is squarefree, so a+b+c+da + b + c + d =1+5+185+68= 1 + 5 + 185 + 68 =259.= 259.

12.

The set of points in 33-dimensional coordinate space that lie in the plane x+y+z=75x + y + z = 75 whose coordinates satisfy the inequalities xyz<yzx<zxyx - yz \lt y - zx \lt z - xy forms three disjoint convex regions. Exactly one of those regions has finite area. The area of this finite region can be expressed in the form ab,a\sqrt{b}, where aa and bb are positive integers and bb is not divisible by the square of any prime. Find a+b.a + b.

Difficulty rating: 3060
Small Hint:

The first inequality rearranges to (xy)(1+z)<0,(x - y)(1 + z) \lt 0, and the second to (yz)(1+x)<0(y - z)(1 + x) \lt 0

Big Hint:

The bounded piece is 1<x<y<z-1 \lt x \lt y \lt z on the plane; its corners come from the boundaries x=1,x = -1, x=y,x = y, and y=zy = z

Solution:

Since xyz(yzx)x - yz - (y - zx) =(xy)+z(xy)= (x - y) + z(x - y) =(xy)(1+z),= (x - y)(1 + z), and similarly yzx(zxy)y - zx - (z - xy) =(yz)(1+x),= (y - z)(1 + x), the conditions are (xy)(1+z)<0(x - y)(1 + z) \lt 0 and (yz)(1+x)<0.(y - z)(1 + x) \lt 0. Each condition offers two sign patterns, giving four combinations. The combination x>y,x \gt y, z<1,z \lt -1, y>z,y \gt z, x<1x \lt -1 is impossible on the plane: x,z<1x, z \lt -1 forces y>77,y \gt 77, contradicting x>y.x \gt y. Two of the remaining combinations allow a coordinate to run off to infinity, producing the two unbounded regions.

The bounded region is x<y,x \lt y, y<z,y \lt z, x>1x \gt -1 (the fourth constraint z>1z \gt -1 is then automatic): the set 1<x<y<z-1 \lt x \lt y \lt z on the plane. Its closure is the triangle whose vertices come from intersecting the boundary lines pairwise: x=1,x = -1, x=yx = y gives (1,1,77);(-1, -1, 77); x=1,x = -1, y=zy = z gives (1,38,38);(-1, 38, 38); and x=y=zx = y = z gives (25,25,25).(25, 25, 25).

With A=(1,1,77),A = (-1, -1, 77), the edge vectors are BA=(0,39,39)B - A = (0, 39, -39) and CA=(26,26,52),C - A = (26, 26, -52), whose cross product is 1014(1,1,1),-1014\,(1, 1, 1), of length 10143.1014\sqrt{3}. The area is 101432=5073,\frac{1014\sqrt{3}}{2} = 507\sqrt{3}, so a+b=507+3=510.a + b = 507 + 3 = 510.

13.

Alex divides a disk into four quadrants with two perpendicular diameters intersecting at the center of the disk. He draws 2525 more line segments through the disk, drawing each segment by selecting two points at random on the perimeter of the disk in different quadrants and connecting these two points. Find the expected number of regions into which these 2727 line segments divide the disk.

Difficulty rating: 3270
Small Hint:

Each new segment adds 11 plus the number of earlier segments it crosses, so find the expected total number of interior crossings

Big Hint:

Classify by quadrant pairs: a random chord meets a given diameter with probability 23,\frac{2}{3}, and two random chords cross with probability 1736\frac{17}{36}

Solution:

With probability 1,1, no random endpoint or interior crossing coincides with another, so adding chords one at a time, each new chord increases the region count by 11 plus the number of existing chords it crosses inside the disk. Starting from one region, the expected total is 1+27+E,1 + 27 + E, where EE is the expected number of interior crossing pairs. The two diameters cross once. A random chord’s endpoints land in one of the 66 quadrant pairs, each with probability 16.\frac{1}{6}. The chord crosses the vertical diameter exactly when its endpoints have opposite xx-signs, which happens for 44 of the 66 pairs, so it meets each diameter with probability 23\frac{2}{3} and both diameters together 43\frac{4}{3} times on average: the 2525 chords contribute 1003\frac{100}{3} expected crossings with the diameters.

For two random chords, condition on their quadrant pairs (3636 equally likely ordered combinations). If one uses quadrants 1,31, 3 and the other 2,4,2, 4, the endpoints always alternate, so they always cross: 22 combinations. If the two pairs are adjacent and disjoint, such as {1,2}\{1, 2\} and {3,4},\{3, 4\}, the chords never cross: 44 combinations. In each of the other 3030 combinations, whether the endpoints alternate around the circle reduces to comparing independent uniform points inside shared quadrants — for example, a {1,3}\{1,3\} chord and a {1,2}\{1,2\} chord cross exactly when the two quadrant-11 points come in one specific order — and the probability is 12\frac{1}{2} by symmetry. So two random chords cross with probability 21+40+301236=1736.\frac{2 \cdot 1 + 4 \cdot 0 + 30 \cdot \frac{1}{2}}{36} = \frac{17}{36}.

The (252)=300\binom{25}{2} = 300 chord pairs contribute 3001736=4253300 \cdot \frac{17}{36} = \frac{425}{3} expected crossings, so E=1+1003+4253=176E = 1 + \frac{100}{3} + \frac{425}{3} = 176 and the expected number of regions is 1+27+176=204.1 + 27 + 176 = 204.

14.

Let ABCDEABCDE be a convex pentagon with AB=14,AB = 14, BC=7,BC = 7, CD=24,CD = 24, DE=13,DE = 13, EA=26,EA = 26, and B=E=60.\angle B = \angle E = 60^\circ. For each point XX in the plane, define f(X)=AX+BX+CXf(X) = AX + BX + CX +DX+EX.+ DX + EX. The least possible value of f(X)f(X) can be expressed as m+np,m + n\sqrt{p}, where mm and nn are positive integers and pp is not divisible by the square of any prime. Find m+n+p.m + n + p.

Difficulty rating: 3500
Small Hint:

Compute AC=73AC = 7\sqrt{3} and AD=133;AD = 13\sqrt{3}; triangles ABCABC and AEDAED turn out to have right angles at CC and DD

Big Hint:

Split f(X)=(BX+EX)f(X) = (BX + EX) +(AX+CX+DX)+ (AX + CX + DX) and show that the Fermat point of triangle ACDACD lies on segment BEBE

Solution:

In triangle ABC,ABC, the law of cosines with B=60\angle B = 60^\circ gives AC2=142+72147=147,AC^2 = 14^2 + 7^2 - 14 \cdot 7 = 147, so AC=73;AC = 7\sqrt{3}; since 72+147=142,7^2 + 147 = 14^2, the angle at CC is right and BAC=30.\angle BAC = 30^\circ. Likewise AD=133,AD = 13\sqrt{3}, with a right angle at DD and DAE=30.\angle DAE = 30^\circ. In triangle ACDACD with CD=24,CD = 24, cosCAD=147+507576273133=17,sinCAD=437. \begin{aligned} \cos \angle CAD &= \frac{147 + 507 - 576}{2 \cdot 7\sqrt{3} \cdot 13\sqrt{3}} \\ &= \frac{1}{7}, \\ \sin \angle CAD &= \frac{4\sqrt{3}}{7}. \end{aligned}

Split f(X)=(BX+EX)f(X) = (BX + EX) +(AX+CX+DX)BE+T,+ (AX + CX + DX) \ge BE + T, where TT is the minimum of AX+CX+DX.AX + CX + DX. Since BAE=30+CAD+30,\angle BAE = 30^\circ + \angle CAD + 30^\circ, we get cosBAE=1217\cos \angle BAE = \frac{1}{2} \cdot \frac{1}{7} 32437- \frac{\sqrt{3}}{2} \cdot \frac{4\sqrt{3}}{7} =1114,= -\frac{11}{14}, so BE2=142+262BE^2 = 14^2 + 26^2 +214261114=1444+ 2 \cdot 14 \cdot 26 \cdot \frac{11}{14} = 1444 and BE=38.BE = 38. All angles of triangle ACDACD are less than 120,120^\circ, so TT is attained at its Fermat point; erecting an equilateral triangle ACPACP on side ACAC away from D,D, the standard rotation argument gives T=PD,T = PD, and since PAD=60+CAD\angle PAD = 60^\circ + \angle CAD also has cosine 1114,-\frac{11}{14}, T2=147+507+2731331114=1083,T=193. \begin{gathered} T^2 \\ = 147 + 507 \\ {}+ 2 \cdot 7\sqrt{3} \cdot 13\sqrt{3} \cdot \frac{11}{14} \\ = 1083, \\ T = 19\sqrt{3}. \end{gathered}

Both bounds are tight simultaneously: let FF be the Fermat point of ACD,ACD, so AFC=AFD=120.\angle AFC = \angle AFD = 120^\circ. Since AFC+ABC=180,\angle AFC + \angle ABC = 180^\circ, point FF lies on the circumcircle of ABC,ABC, whence AFB=ACB=90;\angle AFB = \angle ACB = 90^\circ; similarly FF lies on the circumcircle of AEDAED and AFE=ADE=90.\angle AFE = \angle ADE = 90^\circ. Thus BFE=180,\angle BFE = 180^\circ, so FF lies on segment BEBE and f(F)=BE+T=38+193.f(F) = BE + T = 38 + 19\sqrt{3}. The answer is m+n+p=38+19+3=60.m + n + p = 38 + 19 + 3 = 60.

15.

Let NN denote the number of ordered triples of positive integers (a,b,c)(a, b, c) such that a,a, b,b, c36c \le 3^6 and a3+b3+c3a^3 + b^3 + c^3 is a multiple of 37.3^7. Find the remainder when NN is divided by 1000.1000.

Difficulty rating: 3370
Small Hint:

a3mod37a^3 \bmod 3^7 depends only on amod36,a \bmod 3^6, and cubes of numbers prime to 33 are ±1(mod9)\equiv \pm 1 \pmod 9

Big Hint:

Three units, or one unit, can’t sum to 00 mod 9.9. With one multiple of 3,3, each valid target has exactly one cube root; with all three, recurse modulo 34.3^4.

Solution:

Since (a+36t)3a3(mod37),(a + 3^6 t)^3 \equiv a^3 \pmod{3^7}, the cube of aa modulo 373^7 depends only on amod36,a \bmod 3^6, and each residue occurs exactly once in 1a36.1 \le a \le 3^6. Moreover, the only cube roots of 11 modulo 373^7 are 1+36t,1 + 3^6 t, which all agree modulo 36;3^6; hence cubing is a bijection from the 486486 units modulo 363^6 onto the set of unit cubes modulo 37,3^7, which is exactly the set of units ±1(mod9).\equiv \pm 1 \pmod 9. If all three of a,a, b,b, and cc are prime to 33 (or exactly one is), then modulo 99 the sum of cubes is ±1±1±1\pm 1 \pm 1 \pm 1 or ±1,\pm 1, never 0:0: no solutions.

Exactly one multiple of 3,3, say c=3z:c = 3z: for each of the 486486 units aa and 243243 choices of c,c, the requirement b3a327z3(mod37)b^3 \equiv -a^3 - 27z^3 \pmod{3^7} has a right side that is a unit ±1(mod9),\equiv \pm 1 \pmod 9, hence has exactly one solution bb modulo 36.3^6. With 33 choices for which variable is the multiple of 3,3, this case gives 3486243=3542943 \cdot 486 \cdot 243 = 354294 triples.

All three multiples of 3:3: writing a=3xa = 3x etc. with x,x, y,y, and zz ranging modulo 35,3^5, the condition becomes x3+y3+z30(mod34),x^3 + y^3 + z^3 \equiv 0 \pmod{3^4}, which depends only on the residues modulo 33,3^3, so the count is 939^3 times the count modulo 27.27. Repeating the same analysis one level down: the two-unit case gives 3189=486,3 \cdot 18 \cdot 9 = 486, and the all-divisible case reduces to u+v+w0(mod3)u + v + w \equiv 0 \pmod 3 with u,u, v,v, and ww modulo 9,9, giving 243;243; that is 486+243=729486 + 243 = 729 triples modulo 27,27, hence 729729=531441729 \cdot 729 = 531441 here. In total N=354294+531441=885735,N = 354294 + 531441 = 885735, whose remainder modulo 10001000 is 735.735.