2000 AIME II 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.

The number 2log420006+3log520006\frac{2}{\log_4 2000^6} + \frac{3}{\log_5 2000^6} can be written as mn,\frac{m}{n}, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 7
Concepts:logarithm

Difficulty rating: 1890

Solution:

Since 1logba=logab,\frac{1}{\log_b a} = \log_a b, the two terms equal 2log200064=log20006162\log_{2000^6} 4 = \log_{2000^6} 16 and 3log200065=log20006125.3\log_{2000^6} 5 = \log_{2000^6} 125. Their sum is log20006(16125)=log200062000=16.\log_{2000^6}(16 \cdot 125) = \log_{2000^6} 2000 = \frac{1}{6}.

Since gcd(1,6)=1,\gcd(1, 6) = 1, the answer is m+n=1+6=7.m + n = 1 + 6 = 7.

2.

A point whose coordinates are both integers is called a lattice point. How many lattice points lie on the hyperbola x2y2=20002?x^2 - y^2 = 2000^2?

Answer: 98
Solution:

Factor (xy)(x+y)=20002=2856.(x - y)(x + y) = 2000^2 = 2^8 \cdot 5^6. The factors xyx - y and x+yx + y have the same parity, and their product is even, so both must be even. Writing xy=2ax - y = 2a and x+y=2bx + y = 2b gives ab=2656=106.ab = 2^6 \cdot 5^6 = 10^6.

Each ordered pair of positive integers (a,b)(a, b) with ab=106ab = 10^6 yields exactly one solution x=a+b,x = a + b, y=bay = b - a with x>0,x \gt 0, and 10610^6 has 77=497 \cdot 7 = 49 divisors, hence 4949 such pairs. Replacing (a,b)(a, b) by (a,b)(-a, -b) gives the 4949 solutions with x<0,x \lt 0, and x=0x = 0 is impossible since y2<20002.-y^2 \lt 2000^2.

In total there are 49+49=9849 + 49 = 98 lattice points.

3.

A deck of forty cards consists of four 11's, four 22's, ,\ldots, and four 1010's. A matching pair (two cards with the same number) is removed from the deck. Given that these cards are not returned to the deck, let m/nm/n be the probability that two randomly selected cards also form a pair, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 758

Difficulty rating: 2020

Solution:

After the matching pair is removed, 3838 cards remain: nine numbers with four cards each and one number with only two cards. The number of ways to draw a pair is 9(42)+(22)=54+1=55,9\binom{4}{2} + \binom{2}{2} = 54 + 1 = 55, out of (382)=703\binom{38}{2} = 703 equally likely draws.

Since 703=1937703 = 19 \cdot 37 shares no factor with 55=511,55 = 5 \cdot 11, the probability 55703\frac{55}{703} is in lowest terms, and m+n=55+703=758.m + n = 55 + 703 = 758.

4.

What is the smallest positive integer with six positive odd integer divisors and twelve positive even integer divisors?

Answer: 180

Difficulty rating: 2070

Solution:

Write N=2amN = 2^a m with mm odd. The odd divisors of NN are exactly the divisors of m,m, so d(m)=6.d(m) = 6. Every even divisor is 2k2^k (for 1ka1 \le k \le a) times an odd divisor, so there are ad(m)=6aa \cdot d(m) = 6a of them, and 6a=126a = 12 gives a=2.a = 2.

So N=4mN = 4m where mm is the smallest odd number with exactly 66 divisors. The shapes are p5p^5 (smallest 35=2433^5 = 243) and p2qp^2 q (smallest 325=453^2 \cdot 5 = 45), so m=45m = 45 and N=445=180.N = 4 \cdot 45 = 180.

5.

Given eight distinguishable rings, let nn be the number of possible five-ring arrangements on the four fingers (not the thumb) of one hand. The order of rings on each finger is significant, but it is not required that each finger have a ring. Find the leftmost three nonzero digits of n.n.

Answer: 376

Difficulty rating: 2300

Solution:

Choose which five rings to use in (85)=56\binom{8}{5} = 56 ways, and order them (reading down the first finger, then the second, and so on) in 5!=1205! = 120 ways. It remains to split the ordered list into four possibly empty consecutive blocks, one per finger: the number of compositions of 55 into 44 nonnegative parts, which by stars and bars is (83)=56.\binom{8}{3} = 56.

