2020 AIME I Exam Problems

Scroll down and press Start to try the exam! Or, go to the printable PDF, answer key, or professional solutions curated by LIVE by Po-Shen Loh.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Or jump straight to one problem with its solution: 1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 · 11 · 12 · 13 · 14 · 15

Want to learn professionally through interactive video classes?

Learn LIVE

Time Left:

3:00:00

1.

In ABC\triangle ABC with AB=AC,AB = AC, point DD lies strictly between AA and CC on side AC,\overline{AC}, and point EE lies strictly between AA and BB on side AB\overline{AB} such that AE=ED=DB=BC.AE = ED = DB = BC. The degree measure of ABC\angle ABC is mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 547
Concepts:isosceles triangleangle chasingangle sum

Difficulty rating: 2150

Solution:

Let BAC=α.\angle BAC = \alpha. Since AE=ED,AE = ED, triangle AEDAED is isosceles with ADE=DAE=α,\angle ADE = \angle DAE = \alpha, so the exterior angle at EE gives DEB=2α.\angle DEB = 2\alpha. Since ED=DB,ED = DB, triangle EDBEDB has DBE=DEB=2α,\angle DBE = \angle DEB = 2\alpha, hence EDB=1804α.\angle EDB = 180^\circ - 4\alpha.

The three angles at DD on segment AC\overline{AC} sum to a straight angle: α+(1804α)+BDC=180,\alpha + (180^\circ - 4\alpha) + \angle BDC = 180^\circ, so BDC=3α.\angle BDC = 3\alpha. Since DB=BC,DB = BC, also BCD=BDC=3α.\angle BCD = \angle BDC = 3\alpha. But AB=ACAB = AC makes ABC=ACB=3α,\angle ABC = \angle ACB = 3\alpha, so the angle sum of ABC\triangle ABC gives α+3α+3α=180,\alpha + 3\alpha + 3\alpha = 180^\circ, hence α=1807\alpha = \frac{180}{7} degrees.

Then ABC=3α=5407\angle ABC = 3\alpha = \frac{540}{7} degrees, and m+n=540+7=547.m + n = 540 + 7 = 547.

2.

There is a unique positive real number xx such that the three numbers log8(2x),\log_8(2x), log4x,\log_4 x, and log2x,\log_2 x, in that order, form a geometric progression with positive common ratio. The number xx can be written as mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 17

Difficulty rating: 1950

Solution:

Let t=log2x.t = \log_2 x. Then log4x=t2\log_4 x = \frac{t}{2} and log8(2x)=1+t3.\log_8(2x) = \frac{1 + t}{3}. In a geometric progression the middle term squared equals the product of the outer terms: (t2)2=1+t3t.\left(\frac{t}{2}\right)^2 = \frac{1 + t}{3} \cdot t.

Since t=0t = 0 gives no valid ratio, divide by t:t: t4=1+t3,\frac{t}{4} = \frac{1 + t}{3}, so 3t=4+4t3t = 4 + 4t and t=4.t = -4. Thus x=24=116,x = 2^{-4} = \frac{1}{16}, and the progression is 1,-1, 2,-2, 4-4 with common ratio 2,2, which is positive as required.

Therefore m+n=1+16=17.m + n = 1 + 16 = 17.

3.

A positive integer NN has base-eleven representation abc\underline{a}\,\underline{b}\,\underline{c} and base-eight representation 1bca,\underline{1}\,\underline{b}\,\underline{c}\,\underline{a}, where a,a, b,b, and cc represent (not necessarily distinct) digits. Find the least such NN expressed in base ten.

Answer: 621

Difficulty rating: 2110

Solution:

Equating the two representations in base ten gives 121a+11b+c=512+64b+8c+a,121a + 11b + c = 512 + 64b + 8c + a, which simplifies to 120a=512+53b+7c.120a = 512 + 53b + 7c. All of a,a, b,b, cc are base-eight digits, so 0a,b,c70 \le a, b, c \le 7 (and a1a \ge 1 since it leads the base-eleven representation).

The right side is at least 512,512, so a5.a \ge 5. Since N=121a+11b+cN = 121a + 11b + c increases with a,a, try a=5:a = 5: then 53b+7c=88.53b + 7c = 88. Here b=0b = 0 gives 7c=88,7c = 88, impossible, and b2b \ge 2 overshoots, so b=1b = 1 and 7c=35,7c = 35, giving c=5.c = 5.