Therefore n=5612056=376320,n = 56 \cdot 120 \cdot 56 = 376320, whose leftmost three nonzero digits are 376.376.

6.

One base of a trapezoid is 100100 units longer than the other base. The segment that joins the midpoints of the legs divides the trapezoid into two regions whose areas are in the ratio 2:3.2 : 3. Let xx be the length of the segment joining the legs of the trapezoid that is parallel to the bases and that divides the trapezoid into two regions of equal area. Find the greatest integer that does not exceed x2/100.x^2/100.

Answer: 181

Difficulty rating: 2450

Solution:

Let the bases be bb and b+100.b + 100. The midsegment has length b+50b + 50 and splits the trapezoid into two trapezoids of equal height, whose areas are proportional to the sums of their parallel sides, b+(b+50)b + (b + 50) and (b+50)+(b+100).(b + 50) + (b + 100). Setting 2b+502b+150=23\frac{2b + 50}{2b + 150} = \frac{2}{3} gives b=75,b = 75, so the bases are 7575 and 175.175.

Extend the legs to meet at an apex, creating similar triangles: a segment parallel to the bases with length \ell cuts off a triangle of area c2c\ell^2 for a fixed constant c.c. The segment of length xx bisects the trapezoid's area exactly when cx2c752=c1752cx2,cx^2 - c \cdot 75^2 = c \cdot 175^2 - cx^2, so x2=752+17522=18125.x^2 = \frac{75^2 + 175^2}{2} = 18125.

Then x2/100=181.25,x^2/100 = 181.25, and the greatest integer not exceeding it is 181.181.

7.

Given that 12!17!+13!16!+14!15!+15!14!+16!13!+17!12!+18!11!+19!10!=N1!18!,\frac{1}{2!17!} + \frac{1}{3!16!} + \frac{1}{4!15!} + \frac{1}{5!14!} + \frac{1}{6!13!} + \frac{1}{7!12!} + \frac{1}{8!11!} + \frac{1}{9!10!} = \frac{N}{1!18!}, find the greatest integer that is less than N100.\frac{N}{100}.

Answer: 137

Difficulty rating: 2360

Solution:

Multiply both sides by 19!.19!. Each term on the left becomes 19!k!(19k)!=(19k)\frac{19!}{k!\,(19 - k)!} = \binom{19}{k} for k=2,,9,k = 2, \ldots, 9, while the right side becomes 19N.19N.

Since (19k)=(1919k),\binom{19}{k} = \binom{19}{19 - k}, the first half of the binomial row sums to k=09(19k)=2192=218,\sum_{k=0}^{9} \binom{19}{k} = \frac{2^{19}}{2} = 2^{18}, so k=29(19k)=218(190)(191)=26214420=262124.\sum_{k=2}^{9}\binom{19}{k} = 2^{18} - \binom{19}{0} - \binom{19}{1} = 262144 - 20 = 262124.

Hence N=26212419=13796,N = \frac{262124}{19} = 13796, so N100=137.96,\frac{N}{100} = 137.96, and the greatest integer less than this is 137.137.

8.

In trapezoid ABCD,ABCD, leg BC\overline{BC} is perpendicular to bases AB\overline{AB} and CD,\overline{CD}, and diagonals AC\overline{AC} and BD\overline{BD} are perpendicular. Given that AB=11AB = \sqrt{11} and AD=1001,AD = \sqrt{1001}, find BC2.BC^2.

Answer: 110

Difficulty rating: 2450

Solution:

Place B=(0,0),B = (0, 0), A=(11,0),A = (\sqrt{11}, 0), C=(0,h),C = (0, h), and D=(d,h),D = (d, h), so that BC\overline{BC} is vertical and BC2=h2.BC^2 = h^2. The diagonals give vectors AC=(11,h)\overrightarrow{AC} = (-\sqrt{11}, h) and BD=(d,h),\overrightarrow{BD} = (d, h), and perpendicularity means 11d+h2=0,-\sqrt{11}\,d + h^2 = 0, so d=h211.d = \frac{h^2}{\sqrt{11}}.

Then AD2=(d11)2+h2=1001.AD^2 = (d - \sqrt{11})^2 + h^2 = 1001. Setting u=h2,u = h^2, this becomes (u11)211+u=1001,\frac{(u - 11)^2}{11} + u = 1001, that is, u211u10890=0.u^2 - 11u - 10890 = 0. The positive root is u=11+121+435602=11+2092=110,u = \frac{11 + \sqrt{121 + 43560}}{2} = \frac{11 + 209}{2} = 110, so BC2=110.BC^2 = 110.