Thus N=1215+11+5=621,N = 121 \cdot 5 + 11 + 5 = 621, whose base-eight representation is 11551155 and base-eleven representation is 515,515, as required. The least such NN is 621.621.

4.

Let SS be the set of positive integers NN with the property that the last four digits of NN are 2020,2020, and when the last four digits are removed, the result is a divisor of N.N. For example, 42,02042{,}020 is in SS because 44 is a divisor of 42,020.42{,}020. Find the sum of all the digits of all the numbers in S.S. For example, the number 42,02042{,}020 contributes 4+2+0+2+0=84 + 2 + 0 + 2 + 0 = 8 to this total.

Answer: 93

Difficulty rating: 2230

Solution:

If removing the last four digits leaves k1,k \ge 1, then N=10000k+2020,N = 10000k + 2020, and the condition kNk \mid N is equivalent to k2020.k \mid 2020. Since 2020=225101,2020 = 2^2 \cdot 5 \cdot 101, there are 1212 choices of k:k: 1,1, 2,2, 4,4, 5,5, 10,10, 20,20, 101,101, 202,202, 404,404, 505,505, 1010,1010, 2020.2020.

Each member of SS has digit sum equal to the digit sum of kk plus 2+0+2+0=4.2 + 0 + 2 + 0 = 4. The digit sums of the twelve divisors are 1,2,4,5,1,2,2,4,8,10,2,4,1, 2, 4, 5, 1, 2, 2, 4, 8, 10, 2, 4, totaling 45.45.

The answer is 45+124=93.45 + 12 \cdot 4 = 93.

5.

Six cards numbered 11 through 66 are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order.

Answer: 52
Solution:

First count arrangements from which some card's removal leaves the rest ascending. Any such arrangement arises by choosing the card to remove (66 ways) and inserting it into one of the 66 gaps of the other five cards written in increasing order, for 3636 constructions. But the fully sorted row 123456123456 arises from all 66 card choices, and each of the 55 arrangements obtained by swapping two adjacent cards of the sorted row arises twice (move either card of the pair past the other). Every other construction gives a distinct arrangement.

So the ascending count is 1+5+(36610)=26,1 + 5 + (36 - 6 - 10) = 26, and by symmetry there are 2626 descending arrangements. No arrangement is counted in both totals: that would require an ascending and a descending subsequence of five cards, needing at least 5+51=95 + 5 - 1 = 9 cards.

The total is 26+26=52.26 + 26 = 52.

6.

A flat board has a circular hole with radius 11 and a circular hole with radius 22 such that the distance between the centers of the two holes is 7.7. Two spheres with equal radii sit in the two holes such that the spheres are tangent to each other. The square of the radius of the spheres is mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 173

Difficulty rating: 2450

Solution:

A sphere of radius rr resting in a circular hole of radius aa has its center on the axis of the hole; since the center is at distance rr from every point of the hole's rim, it sits at distance r2a2\sqrt{r^2 - a^2} from the plane of the board. So the two centers lie at depths r21\sqrt{r^2 - 1} and r24\sqrt{r^2 - 4} on the same side of the board, with horizontal separation 7.7.

Tangency of the spheres means the centers are 2r2r apart: 49+(r21r24)2=4r2.49 + \left(\sqrt{r^2 - 1} - \sqrt{r^2 - 4}\right)^2 = 4r^2. Expanding gives 49+2r252(r21)(r24)=4r2,49 + 2r^2 - 5 - 2\sqrt{(r^2 - 1)(r^2 - 4)} = 4r^2, so (r21)(r24)=22r2.\sqrt{(r^2 - 1)(r^2 - 4)} = 22 - r^2. Squaring, r45r2+4=48444r2+r4,r^4 - 5r^2 + 4 = 484 - 44r^2 + r^4, hence 39r2=48039r^2 = 480 and r2=16013.r^2 = \frac{160}{13}.

Thus m+n=160+13=173.m + n = 160 + 13 = 173.

7.

A club consisting of 1111 men and 1212 women needs to choose a committee from among its members so that the number of women on the committee is one more than the number of men on the committee. The committee could have as few as 11 member or as many as 2323 members. Let NN be the number of such committees that can be formed. Find the sum of the prime numbers that divide N.N.

Answer: 81
Solution:

A committee with kk men has k+1k + 1 women, so N=k=011(11k)(12k+1)=k=011(11k)(1211k)=(2311)N = \sum_{k=0}^{11} \binom{11}{k}\binom{12}{k+1} = \sum_{k=0}^{11} \binom{11}{k}\binom{12}{11-k} = \binom{23}{11} by Vandermonde's identity (both sides count ways to choose 1111 people from all 2323).

Now factor (2311)=23!11!12!.\binom{23}{11} = \frac{23!}{11!\,12!}. The primes 13,13, 17,17, 19,19, 2323 each appear in the numerator but not the denominator. By Legendre's formula the exponent of 22 is 19810=1,19 - 8 - 10 = 1, of 33 is 945=0,9 - 4 - 5 = 0, of 55 is 422=0,4 - 2 - 2 = 0, of 77 is 311=1,3 - 1 - 1 = 1, and of 1111 is 211=0.2 - 1 - 1 = 0. Hence N=2713171923.N = 2 \cdot 7 \cdot 13 \cdot 17 \cdot 19 \cdot 23.

The sum of the primes dividing NN is 2+7+13+17+19+23=81.2 + 7 + 13 + 17 + 19 + 23 = 81.

8.

A bug walks all day and sleeps all night. On the first day, it starts at point O,O, faces east, and walks a distance of 55 units due east. Each night the bug rotates 6060^\circ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to point P.P. Then OP2=mn,OP^2 = \frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 103

Difficulty rating: 2560

Solution:

Work in the complex plane with OO at the origin and east along the positive real axis. Each day's displacement is the previous one multiplied by z=12eiπ/3,z = \frac{1}{2}e^{i\pi/3}, so P=5(1+z+z2+)=51z.P = 5\left(1 + z + z^2 + \cdots\right) = \frac{5}{1 - z}.

Since z=14+34i,z = \frac{1}{4} + \frac{\sqrt{3}}{4}i, we get 1z=3434i,1 - z = \frac{3}{4} - \frac{\sqrt{3}}{4}i, whose squared magnitude is 916+316=34.\frac{9}{16} + \frac{3}{16} = \frac{3}{4}. Therefore OP2=253/4=1003,OP^2 = \frac{25}{3/4} = \frac{100}{3}, and m+n=100+3=103.m + n = 100 + 3 = 103.

9.

Let SS be the set of positive integer divisors of 209.20^9. Three numbers are chosen independently and at random from the set SS and labeled a1,a_1, a2,a_2, and a3a_3 in the order they are chosen. The probability that both a1a_1 divides a2a_2 and a2a_2 divides a3a_3 is mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m.m.

Answer: 77
Solution:

Write 209=21859,20^9 = 2^{18} \cdot 5^9, so each ai=2xi5yia_i = 2^{x_i} 5^{y_i} with 0xi180 \le x_i \le 18 and 0yi9;0 \le y_i \le 9; there are 1910=19019 \cdot 10 = 190 divisors, and the exponents of the two primes are chosen independently and uniformly. The chain a1a2a3a_1 \mid a_2 \mid a_3 holds exactly when x1x2x3x_1 \le x_2 \le x_3 and y1y2y3.y_1 \le y_2 \le y_3.

Non-decreasing triples from a set of kk values correspond to multisets of size 3,3, counted by (k+23).\binom{k+2}{3}. So the probability is (213)193(123)103=133068592201000=703611150=771805.\frac{\binom{21}{3}}{19^3} \cdot \frac{\binom{12}{3}}{10^3} = \frac{1330}{6859} \cdot \frac{220}{1000} = \frac{70}{361} \cdot \frac{11}{50} = \frac{77}{1805}.

Since 1805=51921805 = 5 \cdot 19^2 shares no factor with 77=711,77 = 7 \cdot 11, the fraction is in lowest terms and m=77.m = 77.

10.

Let mm and nn be positive integers satisfying the conditions

gcd(m+n,210)=1,\gcd(m + n, 210) = 1,

mmm^m is a multiple of nn,n^n, and

mm is not a multiple of n.n.

Find the least possible value of m+n.m + n.

Answer: 407
Solution:

If a prime pp divides n,n, then pnnmm,p \mid n^n \mid m^m, so pmp \mid m and hence pm+n.p \mid m + n. Since gcd(m+n,210)=1,\gcd(m + n, 210) = 1, no prime factor of nn is 2,2, 3,3, 5,5, or 7:7: every prime factor of nn is at least 11.11. Because mm is not a multiple of n,n, some prime pp has b=vp(m)<a=vp(n),b = v_p(m) \lt a = v_p(n), where vpv_p denotes the exponent of p.p. Comparing exponents of pp in nnmmn^n \mid m^m gives bman,bm \ge an, so mabn2n.m \ge \frac{a}{b}n \ge 2n. In particular a2,a \ge 2, so p2np^2 \mid n and n112=121.n \ge 11^2 = 121.

Take n=121n = 121 with p=11,p = 11, a=2,a = 2, b=1:b = 1: then mm is a multiple of 1111 but not of 121,121, and m2121=242.m \ge 2 \cdot 121 = 242. The candidates m=253,264,275m = 253, 264, 275 give m+n=374=21117,m + n = 374 = 2 \cdot 11 \cdot 17, 385=5711,385 = 5 \cdot 7 \cdot 11, 396=223211,396 = 2^2 \cdot 3^2 \cdot 11, all sharing a factor with 210,210, while m=242=2112m = 242 = 2 \cdot 11^2 is a multiple of 121.121. But m=286=21113m = 286 = 2 \cdot 11 \cdot 13 works: v11(mm)=286242=v11(nn),v_{11}(m^m) = 286 \ge 242 = v_{11}(n^n), so nnmm,n^n \mid m^m, and m+n=407=1137m + n = 407 = 11 \cdot 37 is coprime to 210.210.

Any other admissible nn is at least 132=169,13^2 = 169, forcing m+n3n507.m + n \ge 3n \ge 507. Hence the least possible value is 407.407.

11.

For integers a,a, b,b, c,c, and d,d, let f(x)=x2+ax+bf(x) = x^2 + ax + b and g(x)=x2+cx+d.g(x) = x^2 + cx + d. Find the number of ordered triples (a,b,c)(a, b, c) of integers with absolute values not exceeding 1010 for which there is an integer dd such that g(f(2))=g(f(4))=0.g(f(2)) = g(f(4)) = 0.

Answer: 510

Difficulty rating: 2990

Solution:

The condition says the integers f(2)=4+2a+bf(2) = 4 + 2a + b and f(4)=16+4a+bf(4) = 16 + 4a + b are both roots of the monic quadratic g.g. These two values are equal exactly when a=6.a = -6.

If a=6,a = -6, then for any bb and any cc the choice d=f(2)2cf(2)d = -f(2)^2 - c\,f(2) makes f(2)=f(4)f(2) = f(4) a root of g,g, giving 2121=44121 \cdot 21 = 441 triples. If a6,a \ne -6, the two distinct values must be the two roots of g,g, so Vieta forces c=(f(2)+f(4))=(20+6a+2b),c = -(f(2) + f(4)) = -(20 + 6a + 2b), and then d=f(2)f(4)d = f(2)f(4) is an integer. The requirement c10|c| \le 10 becomes 153a+b5.-15 \le 3a + b \le -5.

For each a,a, count integers b[10,10]b \in [-10, 10] with 153ab53a:-15 - 3a \le b \le -5 - 3a: the counts are 2,5,11,11,11,11,9,6,32, 5, 11, 11, 11, 11, 9, 6, 3 for a=8,7,5,4,3,2,1,0,1a = -8, -7, -5, -4, -3, -2, -1, 0, 1 respectively, and 00 for all other a6,a \ne -6, totaling 69.69. The answer is 441+69=510.441 + 69 = 510.

12.

Let nn be the least positive integer for which 149n2n149^n - 2^n is divisible by 335577.3^3 \cdot 5^5 \cdot 7^7. Find the number of positive divisors of n.n.

Answer: 270
Solution:

Work prime by prime. Since 1492=147=372,149 - 2 = 147 = 3 \cdot 7^2, the lifting-the-exponent lemma gives v3(149n2n)=v3(147)+v3(n)=1+v3(n)v_3(149^n - 2^n) = v_3(147) + v_3(n) = 1 + v_3(n) and v7(149n2n)=2+v7(n)v_7(149^n - 2^n) = 2 + v_7(n) for every positive integer n.n. Requiring at least 33 and 77 forces 32n3^2 \mid n and 75n.7^5 \mid n.

For 55 we first need 149n2n(mod5),149^n \equiv 2^n \pmod 5, i.e. 4n2n,4^n \equiv 2^n, i.e. 2n1(mod5),2^n \equiv 1 \pmod 5, which requires 4n.4 \mid n. Write n=4k.n = 4k. In 149424=(1492)(149+2)(1492+4),149^4 - 2^4 = (149 - 2)(149 + 2)(149^2 + 4), only the last factor is divisible by 5,5, and only once, since 1492+4=22205=54441.149^2 + 4 = 22205 = 5 \cdot 4441. Lifting the exponent from the base 1494,24149^4, 2^4 gives v5(149n2n)=1+v5(k),v_5(149^n - 2^n) = 1 + v_5(k), so 54k,5^4 \mid k, i.e. 454n.4 \cdot 5^4 \mid n.

The least valid nn is 22325475,2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5, which has (2+1)(2+1)(4+1)(5+1)=270(2+1)(2+1)(4+1)(5+1) = 270 positive divisors.

13.

Point DD lies on side BC\overline{BC} of ABC\triangle ABC so that AD\overline{AD} bisects BAC.\angle BAC. The perpendicular bisector of AD\overline{AD} intersects the bisectors of ABC\angle ABC and ACB\angle ACB in points EE and F,F, respectively. Given that AB=4,AB = 4, BC=5,BC = 5, and CA=6,CA = 6, the area of AEF\triangle AEF can be written as mnp,\frac{m\sqrt{n}}{p}, where mm and pp are relatively prime positive integers, and nn is a positive integer not divisible by the square of any prime. Find m+n+p.m + n + p.

Answer: 36

Difficulty rating: 3160

Solution:

In triangle ABD,ABD, the internal bisector of the angle at BB meets the circumcircle of ABDABD again at the midpoint of arc ADAD not containing B,B, and that arc midpoint lies on the perpendicular bisector of AD\overline{AD} — so EE is exactly that arc midpoint. The inscribed angles EAD\angle EAD and EBD\angle EBD subtend the same arc ED,ED, so EAD=B2.\angle EAD = \frac{B}{2}. Similarly FAD=C2,\angle FAD = \frac{C}{2}, and E,FE, F lie on opposite sides of line AD.AD.

Let MM be the midpoint of AD.\overline{AD}. In right triangles AMEAME and AMF,AMF, ME=AMtanB2ME = AM\tan\frac{B}{2} and MF=AMtanC2,MF = AM\tan\frac{C}{2}, so EF=AM(tanB2+tanC2),EF = AM\left(\tan\frac{B}{2} + \tan\frac{C}{2}\right), while the distance from AA to line EFEF is AM.AM. Hence [AEF]=12AM2(tanB2+tanC2).[AEF] = \frac{1}{2}AM^2\left(\tan\frac{B}{2} + \tan\frac{C}{2}\right).

Here BD=2BD = 2 and DC=3,DC = 3, so AD2=ABACBDDC=246=18AD^2 = AB \cdot AC - BD \cdot DC = 24 - 6 = 18 and AM2=92.AM^2 = \frac{9}{2}. The law of cosines gives cosB=18\cos B = \frac{1}{8} and cosC=34,\cos C = \frac{3}{4}, so tanB2=11/81+1/8=73\tan\frac{B}{2} = \sqrt{\frac{1 - 1/8}{1 + 1/8}} = \frac{\sqrt{7}}{3} and tanC2=17,\tan\frac{C}{2} = \frac{1}{\sqrt{7}}, with sum 10721.\frac{10\sqrt{7}}{21}. The area is 129210721=15714,\frac{1}{2} \cdot \frac{9}{2} \cdot \frac{10\sqrt{7}}{21} = \frac{15\sqrt{7}}{14}, so m+n+p=15+7+14=36.m + n + p = 15 + 7 + 14 = 36.

14.

Let P(x)P(x) be a quadratic polynomial with complex coefficients whose x2x^2 coefficient is 1.1. Suppose the equation P(P(x))=0P(P(x)) = 0 has four distinct solutions, x=3,4,a,b.x = 3, 4, a, b. Find the sum of all possible values of (a+b)2.(a + b)^2.

Answer: 85
Solution:

Write P(x)=x2+px+qP(x) = x^2 + px + q with roots r1r_1 and r2.r_2. The solutions of P(P(x))=0P(P(x)) = 0 split into the two solutions of P(x)=r1P(x) = r_1 and the two of P(x)=r2,P(x) = r_2, and each pair sums to p.-p.