9.

Given that zz is a complex number such that z+1z=2cos3,z + \frac{1}{z} = 2\cos 3^\circ, find the least integer that is greater than z2000+1z2000.z^{2000} + \frac{1}{z^{2000}}.

Answer: 0

Difficulty rating: 2330

Solution:

From z+1z=2cos3z + \frac{1}{z} = 2\cos 3^\circ we get z2(2cos3)z+1=0,z^2 - (2\cos 3^\circ) z + 1 = 0, so z=cos3±isin3,z = \cos 3^\circ \pm i \sin 3^\circ, a point on the unit circle. By de Moivre's theorem, z2000+1z2000=2cos(20003)=2cos6000.z^{2000} + \frac{1}{z^{2000}} = 2\cos(2000 \cdot 3^\circ) = 2\cos 6000^\circ.

Since 6000=16360+240,6000 = 16 \cdot 360 + 240, this equals 2cos240=1.2\cos 240^\circ = -1. The least integer greater than 1-1 is 0.0.

10.

A circle is inscribed in quadrilateral ABCD,ABCD, tangent to AB\overline{AB} at PP and to CD\overline{CD} at Q.Q. Given that AP=19,AP = 19, PB=26,PB = 26, CQ=37,CQ = 37, and QD=23,QD = 23, find the square of the radius of the circle.

Answer: 647
Solution:

Let the incircle have center II and radius r.r. The tangent lengths from A,A, B,B, C,C, DD are 19,19, 26,26, 37,37, 23,23, and II lies on each angle bisector, so the half-angles α,β,γ,δ\alpha, \beta, \gamma, \delta at the four vertices satisfy tanα=r19,\tan\alpha = \frac{r}{19}, tanβ=r26,\tan\beta = \frac{r}{26}, tanγ=r37,\tan\gamma = \frac{r}{37}, tanδ=r23,\tan\delta = \frac{r}{23}, with α+β+γ+δ=180.\alpha + \beta + \gamma + \delta = 180^\circ.

Then tan(α+γ)=tan(β+δ),\tan(\alpha + \gamma) = -\tan(\beta + \delta), and the tangent addition formula turns this into r19+r371r21937=r26+r231r22623,i.e.56r703r2=49rr2598.\frac{\frac{r}{19} + \frac{r}{37}}{1 - \frac{r^2}{19 \cdot 37}} = -\frac{\frac{r}{26} + \frac{r}{23}}{1 - \frac{r^2}{26 \cdot 23}}, \qquad\text{i.e.}\qquad \frac{56r}{703 - r^2} = \frac{49r}{r^2 - 598}.

Cross-multiplying gives 56r256598=4970349r2,56r^2 - 56 \cdot 598 = 49 \cdot 703 - 49r^2, so 105r2=33488+34447=67935105r^2 = 33488 + 34447 = 67935 and r2=647.r^2 = 647.

11.

The coordinates of the vertices of isosceles trapezoid ABCDABCD are all integers, with A=(20,100)A = (20, 100) and D=(21,107).D = (21, 107). The trapezoid has no horizontal or vertical sides, and AB\overline{AB} and CD\overline{CD} are the only parallel sides. The sum of the absolute values of all possible slopes for AB\overline{AB} is m/n,m/n, where mm and nn are relatively prime positive integers. Find m+n.m + n.

Answer: 131

Difficulty rating: 2990

Solution:

Since all vertices are lattice points, w=BCw = \overrightarrow{BC} is an integer vector with w=AD=50,|w| = |\overrightarrow{AD}| = \sqrt{50}, so ww is one of (±1,±7),(\pm 1, \pm 7), (±7,±1),(\pm 7, \pm 1), (±5,±5).(\pm 5, \pm 5). Write AD=(1,7)=su^+hv^\overrightarrow{AD} = (1, 7) = s\,\hat{u} + h\,\hat{v} where u^\hat{u} points along AB\overline{AB} and v^\hat{v} is perpendicular. Because ABCD,\overline{AB} \parallel \overline{CD}, the vector ww has the same perpendicular component h,h, and the equal leg lengths force its u^\hat{u}-component to be s-s (the value +s+s gives a parallelogram). Hence (1,7)w=2su^(1, 7) - w = 2s\,\hat{u} is parallel to AB.\overline{AB}.

Discard w=(1,7)w = (1, 7) (parallelogram) and w=(1,7)w = (-1, -7) (then h=0,h = 0, degenerate). The choices w=(1,7)w = (1, -7) and w=(1,7)w = (-1, 7) make (1,7)w(1, 7) - w vertical or horizontal, which is forbidden. The remaining eight choices give (1,7)w(1, 7) - w equal to (6,6),(-6, 6), (6,8),(-6, 8), (8,6),(8, 6), (8,8),(8, 8), (4,2),(-4, 2), (4,12),(-4, 12), (6,2),(6, 2), (6,12),(6, 12), with slopes 1,-1, 43,-\frac{4}{3}, 34,\frac{3}{4}, 1,1, 12,-\frac{1}{2}, 3,-3, 13,\frac{1}{3}, 2;2; each is realizable by placing BB suitably far along u^.\hat{u}.

The sum of the absolute values is 1+43+34+1+12+3+13+2=11912,1 + \frac{4}{3} + \frac{3}{4} + 1 + \frac{1}{2} + 3 + \frac{1}{3} + 2 = \frac{119}{12}, so m+n=119+12=131.m + n = 119 + 12 = 131.

12.

The points A,A, B,B, and CC lie on the surface of a sphere with center OO and radius 20.20. It is given that AB=13,AB = 13, BC=14,BC = 14, CA=15,CA = 15, and that the distance from OO to triangle ABCABC is mnk,\frac{m\sqrt{n}}{k}, where m,m, n,n, and kk are positive integers, mm and kk are relatively prime, and nn is not divisible by the square of any prime. Find m+n+k.m + n + k.

Answer: 118
Solution:

The foot of the perpendicular from OO to the plane of ABCABC is equidistant from A,A, B,B, and CC (the slant segments to the vertices all have length 2020), so it is the circumcenter of triangle ABC.ABC.

By Heron's formula with s=21,s = 21, the area is K=21876=84,K = \sqrt{21 \cdot 8 \cdot 7 \cdot 6} = 84, so the circumradius is R=abc4K=131415336=658.R = \frac{abc}{4K} = \frac{13 \cdot 14 \cdot 15}{336} = \frac{65}{8}. The distance from OO to the plane is 202(658)2=25600422564=213758=15958.\sqrt{20^2 - \left(\tfrac{65}{8}\right)^2} = \sqrt{\frac{25600 - 4225}{64}} = \frac{\sqrt{21375}}{8} = \frac{15\sqrt{95}}{8}.

Here gcd(15,8)=1\gcd(15, 8) = 1 and 95=51995 = 5 \cdot 19 is squarefree, so m+n+k=15+95+8=118.m + n + k = 15 + 95 + 8 = 118.

13.

The equation 2000x6+100x5+10x3+x2=02000x^6 + 100x^5 + 10x^3 + x - 2 = 0 has exactly two real roots, one of which is m+nr,\frac{m + \sqrt{n}}{r}, where m,m, n,n, and rr are integers, mm and rr are relatively prime, and r>0.r \gt 0. Find m+n+r.m + n + r.

Answer: 200
Solution:

Group the equation as 2(1000x61)+x(100x4+10x2+1)=0.2(1000x^6 - 1) + x(100x^4 + 10x^2 + 1) = 0. Since 1000x61=(10x2)31=(10x21)(100x4+10x2+1),1000x^6 - 1 = (10x^2)^3 - 1 = (10x^2 - 1)(100x^4 + 10x^2 + 1), the left side factors as (100x4+10x2+1)(2(10x21)+x)=(100x4+10x2+1)(20x2+x2).(100x^4 + 10x^2 + 1)\big(2(10x^2 - 1) + x\big) = (100x^4 + 10x^2 + 1)(20x^2 + x - 2).

The quartic factor is always positive, so the two real roots are the roots of 20x2+x2=0,20x^2 + x - 2 = 0, namely x=1±16140.x = \frac{-1 \pm \sqrt{161}}{40}. The root of the form m+nr\frac{m + \sqrt{n}}{r} is 1+16140,\frac{-1 + \sqrt{161}}{40}, with m=1,m = -1, n=161,n = 161, r=40,r = 40, and gcd(1,40)=1.\gcd(-1, 40) = 1. Thus m+n+r=1+161+40=200.m + n + r = -1 + 161 + 40 = 200.