If 33 and 44 form one pair, then a+b=p=3+4=7,a + b = -p = 3 + 4 = 7, so (a+b)2=49.(a + b)^2 = 49. This is achievable: P(x)=(x3)(x4)+r1P(x) = (x - 3)(x - 4) + r_1 with r1r_1 satisfying r126r1+12=0,r_1^2 - 6r_1 + 12 = 0, which has (complex) solutions, and the four roots are distinct.

Otherwise 33 and 44 lie in different pairs: 3+a=4+b=p=s,3 + a = 4 + b = -p = s, and {P(3),P(4)}={r1,r2}.\{P(3), P(4)\} = \{r_1, r_2\}. The root sum gives P(3)+P(4)=25+7p+2q=s,P(3) + P(4) = 25 + 7p + 2q = s, so with p=sp = -s we get q=4s252,q = 4s - \frac{25}{2}, and then P(3)=s72P(3) = s - \frac{7}{2} and P(4)=72.P(4) = \frac{7}{2}. The root product gives 72(s72)=q=4s252,\frac{7}{2}\left(s - \frac{7}{2}\right) = q = 4s - \frac{25}{2}, whose solution is s=12.s = \frac{1}{2}. Then a+b=(s3)+(s4)=6,a + b = (s - 3) + (s - 4) = -6, so (a+b)2=36,(a + b)^2 = 36, with a=52,a = -\frac{5}{2}, b=72b = -\frac{7}{2} all distinct from 33 and 4.4. The sum of all possible values is 49+36=85.49 + 36 = 85.

15.

Let ABC\triangle ABC be an acute triangle with circumcircle ω\omega and orthocenter H.H. Suppose the tangent to the circumcircle of HBC\triangle HBC at HH intersects ω\omega at points XX and YY with HA=3,HA = 3, HX=2,HX = 2, and HY=6.HY = 6. The area of ABC\triangle ABC can be written as mn,m\sqrt{n}, where mm and nn are positive integers, and nn is not divisible by the square of any prime. Find m+n.m + n.

Answer: 58
Solution:

Reflecting HH over line BCBC lands on ω,\omega, so the circumcircle of HBCHBC is the reflection of ω\omega over BC.BC. Take the circumcenter OO as the origin, so that H=A+B+CH = A + B + C as vectors. If MM is the midpoint of BC,\overline{BC}, then OMBC,OM \perp BC, so the reflected center is 2MO=B+C=HA.2M - O = B + C = H - A. Tangency at HH means XYXY is perpendicular to the radius from B+CB + C to H,H, which is the vector A:A: the chord XYXY is perpendicular to OA.OA.

Place A=(0,R)A = (0, R) so that XYXY is horizontal at height h,h, with H=(x0,h).H = (x_0, h). The half-chord length is R2h2,\sqrt{R^2 - h^2}, and HX=2,HX = 2, HY=6HY = 6 give R2h2=4\sqrt{R^2 - h^2} = 4 with x0=2.|x_0| = 2. From HA=3:HA = 3: 4+(Rh)2=9,4 + (R - h)^2 = 9, so Rh=5.R - h = \sqrt{5}. Then 16=R2h2=(Rh)(R+h)=5(2R5),16 = R^2 - h^2 = (R - h)(R + h) = \sqrt{5}\left(2R - \sqrt{5}\right), giving R=2125.R = \frac{21}{2\sqrt{5}}.

Now B+C=HA=(±2,5),B + C = H - A = (\pm 2, -\sqrt{5}), so M=(±1,52)M = \left(\pm 1, -\frac{\sqrt{5}}{2}\right) and OM=32,OM = \frac{3}{2}, whence BC=2R294=2995.BC = 2\sqrt{R^2 - \frac{9}{4}} = 2\sqrt{\frac{99}{5}}. The distance from AA to line BCBC (through M,M, perpendicular to OMOM) is AMOM2OM=21/4+9/43/2=5,\frac{|A \cdot M - OM^2|}{OM} = \frac{21/4 + 9/4}{3/2} = 5, using AM=5R2=214.A \cdot M = -\frac{\sqrt{5}R}{2} = -\frac{21}{4}. Hence [ABC]=1229955=495=355,[ABC] = \frac{1}{2} \cdot 2\sqrt{\frac{99}{5}} \cdot 5 = \sqrt{495} = 3\sqrt{55}, and m+n=3+55=58.m + n = 3 + 55 = 58.