14.

Every positive integer kk has a unique factorial base expansion (f1,f2,f3,,fm),(f_1, f_2, f_3, \ldots, f_m), meaning that k=1!f1+2!f2+3!f3++m!fm,k = 1! \cdot f_1 + 2! \cdot f_2 + 3! \cdot f_3 + \cdots + m! \cdot f_m, where each fif_i is an integer, 0fii,0 \le f_i \le i, and 0<fm.0 \lt f_m. Given that (f1,f2,f3,,fj)(f_1, f_2, f_3, \ldots, f_j) is the factorial base expansion of 16!32!+48!64!++1968!1984!+2000!,16! - 32! + 48! - 64! + \cdots + 1968! - 1984! + 2000!, find the value of f1f2+f3f4++(1)j+1fj.f_1 - f_2 + f_3 - f_4 + \cdots + (-1)^{j+1} f_j.

Answer: 495

Difficulty rating: 3060

Solution:

Since (i+1)!i!=ii!,(i+1)! - i! = i \cdot i!, telescoping gives a!b!=i=ba1ii!a! - b! = \sum_{i=b}^{a-1} i \cdot i! for a>b.a \gt b. Group the given number as 16!+(48!32!)+(80!64!)++(2000!1984!),16! + (48! - 32!) + (80! - 64!) + \cdots + (2000! - 1984!), with 6262 parenthesized groups (32j+16)!(32j)!(32j + 16)! - (32j)! for j=1,,62.j = 1, \ldots, 62.

The group for jj contributes factorial-base digits fi=if_i = i for 32ji32j+15,32j \le i \le 32j + 15, and the lone 16!16! contributes f16=1;f_{16} = 1; all other digits are 0.0. Every digit satisfies 0fii,0 \le f_i \le i, so by uniqueness this is the factorial base expansion.

In the alternating sum, f16=1f_{16} = 1 sits at an even index and contributes 1.-1. Each group's range starts at an even index and has length 16,16, so it splits into 88 consecutive pairs, each contributing i+(i+1)=1,-i + (i + 1) = 1, for +8+8 per group. The total is 6281=495.62 \cdot 8 - 1 = 495.

15.

Find the least positive integer nn such that 1sin45sin46+1sin47sin48++1sin133sin134=1sinn.\frac{1}{\sin 45^\circ \sin 46^\circ} + \frac{1}{\sin 47^\circ \sin 48^\circ} + \cdots + \frac{1}{\sin 133^\circ \sin 134^\circ} = \frac{1}{\sin n^\circ}.

Answer: 1

Difficulty rating: 3060

Solution:

Since sin1=sin((k+1)k)=sin(k+1)coskcos(k+1)sink,\sin 1^\circ = \sin\big((k+1)^\circ - k^\circ\big) = \sin(k+1)^\circ \cos k^\circ - \cos(k+1)^\circ \sin k^\circ, dividing by sinksin(k+1)\sin k^\circ \sin(k+1)^\circ gives 1sinksin(k+1)=cotkcot(k+1)sin1.\frac{1}{\sin k^\circ \sin(k+1)^\circ} = \frac{\cot k^\circ - \cot(k+1)^\circ}{\sin 1^\circ}. So the sum times sin1\sin 1^\circ equals cot45cot46+cot47cot48++cot133cot134,\cot 45^\circ - \cot 46^\circ + \cot 47^\circ - \cot 48^\circ + \cdots + \cot 133^\circ - \cot 134^\circ, with ++ signs on odd arguments and - signs on even arguments.

Because cot(180x)=cotx\cot(180^\circ - x) = -\cot x and supplementary arguments here have the same parity, the terms cancel in supplementary pairs: +cot133+\cot 133^\circ cancels +cot47,+\cot 47^\circ, cot134-\cot 134^\circ cancels cot46,-\cot 46^\circ, and so on for every pair of arguments summing to 180.180^\circ. The only survivors are cot45=1\cot 45^\circ = 1 (its partner 135135^\circ is out of range) and cot90=0.-\cot 90^\circ = 0.

Hence the sum equals cot45sin1=1sin1,\frac{\cot 45^\circ}{\sin 1^\circ} = \frac{1}{\sin 1^\circ}, so the least such nn is 1.1.